An Efficient VQ-based Data Hiding Scheme Using Voronoi Clustering
In this paper, we propose a vector quantization (VQ) -based information hiding scheme that cluster the VQ codeowrds according the codewords’ relation on Voronoi Diagram (VD). The clustering method is fast and easy to implement when projecting the codewords into VD space. The hiding capacities can be adaptive adjusted just modifying the threshold value which didn’t need reorganizing the codebook sequence. Besides, the image quality is acceptable when raising the embedding capacity. Experiments demonstrate that the method can efficiently hiding the secret data into VQ indexes by the fast hiding procedure, high hiding capacity and good image quality.
data hiding Voronoi diagram vector quantization
Ming-Ni Wu Puu-An Juang Yu-Chiang Li
Dept. of Information Management, National Taichung Institute of Technology, Taichung, Taiwan, ROC Dept. of Electrical Engineering, National Chung-Hsing University, Taichung, Taiwan, ROC Dept. of Computer Science and Information Engineering, Southern Taiwan University, Tainan, Taiwan, R
国际会议
2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)
沈阳
英文
1-5
2009-08-12(万方平台首次上网日期,不代表论文的发表时间)