Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes

The problem of finding a description, at varying levels of detail, for planar curves and matching two such descriptions is posed and solved in this paper. A number of necessary criteria are imposed on any candidate solution method. Path-based Gaussian smoothing techniques are applied to the curve to find zeros of curvature at varying levels of detail. The result is the ``generalized scale space'' image of a planar curve which is invariant under rotation, uniform scaling and translation of the curve. These properties make the scale space image suitable for matching. The matching algorithm is a modification of the uniform cost algorithm and finds the lowest cost match of contours in the scale space images. It is argued that this is preferable to matching in a so-called stable scale of the curve because no such scale may exist for a given curve. This technique is applied to register a Landsat satellite image of the Strait of Georgia, B.C. (manually corrected for skew) to a map containing the shorelines of an overlapping area.

[1]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[2]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[3]  Theodosios Pavlidis,et al.  Segmentation of pictures and maps through functional approximation , 1972, Comput. Graph. Image Process..

[4]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[5]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[6]  Ian T. Young,et al.  An Analysis Technique for Biological Shape. I , 1974, Inf. Control..

[7]  M. B. Clowes,et al.  Finding Picture Edges Through Collinearity of Feature Points , 1973, IEEE Transactions on Computers.

[8]  Jake K. Aggarwal,et al.  Computer Recognition of Partial Views of Curved Objects , 1977, IEEE Transactions on Computers.

[9]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[10]  Alan K. Mackworth On Reading Sketch Maps , 1977, IJCAI.

[11]  Theodosios Pavlidis,et al.  Polygonal Approximations by Newton's Method , 1977, IEEE Transactions on Computers.

[12]  Per-Erik Danielson A new shape factor , 1978 .

[13]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[14]  James L Stansfield,et al.  Conclusions from the Commodity Expert Project , 1980 .

[15]  Dana H. Ballard,et al.  Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[16]  Michael L. Baird Structural Pattern Recognition , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  D. D. Hoffman,et al.  Representing Smooth Plane Curves for Recognition: Implications for Figure-Ground Reversal , 1982, AAAI.

[18]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[19]  Andrew P. Witkin,et al.  Scale-space filtering: A new approach to multi-scale description , 1984, ICASSP.

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

[21]  Alan L. Yuille,et al.  Scaling Theorems for Zero Crossings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..