Name
Abstract | ||
|---|---|---|
This paper proposes an effective lossless information hiding scheme, in which a host image is quantized firstly to generate spare spaces for hiding secret messages. The proposed scheme applies the complexity analysis of neighboring pixels to predict the number of secret message bits concealed in a pixel. In addition, it reserves the differences between the host image and the quantized image for completely restoring the host image. According to the experimental results, the information capacity of the proposed scheme is 0.9 bpp for the standard Lena while that of Maniccam and Bourbakispsilas scheme is 0.3 bpp. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/SITIS.2007.60 | SITIS |
Keywords | Field | DocType |
secret message bit,pixels complexity analysis,information capacity,secret message,lossless information hiding scheme,arithmetic coding,data compression,secret messages hiding,quantized image,data encapsulation,effective lossless information hiding,proposed scheme,watermarking,host image,lena scheme,lossless information hiding,maniccam scheme,quantized firstly,bourbakis scheme,reversible data embedding,complexity analysis,pixel,data mining,information hiding,encoding | Computer vision,Digital watermarking,Spare part,Pattern recognition,Computer science,Information hiding,Pixel,Artificial intelligence,Data compression,Arithmetic coding,Lossless compression,Encoding (memory) | Conference |
ISBN | Citations | PageRank |
978-0-7695-3122-9 | 1 | 0.36 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tzu-Chuen Lu | 1 | 374 | 33.17 |
| Cheng-Chun Huang | 2 | 1 | 0.70 |