DocumentCode
860199
Title
Candidate pruning for fast corner detection
Author
Alkaabi, S. ; Deravi, F.
Author_Institution
Dept. of Electron., Univ. of Kent, Canterbury, UK
Volume
40
Issue
1
fYear
2004
Firstpage
18
Lastpage
19
Abstract
A novel scheme for fast corner detection is presented. This is based on pruning candidate corners to reduce the need for computing local autocorrelation. The algorithm is tested on real image sequences and compared with other widely used corner detectors.
Keywords
computational complexity; correlation methods; edge detection; eigenvalues and eigenfunctions; image sequences; autocorrelation algorithm fusion; candidate pruning; cascaded detector; computational effort; eigenvalues; fast corner detection; real image sequences; thresholding;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20040023
Filename
1260650
Link To Document