Two Symbol Expansion Methods and Their Application to Reversible Data Hiding

In reversible data hiding, image quality preservation and embedding capacity are of utmost importance. This paper proposes two reversible data hiding methods that utilize symbolization of correlations between adjacent pixels: 1) Haar transform representation and 2) pixel concatenation. First, we convert the pixel value into Haar transformed coefficients and use the symbol given by each pair as a domain for the histogram in which the secret data should be embedded. Second, a symbol domain created by concatenating two adjacent pixels was used. Both algorithms exploit the similarity between the neighboring pixels in an image, and the experimental results demonstrate an average PSNR of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$64.1dB$ </tex-math></inline-formula>, which is 11.6% higher compared to the original histogram shifting method. The performance of the proposed simple method is comparable to or better than that of more advanced methods that rely on computationally complex prediction techniques.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2024-12-25
DOI
https://doi.org/10.1109/access.2024.3523230
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two Symbol Expansion Methods and Their Application to Reversible Data Hiding

Hyoung Joong Kim, Changhee Kang, Sang-ug Kang
IEEE Access
Advanced Steganography and Watermarking Techniques
article

Two Symbol Expansion Methods and Their Application to Reversible Data Hiding

Hyoung Joong Kim, Changhee Kang, Sang-ug Kang
article en

Abstract

In reversible data hiding, image quality preservation and embedding capacity are of utmost importance. This paper proposes two reversible data hiding methods that utilize symbolization of correlations between adjacent pixels: 1) Haar transform representation and 2) pixel concatenation. First, we convert the pixel value into Haar transformed coefficients and use the symbol given by each pair as a domain for the histogram in which the secret data should be embedded. Second, a symbol domain created by concatenating two adjacent pixels was used. Both algorithms exploit the similarity between the neighboring pixels in an image, and the experimental results demonstrate an average PSNR of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$64.1dB$ </tex-math></inline-formula>, which is 11.6% higher compared to the original histogram shifting method. The performance of the proposed simple method is comparable to or better than that of more advanced methods that rely on computationally complex prediction techniques.

IEEE AccessVol. 13
Sangmyung University (KR), Hoseo University (KR)
Hoseo University, National Research Foundation of Korea
Openalex Percentile: Top 76%
Advanced Steganography and Watermarking Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.