Geometrically invariant image watermarking using scale-invariant feature transform and K-means clustering

Authors:
Huawei Tian;Yao Zhao;Rongrong Ni;Jeng-Shyang Pan
Affiliations:
Institute of Information Science, Beijing Jiaotong University, Beijing, China;Institute of Information Science, Beijing Jiaotong University, Beijing, China;Institute of Information Science, Beijing Jiaotong University, Beijing, China;Department of Electronic Engineering, Kaohsiung University of Applied Sciences, Taiwan
Venue:
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI
Year:
2010

Citing 6
Cited 0

Attacks on Copyright Marking Systems

Proceedings of the Second International Workshop on Information Hiding
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Scale-Space Feature Based Image Watermarking in Contourlet Domain

Digital Watermarking
A feature-based robust digital image watermarking scheme

IEEE Transactions on Signal Processing
A New Digital Image Watermarking Algorithm Resilient to Desynchronization Attacks

IEEE Transactions on Information Forensics and Security
Geometrically invariant watermarking using feature points

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the traditional feature-base robust image watermarking, all bits of watermark message are bound with the feature point. If a few of points are attacked badly or lost, the performance of the watermarking scheme will decline or fail. In this paper, we present a robust image watermarking scheme by the use of k-means clustering, scale-invariant feature transform (SIFT) which is invariant to rotation, scaling, translation, partial affine distortion and addition of noise. SIFT features are clustered into clusters by k-means clustering. Watermark message is embedded bit by bit in each cluster. Because one cluster contains only one watermark bit but one cluster contains many feature points, the robustness of watermarking is not lean upon individual feature point. We use twice voting strategy to keep the robustness of watermarking in watermark detecting process. Experimental results show that the scheme is robust against various geometric transformation and common image processing operations, including scaling, rotation, affine transforms, cropping, JPEG compression, image filtering, and so on.