Paper
30 October 2009 A fast approximate Harris corner detector
Bing Han, Jiyin Sun, Jing Liu
Author Affiliations +
Proceedings Volume 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis; 74952W (2009) https://doi.org/10.1117/12.833606
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
The most widely used interest points detector is probably the Harris corner detector, which is based on the eigen values of the second moment matrix to extract corner features. In this detection algorithm, convolution with Gaussian filter is a very necessary and pivotal step. However, it is also the most time-consuming step which influences on the detection speed. Therefore, a novel fast approximate Harris corner detector was proposed in this paper, which relied on the integral images and box filters to convolute image. This fast algorithm replaced Gaussian filter process just by 3 additions and made it completely independent of the filter mask size. So it can save a large amount of consuming time. Verified by experimental results, the corners detected by the fast algorithm are quite similar as the original one, but for the implementation speed, especially when the mask size is bigger, the fast algorithm's speed advantage is more outstanding.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bing Han, Jiyin Sun, and Jing Liu "A fast approximate Harris corner detector", Proc. SPIE 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis, 74952W (30 October 2009); https://doi.org/10.1117/12.833606
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensors

Gaussian filters

Detection and tracking algorithms

Image filtering

Convolution

Image processing

Corner detection

Back to Top