1. An optimized structure on FPGA of key point description in SIFT algorithm
- Author
-
Chenyu Xu, Yuxin Zou, En Zhu, and Jinlong Peng
- Subjects
Matching (graph theory) ,business.industry ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Scale-invariant feature transform ,Hamming distance ,Image (mathematics) ,Euclidean distance ,Computer Science::Computer Vision and Pattern Recognition ,Histogram ,Rotational invariance ,Computer vision ,Artificial intelligence ,business ,Rotation (mathematics) ,Mathematics - 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.
- Published
- 2015
- Full Text
- View/download PDF