A Topological Measure for Image Object Recognition

All the effective object recognition systems are based on a powerful shape descriptor. We propose a new method for extracting the topological feature of an object. By connecting all the pixels constituting the object under the constraint to define the shortest path (minimum spanning tree) we capture the shape topology. The tree length is in the first approximation the key of our object recognition system. This measure (with some adjustments) make it possible to detect the object target in several geometrical configurations (translation / rotation) and it seems to have many desirable properties such as discrimination power and robustness to noise, that is the conclusion of the preliminary tests on characters and symbols.

[1]  Soo-Chang Pei,et al.  Normalization of rotationally symmetric shapes for pattern recognition , 1992, Pattern Recognit..

[2]  Petros Maragos,et al.  Morphological skeleton representation and coding of binary images , 1984, IEEE Trans. Acoust. Speech Signal Process..

[3]  Laurent Wendling,et al.  Indexing of technical line drawings based on F-signatures , 2001, Proceedings of Sixth International Conference on Document Analysis and Recognition.

[4]  J. Yukich,et al.  Limit Theorems and Rates of Convergence for Euclidean Functionals , 1994 .

[5]  A. Rényi.  On Measures of Entropy and Information , 1961 .

[6]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[7]  N. Kita.  Object locating based on concentric circular description , 1992, [1992] Proceedings. 11th IAPR International Conference on Pattern Recognition.

[8]  Alireza Khotanzad,et al.  Rotation invariant image recognition using features selected via a systematic method , 1990, Pattern Recognition.

[9]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[10]  Alfred O. Hero,et al.  Robust entropy estimation strategies based on edge weighted random graphs , 1998, Optics & Photonics.

[11]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[12]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[13]  Alfred O. Hero,et al.  Asymptotic theory of greedy approximations to minimal k-point random graphs , 1999, IEEE Trans. Inf. Theory.

[14]  Chun-Shin Lin,et al.  New forms of shape invariants from elliptic fourier descriptors , 1987, Pattern Recognit..

[15]  David Malah,et al.  Morphological reduction of skeleton redundancy , 1994, Signal Process..

[16]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[17]  M. Teague.  Image analysis via the general theory of moments , 1980 .

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .