Reversible Data Hiding Based on Histogram Shifting with Sorted Pairs of Points
Publication Date
1-1-2021
Document Type
Conference Proceeding
Publication Title
Proceedings - IEEE 7th International Conference on Big Data Computing Service and Applications, BigDataService 2021
DOI
10.1109/BigDataService52369.2021.00032
First Page
201
Last Page
207
Abstract
In recent years, Reversible Data Hidden (RDH) has been paid more and more attention by researchers. Existing RDH algorithms based on histogram shifting require that there should be no overlap between the multiple pairs of maximum and minimum points, so that the embedding capacity is relatively small. In order to improve the embedding capacity, we propose a histogram shifting technique which allows the region between the multiple pairs of maximum and minimum points to be overlapped. This scheme simplifies the process of selecting frequency points. It only needs to find some maximum points and minimum points, and one maximum point matches another minimum point according to their distance. For each pair of maximum and minimum point, histogram shifting is applied to embed the secret information. The experimental results show that the embedding capacity is greatly improved while the image quality reduces slightly.
Funding Number
61902110
Funding Sponsor
National Natural Science Foundation of China
Keywords
Histogram shifting, Image encryption, Reversible data hiding
Department
Applied Data Science; Computer Engineering
Recommended Citation
Hongze Zhao, Ping Ping, Deyin Fu, Jie Hao, and Zeyu Gao. "Reversible Data Hiding Based on Histogram Shifting with Sorted Pairs of Points" Proceedings - IEEE 7th International Conference on Big Data Computing Service and Applications, BigDataService 2021 (2021): 201-207. https://doi.org/10.1109/BigDataService52369.2021.00032
