SIFT implementation based on parallel computation

Feng Liang*, Tingfa Xu, Huang Qian, Xiaoyan Wang, Ping Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Image matching is the basis of object recognition, tracking and three-dimensional reconstruction. The SIFT algorithm based on scale space has been widely used for image matching due to its strong robustness. However, the performance of the original flow is difficult to satisfy the real-time requirements. Due to the great advantage of parallel computing, this paper modified the algorithm flow of SIFT algorithm. The experimental results show that the modified algorithm flow makes the computation faster but can find more effective feature points. Also, the experiments further prove the invariance to change of image scales and rotation angles still exists apparently.

Original languageEnglish
Title of host publication2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
DOIs
Publication statusPublished - 2010
Event2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010 - Chengdu, China
Duration: 23 Sept 201025 Sept 2010

Publication series

Name2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010

Conference

Conference2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010
Country/TerritoryChina
CityChengdu
Period23/09/1025/09/10

Keywords

  • Feature descriptors
  • Parallel computing
  • SIFT
  • Scale space

Fingerprint

Dive into the research topics of 'SIFT implementation based on parallel computation'. Together they form a unique fingerprint.

Cite this