Sciweavers

Share
HIS
2009

An Efficient VQ-Based Data Hiding Scheme Using Voronoi Clustering

9 years 9 months ago
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. Keywords-data hiding; Voronoi diagram; vector quantization
Ming-Ni Wu, Puu-An Juang, Yu-Chiang Li
Added 18 Feb 2011
Updated 18 Feb 2011
Type Journal
Year 2009
Where HIS
Authors Ming-Ni Wu, Puu-An Juang, Yu-Chiang Li
Comments (0)
books