High‐quality reversible data hiding scheme using sorting and enhanced pairwise PEE. Issue 4 (23rd April 2021)

• Record Type: Journal Article
• Authors: Kaur, Gurjinder; Singh, Samayveer; Rani, Rajneesh; Kumar, Rajeev; Malik, Aruna
• Is Part Of: IET image processing. Volume 16:Issue 4(2022)
• Page Start: 1096
• Page End: 1110
• Publication Date: 2021-04-23
• Subjects: Image processing -- Periodicals; 621.36705
• DOI: 10.1049/ipr2.12212
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract: This paper proposes a novel reversible data hiding (RDH) technique using sorting and pairwise prediction error expansion (PEE) to improve embedding capacity (EC) while retaining the quality of cover image. The proposed scheme traverses alternate pixels of the cover image in a zig‐zag order to construct two independent sets for sequential embedding. The pixels of each set are sorted in an increasing order of their rhombus mean followed by a two‐pass data embedding by dividing the sets into 1 × 3 size blocks based on some pre‐defined criteria. In pass 1, two prediction errors are calculated for the first and the last pixels using their rhombus means; and pairwise mapping is modified and exploited to embed the secret data in such a way that the value of the first pixel is either increased or remains unchanged, and the value of the last pixel is either decreased or remains unchanged. In pass‐2, the middle pixel is utilised to predict the first and last pixels and the values of the first pixel and the last pixel are either decreased or remains unchanged and either increased or remains unchanged, respectively. In contrast to some existing recovery‐based methods, the proposed pass‐2 guarantees to complement the changes made in pass‐1, thereby boosting the quality along with increased EC. The experimental results show that the proposed method achieves better embedding performance than the state‐of‐the‐art RDH techniques. More specifically, the proposed method gets an increment by an average of 0.46 dB and 1.01 dB for embedding 10, 000 bits and 20, 000 bits respectively over its closest prior art.