Fast SIFT Algorithm for Object Recognition
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In the object recognition based on original SIFT algorithm, the calculation of the feature descriptor is complex and the time of feature point matching is long, so a fast SIFT algorithm is proposed. The fast algorithm takes cumulative gray-scale value and its difference in a concentic circular window to construct a simplified feature descriptor with 16 dimension, and it matches feature points according to a coarse-to-fine pyramid structure when recognising the object. Experiments show that, under the premise of ensuring the recognition accuracy, the computation time of the proposed fast algorithm is reduced two orders of magnitude compared with the original SIFT algorithm, so the proposed algorithm has a good real-time performance.

    Reference
    Related
    Cited by
Get Citation

张书真,宋海龙,向晓燕,赵英男.采用快速SIFT算法实现目标识别.计算机系统应用,2010,19(6):82-85

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 18,2009
  • Revised:October 26,2009
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063