A decrease in the watermark detection rate is a fatal problem in employing audio watermarks for applications in which a watermarked signal is transmitted through the air. The enforcement of watermarks using an error-correcting code is a solution to this problem. Low-density Parity Check (LDPC) coding is a recent error-correcting code; it shows good performance close to Shannon¿s limit. Therefore, in the present study, watermark detection rates when the watermarks were coded combined with and without LDPC coding were evaluated through computer simulations and experiments in a real room. The results showed that employing LDPC coding raised the watermark detection rate by around 15 percentage points for an additive white Gaussian noise and by around 20 points from around 60% to around 80% in an actual reverberation environment.
{"title":"Audio Watermark Enhanced by LDPC Coding for Air Transmission","authors":"Yôiti Suzuki, R. Nishimura, Hao Tao","doi":"10.1109/IIH-MSP.2006.61","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.61","url":null,"abstract":"A decrease in the watermark detection rate is a fatal problem in employing audio watermarks for applications in which a watermarked signal is transmitted through the air. The enforcement of watermarks using an error-correcting code is a solution to this problem. Low-density Parity Check (LDPC) coding is a recent error-correcting code; it shows good performance close to Shannon¿s limit. Therefore, in the present study, watermark detection rates when the watermarks were coded combined with and without LDPC coding were evaluated through computer simulations and experiments in a real room. The results showed that employing LDPC coding raised the watermark detection rate by around 15 percentage points for an additive white Gaussian noise and by around 20 points from around 60% to around 80% in an actual reverberation environment.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115942305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.108
Hongjun Wang, Yong-Jian Huang, Hua Li
Compared with the previous standards, the coding efficiency and coding performance of H.264/AVC are improved at the cost of higher computational complexity. It is a big challenge for us to develop the embedded real-time H.264/AVC video encoder with the limited on-chip memory space. This paper introduces the method to develop and optimize the H.264/AVC "baseline' encoder on the TMS320DM642 DSP hardware platform. The emphasis is put on the optimization methods of memory space allocation, the strategy of data transfer and pixel interpolation in motion compensation. Hereinto, ping-pong buffering technique was used to optimize the input interface of H.264/AVC encoder and the bi-linear interpolation method was used to replace the 6-tap filter which has been adopted in the "x264" source program. Experiments show that the coding performance of the optimized encoder is improved effectively with a little loss in PSNR and video sequences with QCIF resolution can be encoded in real time.
{"title":"H.264/AVC Video Encoder Implementation Based on TI TMS320DM642","authors":"Hongjun Wang, Yong-Jian Huang, Hua Li","doi":"10.1109/IIH-MSP.2006.108","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.108","url":null,"abstract":"Compared with the previous standards, the coding efficiency and coding performance of H.264/AVC are improved at the cost of higher computational complexity. It is a big challenge for us to develop the embedded real-time H.264/AVC video encoder with the limited on-chip memory space. This paper introduces the method to develop and optimize the H.264/AVC \"baseline' encoder on the TMS320DM642 DSP hardware platform. The emphasis is put on the optimization methods of memory space allocation, the strategy of data transfer and pixel interpolation in motion compensation. Hereinto, ping-pong buffering technique was used to optimize the input interface of H.264/AVC encoder and the bi-linear interpolation method was used to replace the 6-tap filter which has been adopted in the \"x264\" source program. Experiments show that the coding performance of the optimized encoder is improved effectively with a little loss in PSNR and video sequences with QCIF resolution can be encoded in real time.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116180128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper introduces an unusual event detection scheme in various video scenes. The proposed method finds out the video clips that are most different from the others based on the similarity measure. Each video clip is represented by the motion magnitude and direction histograms and color histogram. Without searching key-frames, we calculate the similarity matrix by using chi^2 difference or chamfer difference as the similarity measure of features in different clips. Finally, we apply n-cut clustering. Clusters with low self-similarity value are reported as unusual events.
{"title":"Abnormal Event Detection in Video Using N-cut Clustering","authors":"Chun-Ku Lee, Meng-Fen Ho, Wu-Sheng Wen, Chung-Lin Huang","doi":"10.1109/IIH-MSP.2006.44","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.44","url":null,"abstract":"This paper introduces an unusual event detection scheme in various video scenes. The proposed method finds out the video clips that are most different from the others based on the similarity measure. Each video clip is represented by the motion magnitude and direction histograms and color histogram. Without searching key-frames, we calculate the similarity matrix by using chi^2 difference or chamfer difference as the similarity measure of features in different clips. Finally, we apply n-cut clustering. Clusters with low self-similarity value are reported as unusual events.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123589567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A novel fuzzy video rate control algorithm (RCA) with delay and quality constraints is proposed for video streaming over DVB-H (Digital Video Broadcasting for Handheld terminals) application. In this application a variable bit rate (VBR) bit stream is used to improve the quality and compression performance of encoded video at the expense of buffering delay while there is a holdup as channel changing delay. DVB-H uses a time-sliced transmission scheme to reduce the power consumption for the receiver. The time-slice scheme amplifies the channel changing delay. Two main factors in channel changing delay are the time until a media decoder is refreshed by a random access point such as an IDR (Instantaneous Decoder Refresh) picture in H.264/AVC and the delay to compensate the variation in bit rate. The average decoder refresh delay can decrease by frequent IDR pictures in the bit stream while it drops the quality and compression efficiency remarkably. On the other hand, a VBR video provides higher quality at the expense of higher buffering delay. Hence force, there is a multilateral contradiction between the quality and delay in this application. The proposed RCA has been optimized to provide high quality VBR video with minimum channel changing delay. Simulation results on H.264/AVC video coding standard show that encoded bit streams by proposed RCA strictly obey the delay and quality constraints.
{"title":"Delay Constrained Fuzzy Rate Control for Video Streaming over DVB-H","authors":"M. Rezaei, M. Gabbouj, Imed Bouazizi","doi":"10.1109/IIH-MSP.2006.79","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.79","url":null,"abstract":"A novel fuzzy video rate control algorithm (RCA) with delay and quality constraints is proposed for video streaming over DVB-H (Digital Video Broadcasting for Handheld terminals) application. In this application a variable bit rate (VBR) bit stream is used to improve the quality and compression performance of encoded video at the expense of buffering delay while there is a holdup as channel changing delay. DVB-H uses a time-sliced transmission scheme to reduce the power consumption for the receiver. The time-slice scheme amplifies the channel changing delay. Two main factors in channel changing delay are the time until a media decoder is refreshed by a random access point such as an IDR (Instantaneous Decoder Refresh) picture in H.264/AVC and the delay to compensate the variation in bit rate. The average decoder refresh delay can decrease by frequent IDR pictures in the bit stream while it drops the quality and compression efficiency remarkably. On the other hand, a VBR video provides higher quality at the expense of higher buffering delay. Hence force, there is a multilateral contradiction between the quality and delay in this application. The proposed RCA has been optimized to provide high quality VBR video with minimum channel changing delay. Simulation results on H.264/AVC video coding standard show that encoded bit streams by proposed RCA strictly obey the delay and quality constraints.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125206784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we propose a new image steganography to meet an increasing demand for effective and cheap digital security scheme for the Internet. This technique is based on chaotic sequences in the discrete wavelet transform domain of covert images. Multiple sensitive images are added to a covert image as a white noise-like form. The results of theoretical analysis and computer simulation show the new hiding technique has improved properties with high security, imperceptibility and capacity for hidden information in comparison with LSB. Such properties can be exploited in the quest for secure communications and document exchange over the Internet.
{"title":"A New Image Steganography for Internet Communications Based on Chaotic Sequences","authors":"Niansheng Liu, Donghui Guo, G. Parr","doi":"10.1109/IIH-MSP.2006.20","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.20","url":null,"abstract":"In this paper we propose a new image steganography to meet an increasing demand for effective and cheap digital security scheme for the Internet. This technique is based on chaotic sequences in the discrete wavelet transform domain of covert images. Multiple sensitive images are added to a covert image as a white noise-like form. The results of theoretical analysis and computer simulation show the new hiding technique has improved properties with high security, imperceptibility and capacity for hidden information in comparison with LSB. Such properties can be exploited in the quest for secure communications and document exchange over the Internet.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128790220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.136
Jinye Peng, Wanhai Yang, Yichun Wang
Image denoising and enhancement is one of the most important tasks in image processing. Self-snake model is a most basic and important image denoising method based on PDE (Partial Differential Equation), in which the stop function is very important and is usually related to the gradient of the image. But it¿s difficult to choose the smoothness scale as we usually do in acquiring the gradients of the approximating image by smoothening it with a single scale. So we proposed a multiscale gradient vector which integrate the different scale gradient vector from coarse image to fine according to our some defined rulers instead of single-scaled gradient vector of images to improve the performance of self-snake model. The efficiency of our proposal was proved by experimental results.
{"title":"Multiscale Gradient Vector Field with Application to Image Denoising and Enhancement","authors":"Jinye Peng, Wanhai Yang, Yichun Wang","doi":"10.1109/IIH-MSP.2006.136","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.136","url":null,"abstract":"Image denoising and enhancement is one of the most important tasks in image processing. Self-snake model is a most basic and important image denoising method based on PDE (Partial Differential Equation), in which the stop function is very important and is usually related to the gradient of the image. But it¿s difficult to choose the smoothness scale as we usually do in acquiring the gradients of the approximating image by smoothening it with a single scale. So we proposed a multiscale gradient vector which integrate the different scale gradient vector from coarse image to fine according to our some defined rulers instead of single-scaled gradient vector of images to improve the performance of self-snake model. The efficiency of our proposal was proved by experimental results.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116804787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.110
Yu-Chun Lai, H. Liao
In this paper, we propose a novel human motion recognition approach that incorporates two fundamental concepts. First, the Shape Context and a clustering method are used to extract moving articulated parts from a video sequence. Then, we represent the moving articulated parts by trajectories. Our trajectory extraction approach provides good tolerance under various background and lighting conditions. Significantly, landmark point selection is not necessary in our approach, since trajectory generation is based on the extraction of moving articulated parts. The second concept is that the extracted trajectories are seen as forces pushing the articulated parts. Those forces are applied to a clay-like deformed material, which is used to represent the trajectories¿ behavior. The experiment results show that the proposed approach is robust against noise and incorrectly extracted trajectories, such as redundant and missing trajectories.
{"title":"Human Motion Recognition Using Clay Representation of Trajectories","authors":"Yu-Chun Lai, H. Liao","doi":"10.1109/IIH-MSP.2006.110","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.110","url":null,"abstract":"In this paper, we propose a novel human motion recognition approach that incorporates two fundamental concepts. First, the Shape Context and a clustering method are used to extract moving articulated parts from a video sequence. Then, we represent the moving articulated parts by trajectories. Our trajectory extraction approach provides good tolerance under various background and lighting conditions. Significantly, landmark point selection is not necessary in our approach, since trajectory generation is based on the extraction of moving articulated parts. The second concept is that the extracted trajectories are seen as forces pushing the articulated parts. Those forces are applied to a clay-like deformed material, which is used to represent the trajectories¿ behavior. The experiment results show that the proposed approach is robust against noise and incorrectly extracted trajectories, such as redundant and missing trajectories.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117103341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.
{"title":"Reversible Data Hiding for 3D Point Cloud Model","authors":"Hao Luo, Jeng-Shyang Pan, Zhe-ming Lu, Hsiang-Cheh Huang","doi":"10.1109/IIH-MSP.2006.155","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.155","url":null,"abstract":"This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116902147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.134
A. Ito, S. Makino
In this paper, we discuss the mathematical fundamentals of splitting one audio stream into two equal-quality streams. From a trivial consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if the orthogonal recovery is carried out. Next, we describe the optimum recovery transform. This method utilizes the covariance matrix of the signal. We carried out some experiments to recover a signal from one of the split signals. From the results of four kinds of split methods used, the correlating transform of the spectrum gave the best performance.
{"title":"Multiple Description Coding of an Audio Stream by Optimum Recovery Transform","authors":"A. Ito, S. Makino","doi":"10.1109/IIH-MSP.2006.134","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.134","url":null,"abstract":"In this paper, we discuss the mathematical fundamentals of splitting one audio stream into two equal-quality streams. From a trivial consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if the orthogonal recovery is carried out. Next, we describe the optimum recovery transform. This method utilizes the covariance matrix of the signal. We carried out some experiments to recover a signal from one of the split signals. From the results of four kinds of split methods used, the correlating transform of the spectrum gave the best performance.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124484119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper channel capacity analysis of spread spectrum audio watermarking (SSW) system for transmission of hidden information through a noisy environment is performed. Channel capacity analysis of algorithm enables us to determine the most reliable transmission rate of hidden information by the watermarking system, i.e. the analysis makes a relation between capacity and robustness as two conflicting features of watermarking algorithms. Examining transmission and detection of hidden information shows that SSW behaves like a binary symmetric channel. It is proved that well known Shannon channel capacity formula for calculating channel capacity is not applicable for SSW system. Instead, analysis of channel capacity for additive color noise channels should be used. Obtaining channel capacity for SSW system using pseudo-noise random sequences with different period, different power of additive white Gaussian noise channel and different power of host signal is performed in simulation results.
{"title":"Channel Capacity Analysis of Spread Spectrum Audio Watermarking for Noisy Environments","authors":"Saeed Sedghi, M. Khademi, N. Cvejic","doi":"10.1109/IIH-MSP.2006.70","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.70","url":null,"abstract":"In this paper channel capacity analysis of spread spectrum audio watermarking (SSW) system for transmission of hidden information through a noisy environment is performed. Channel capacity analysis of algorithm enables us to determine the most reliable transmission rate of hidden information by the watermarking system, i.e. the analysis makes a relation between capacity and robustness as two conflicting features of watermarking algorithms. Examining transmission and detection of hidden information shows that SSW behaves like a binary symmetric channel. It is proved that well known Shannon channel capacity formula for calculating channel capacity is not applicable for SSW system. Instead, analysis of channel capacity for additive color noise channels should be used. Obtaining channel capacity for SSW system using pseudo-noise random sequences with different period, different power of additive white Gaussian noise channel and different power of host signal is performed in simulation results.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129475927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：