Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 310704, 10 pages
http://dx.doi.org/10.1155/2015/310704
Research Article

A New Scheme for Keypoint Detection and Description

1College of Mechanical Engineering, Jiangsu University, Zhenjiang, Jiangsu 212013, China
2Department of Mathematics, Hunan University of Humanities, Science and Technology, Loudi, Hunan 417000, China

Received 9 February 2015; Revised 17 April 2015; Accepted 4 May 2015

Academic Editor: Anders Eriksson

Copyright © 2015 Lian Yang and Zhangping Lu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Matas, O. Chum, M. Urban, and T. Pajdla, “Robust wide baseline stereo from maximally stable extremal regions,” in Proceedings of the British Machine Vision Conference (BMVC '02), Cardiff, UK, September 2002.
  3. V. Ke, R. Sukthankar, and L. Huston, “Efficient near-duplicate detection and sub-image retrieval,” in Proceedings of the 12th ACM International Conference on Multimedia, pp. 869–876, October 2004. View at Scopus
  4. T. Tuytelaars and L. V. Gool, “Content-based image retrieval based on local affinely invariant regions,” in Proceedings of the 3rd International Conference on Visual Information and Information Systems (VISUAL '99), pp. 493–500, Amsterdam, The Netherlands, June 1999.
  5. S. Se, D. Lowe, and J. Little, “Local and global localization for mobile robots using visual landmarks,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 1, pp. 414–420, IEEE, Maui, Hawaii, USA, November 2001. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Brown and D. G. Lowe, “Recognising panoramas,” in Proceedings of the 9th IEEE International Conference on Computer Vision, pp. 1218–1225, October 2003. View at Scopus
  7. H. Moravec, “Rover visual obstacle avoidance,” in Proceedings of the 7th International Joint Conference on Artificial Intelligence (IJCAI '81), pp. 785–790, 1981.
  8. C. Harris and M. Stephens, “A combined corner and edge detector,” in Proceedings of the Alvey Vision Conference, pp. 23.1–23.6, Manchester, UK, 1988. View at Publisher · View at Google Scholar
  9. E. Rosten and T. Drummond, “Machine learning for high-speed corner detection,” in Computer Vision—ECCV 2006: 9th European Conference on Computer Vision, Graz, Austria, May 7–13, 2006. Proceedings, Part I, vol. 3951 of Lecture Notes in Computer Science, pp. 430–443, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  10. E. Mair, G. Hager, D. Burschka, M. Suppa, and G. Hirzinger, “Adaptive and generic corner detection based on the accelerated segment test,” in Computer Vision—ECCV 2010: Proceedings of the 11th European Conference on Computer Vision, Heraklion, Crete, Greece, September 5–11, 2010, Part II, vol. 6312 of Lecture Notes in Computer Science, pp. 183–196, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  11. E. Rublee, V. Rabaud, K. Konolige, and G. Bradski, “ORB: an efficient alternative to SIFT or SURF,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV '11), pp. 2564–2571, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. T. Lindeberg, “Feature detection with automatic scale selection,” International Journal of Computer Vision, vol. 30, no. 2, pp. 79–116, 1998. View at Publisher · View at Google Scholar · View at Scopus
  13. K. Mikolajczyk and C. Schmid, “Indexing based on scale invariant interest points,” in Proceedings of the 8th International Conference on Computer Vision, pp. 525–531, July 2001. View at Scopus
  14. K. Mikolajczyk and C. Schmid, “An affine invariant interest point detector,” in Proceedings of the European Conference on Computer Vision, pp. 128–142, May 2002.
  15. K. Mikolajczyk, T. Tuytelaars, C. Schmid et al., “A comparison of affine region detectors,” International Journal of Computer Vision, vol. 65, no. 1-2, pp. 43–72, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. A. E. Johnson and M. Hebert, “Recognizing objects by matching oriented points,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 684–689, June 1997. View at Scopus
  17. R. Zabih and J. Woodfill, “Non-parametric local transforms for computing visual correspondence,” in Computer Vision—ECCV '94: Third European Conference on Computer Vision Stockholm, Sweden, May 2–6 1994 Proceedings, Volume II, vol. 801 of Lecture Notes in Computer Science, pp. 151–158, Springer, Berlin, Germany, 1994. View at Publisher · View at Google Scholar
  18. Y. Ke and R. Sukthankar, “PCA-SIFT: a more distinctive representation for local image descriptors,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '04), vol. 2, pp. II-506–II-513, June–July 2004. View at Publisher · View at Google Scholar
  19. K. Mikolajczyk and C. Schmid, “A performance evaluation of local descriptors,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1615–1630, 2005. View at Publisher · View at Google Scholar · View at Scopus
  20. H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool, “Speeded-up robust features (SURF),” Computer Vision and Image Understanding, vol. 110, no. 3, pp. 346–359, 2008. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Calonder, V. Lepetit, C. Strecha, and P. Fua, “Brief: binary robust independent elementary features,” in Proceedings of the European Conference on Computer Vision, pp. 778–792, Crete, Greece, September 2010.
  22. S. Leutenegger, M. Chli, and R. Y. Siegwart, “BRISK: binary robust invariant scalable keypoints,” in Proceedings of the IEEE International Conference on Computer Vision (ICCV '11), vol. 65, pp. 2548–2555, Barcelona, Spain, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Alahi, R. Ortiz, and P. Vandergheynst, “FREAK: fast retina keypoint,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '12), pp. 510–517, IEEE, Providence, RI, USA, June 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, “Analysis of the clustering properties of the Hilbert space-filling curve,” IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 124–141, 2001. View at Publisher · View at Google Scholar · View at Scopus
  25. A. R. Butz, “Alternative algorithm for Hilbert's space filling curve,” IEEE Transactions on Computers, vol. 20, no. 4, pp. 424–426, 1971. View at Publisher · View at Google Scholar · View at Scopus
  26. M. Brown and D. G. Lowe, “Invariant features from interest point groups,” in Proceedings of the British Machine Vision Conference, pp. 656–665, 2002.