A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins
The histogram watermark, which performs watermark embedding by slightly modifying the histogram of the original image, has been a hot research topic in information hiding technology due to the superiority of its pixel modification during the watermark embedding process, which is independent of the p...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-12-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/8/12/2617 |
| _version_ | 1819230778186268672 |
|---|---|
| author | Zhen Yue Zichen Li Hua Ren Yixian Yang |
| author_facet | Zhen Yue Zichen Li Hua Ren Yixian Yang |
| author_sort | Zhen Yue |
| collection | DOAJ |
| description | The histogram watermark, which performs watermark embedding by slightly modifying the histogram of the original image, has been a hot research topic in information hiding technology due to the superiority of its pixel modification during the watermark embedding process, which is independent of the pixel position. This property makes the histogram-based watermark strong resistant to geometric attacks, such as cropping attack, crossed attack, rotation attack, etc. In this paper, we propose a large capacity histogram-based robust watermarking algorithm based on three consecutive bins for the first time. In our scheme, we divide the shape of three consecutive bins into eight cases. According to these cases, we embed Information Number 0, 1, 2, 3, 4, 5, 6, or 7, respectively. The embedded information capacity reaches one bit per bin (bpb), and the amount of embedded information is equal to 200% of the previous existing algorithms. Experimental results show that the new algorithm not only has a large capacity of embedding information, but also has strong robustness to geometric attacks, as well as common image processing operations. |
| first_indexed | 2024-12-23T11:34:28Z |
| format | Article |
| id | doaj.art-82c9b0c521564350890b44987d87f24a |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-12-23T11:34:28Z |
| publishDate | 2018-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-82c9b0c521564350890b44987d87f24a2022-12-21T17:48:42ZengMDPI AGApplied Sciences2076-34172018-12-01812261710.3390/app8122617app8122617A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive BinsZhen Yue0Zichen Li1Hua Ren2Yixian Yang3Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Information Engineering, Beijing Institute of Graphic Communication, Beijing 102600, ChinaCollege of Computer and Information Engineering, Henan Normal University, Xinxiang 453007, ChinaInformation Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaThe histogram watermark, which performs watermark embedding by slightly modifying the histogram of the original image, has been a hot research topic in information hiding technology due to the superiority of its pixel modification during the watermark embedding process, which is independent of the pixel position. This property makes the histogram-based watermark strong resistant to geometric attacks, such as cropping attack, crossed attack, rotation attack, etc. In this paper, we propose a large capacity histogram-based robust watermarking algorithm based on three consecutive bins for the first time. In our scheme, we divide the shape of three consecutive bins into eight cases. According to these cases, we embed Information Number 0, 1, 2, 3, 4, 5, 6, or 7, respectively. The embedded information capacity reaches one bit per bin (bpb), and the amount of embedded information is equal to 200% of the previous existing algorithms. Experimental results show that the new algorithm not only has a large capacity of embedding information, but also has strong robustness to geometric attacks, as well as common image processing operations.https://www.mdpi.com/2076-3417/8/12/2617robust watermarkinghistogramthree consecutive binslarge capacity |
| spellingShingle | Zhen Yue Zichen Li Hua Ren Yixian Yang A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins Applied Sciences robust watermarking histogram three consecutive bins large capacity |
| title | A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins |
| title_full | A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins |
| title_fullStr | A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins |
| title_full_unstemmed | A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins |
| title_short | A Large Capacity Histogram-Based Watermarking Algorithm for Three Consecutive Bins |
| title_sort | large capacity histogram based watermarking algorithm for three consecutive bins |
| topic | robust watermarking histogram three consecutive bins large capacity |
| url | https://www.mdpi.com/2076-3417/8/12/2617 |
| work_keys_str_mv | AT zhenyue alargecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT zichenli alargecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT huaren alargecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT yixianyang alargecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT zhenyue largecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT zichenli largecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT huaren largecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins AT yixianyang largecapacityhistogrambasedwatermarkingalgorithmforthreeconsecutivebins |