Efficient Recoverable Cryptographic Mosaic Technique by Permutations
| العنوان: | Efficient Recoverable Cryptographic Mosaic Technique by Permutations |
|---|---|
| المؤلفون: | Elaine Y.-N. Sun, Shih Yu Chang, Yen-Cheng Kuan, Hsiao-Chun Wu, Costas Busch, Scott C.-H. Huang |
| المصدر: | IEEE Transactions on Circuits and Systems for Video Technology. 31:112-125 |
| بيانات النشر: | Institute of Electrical and Electronics Engineers (IEEE), 2021. |
| سنة النشر: | 2021 |
| مصطلحات موضوعية: | Demosaicing, business.industry, Computer science, Cryptography, 02 engineering and technology, Encryption, Image (mathematics), Permutation, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, Discrete cosine transform, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, business, Divergence (statistics), Algorithm |
| الوصف: | Mosaic is a popular approach to provide privacy of data and image. However, the existing demosaicing techniques cannot accomplish efficient perfect-reconstruction. If the receiver wants to recover the original image, the extra transmission of the original subimage to be mosaicked is necessary, which consumes much channel resource and is therefore inefficient. In this paper, we propose a novel efficient recoverable cryptographic mosaic technique by permutations. A mosaic, or a privacy-protected subimage, can be constructed through either of the three permutations (Busch’s, Wu’s, and Sun’s/Minmax). These three permutations are designed to maximize the objective function as the sum of the absolute row/column index-differences. This objective is related to the sum of the pixel-to-pixel cross-correlation by our pertinent theoretical study. To measure the effectiveness of the image-mosaicing methods, we propose two image-discrepancy measures, namely summed cross-correlation (SCC) and Kullback-Leibler divergence of discrete cosine transform (DCT-KLD). Compared to the big majority of random permutations for image-mosaicing, our proposed three permutation methods can achieve much better performances in terms of SCC. Nevertheless, the advantage of the three proposed permutation methods over random permutations is not obvious according to DCT-KLD. |
| تدمد: | 1558-2205 1051-8215 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::0b6088953fdde9100097780fd6204275 https://doi.org/10.1109/tcsvt.2020.2976050 |
| حقوق: | CLOSED |
| رقم الأكسشن: | edsair.doi...........0b6088953fdde9100097780fd6204275 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 15582205 10518215 |
|---|