A novel adjustable reversible data hiding method for AMBTC-compressed codes using Hamming distance
by Ting-Ting Xia; Juan Lin; Chin-Chen Chang; Tzu-Chuen Lu
International Journal of Embedded Systems (IJES), Vol. 14, No. 4, 2021

Abstract: In this paper, we propose a novel adjustable reversible data hiding method for AMBTC-compressed codes using Hamming distance. First, the original image is compressed by AMBTC technique to obtain two quantisation levels and a bitmap of each block. Next, the scheme converts the bitmap of each block to a decimal number and calculates the frequency of the decimal number to find the maximum frequency of the decimal number as the peak bitmap. In our scheme, if the block is equal to the peak bitmap, then the block is embeddable. The scheme generates a candidate list to collect a different kind of bitmap in which the Hamming distance between the block and the peak bitmap is less than a pre-defined threshold. The length of the secret message is computed from the total number of bitmaps in the candidate list. The scheme converts the secret message to form an indicated index and uses the corresponding indicated bitmap in the candidate list to replace the original bitmap. Experimentally, the proposed scheme has a high image quality, and the information hiding capacity can be adjusted by the threshold.

Online publication date: Tue, 05-Oct-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com