{"title":"A novel blind watermarking method based on distance vector of significant wavelet coefficients","authors":"M. Hajizadeh, M. Helfroush, M. Dehghani","doi":"10.1109/IRANIANMVIP.2010.5941147","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient blind watermarking algorithm using distance vector for copyright protection. In this algorithm, the wavelet coefficients from various frequency locations have been grouped into a sequence and named as Group for invisible watermark embedding and extraction. In the next step, after choosing the maximum and second maximum amplitude coefficients of each Group, the distance vector between two coefficients is computed. For embedding bit zero and bit 1, values of the distance vector elements are decreased or increased, respectively. The proposed method, takes advantage of considerable robustness against prevalent attacks. Comparison analysis demonstrates that our method has better performance than the other watermarking schemes reported recently and also watermarked images do not suffer from obvious visual distortion.","PeriodicalId":350778,"journal":{"name":"2010 6th Iranian Conference on Machine Vision and Image Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 6th Iranian Conference on Machine Vision and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANMVIP.2010.5941147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper proposes an efficient blind watermarking algorithm using distance vector for copyright protection. In this algorithm, the wavelet coefficients from various frequency locations have been grouped into a sequence and named as Group for invisible watermark embedding and extraction. In the next step, after choosing the maximum and second maximum amplitude coefficients of each Group, the distance vector between two coefficients is computed. For embedding bit zero and bit 1, values of the distance vector elements are decreased or increased, respectively. The proposed method, takes advantage of considerable robustness against prevalent attacks. Comparison analysis demonstrates that our method has better performance than the other watermarking schemes reported recently and also watermarked images do not suffer from obvious visual distortion.