Quantum Watermark Algorithm Based on Maximum Pixel Difference and Tent Map
| Autor: | Zhuo-Yu Wen, Qing-Wei Zeng, Jun-Feng Fu, Nanrun Zhou |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Physics and Astronomy (miscellaneous)
Pixel Computer science General Mathematics ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Watermark Tent map Scrambling Quantum circuit Least significant bit Computer Science::Multimedia Algorithm Computer Science::Cryptography and Security Block (data storage) Maximum Pixel |
| Zdroj: | International Journal of Theoretical Physics. 60:3306-3333 |
| ISSN: | 1572-9575 0020-7748 |
| DOI: | 10.1007/s10773-021-04909-7 |
| Popis: | A new quantum watermark algorithm is presented by combining maximum pixel difference partitioning with the least significant bit substitution strategy. A quantum cover image with the novel enhanced quantum image representation is divided into non-overlapping blocks. And the difference between the maximal and the minimal pixel values in a block is calculated and compared with the predefined threshold. Then the current block is defined as an edge block or a smooth block according to the comparison result. Subsequently, an edge block could be embedded into more secret information than a smooth block due to the visual characteristic of human eyes. To enhance the security of the quantum watermark algorithm, the chaos matrix obtained by tent map is utilized in the scrambling and embedding process. The scrambled quantum watermark image is embedded into a quantum carrier image with the least significant bit substitution strategy. Quantum circuit analyses demonstrate that the complexity of embedding process is O(n2). Compared with other quantum watermark schemes, the proposed quantum watermark algorithm based on maximum pixel difference and tent map could achieve a better visual quality and a higher embedding capacity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|