Share Email Print
cover

Proceedings Paper

A fast approximate Harris corner detector
Author(s): Bing Han; Jiyin Sun; Jing Liu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 30 October 2009
PDF: 7 pages
Proc. SPIE 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis, 74952W (30 October 2009); doi: 10.1117/12.833606
Show Author Affiliations
Bing Han, Research Institute of High Technology (China)
Jiyin Sun, Research Institute of High Technology (China)
Jing Liu, Research Institute of High Technology (China)


Published in SPIE Proceedings Vol. 7495:
MIPPR 2009: Automatic Target Recognition and Image Analysis
Tianxu Zhang; Bruce Hirsch; Zhiguo Cao; Hanqing Lu, Editor(s)

© SPIE. Terms of Use
Back to Top