Advertisement

Improving the Efficiency and Accuracy of SIFT Image Matching

  • Daw-Tung Lin
  • Chin-Hui Hsu
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)

Abstract

Developing an accurate mechanism of correspondence and increasing matching stability are crucial tasks in many computer vision applications. This work improves the accuracy and efficiency in image matching via a novel method. The Modifiable Area Harmony Dominating Rectification (MHDR) method is proposed to eliminate mismatched key-point couples automatically and protect matching couples. The matching performance of the proposed scheme was evaluated on a test image database and via the transformation of the shearing effect and thin-plate splines. Compared with other methods, including the Exhaustive Search, Best Bin Search, and Sliding Midpoint Splitting, the proposed method had promising results in improving the accuracy and efficiency of the SIFT image matching.

Keywords

Exhaustive Search Recall Rate Scale Invariant Feature Transform Image Match Matching Stability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM) 45(6), 891–923 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Beis, J.S., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search inhigh-dimensional spaces. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1000–1006 (1997)Google Scholar
  4. 4.
    Donato, G., Belongie, S.: Approximation Methods for Thin Plate Spline Mappings and Principal Warps. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 21–31. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software (TOMS) 3(3), 209–226 (1977)zbMATHCrossRefGoogle Scholar
  6. 6.
    Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: Proceedings of the ACM 12th International Conference on Extending Database Technology: Advances in Database Technology, pp. 744–755 (2009)Google Scholar
  7. 7.
    Hsu, C.H.: Improving the efficiency and accuracy of SIFT image matching. Master’s thesis, National Taipei University (2009)Google Scholar
  8. 8.
    Lin, D.T.: Autonomous sub-image matching for two-dimensional electrophoresis gels using maxrst algorithm. Image and Vision Computing 28(8), 1267–1279 (2010)CrossRefGoogle Scholar
  9. 9.
    Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)CrossRefGoogle Scholar
  10. 10.
    Maneewongvatana, S., Mount, D.M.: It’s okay to be skinny, if your friends are fat. In: Proceedings of the 4th Annual Workshop on Computational Geometry, Center for Geometric Computing (1999)Google Scholar
  11. 11.
    Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(10), 1615–1630 (2005)CrossRefGoogle Scholar
  12. 12.
    Wei, Z., Weisheng, X., Youling, Y.: Area harmony dominating rectification method for SIFT image matching. In: Proceedings of the International Conference on Electronic Measurement and Instruments, pp. 2–935 (2007)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Taipei UniversityNew Taipei CityTaiwan

Personalised recommendations