A SIFT pruning algorithm for efficient near-duplicate image matching

被引：0
|
作者：
Wang J. [1 ]
Li X. [1 ]
Shou L. [1 ]
Chen G. [1 ]
机构：
[1] College of Computer Science and Technology, Zhejiang University
来源：
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2010年 / 22卷 / 06期
关键词：
Image matching; Locality-sensitive hashing (LSH); Near-duplicate images; Scale invariant feature transform (SIFT);
D O I：
10.3724/sp.j.1089.2010.10850
中图分类号：
学科分类号：
摘要：
The number of SIFT features extracted from an image is usually large and cannot be adequately controlled, which usually results in poor system performance of low efficiency and instability. A SIFT pruning algorithm is proposed to address the above issues in this work. The algorithm measured discriminative power of keypoints by combining the weighted contrast and ratio of the principal curvature, then extracted the proper number of most significant keypoints within a given range through a two-phase filter process in the steps of keypoint localization and orientation assignment. The experiments show that the proposed algorithm can effectively control the number of features and provide higher accuracy than the previous pruning algorithm. The experiments also indicate that the proposed pruning algorithm achieves much higher efficiency and stability with a comparable matching accuracy in comparison to the original non-pruning SIFT algorithm.
引用
收藏
页码：1042 / 1049+1055
相关论文
共 20 条
  • [1] Ke Y., Sukthankar R., Huston L., Efficient near-duplicate detection and sub-image retrieval, Proceedings of the 12th ACM International Conference on Multimedia, pp. 869-876, (2004)
  • [2] Foo J.J., Sinha R., Pruning SIFT for scalable near-duplicate image matching, Proceedings of the 18th Conference on Australasian Database, pp. 63-71, (2007)
  • [3] Lowe D.G., Object recognition from local scale-invariant features, Proceedings of the 7th IEEE International Conference on Computer Vision, pp. 1150-1157, (1999)
  • [4] Lowe D.G., Distinctive image features from scale-invariant keypoints, International Journal of Computer Vision, 60, 2, pp. 91-110, (2004)
  • [5] Ke Y., Sukthankar R., PCA-SIFT: a more distinctive representation for local image descriptors, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 506-513, (2004)
  • [6] Mikolajczyk K., Schmid C., A performance evaluation of local descriptors, IEEE Transactions on Pattern Analysis and Machine Intelligence, 27, 10, pp. 1615-1630, (2005)
  • [7] Gionis A., Indyk P., Motwani R., Similarity search in high dimensions via hashing, Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518-529, (1999)
  • [8] Lv Q., Josephson W., Wang Z., Et al., Multi-probe LSH: efficient indexing for high-dimensional similarity search, Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 950-961, (2007)
  • [9] Dong W., Wang Z., Josephson W., Et al., Modeling LSH for performance tuning, Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 669-678, (2008)
  • [10] Kang X.G., Huang J.W., Shi Y.Q., Et al., A DWT-DFT composite watermarking scheme robust to both affine transform and JPEG compression, IEEE Transactions on Circuits and Systems for Video Technology, 13, 8, pp. 776-786, (2003)
12