Two-layers robust data hiding scheme for highly compressed image exploiting AMBTC with difference expansion
When the secret message is placed inside a highly compressed image, the transmission will be more secure and cost efficient. In this article, two-layer data embedding and extraction approaches are provided that use a combination of Absolute Moment Block Truncation Coding (AMBTC) and Difference Expan...
Gespeichert in:
Veröffentlicht in: | Journal of King Saud University. Computer and information sciences 2022-09, Vol.34 (8), p.5240-5260 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | When the secret message is placed inside a highly compressed image, the transmission will be more secure and cost efficient. In this article, two-layer data embedding and extraction approaches are provided that use a combination of Absolute Moment Block Truncation Coding (AMBTC) and Difference Expansion (DE) to enhance hiding capacity on a large scale while producing minimum distortion. The first layer embedding strategy is classified into three situations according to the amount of bit patterns that are concatenated to improve performance. DE is used to build the second layer algorithm. Bitmap has been retaining its previous layer values through DE. The two-layer embedding technique is effective for concealing large volumes of data. In comparison to existing popular AMBTC data hiding strategies, this suggested design provides a low-cost, high-capacity, two-layer efficient data embedding procedure. The anticipated consequence highlighted certain outstanding magnificent aspects in the fields of tampered detection, recovery and authentication schemes, all of which are essential to the modern technological life. This system benefits a wide range of government and business sectors, including health care, commercial security, defence, and intellectual property rights. |
---|---|
ISSN: | 1319-1578 2213-1248 |
DOI: | 10.1016/j.jksuci.2022.05.013 |