Share Email Print
cover

Proceedings Paper

An optimized structure on FPGA of key point description in SIFT algorithm
Author(s): Chenyu Xu; Jinlong Peng; En Zhu; Yuxin Zou
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

SIFT algorithm is one of the most significant and effective algorithms to describe the features of image in the field of image matching. To implement SIFT algorithm to hardware environment is apparently considerable and difficult. In this paper, we mainly discuss the realization of Key Point Description in SIFT algorithm, along with Matching process. In Key Point Description, we have proposed a new method of generating histograms, to avoid the rotation of adjacent regions and insure the rotational invariance. In Matching, we replace conventional Euclidean distance with Hamming distance. The results of the experiments fully prove that the structure we propose is real-time, accurate, and efficient. Future work is still needed to improve its performance in harsher conditions.

Paper Details

Date Published: 8 December 2015
PDF: 5 pages
Proc. SPIE 9875, Eighth International Conference on Machine Vision (ICMV 2015), 987519 (8 December 2015); doi: 10.1117/12.2228710
Show Author Affiliations
Chenyu Xu, Southeast Unv. (China)
Jinlong Peng, Southeast Univ. (China)
En Zhu, Southeast Univ. (China)
Yuxin Zou, Southeast Univ. (China)


Published in SPIE Proceedings Vol. 9875:
Eighth International Conference on Machine Vision (ICMV 2015)
Antanas Verikas; Petia Radeva; Dmitry Nikolaev, Editor(s)

© SPIE. Terms of Use
Back to Top