Candidate pruning for fast corner detection

被引：19

作者：

Alkaabi, S ^{[1
]}

Deravi, F ^{[1
]}

机构：

[1] Univ Kent, Dept Elect, Canterbury CT2 7NT, Kent, England

来源：

ELECTRONICS LETTERS | 2004年 / 40卷 / 01期

关键词：

Algorithms - Computational complexity - Computational methods - Correlation methods - Eigenvalues and eigenfunctions - Matrix algebra - Motion estimation - Optimization - Problem solving - Real time systems - Stereo vision;

D O I：

10.1049/el:20040023

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：18 / 19

页数：2

共 5 条

[1]

Harris C., 1988, P 4 ALV VIS C MANCH

[2] SUSAN - A new approach to low level image processing [J].

Smith, SM ;

Brady, JM .

INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 23 (01) :45-78

[3] Fast corner detection [J].

Trajkovic, M ;

Hedley, M .

IMAGE AND VISION COMPUTING, 1998, 16 (02) :75-87

[4] REAL-TIME CORNER DETECTION ALGORITHM FOR MOTION ESTIMATION [J].

WANG, H ;

BRADY, M .

IMAGE AND VISION COMPUTING, 1995, 13 (09) :695-703

[5] Analysis of gray level corner detection [J].

Zheng, ZQ ;

Wang, H ;

Teoh, EK .

PATTERN RECOGNITION LETTERS, 1999, 20 (02) :149-162

← 1 →