TY - GEN
T1 - Histogram-based reversible data hiding with quadtree concepts
AU - Huang, Hsiang Cheh
AU - Wang, Ting Hsuan
AU - Fang, Wai-Chi
PY - 2010/12/1
Y1 - 2010/12/1
N2 - Reversible data hiding has attracted much attention in researches during the past few years. With its characteristics of reversibility, the algorithm is required to fulfill the goals that at the encoder, the secret information needs to be embedded into the original image by some means, and at the decoder, both the secret information and the original image are required to be correctly extracted and recovered, and they should be identical to their embedding counterparts. Under the requirement of reversibility, for evaluating the performance of the algorithm, the output image quality, called imperceptibility, and the number of bits for embedding, called capacity, are the two important factors to access the effectiveness of the algorithm. Here we take the concepts of quadtree decomposition into consideration to watch the characteristics of the original content. And we propose a reversible data hiding algorithm that has the ability to reside more capacity than conventional algorithm, with similar output image quality after embedding, and comparable side information produced.
AB - Reversible data hiding has attracted much attention in researches during the past few years. With its characteristics of reversibility, the algorithm is required to fulfill the goals that at the encoder, the secret information needs to be embedded into the original image by some means, and at the decoder, both the secret information and the original image are required to be correctly extracted and recovered, and they should be identical to their embedding counterparts. Under the requirement of reversibility, for evaluating the performance of the algorithm, the output image quality, called imperceptibility, and the number of bits for embedding, called capacity, are the two important factors to access the effectiveness of the algorithm. Here we take the concepts of quadtree decomposition into consideration to watch the characteristics of the original content. And we propose a reversible data hiding algorithm that has the ability to reside more capacity than conventional algorithm, with similar output image quality after embedding, and comparable side information produced.
KW - capacity
KW - histogram
KW - imperceptibility
KW - quadtree
KW - Reversible data hiding
UR - http://www.scopus.com/inward/record.url?scp=78650795028&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17610-4_14
DO - 10.1007/978-3-642-17610-4_14
M3 - Conference contribution
AN - SCOPUS:78650795028
SN - 3642176097
SN - 9783642176098
T3 - Communications in Computer and Information Science
SP - 126
EP - 133
BT - Security Technology, Disaster Recovery and Business Continuity - International Conferences, SecTech and DRBC 2010, Held as Part of the Future Generation Information Technology Conference, FGIT 2010
T2 - 2010 International Conferences on Security Technology, SecTech 2010 and Disaster Recovery and Business Continuity, DRBC 2010, Held as Part of the 2nd International Mega-Conference on Future Generation Information Technology, FGIT 2010
Y2 - 13 December 2010 through 15 December 2010
ER -