Tree-Based Parity Check for an Optimal Data Hiding Scheme

Free registration required

Executive Summary

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, the authors propose a majority vote strategy that results in least distortion for finding a stego object. The lower embedding efficiency of their method is better than that of previous works when the hidden message length is relatively large.

  • Format: PDF
  • Size: 313.3 KB