Abstract
Data hiding is a technique used to embed a sequence of bits in a host image with small visual deterioration and the means to extract it afterwards. Reversible data hiding allows, in addition, recovering the original cover-image exactly. Several reversible data hiding techniques have been developed but very few of them are appropriate for binary images. This paper proposes a reversible data hiding technique for binary images. This technique uses the Golomb code to compress prediction errors of low-visibility pixels, using its neighborhood as side information, to obtain the space to store the hidden data. The proposed technique is then used to reversibly authenticate binary images, including texts, drawings and halftones. All binary images we tested could be authenticated using the proposed technique, except unrealistically small or random images.
Highlights
A DATA-HIDING scheme is a technique used to embed a sequence of bits in a host image and the means to extract it afterwards
We propose in this paper a reversible data hiding technique of the second type for binary images, called RDTC (Reversible Data hiding by Template ranking with symmetrical Central pixel)
The technique proposed in this paper (RDTC) is based on the non-reversible data hiding named DHTC (Data Hiding by Template ranking with symmetrical Central pixels) [10]
Summary
A DATA-HIDING scheme is a technique used to embed a sequence of bits in a host image and the means to extract it afterwards. Most data-hiding techniques modify and distort the host signal in order to insert the additional information. Reversible data-hiding techniques insert information bits by modifying the host signal, but enable the exact (lossless) restoration of the original host signal after extracting the embedded information. In various fields, such as law enforcement, military imagery, medical imagery and astronomical research, a lossless recover of the host image is essential. The hidden data is detected and the added signal is removed (subtracted) to restore the original host signal These techniques use modulus arithmetic to avoid overflow/underflow errors, which may cause salt-and-pepper. RDTC uses the Golomb code to compress prediction errors of lowvisibility pixels to obtain the space to store the hidden data
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
