• Electronics Optics & Control
  • Vol. 24, Issue 8, 24 (2017)
SUN Shi-yu1, ZHANG Yan1, LI Jian-zeng1, LI De-liang1, DU Yu-long1, DU Wen-bo2, and ZHANG Shuai3
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • 3[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1671-637x.2017.08.006 Cite this Article
    SUN Shi-yu, ZHANG Yan, LI Jian-zeng, LI De-liang, DU Yu-long, DU Wen-bo, ZHANG Shuai. Comparison of Algorithms Affecting Robustness and Speed of Feature Detectors[J]. Electronics Optics & Control, 2017, 24(8): 24 Copy Citation Text show less

    Abstract

    Feature detectors are receiving increasing attention from computer vision research community, which have been widely utilized in a large number of applications, such as wide baseline matching, object recognition and categorization, image retrieval, visual search, robot localization and data mining.To discuss research challenges of investigation and directions for further research, analysis is made to the robustness and speed of current widely used feature detectors.Various feature detectors, including Scale Invariant Feature Transform (SIFT), Speeded Up Robust Features (SURF), Binary Robust Invariant Scalable Keypoints (BRISK), ORB, KAZE, and Accelerated-KAZE are reviewed.Also, the algorithms affecting robustness and speed of feature detectors are investigated based on steps of feature detection.The Mikolajczyk 05 testing image sequences are used to determine and analyze repeatability and time cost.The experimental results show that fast nonlinear scale space, Features from Accelerated Segment Test (FAST) and long-distance pairs iteration have a more comprehensive performance.
    SUN Shi-yu, ZHANG Yan, LI Jian-zeng, LI De-liang, DU Yu-long, DU Wen-bo, ZHANG Shuai. Comparison of Algorithms Affecting Robustness and Speed of Feature Detectors[J]. Electronics Optics & Control, 2017, 24(8): 24
    Download Citation