High-capacity PVO-based reversible data hiding scheme using changeable step size

Reversible data hiding (RDH) algorithm based on pixel-value-ordering (PVO) has received widespread attention because of its excellent performance. PVO algorithm divides the host image into non-overlapped equal-sized blocks, then achieves data embedding by modifying the maximum and minimum values of each block. Every pixel block can be a host of watermark data, so the smaller number of pixel blocks limit the embedding capacity (EC). In our work, a novel PVO with changeable step size (CPVO) is presented which can choose suitable step size based on the number of watermark data bits, even that allow one block to overlap other ones. Take the block size 2 x 2 as an example, we can set step size 2 x 1 or another one in CPVO. Consequently, with a block selection skill based on the noise level (NL) of a pixel block, CPVO can embed more hidden data bits into a host image. Compared to the original PVO-based schemes, experimental results show that our proposed scheme increases the EC by 2 similar to 3 times, and the marked image quality keeps much higher, even outperforms some other state-of-the-art works in some test images.

Automated summary

By improving the PVO-based algorithm, a novel CPVO with changeable step size is proposed, which can choose suitable step size based on the number of watermark data bits, allowing for embedding more hidden data bits. Experimental results demonstrate that our scheme increases the embedding capacity while maintaining higher image quality, even outperforming some other state-of-the-art works in certain test images.