HSB based reversible data hiding using sorting and pairwise expansion

Ankit Saini

doi:10.1016/j.jisa.2023.103663

Return

HSB based reversible data hiding using sorting and pairwise expansion

2024-02-01

PRE

Ankit Saini

Samayveer Singh *

DOI：10.1016/j.jisa.2023.103663

Original

Original request for help

Save

Abstract

En 中文

Reversible data hiding (RDH) continues to advance in its applicability across diverse fields, including medical imaging, military applications, and cloud computing. In recent times, there has been a proliferation of RDH methods that focus on embedding in the higher significant bit (HSB) plane, as opposed to the least significant bit (LSB), in order to leverage the greater correlation, thereby achieving a larger embedding capacity (EC). This paper introduces a novel and efficient RDH approach that utilizes sorting and pairwise expansion. The proposed method initiates by partitioning the original image into HSB and LSB planes and then converting the HSB plane into a chessboard pattern. Subsequently, pixels are organized in ascending order based on their predicted values, forming groups of 1 x 3 pixels. The embedding process occurs in two passes: the first employs a difference expansion-based RDH, while the second pass employs pairwise expansion to minimize distortion. This method accomplishes an expanded EC while preserving the quality of the resulting image. Experimental results also demonstrate that the proposed approach maintains a significant lead of approximately 0.5 dB over the bestperforming existing methods, underscoring its superior embedding efficiency.

Keywords:

Reversible data hiding

Pairwise expansion

HSB plane

Embedding capacity

Chessboard