{"title":"Robust watermarking algorithm for digital image based on SIFT feature points","authors":"X. Zou, Na Li, Nawei Ji","doi":"10.1109/ICSESS.2014.6933733","DOIUrl":null,"url":null,"abstract":"In this paper, we present a robust watermarking algorithm for digital image using SIFT (Scale-invariant feature transform) feature points and realizes the blind detection. The algorithm uses SIFT feature points on the host image to decide the embedding location and capacity, and adjusts the size of the binary watermark with Neighbor interpolation, and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host image. The algorithm has the following characteristics: (1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering; (2) the watermarking detection does not require original digital image. The experiments show that the algorithm has good invisibility and strong robustness.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"14 1","pages":"996-1000"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 5th International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2014.6933733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper, we present a robust watermarking algorithm for digital image using SIFT (Scale-invariant feature transform) feature points and realizes the blind detection. The algorithm uses SIFT feature points on the host image to decide the embedding location and capacity, and adjusts the size of the binary watermark with Neighbor interpolation, and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host image. The algorithm has the following characteristics: (1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering; (2) the watermarking detection does not require original digital image. The experiments show that the algorithm has good invisibility and strong robustness.