By Topic

An Efficient VQ-Based Data Hiding Scheme Using Voronoi Clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming-Ni Wu ; Dept. of Inf. Manage., Nat. Taichung Inst. of Technol., Taichung, Taiwan ; Puu-An Juang ; Yu-Chiang Li

In this paper, we propose a vector quantization (VQ) -based information hiding scheme that cluster the VQ codewords according the codewordspsila 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 didnpsilat 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.

Published in:

Hybrid Intelligent Systems, 2009. HIS '09. Ninth International Conference on  (Volume:3 )

Date of Conference:

12-14 Aug. 2009