A low bit-rate SOC-based reversible data hiding algorithm by using new encoding strategies

• Published in: Multimedia tools and applications Vol. 78; no. 15; pp. 21223 - 21244
• Main Authors: Pan, Zhibin, Gao, Erdun, Zhu, Ruoxin, Wang, Lingfei
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.08.2019; Springer Nature B.V
• Subjects: Algorithms; Coding; Computer Communication Networks; Computer Science; Data Structures and Information Theory; Embedding; Huffman codes; Multimedia; Multimedia Information Systems; Searching; Special Purpose and Application-Based Systems; Vector quantization; Reversible data hiding; Image compression; Search order coding (SOC); Vector quantization (VQ); Placeholder (PH) of repetition search point
• ISSN: 1380-7501; 1573-7721
• DOI: 10.1007/s11042-019-7425-7

Search order coding (SOC) benefits a lot from the correlation of neighboring blocks for vector quantization (VQ)-compressed images. SOC selects a number of different indices in its search path as candidate search order codes. In this work, we present a low bit-rate SOC-based reversible data hiding algorithm benefiting from novel encoding strategies which exploit the information of the placeholders. The blocks are classified into two categories by the placeholders, where different encoding strategies are designed, respectively. Firstly, for the block in smooth region, the placeholders in its neighborhood are employed to compress the VQ index. Secondly, for the block in complex region, SOC is employed to compress the VQ index. Finally, for the blocks that cannot be processed by its placeholders and SOC, an effective prediction method named accurate gradient selective prediction (AGSP) and Huffman coding are introduced. After encoding phase, the size of the output bit stream is reduced so that space is saved for data embedding. Experiment results show that our proposed method outperforms other state-of-the-art SOC-based algorithms in bit rate and embedding capacity.