Tsong-Yi Chen, Chao-Ho Chen, Shi-Feng Huang, Yi-Fan Li
A novel and simple speed/accuracy adjustable block-matching algorithm (BMA) based on multipath flatted-hexagon search (MFHS) is developed for motion estimation. In the proposed method, an adaptive threshold of BDM is introduced to determine the required search directions in order to escape from being trapped into a local minimum BDM for the purpose of adjusting the search speed and matching probability. The estimated motion vector will be refined at each search step until the searching process is stopped. Experimental results show that the proposed MFHS algorithm can achieve an average matching probability up to 98% near to that of FS and about 10 times of checking points faster than FS in most of real-world sequences, especially for horizontal-motion-biased image sequences.
{"title":"An adjustable multipath flatted-hexagon search algorithm for block motion estimation","authors":"Tsong-Yi Chen, Chao-Ho Chen, Shi-Feng Huang, Yi-Fan Li","doi":"10.1109/IIH-MSP.2006.47","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.47","url":null,"abstract":"A novel and simple speed/accuracy adjustable block-matching algorithm (BMA) based on multipath flatted-hexagon search (MFHS) is developed for motion estimation. In the proposed method, an adaptive threshold of BDM is introduced to determine the required search directions in order to escape from being trapped into a local minimum BDM for the purpose of adjusting the search speed and matching probability. The estimated motion vector will be refined at each search step until the searching process is stopped. Experimental results show that the proposed MFHS algorithm can achieve an average matching probability up to 98% near to that of FS and about 10 times of checking points faster than FS in most of real-world sequences, especially for horizontal-motion-biased image sequences.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127986362","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}
Qinzhen Xu, Pinzheng Zhang, Wenjiang Pei, Luxi Yang, Zhenya He
A hybrid learning approach named confusioncrossed support vector machine tree (CSVMT) has been proposed in our current work. It is developed to achieve a better performance for complex distribution problems even when the two parameters of SVM are not appropriately selected. In this paper a facial expression recognition approach based on CSVMT is proposed. Pseudo-Zernike moments are applied in the feature extraction phase, and then CSVMT learning model is performed during the facial expression recognition phase. The compared results on Cohn- Kanade facial expression database show that the proposed approach appeared higher recognition accuracy than the other approaches.
{"title":"A Facial Expression Recognition Approach Based on Confusion-Crossed Support Vector Machine Tree","authors":"Qinzhen Xu, Pinzheng Zhang, Wenjiang Pei, Luxi Yang, Zhenya He","doi":"10.1109/IIH-MSP.2006.9","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.9","url":null,"abstract":"A hybrid learning approach named confusioncrossed support vector machine tree (CSVMT) has been proposed in our current work. It is developed to achieve a better performance for complex distribution problems even when the two parameters of SVM are not appropriately selected. In this paper a facial expression recognition approach based on CSVMT is proposed. Pseudo-Zernike moments are applied in the feature extraction phase, and then CSVMT learning model is performed during the facial expression recognition phase. The compared results on Cohn- Kanade facial expression database show that the proposed approach appeared higher recognition accuracy than the other approaches.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"37 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":"127203895","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}
Chia An Huang, Jeng-Shyang Pan, Te-hui Kuo, Jaw-Shyang Wu, Chuan-Feng Lin
The paper proposed a subsampling and quantization based watermarking scheme to resist the permutation attack. The subsampling based watermarking schemes have drawn great attention for its convenience and effectiveness recently, but this kind of watermarking schemes is very vulnerable to the permutation attack. In this paper, the watermark information is embedded into the average values of the 3-level DWT coefficients to resist the permutation attack. Experimental results show that the proposed scheme can resist not only the permutation attack but also some common image processing attacks.
{"title":"A Subsampling and Quantization Based Watermarking Scheme Resisted the Permutation Attacking","authors":"Chia An Huang, Jeng-Shyang Pan, Te-hui Kuo, Jaw-Shyang Wu, Chuan-Feng Lin","doi":"10.1109/IIH-MSP.2006.43","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.43","url":null,"abstract":"The paper proposed a subsampling and quantization based watermarking scheme to resist the permutation attack. The subsampling based watermarking schemes have drawn great attention for its convenience and effectiveness recently, but this kind of watermarking schemes is very vulnerable to the permutation attack. In this paper, the watermark information is embedded into the average values of the 3-level DWT coefficients to resist the permutation attack. Experimental results show that the proposed scheme can resist not only the permutation attack but also some common image processing attacks.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"30 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":"123460721","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}
R. Ji, H. Yao, Shaohui Liu, Liang Wang, Jianchao Sun
In this paper we focus on the detection of spread spectrum steganography, especially in the case that the scaling parameters are adaptive to image content. Our contribution is two folds. Firstly, we present a new steganalysis method for adaptive spread spectrum steganography: block-based scatter difference detection. Our algorithm first restores cover image by restoring filter. Then the embedding process is simulated in both test and cover images for certain times and the statistic in local DCT block is calculated as a criterion for classification. Secondly, we propose a region estimation algorithm to estimate the most likely stego regions. Our experiment result is promising by showing hits over 90% and false alarm lower than 10%. Its simplicity and extensibility indicate its further application in watermark detection.
{"title":"A New Steganalysis Method for Adaptive Spread Spectrum Steganography","authors":"R. Ji, H. Yao, Shaohui Liu, Liang Wang, Jianchao Sun","doi":"10.1109/IIH-MSP.2006.22","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.22","url":null,"abstract":"In this paper we focus on the detection of spread spectrum steganography, especially in the case that the scaling parameters are adaptive to image content. Our contribution is two folds. Firstly, we present a new steganalysis method for adaptive spread spectrum steganography: block-based scatter difference detection. Our algorithm first restores cover image by restoring filter. Then the embedding process is simulated in both test and cover images for certain times and the statistic in local DCT block is calculated as a criterion for classification. Secondly, we propose a region estimation algorithm to estimate the most likely stego regions. Our experiment result is promising by showing hits over 90% and false alarm lower than 10%. Its simplicity and extensibility indicate its further application in watermark detection.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"62 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":"123788376","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}
Cui-Qing Liu, X. Ping, Tao Zhang, Linna Zhou, Yun-He Wang
With the encoding redundancy of Error-Correcting codes a new steganography method is proposed. A mapping code between secret information and codeword error map is built. By modifying the part of the codeword of the error-correcting codes according to the error map secret information is embedded. Theoretical analysis and experimental results show that this method has better security.
{"title":"A Research on Steganography Method Based on Error-Correcting Codes","authors":"Cui-Qing Liu, X. Ping, Tao Zhang, Linna Zhou, Yun-He Wang","doi":"10.1109/IIH-MSP.2006.37","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.37","url":null,"abstract":"With the encoding redundancy of Error-Correcting codes a new steganography method is proposed. A mapping code between secret information and codeword error map is built. By modifying the part of the codeword of the error-correcting codes according to the error map secret information is embedded. Theoretical analysis and experimental results show that this method has better security.","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":"115200351","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.121
Chinchen Chang, Yi-Hui Chen, Kuan-Ming Li
The side-match vector quantization (SMVQ) technique has been widely used in various image compression and hiding techniques. It effectively decreases the bit rates of image with a great compressed quality. However, the prediction is not precise while the variation between the encoded block and its neighboring upper and left blocks is large. Due to the imprecision will cause derailment problem, to solve this problem, this paper proposed an EDPSMVQ scheme which is based on edge-directed prediction (EDP) to precisely predict the side-match pixels avoiding the derailment problem. The experimental results showed that the scheme achieves a high compression ratio with an acceptable image quality.
{"title":"Improved SMVQ Scheme with Edge-Directed Prediction","authors":"Chinchen Chang, Yi-Hui Chen, Kuan-Ming Li","doi":"10.1109/IIH-MSP.2006.121","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.121","url":null,"abstract":"The side-match vector quantization (SMVQ) technique has been widely used in various image compression and hiding techniques. It effectively decreases the bit rates of image with a great compressed quality. However, the prediction is not precise while the variation between the encoded block and its neighboring upper and left blocks is large. Due to the imprecision will cause derailment problem, to solve this problem, this paper proposed an EDPSMVQ scheme which is based on edge-directed prediction (EDP) to precisely predict the side-match pixels avoiding the derailment problem. The experimental results showed that the scheme achieves a high compression ratio with an acceptable image quality.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"94 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":"116021578","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.167
I. Awan, S. Gilani, S. Shah
Although data hiding in text document images is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. In this paper, a new enhanced embedding method is proposed for object-based text document authentication, in which the maximum data hiding capacity of the document is utilized for watermark embedding. Due to which maximum information that a document can contain is embedded within the entire document. Experimental results show that the proposed method utilizes the maximum data hiding capacity as watermark size to ensure the authenticity and integrity of the document much better as compared with the compared technique in which embedding and temper detection fails in some cases.
{"title":"Utilization of Maximum Data Hiding Capacity in Object-Based Text Document Authentication","authors":"I. Awan, S. Gilani, S. Shah","doi":"10.1109/IIH-MSP.2006.167","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.167","url":null,"abstract":"Although data hiding in text document images is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. In this paper, a new enhanced embedding method is proposed for object-based text document authentication, in which the maximum data hiding capacity of the document is utilized for watermark embedding. Due to which maximum information that a document can contain is embedded within the entire document. Experimental results show that the proposed method utilizes the maximum data hiding capacity as watermark size to ensure the authenticity and integrity of the document much better as compared with the compared technique in which embedding and temper detection fails in some cases.","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":"122860998","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.100
Yu Hu, Qing Li, Siwei Ma, C.-C. Jay Kuo
A complexity-constrained inter-mode decision algorithm for H.264/AVC video coding is developed using a rate-distortioncomplexity (RDC) optimization framework in this work. The proposed algorithm consists of two main steps. At the first step, we use the number of DCT coefficients of prediction errors quantized to zeros to predict whether the underlying block modes should be skipped. At the second step, a joint RDC cost function is adopted to control the mode decision process to manage motion search complexity. It is demonstrated by computer simulation that significant complexity saving can be achieved with negligible R-D performance degradation.
{"title":"Fast H.264/AVC Inter-Mode Decision with RDC Optimization","authors":"Yu Hu, Qing Li, Siwei Ma, C.-C. Jay Kuo","doi":"10.1109/IIH-MSP.2006.100","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.100","url":null,"abstract":"A complexity-constrained inter-mode decision algorithm for H.264/AVC video coding is developed using a rate-distortioncomplexity (RDC) optimization framework in this work. The proposed algorithm consists of two main steps. At the first step, we use the number of DCT coefficients of prediction errors quantized to zeros to predict whether the underlying block modes should be skipped. At the second step, a joint RDC cost function is adopted to control the mode decision process to manage motion search complexity. It is demonstrated by computer simulation that significant complexity saving can be achieved with negligible R-D performance degradation.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"54 98 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":"123003257","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.140
Chun-Hsien Chou, Kuo-Cheng Liu
In this paper, the performance analysis of color image watermarking schemes employing perceptually redundant signal spaces is undertaken. A watermarking scheme that searches for perceptually redundant signal space for embedding transparent watermarks in color images is presented. The search is performed in the wavelet domain of the host color image. A color visual model based on the uniform color metric of the CIEDE2000 color difference equation is used to measure the perceptual redundancy inherent in each wavelet coefficient of various color spaces. Binary watermark signals are repeatedly embedded in qualified wavelet coefficients by the way of quantization index modulation. The watermarking schemes using the uniform and non-uniform color spaces for hiding watermarks are conducted to compare the robustness of the embedded watermark. Experimental results of the analysis show that the non-uniform color space can provide a certain part of color signals a large amount of perceptual redundancy for hiding high-strength watermark signals. The watermark embedded in the non-uniform space is always robust than that embedded in the uniform space.
{"title":"Performance Analysis of Color Image Watermarking Schemes Using Perceptually Redundant Signal Spaces","authors":"Chun-Hsien Chou, Kuo-Cheng Liu","doi":"10.1109/IIH-MSP.2006.140","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.140","url":null,"abstract":"In this paper, the performance analysis of color image watermarking schemes employing perceptually redundant signal spaces is undertaken. A watermarking scheme that searches for perceptually redundant signal space for embedding transparent watermarks in color images is presented. The search is performed in the wavelet domain of the host color image. A color visual model based on the uniform color metric of the CIEDE2000 color difference equation is used to measure the perceptual redundancy inherent in each wavelet coefficient of various color spaces. Binary watermark signals are repeatedly embedded in qualified wavelet coefficients by the way of quantization index modulation. The watermarking schemes using the uniform and non-uniform color spaces for hiding watermarks are conducted to compare the robustness of the embedded watermark. Experimental results of the analysis show that the non-uniform color space can provide a certain part of color signals a large amount of perceptual redundancy for hiding high-strength watermark signals. The watermark embedded in the non-uniform space is always robust than that embedded in the uniform space.","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":"130318502","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}
Yanqing Guo, Weiwei Quan, Yanwu Zhu, Xingang You, Xiangwei Kong
The changes of statistical features can be used to detect the existence of secret messages in images. In this paper, it is indicated that statistical distribution of the whole AC coefficients, such as Generalized Gaussian, Laplacian, Cauchy, etc. can be greatly affected by JPEG quantization process. Furthermore, a constraint condition concerned with quantization step is presented under which the coefficients of individual channel can be fit Laplacian distribution. Based on the constraint condition above, a new steganalytic method, which can achieve a high degree of detection reliability, is also proposed.
{"title":"Effects on Statistical Features for Image by Quantization","authors":"Yanqing Guo, Weiwei Quan, Yanwu Zhu, Xingang You, Xiangwei Kong","doi":"10.1109/IIH-MSP.2006.91","DOIUrl":"https://doi.org/10.1109/IIH-MSP.2006.91","url":null,"abstract":"The changes of statistical features can be used to detect the existence of secret messages in images. In this paper, it is indicated that statistical distribution of the whole AC coefficients, such as Generalized Gaussian, Laplacian, Cauchy, etc. can be greatly affected by JPEG quantization process. Furthermore, a constraint condition concerned with quantization step is presented under which the coefficients of individual channel can be fit Laplacian distribution. Based on the constraint condition above, a new steganalytic method, which can achieve a high degree of detection reliability, is also proposed.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"90 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":"123964522","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
扫码关注我们
求助内容：
应助结果提醒方式：