A Novel Adjustable RDH Method for AMBTC-Compressed Codes Using One-to-Many Map

Most existing AMBTC (absolute moment block truncation coding)-based reversible data hiding (RDH) schemes cannot be decoded by traditional AMBTC decoders, because they change the coding structure of the AMBTC compressed code stream, which is unidentified for decoders. Even if some AMBTC-based RDH methods can be decoded by traditional AMBTC decoders, but the obtained payload is low. To this end, in this paper, a high-capacity and decodable AMBTC-based RDH scheme is presented. It is well observed that an m × n-sized bitmap has 2
^m×n
combinations of `1' and `0'. However, all the bitmaps of an image occupy only a small part of all the combinations, and a large part are not used in this image. Motivated by this observation, we propose a one-to-many map between the used and unused combinations, in which one used bitmap can be mapped to multiple unused combinations, achieving high payloads (e.g., log
₂
25 bits for one bitmap of Lena), and more importantly, completely reserving the coding structure of the AMBTC-compressed code. Unlike existing decodable AMBTC-based RDH methods only capable of achieving a fixed payload for one test image, our method can adjust adaptively payloads according to the required visual quality by introducing a predefined threshold. The experimental results also demonstrate that our proposed scheme can largely increase the payload on the basis of maintaining good visual quality.