Image Feature Matching Algorithm Based on Sparse Structure
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The global image detection of feature points is time-consuming, and the global feature is not of good of stability, which causes the algorithm speed to be slow and the matching accuracy to be low, with the matching effect satisfactory. On the basis of scale invariant feature transform (SIFT) based on the sparse structure of the concept, this study puts forward an image feature matching algorithm based on sparse structure (SSM). It gets the pixel value by sparse sparse degree function, selects pixel highly sparse region, and detects the SIFT feature point of the region, to achieve feature matching by using the best descriptors. Compared with several classical algorithms, the experimental results show that this algorithm has significantly improved in feature matching speed and accuracy, and it can be used for real-time object tracking, image retrieval and image mosaics, and other fields.

    Reference
    Related
    Cited by
Get Citation

包晓安,詹秀娟,张俊为,王强,胡玲玲,桂江生.基于稀疏结构的图像特征匹配算法.计算机系统应用,2018,27(4):178-183

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 03,2017
  • Revised:September 06,2017
  • Adopted:
  • Online: April 03,2018
  • 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