Evaluating the Harris ,BRISK and SURF Feature Points in Watermarking Based on Histogram and Knapsack Problem
محورهای موضوعی : Journal of Computer & RoboticsAli Amiri 1 , Sattar Mirzakuchaki 2
1 - aDepartment of Electronic Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2 - b Department of Electronic Engineering,Iran University of Science and Technology, Tehran, Iran
کلید واژه: watermarking, feature points, SURF, Knapsack problem, geometric attacks,
چکیده مقاله :
With the increasing expansion of the world wide web and social networks, the use of copyright and the prevention of illegal copying in such a way that the proprietorship of the copyrighted work can be proven, has become more popular. With ever-increasing use of the Internet as well as digital audio and video, watermarking has become progressively essential for protecting copyright. In fact, digital watermarking can be a good solution to this problem. Due to having unchangeable nature, applying local features as the second generation of watermarking has gained attention for reaching more stability against attacks. Accordingly, in this article, first, by comparing point-based methods, we choose the most resistant features to attacks based on experiments from the stability perspective. Afterward, an optimal selection process is formulated as a backpack problem to select the stable non-overlapped areas, in which watermark is located. Finally, results are presented for the three feature points algorithms separately.Finally, each selected Region is normalized to obtain a geometrically fixed Region. The proposed plan can withstand various attacks, including the processing of the quasi-noise signals and geometric distortions. The results are compared using the two mentioned feature extraction algorithms and the evaluation of the results is based on the StirMark criterion
With the increasing expansion of the world wide web and social networks, the use of copyright and the prevention of illegal copying in such a way that the proprietorship of the copyrighted work can be proven, has become more popular. With ever-increasing use of the Internet as well as digital audio and video, watermarking has become progressively essential for protecting copyright. In fact, digital watermarking can be a good solution to this problem. Due to having unchangeable nature, applying local features as the second generation of watermarking has gained attention for reaching more stability against attacks. Accordingly, in this article, first, by comparing point-based methods, we choose the most resistant features to attacks based on experiments from the stability perspective. Afterward, an optimal selection process is formulated as a backpack problem to select the stable non-overlapped areas, in which watermark is located. Finally, results are presented for the three feature points algorithms separately.Finally, each selected Region is normalized to obtain a geometrically fixed Region. The proposed plan can withstand various attacks, including the processing of the quasi-noise signals and geometric distortions. The results are compared using the two mentioned feature extraction algorithms and the evaluation of the results is based on the StirMark criterion
[1]Deng, Ch., Gao, X., Li, X., Tao, D.,”Local histogrambased geometric invariant image watermarking”,Signal Processing, Vol. 90, pp. 3256-3264, 2010.
[2] I.J. Cox, J. Kilian, F.T. Leighton, T. Shamoon, Secure spread spectrum watermarking for multimedia, IEEE Transactions on Image Proces- sing 6 (12) (1997) 1673–1687.
[3] N. Agarwal, A. K. Singh, P. K. Singh, “Survey of robust and imperceptible watermarking,” Multimedia Tools and Applications, vol. 78, no. 7, pp. 8603-8633, Apr. 2019.
[4].F. Cayre, C. Fontaine, T. Furon, Watermarking security: theory and practice, IEEE Transaction on Signal Processing 53 (10) (2005) 3976–3987.
[5] P. Bas, J.M. Chassery, B. Macq, Geometrically invariant watermarkingusing feature points, IEEE Trans. Image Process. 11 (9)(2002) 1014–1028.
[6] Tang, C.W., Hang, H.M., “A feature-based robustdigital image watermark scheme”, IEEE Trans. SignalProcess. Vol. 51 (4), pp. 950–958, (2003).
[7] J.S. Seo, C.D. Yoo, Image watermarking based on invariant regions of scale-space representation, IEEE Transaction on Signal Processing 54 (4) (2006) 1537–1549.
[8] X. Wang, J. Wu, P. Niu, A new digital image watermarking algorithm resilient to desynchronization attacks, IEEE Transaction on Information Forensics Security 2 (4) (2007) 633–655.
[9]Singh, C., Ranade, S.K., “Geometrically invariant and high capacity image watermarking scheme usingaccurate radial transform”, Opt. Laser Technol,Vol. 54(30), pp. 176–184, 2013.
[10]D.G.Lowe,Distinctive image features from scalein variant key points,Internationa lJournal of Computer Vision 60(2)(2004)91–110
[11] C. Deng, X. Gao, X. Li, D. Tao, Local histogram based geometric invariant image watermarking, Signal Processing 90 (12) (2010) 3256–3264.
[12]Bay, H., Ess, A., Tuytelaars , T., Gool, L.V., “Speeded-Up Robust Features (SURF)”, in: Computer Vision andImage Understanding, Vol. 110(3), pp. 346-359, 2008.
[13] C. Wang, Y. Zhang, and X. Zhou, "Robust Image Watermarking Algorithm Based on ASIFT against Geometric Attacks", Appl. Sci., 8, 410, 2018.
[14] K. Asifullah M. Summuyya. Robust image watermarking technique using triangular regions and zernike moments for quantization base embedding. Multimed Tools Appl, 2017.
[15] Ch. Deng, X. Gao, X. Li, D. Tao, ”Local histogram based geometric invariant image watermarking”, Signal Processing, Vol. 90(12), December 2010, pp. 3256-3264.
[16] ZEAR, Aditi, SINGH, Amit Kumar, KUMAR, Pardeep. A proposed secure multiple watermarking technique based on DWT, DCT and SVD for application in medicine. Multimedia Tools and Applications, 2016, p. 1-20.
[17] A. Pourhadi, and H. Mahdavi-Nasab, “A robust digital image watermarking scheme based on bat algorithm optimization and SURF detector in SWT domain,” in Multimed Tools and applications, Vol. 79, no. 29, pp. 21653–21677, May 2020.
[18] Sharma V, Mir RN. An enhanced time efficient technique for image watermarking using ant colony optimization and light gradient boosting algorithm. J King Saud Univ Comput Inf Sci. 2019.
[19] B. Kazemivash and M. E. Moghaddam, “A robust digital image watermarking technique using lifting wavelet transform and firefly algorithm,” Multimed Tools Appl., vol. 76, no. 20, pp. 20499–20524, 2017.
[20] M. Amini, M. O. Ahmad and M. N. S. Swamy, “Digital watermark extraction in wavelet domain using hidden Markov model,” Multimedia Tools and Applications, vol. 75, no. 21, pp. 3731-3749, 2017.
[21] L. Zhang and D. Wei, ``Dual DCT-DWT-SVD digital watermarking algorithm based on particle swarm optimization,'' Multimedia Tools Appl., vol. 78, no. 19, pp. 28003_28023, Oct. 2019.
[22] L. Zhang and D. Wei, “Dual DCT-DWT-SVD digital watermarking algorithm based on particle swarm optimization,” Multimedia Tools and Applications, vol. 78, no. 19, pp. 28003–28023, Oct. 2019.
[23] A .Amiri and S. Mirzakuchaki “ A digital watermarking method based on NSCT transform and hybrid evolutionary algorithms with neural networks,” SN Appl Sci vol. 2,no. 10,pp.1–15,sep.2020.
[24]Leutenegger, S., Chli, M., Seigwart, R. Y., “BRISK:Binary Robust Invariant Scalable Keypoints”, IEEE,International Conference on Computer Vision, pp.2548-2555, 2011.
[25]K.Mikolajczyk,C.Schmid,Indexing based on scale in variant interestpoints,in:Proceeding softhe Eighth International Con-ference on Computer Vision,2001,pp.525–531.
[26] Lowe, D. “Distinctive image features from scaleinvariant keypoints” International Journal of Computer Vision, 60,2 (2004), pp. 91-110.
[27] Y. T. Lin, C. Y. Huang, and G. C. Lee, “Rotation, scaling, and translation resilient watermarking for images,” IET Image Processing, vol. 5, no. 4, pp. 328–340, Jun. 2011.
[28] H. Bay, A. Ess, T. Tuytelaars, L. V. Gool, “Speeded-Up Robust Features (SURF)”, in: Computer Vision and Image Understanding, Vol. 110(3), June 2008, pp.346-359.
[29] Alahi, Alexandre, Raphael Ortiz, and Pierre Vandergheynst Freak: Fast retina keypoint, IEEE Conference on
Computer Vision and Pattern Recognition (CVPR), Vol. 10, pp. 510-517, 2012.
[30]M. Assi,R. Haraty “ A Survey of the Knapsack Problem”, 2018 International Arab Conference on Information Technology (ACIT)., 25 March 2019.
[31] P.C. Chu, J.E. Beasley, A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics 4 (1) (1998) 63–86.
[32] R.J. Moraga, G.W. DePuy, G.E. Whitehouse, Meta-RaPS approach for the 0–1 multidimensional knapsack problem, Computers and Industrial Engineering 48 (1) (2005) 83–96.
[33] J.S. Tsai, W.B. Huang, C.L. Chen, Y.H. Kuo, A feature-based digital image watermarking for copyright protection and content authen- tication, in: Proceedings of the IEEE International Conference on Image Processing, 2007, pp. 469–472.
[34] C. Deng, X. Gao, X. Li, and D. Tao, “Local histogram based geometric invariant image watermarking,” Signal Process., vol. 90, no. 12, pp. 3256–3264, Dec. 2010.
[35] A. F. Qasim, R. Aspin, F. Meziane, and P. Hogg, "ROI-based reversible watermarking scheme for ensuring the integrity and authenticity of DICOM MR images," Multimedia Tools and Applications, 2018.
[36] J.S. Tsai, W.B. Huang, C.L. Chen, Y.H. Kuo, A feature-based digital image watermarking for copyright protection and content authen- tication, in: Proceedings of the IEEE International Conference on Image Processing, 2007, pp. 469–472.
[37] H. W. Tian, Y. Zhao, R. R. Ni, L. M. Qin, and X. L. Li, LDFT-based watermarking resilient to local desynchronization attacks, IEEE Trans. Cybern., vol. 43, no. 6, pp. 2190–2201, Dec. 2013.
