Two reversible data hiding schemes for VQ‐compressed images based on index coding. Issue 7 (1st July 2018)

• Record Type: Journal Article
• Authors: Rahmani, Peyman; Dastghaibyfard, Gholamhossein
• Is Part Of: IET image processing. Volume 12:Issue 7(2018)
• Page Start: 1195
• Page End: 1203
• Publication Date: 2018-07-01
• Subjects: data encapsulation -- image coding -- vector quantisation -- tree codes -- decoding -- trees (mathematics); reversible data hiding scheme -- VQ image compression -- index coding -- vector quantisation image compression -- switching‐tree coding -- dynamic tree‐coding scheme -- VQ‐based RDH schemes -- nonlegitimate codes -- index replacement mechanism -- legitimate STC‐DTCS code -- VQ index table; Image processing -- Periodicals; 621.36705
• DOI: 10.1049/iet-ipr.2016.0618
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract : This study proposes two reversible data hiding (RDH) schemes for vector quantisation (VQ)‐compressed images based on switching‐tree coding (STC) and dynamic tree‐coding scheme (DTCS). Most developed VQ‐based RDH schemes produce non‐legitimate codes as output. In order to preserve the legitimacy of the embedded VQ code, some schemes embed data into VQ indices by employing an index replacement mechanism and some other schemes perform embedding by adopting one of the possible ways during encoding each index when multiple ways are possible to encode the index. In the current research, two schemes are proposed based on the second mechanism. Outputted code of the proposed schemes is a legitimate STC/DTCS code and the conventional STC/DTCS decoder can decode it to the original VQ index table. The experimental results show that the proposed schemes are feasible and in comparison with some previous RDH schemes, the first one provides higher embedding capacity and the second one embeds a substantial amount of data while provides lower bit rate than most the previous schemes. In addition, the embedding‐efficiency of both proposed schemes is higher than that of the previous schemes.