A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision, Graphics, and Image Processing
Corner detection from chain-code
Pattern Recognition
A computational approach for corner and vertex detection
International Journal of Computer Vision
SUSAN—A New Approach to Low Level Image Processing
International Journal of Computer Vision
Scale-Space Vector Fields for Feature Analysis
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A Corner-Finding Algorithm for Chain-Coded Curves
IEEE Transactions on Computers
Hi-index | 0.00 |
This paper describes how corner detection can be realised using a new feature representation that has recently been successfully exploited for edge and symmetry detection. Thefeature representation based on an magnetostatic analogy. The idea is to compute a vector potential by appealing to an analogy in which the Canny edge-map is regarded as an elementary current density residing on the image plane. In our previous work we demonstrated that edges are the local maxima of the vector potential while points of symmetry correspond to the local minimum. In this paper we demonstrate that corners are located at the saddle points of the magnitude of the vector potential. These points corresponds to the intersections of saddle-ridge and saddlevalley structures, i.e. to junctions of the edge and symmetry lines. We describe a template-based methodfor locating the saddle-points. This involves performing a non-minimum suppression test in the direction of the vector potential and a non-maximum suppression test in the orthogonal direction. Experimental results of both synthetic and real images are given.