title: An optimal data hiding scheme with tree-based parity check.
abstract: Reducing distortion between the cover object and the stego object is an important issue for steganography. The tree-based parity check method is very efficient for hiding a message on image data due to its simplicity. Based on this approach, we propose a majority vote strategy that results in least distortion for finding a stego object. The lower embedding efficiency of our method is better than that of previous works when the hidden message length is relatively large.
authors.affiliation: Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30050. clhou@csie.nctu.edu.tw
authors.forename: Chung-Li
authors.initials: CL
authors.lastname: Hou
authors.forename: ChangChun
authors.initials: C
authors.lastname: Lu
authors.forename: Shi-Chun
authors.initials: SC
authors.lastname: Tsai
authors.forename: Wen-Guey
authors.initials: WG
authors.lastname: Tzeng