Candidate pruning for fast corner detection

Alkaabi, Sultan, Deravi, Farzin (2004) Candidate pruning for fast corner detection. Electronics Letters, 40 (1). pp. 18-19. ISSN 0013-5194. (doi:10.1049/el:20040023) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:8592)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL http://dx.doi.org/10.1049/el:20040023

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.

Item Type:	Article
DOI/Identification number:	10.1049/el:20040023
Subjects:	T Technology > TA Engineering (General). Civil engineering (General) > TA1637 Image processing
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Engineering and Digital Arts
Depositing User:	Yiqing Liang
Date Deposited:	25 Sep 2008 23:45 UTC
Last Modified:	16 Nov 2021 09:46 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/8592 (The current URI for this page, for reference purposes)
Deravi, Farzin:	https://orcid.org/0000-0003-0885-437X

Depositors only (login required):

Altmetric