Enhanced pairwise IPVO-based reversible data hiding scheme using rhombus context

Kumar, Rajeev; Jung, Ki-Hyun

doi:10.1016/j.ins.2020.05.047

Cited by 38 publications

(32 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In pass 2, two prediction errors are computed for the first pixel and the last pixel using the middle pixel and PEH is modified for data embedding. Thus, the proposed method successfully overcomes the drawback of recovery-based method of Kumar et al [25] and other PVO-based methods. In their work, pass-2 does not guarantee recovery of the pixel values modified during pass-1 as in the worst case, a pixel can be modified by ±2.…”

Section: Introductionmentioning

confidence: 84%

“…The experiments are implemented in MATLAB and the secret data is generated using pseudo-random number generators. The results of the proposed method are analysed and compared with some existing state-of-the-art methods including [7,8,14,22,25,27,37,41,42].…”

Section: Elsementioning

confidence: 99%

“…On another note, although high EC is offered by Enhanced pairwise IPVO using rhombus context [25], it suffers from quality problems at low ECs. This method claims to recover the pixel values during pass-2 embedding, which may not always be the case, hence lead to higher distortion.…”

Section: Elsementioning

confidence: 99%

See 2 more Smart Citations

High‐quality reversible data hiding scheme using sorting and enhanced pairwise PEE

Kaur

Singh

Rani

et al. 2021

IET Image Processing

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 84%

Section: Elsementioning

confidence: 99%

See 1 more Smart Citation

High‐quality reversible data hiding scheme using sorting and enhanced pairwise PEE

Kaur

Singh

Rani

et al. 2021

IET Image Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…According to the experimental results, this scheme can achieve an embedding capacity of 3 bpp and a PSNR of 40.73dB. In order to improve stego-image quality and steganography efficiency [35,36], the paper redesigns the hidden manner of secret information. Therefore, this scheme can achieve the corresponding secret information steganography.…”

Section: -2 Double-layer Magic Matrix-based Image Steganographymentioning

confidence: 99%

Research on Image Steganography Based on Sudoku Matrix

et al. 2021

View full text Add to dashboard Cite

At present, the Sudoku matrix, turtle shell matrix, and octagonal matrix have been put forward according to the magic matrix-based data hiding methods. Moreover, the magic matrices to be designed depend on the size of the embedding capacity. In addition, by determining the classification of points of pixel pairs after applying a magic matrix and by determining the traversal area, the average peak signal-to-noise ratio (PSNR) can be improved. Therefore, this topic intends to propose a data hiding method based on a 16 × 16 Sudoku matrix by using the 16 × 16 Sudoku matrix and extending it to a double-layer magic matrix. Low-cost data embedding methods are also studied, in order to improve the PSNR and maintain good image quality with the same embedding capacity.

show abstract

“…The IPVO method makes full use of image redundancy to hide information at the prediction errors of 0 or 1/−1 to achieve excellent embedding performance. In 2020, Kumar and Jung successively proposed a pairwise IPVO method [23] to hide data in a smoother block and used the bin reservation strategy [24] to further combine PEE technology to increase the capacity embedded in the carrier. However, the method has lower image quality under low hidden payload.…”

Section: Introductionmentioning

confidence: 99%

High-Capacity and High-Quality Reversible Data Hiding Method Using Recurrent Round-Trip Embedding Strategy in the Quotient Image

Lee

2021

Applied Sciences

View full text Add to dashboard Cite

In previous research, scholars always think about how to improve the information hiding algorithm and strive to have the largest embedding capacity and better image quality, restoring the original image. This research mainly proposes a new robust and reversible information hiding method, recurrent robust reversible data hiding (triple-RDH), with a recurrent round-trip embedding strategy. We embed the secret message in a quotient image to increase the image robustness. The pixel value is split into two parts, HiSB and LoSB. A recurrent round-trip embedding strategy (referred to as double R-TES) is designed to adjust the predictor and the recursive parameter values, so the pixel value carrying the secret data bits can be first shifted to the right and then shifted to the left, resulting in pixel invariance, so the embedding capacity can be effectively increased repeatedly. Experimental results show that the proposed triple-RDH method can effectively increase the embedding capacity up to 310,732 bits and maintain a certain level of image quality. Compared with the existing pixel error expansion (PEE) methods, the triple-RDH method not only has a high capacity but also has robustness for image processing against unintentional attacks. It can also be used for capacity and image quality according to the needs of the application, performing adjustable embedding.

show abstract

Enhanced pairwise IPVO-based reversible data hiding scheme using rhombus context

Cited by 38 publications

References 26 publications

High‐quality reversible data hiding scheme using sorting and enhanced pairwise PEE

High‐quality reversible data hiding scheme using sorting and enhanced pairwise PEE

Research on Image Steganography Based on Sudoku Matrix

High-Capacity and High-Quality Reversible Data Hiding Method Using Recurrent Round-Trip Embedding Strategy in the Quotient Image

Contact Info

Product

Resources

About