An algebraic model for fast corner detection

This paper revisits the classical problem of detecting interest points, popularly known as “corners,” in 2D images by proposing a technique based on fitting algebraic shape models to contours in the edge image. Our method for corner detection is targeted for use on structural images, i.e., images that contain man-made structures for which corner detection algorithms are known to perform well. Further, our detector seeks to find image regions that contain two distinct linear contours that intersect. We define the intersection point as the corner, and, in contrast to previous approaches such as the Harris detector, we consider the spatial coherence of the edge points, i.e., the fact that the edge points must lie close to one of the two intersecting lines, an important aspect to stable corner detection. Comparisons between results for the proposed method and that for several popular feature detectors are provided using input images exhibiting a number of standard image variations, including blurring, affine transformation, scaling, rotation, and illumination variation. A modified version of the repeatability rate is proposed for evaluating the stability of the detector under these variations which requires a 1-to-1 mapping between matched features. Using this performance metric, our method is found to perform well in contrast to several current methods for corner detection. Discussion is provided that motivates our method of evaluation and provides an explanation for the observed performance of our algorithm in contrast to other algorithms. Our approach is distinct from other contour-based methods since we need only compute the edge image, from which we explicitly solve for the unknown linear contours and their intersections that provide image corner location estimates. The key benefits to this approach are: (1) performance (in space and time); since no image pyramid (space) and no edge-linking (time) is required and (2) compactness; the estimated model includes the corner location, and direction of the incoming contours in space, i.e., a complete model of the local corner geometry.

[1]  Cordelia Schmid,et al.  Evaluation of Interest Point Detectors , 2000, International Journal of Computer Vision.

[2]  Hans P. Moravec Towards Automatic Visual Obstacle Avoidance , 1977, IJCAI.

[3]  Cordelia Schmid,et al.  Indexing Based on Scale Invariant Interest Points , 2001, ICCV.

[4]  Tom Drummond,et al.  Machine Learning for High-Speed Corner Detection , 2006, ECCV.

[5]  Luc Van Gool,et al.  Efficient Non-Maximum Suppression , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[6]  Carlo Tomasi,et al.  Good features to track , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[7]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Tony Lindeberg,et al.  Shape-adapted smoothing in estimation of 3-D shape cues from affine deformations of local 2-D brightness structure , 1997, Image Vis. Comput..

[9]  Adam Baumberg,et al.  Reliable feature matching across widely separated views , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[10]  David J. Kriegman,et al.  Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Cordelia Schmid,et al.  An Affine Invariant Interest Point Detector , 2002, ECCV.

[12]  William H. Beyer,et al.  CRC standard mathematical tables , 1976 .

[13]  Cordelia Schmid,et al.  A Comparison of Affine Region Detectors , 2005, International Journal of Computer Vision.

[14]  Andrew Zisserman,et al.  Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?" , 2002, ECCV.

[15]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[16]  Gérard G. Medioni,et al.  Corner detection and curve representation using cubic B-splines , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[17]  Radu Horaud,et al.  Finding Geometric and Relational Structures in an Image , 1990, ECCV.

[18]  N. H. C. Yung,et al.  Curvature scale space corner detector with adaptive threshold and dynamic region of support , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[19]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.

[20]  Han Wang,et al.  Real-time corner detection algorithm for motion estimation , 1995, Image Vis. Comput..

[21]  Tony Lindeberg,et al.  Feature Detection with Automatic Scale Selection , 1998, International Journal of Computer Vision.

[22]  Hans P. Morevec Towards automatic visual obstacle avoidance , 1977, IJCAI 1977.

[23]  Mark Hedley,et al.  Fast corner detection , 1998, Image Vis. Comput..

[24]  Stephen M. Smith,et al.  SUSAN—A New Approach to Low Level Image Processing , 1997, International Journal of Computer Vision.

[25]  G. Medioni,et al.  Corner detection and curve representation using cubic B-splines , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[26]  W. Gander,et al.  Least-squares fitting of circles and ellipses , 1994 .

[27]  F. Bookstein Fitting conic sections to scattered data , 1979 .

[28]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.