Cart (Loading....) | Create Account
Close category search window
 

A Reversible Data Embedding Scheme Based on Hash Functions for VQ Index Tables

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)
Zhi-Hui Wang ; Dept. of Software, Dalian Univ. of Technol., Dalian, China ; Ching-Yun Chang ; Pei-Wei Tsai

A data hiding scheme with flexible hiding capacity applied in vector quantization (VQ) index tables was proposed by Chang et al. However the minimum bit rate of their scheme is 0.552. To improve the bit rate of Chang et al's method, this paper proposes a novel and efficient reversible data embedding scheme for VQ index tables. The proposed method exploits characteristics of VQ indices and uses two hush functions to embed the secret data, which is able to make sure that the original indices can be restored to reconstruct the VQ compressed image. The experimental results show that the proposed scheme can achieve the best bit rate and have the satisfactory hiding capacity for all test images.

Published in:

Genetic and Evolutionary Computing (ICGEC), 2010 Fourth International Conference on

Date of Conference:

13-15 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.