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. Thetree-based parity check method is very efficient for hiding a message on image data due to its simplicity. Basedon 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. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Salient Motion Features for Video Quality Assessment Variational region-based segmentation using multiple texture statistics