Pub Date : 2006-12-18DOI: 10.1109/IIH-MSP.2006.129
W. Fang, Tsung-Hsien Lin
A low-power radio has been developed as an embedded communication core for wireless sensor networks system-on-chip designs. Energy constraints and sensor network design considerations due to the limited battery energy supply are described. Lowpower receiver and transmitter architectures for wireless sensor networks are presented. Associated low-power RF circuit design methodologies are also illustrated.
{"title":"Low-Power Radio Design for Wireless Smart Sensor Networks","authors":"W. Fang, Tsung-Hsien Lin","doi":"10.1109/IIH-MSP.2006.129","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.129","url":null,"abstract":"A low-power radio has been developed as an embedded communication core for wireless sensor networks system-on-chip designs. Energy constraints and sensor network design considerations due to the limited battery energy supply are described. Lowpower receiver and transmitter architectures for wireless sensor networks are presented. Associated low-power RF circuit design methodologies are also illustrated.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"4 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":"124633520","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}
Zhiyu Zhang, Wei Huang, Jiu-long Zhang, Hai-yan Yu, Yanjun Lu
Watermark is a new effective digital copyright protection method and data security technology. In this paper, a digital image watermark algorithm operating in the curvelet domain is proposed. Unequally-Spaced Fast Fourier Transforms (USFFT) is employed to implement Fast Discrete Curvelet Transforms (FDCT ) to transform the digital image to the curvelet domain. The following three factors are considered when embedding the watermark in the curvelet domain: (1) the scale distribution of the curvelet coefficients; (2) the variation of high frequency components and low frequency components have different effects on HVS; (3) the impact of the variation of the curvelet coefficients on the robustness of the watermark. Combining these factors with the basic watermark algorithm, we choose the proper position to embed the watermark. The experimental results demonstrate a fine unification of robustness and invisibility and shows advantages over watermark algorithm in the ridgelet domain concerning the two aspects.
{"title":"Digital Image Watermark Algorithm in the Curvelet Domain","authors":"Zhiyu Zhang, Wei Huang, Jiu-long Zhang, Hai-yan Yu, Yanjun Lu","doi":"10.1109/IIH-MSP.2006.87","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.87","url":null,"abstract":"Watermark is a new effective digital copyright protection method and data security technology. In this paper, a digital image watermark algorithm operating in the curvelet domain is proposed. Unequally-Spaced Fast Fourier Transforms (USFFT) is employed to implement Fast Discrete Curvelet Transforms (FDCT ) to transform the digital image to the curvelet domain. The following three factors are considered when embedding the watermark in the curvelet domain: (1) the scale distribution of the curvelet coefficients; (2) the variation of high frequency components and low frequency components have different effects on HVS; (3) the impact of the variation of the curvelet coefficients on the robustness of the watermark. Combining these factors with the basic watermark algorithm, we choose the proper position to embed the watermark. The experimental results demonstrate a fine unification of robustness and invisibility and shows advantages over watermark algorithm in the ridgelet domain concerning the two aspects.","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":"126322211","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 decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.
{"title":"Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding","authors":"Qi Zhang, Yunyang Dai, Siwei Ma, C.-C. Jay Kuo","doi":"10.1109/IIH-MSP.2006.78","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.78","url":null,"abstract":"A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.","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":"114296015","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.154
Zhen Sun, Zhe-ming Lu, Z. Li
In this paper, we present a new data hiding method for 3D triangle meshes. While most of the existing data hiding schemes introduce some small amount of nonreversible distortion to the cover mesh, the new method is reversible and enables the cover mesh data to be completely restored when the payload is removed from the stego mesh. A noticeable difference between our method and others is that we embed data in the predictive vector quantization (PVQ) compressed domain by modifying the prediction mechanism during the compression process. Experimental results demonstrate the effectiveness of the proposed scheme.
{"title":"Reversible Data Hiding for 3D Meshes in the PVQ-Compressed Domain","authors":"Zhen Sun, Zhe-ming Lu, Z. Li","doi":"10.1109/IIH-MSP.2006.154","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.154","url":null,"abstract":"In this paper, we present a new data hiding method for 3D triangle meshes. While most of the existing data hiding schemes introduce some small amount of nonreversible distortion to the cover mesh, the new method is reversible and enables the cover mesh data to be completely restored when the payload is removed from the stego mesh. A noticeable difference between our method and others is that we embed data in the predictive vector quantization (PVQ) compressed domain by modifying the prediction mechanism during the compression process. Experimental results demonstrate the effectiveness of the proposed scheme.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"29 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":"114682187","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}
Image perceptual hashing has been proposed to identify or authenticate image contents in a robust way against distortions caused by compression, noise, common signal processing and geometrical modifications, while still holding a good discriminability for different ones in sense of human perception. We propose and compare four normalized block mean value based image perceptual hashing algorithms which demonstrate higher performances than other existing algorithms in robustness-anddiscriminalibility and simplicity for implementation. Overlapped blocking and rotation operations are employed to enhance the robustness to geometrical distortions. To evaluate the proposed algorithms¿ robustness and discriminability, given fixed modifications, identification ratio is used; and given fixed content classification, receiver operating curves is obtained.
{"title":"Block Mean Value Based Image Perceptual Hashing","authors":"Bian Yang, Fan Gu, X. Niu","doi":"10.1109/IIH-MSP.2006.66","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.66","url":null,"abstract":"Image perceptual hashing has been proposed to identify or authenticate image contents in a robust way against distortions caused by compression, noise, common signal processing and geometrical modifications, while still holding a good discriminability for different ones in sense of human perception. We propose and compare four normalized block mean value based image perceptual hashing algorithms which demonstrate higher performances than other existing algorithms in robustness-anddiscriminalibility and simplicity for implementation. Overlapped blocking and rotation operations are employed to enhance the robustness to geometrical distortions. To evaluate the proposed algorithms¿ robustness and discriminability, given fixed modifications, identification ratio is used; and given fixed content classification, receiver operating curves is obtained.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"115 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":"116591636","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.107
Yuh-Chou Tsai, Chia-Ming Tsai, Chia-Wen Lin
In this paper, we propose novel schemes to enhance the error robustness of multi-hypothesis motion-compensate predictive (MHMCP) coder without sacrificing the coding efficiency significantly. The proposed method utilizes the concept of reference picture interleaving and data partitioning to make the MHMCP-coded video more resilient to channel errors, especially for burst channel error. Besides, we also propose a scheme of integrating adaptive intrarefresh into the proposed MHMCP coder to further improve the error recovery speed. Extensive simulation results show that the proposed methods can effectively and quickly mitigate the error propagation and the penalty on coding efficiency for clean channels due to the inserted error resilience features is rather minor.
{"title":"H.264 Error Resilience Coding Based on Multi-hypothesis Motion Compensated Prediction and Adaptive Intra-refresh","authors":"Yuh-Chou Tsai, Chia-Ming Tsai, Chia-Wen Lin","doi":"10.1109/IIH-MSP.2006.107","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.107","url":null,"abstract":"In this paper, we propose novel schemes to enhance the error robustness of multi-hypothesis motion-compensate predictive (MHMCP) coder without sacrificing the coding efficiency significantly. The proposed method utilizes the concept of reference picture interleaving and data partitioning to make the MHMCP-coded video more resilient to channel errors, especially for burst channel error. Besides, we also propose a scheme of integrating adaptive intrarefresh into the proposed MHMCP coder to further improve the error recovery speed. Extensive simulation results show that the proposed methods can effectively and quickly mitigate the error propagation and the penalty on coding efficiency for clean channels due to the inserted error resilience features is rather minor.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"69 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":"116963880","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 digital watermarking scheme permits embedding additional information into digital contents as a watermark so that the embedded information can be detected afterward. In detecting a watermark, there are two kinds of detection errors, a false positive error (FPE) and a false negative error (FNE). A detection scheme is said to be optimum if the FNE probability is minimized for a given FPE probability. In this paper, we present an optimum detection scheme for additive watermarks embedded in the spatial domain. The key idea of the proposed detection scheme is to use the difference between the brightness values. It is confirmed experimentally that the proposed scheme can control the FPE probability strictly.
{"title":"A New Optimum Detection Scheme for Additive Watermarks Embedded in Spatial Domain","authors":"Maki Yoshida, T. Fujita, T. Fujiwara","doi":"10.1109/IIH-MSP.2006.21","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.21","url":null,"abstract":"A digital watermarking scheme permits embedding additional information into digital contents as a watermark so that the embedded information can be detected afterward. In detecting a watermark, there are two kinds of detection errors, a false positive error (FPE) and a false negative error (FNE). A detection scheme is said to be optimum if the FNE probability is minimized for a given FPE probability. In this paper, we present an optimum detection scheme for additive watermarks embedded in the spatial domain. The key idea of the proposed detection scheme is to use the difference between the brightness values. It is confirmed experimentally that the proposed scheme can control the FPE probability strictly.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"1999 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":"123550239","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.120
Wan-Chi Lee, C.-C. Jay Kuo
Following our previous work in [8] where a music signal is decomposed into multiple subband signals and the forward linear prediction errors of all subbands are combined to give the detection function to localize the onset position, two enhanced features are examined in this work. First, we propose a new method to decide the stepsize, which is a critical parameter in LPEF adaptation. Second, we consider a more flexible and robust subband decomposition scheme that is adaptive to the characteristics of the music signal. It will be shown by experimental results that these modifications enhance the accuracy of the onset detection scheme.
{"title":"Improved Linear Prediction Technique for Musical Onset Detection","authors":"Wan-Chi Lee, C.-C. Jay Kuo","doi":"10.1109/IIH-MSP.2006.120","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.120","url":null,"abstract":"Following our previous work in [8] where a music signal is decomposed into multiple subband signals and the forward linear prediction errors of all subbands are combined to give the detection function to localize the onset position, two enhanced features are examined in this work. First, we propose a new method to decide the stepsize, which is a critical parameter in LPEF adaptation. Second, we consider a more flexible and robust subband decomposition scheme that is adaptive to the characteristics of the music signal. It will be shown by experimental results that these modifications enhance the accuracy of the onset detection scheme.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"75 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":"122628323","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.106
Dan Wang, Peizhong Lu
This paper proposes a novel geometrical invariant watermark scheme based on fast correlation attacks of stream ciphers. The binary bit sequences of watermark as the initial state are fed into the LSFR, and the output m-sequence is embedded into the triangles that are obtained according to the scale-space Harris feature points and Delaunay tessellations. During the detection, the embedded watermark will be extracted based on the fast correlation attacks technique. Owing to its powerful error-correcting capability, the robustness against both geometrical distortion and common signal processing can be readily obtained. Simulation results show that the proposed scheme is highly robust against all kinds of geometrical attacks even including RBA in the StirMark.
{"title":"Geometrically Invariant Watermark Using Fast Correlation Attacks","authors":"Dan Wang, Peizhong Lu","doi":"10.1109/IIH-MSP.2006.106","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.106","url":null,"abstract":"This paper proposes a novel geometrical invariant watermark scheme based on fast correlation attacks of stream ciphers. The binary bit sequences of watermark as the initial state are fed into the LSFR, and the output m-sequence is embedded into the triangles that are obtained according to the scale-space Harris feature points and Delaunay tessellations. During the detection, the embedded watermark will be extracted based on the fast correlation attacks technique. Owing to its powerful error-correcting capability, the robustness against both geometrical distortion and common signal processing can be readily obtained. Simulation results show that the proposed scheme is highly robust against all kinds of geometrical attacks even including RBA in the StirMark.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"34 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":"122736334","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}
Deyun Peng, Jiazhen Wang, Sumin Yang, Suzhen Wang, Aizhen Liu
This paper proposes a new type of multi-user digital watermarking based on CDMA, which aims at the demand of multi-user copyright sharing protection. It presents two CDMA based approaches, i.e. wavelet domain direct approach (WD) and wavelet domain neighbor linear prediction approach (WNLP). It analyses the influence of user quantity and embedding depth on the quality of watermarked images and extracted watermarks. Experiment results show that the algorithm can solve the problem of watermarks collision and relieve the restriction of user quantity of multiple watermarking algorithms.
{"title":"CDMA Based Multiple-User Digital Watermarking","authors":"Deyun Peng, Jiazhen Wang, Sumin Yang, Suzhen Wang, Aizhen Liu","doi":"10.1109/IIH-MSP.2006.68","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.68","url":null,"abstract":"This paper proposes a new type of multi-user digital watermarking based on CDMA, which aims at the demand of multi-user copyright sharing protection. It presents two CDMA based approaches, i.e. wavelet domain direct approach (WD) and wavelet domain neighbor linear prediction approach (WNLP). It analyses the influence of user quantity and embedding depth on the quality of watermarked images and extracted watermarks. Experiment results show that the algorithm can solve the problem of watermarks collision and relieve the restriction of user quantity of multiple watermarking algorithms.","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":"124878771","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
扫码关注我们
求助内容：
应助结果提醒方式：