DocumentCode
3027073
Title
A practical hardware design for the keypoint detection in the SIFT algorithm with a reduced memory requirement
Author
Kim, Eung Sup ; Lee, Hyuk-Jae
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., Seoul, South Korea
fYear
2012
fDate
20-23 May 2012
Firstpage
770
Lastpage
773
Abstract
SIFT (Scale Invariant Feature Transform) generates image features widely used to match objects in different images. Previous work on hardware-based SIFT implementation requires excessive internal memory and hardware logic [1]. In this paper, a new hardware organization is proposed to implement the keypoint detection in SIFT with a less memory and hardware cost than the previous work. To this end, a parallel Gaussian filter bank is adopted to eliminate the buffers that store intermediate results because parallel operations allow all intermediate results available at the same time. The processing order of the vertical filtering ahead of the horizontal operation also reduces the storage space. The computational complexity is reduced by sharing the Gaussian filter bank for multiple octaves. As a result, the memory size is reduced by more than 80 percent without a complexity increase in hardware design.
Keywords
buffer storage; computational complexity; feature extraction; filtering theory; image matching; object detection; transforms; SIFT algorithm; buffers; computational complexity; hardware design; hardware logic; image features; image object matching; internal memory; keypoint detection; parallel Gaussian filter bank; reduced memory requirement; scale invariant feature transform; vertical filtering; Buffer storage; Computer architecture; Delay; Filter banks; Hardware; Organizations;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (ISCAS), 2012 IEEE International Symposium on
Conference_Location
Seoul
ISSN
0271-4302
Print_ISBN
978-1-4673-0218-0
Type
conf
DOI
10.1109/ISCAS.2012.6272152
Filename
6272152
Link To Document