An Optimal Data Hiding Scheme With Tree-Based Parity Check

An Optimal Data Hiding Scheme With Tree-Based Parity Check

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing 2011-03, Vol.20 (3), p.880-886
Hauptverfasser: HOU, Chung-Li, CHANGCHUN LU, TSAI, Shi-Chun, TZENG, Wen-Guey
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Complexity theory
Construction industry
Cryptography
Distortion
Exact sciences and technology
Image coding
Image processing
information security
Information, signal and communications theory
Linear code
Messages
Optimization
Parity
Parity check codes
Payloads
Pediatrics
Signal and communications theory
Signal processing
Steganography
Strategy
Telecommunications and information theory
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1057-7149
1941-0042
DOI:10.1109/TIP.2010.2072513