Back to Search Start Over

Senary Huffman Compression - A Reversible Data Hiding Scheme for Binary Images.

Authors :
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Rangan, C. Pandu
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Sebe, Nicu
Yuncai Liu
Yueting Zhuang
Huang, Thomas S.
Chung-Chuan Wang
Source :
Multimedia Content Analysis & Mining; 2007, p351-360, 10p
Publication Year :
2007

Abstract

Over the past few years many studies have proposed reversible data hiding schemes, but few have been applied to binary images. Some studies have utilized spread spectrum, compression and binary operations methods to achieve the data hiding goal, but most of them suffered from poor visual quality, capacity and inability to extract the hidden data during recovery. The performance of existing methods also is unsatisfactory. Therefore, this paper proposes a reversible data hiding scheme for binary images: SHC (senary Huffman compression). SHC adopts the half-white and half-black pixels of 4×1 or 2×2 blocks of six types to increase visual quality. Moreover, SHC is senary instead of binary and becomes double senary as a compression unit to increase compression rate and secret hiding capacity. Experimental results show that recovered images are well within human visual perception and have PSNR(s) greater than 33, high secret hiding capacity for 1.1 secret bits / 2 bits, and an effective compression rate of over 17% on average. All results demonstrate that the scheme has advantages in reversible data hiding for binary images. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540734161
Database :
Complementary Index
Journal :
Multimedia Content Analysis & Mining
Publication Type :
Book
Accession number :
33041318
Full Text :
https://doi.org/10.1007/978-3-540-73417-8_43