TY - GEN
T1 - Secure SIFT-based sparse representation for image copy detection and recognition
AU - Kang, Li Wei
AU - Hsu, Chao Yung
AU - Chen, Hung Wei
AU - Lu, Chun Shien
PY - 2010
Y1 - 2010
N2 - In this paper, we formulate the problems of image copy detection and image recognition in terms of sparse representation. To achieve robustness, security, and efficient storage of image features, we propose to extract compact local feature descriptors via constructing the basis of the SIFT-based feature vectors extracted from the secure SIFT domain of an image. Image copy detection can be efficiently accomplished based on the sparse representations and reconstruction errors of the features extracted from an image possibly manipulated by signal processing or geometric attacks. For image recognition, we show that the features of a query image can be represented as sparse linear combinations of the features extracted from the training images belonging to the same cluster. Hence, image recognition can also be cast as a sparse representation problem. Then, we formulate our sparse representation problem as an l1-minimization problem. Promising results regarding image copy detection and recognition have been verified, respectively, through the simulations conducted on several content-preserving attacks defined in the Stirmark benchmark and Caltech-101 dataset.
AB - In this paper, we formulate the problems of image copy detection and image recognition in terms of sparse representation. To achieve robustness, security, and efficient storage of image features, we propose to extract compact local feature descriptors via constructing the basis of the SIFT-based feature vectors extracted from the secure SIFT domain of an image. Image copy detection can be efficiently accomplished based on the sparse representations and reconstruction errors of the features extracted from an image possibly manipulated by signal processing or geometric attacks. For image recognition, we show that the features of a query image can be represented as sparse linear combinations of the features extracted from the training images belonging to the same cluster. Hence, image recognition can also be cast as a sparse representation problem. Then, we formulate our sparse representation problem as an l1-minimization problem. Promising results regarding image copy detection and recognition have been verified, respectively, through the simulations conducted on several content-preserving attacks defined in the Stirmark benchmark and Caltech-101 dataset.
KW - Compressive sensing
KW - Copy detection
KW - Image recognition
KW - Secure SIFT
KW - Sparse representation
UR - http://www.scopus.com/inward/record.url?scp=78349233871&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78349233871&partnerID=8YFLogxK
U2 - 10.1109/ICME.2010.5582615
DO - 10.1109/ICME.2010.5582615
M3 - Conference contribution
AN - SCOPUS:78349233871
SN - 9781424474912
T3 - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
SP - 1248
EP - 1253
BT - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
T2 - 2010 IEEE International Conference on Multimedia and Expo, ICME 2010
Y2 - 19 July 2010 through 23 July 2010
ER -