Matching polygon fragments

Abstract Many computer vision systems model objects using polygons. If objects occlude each other or do not appear entirely in view, we need to match a polygon scene fragment with the polygon representation of the model objects. In this paper we present a way to match polygon fragments. Using polygon moments and cross moments we can compute a dissimilarity measure between two fragments. In addition, we also find the coordinate transform that maps one fragment onto the other. These polygon moments can be conputed by using just the end points of the line segments. If the dissimilarity measure is less than a small number, then we can preliminarily conclude fragments. Otherwise the polygon fragments are dissimilar and are not considered any further. In computing the dissimilarity measure, we will also find a coordinate transform that maps one fragment to another. By using this coordinate transform, we can develop confirmation tests for determining whether the scene polygon fragments really belong to an occluded object.

[1]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .

[2]  Basantkumar John Oommen,et al.  PATTERN RECOGNITION WITH STRINGS, SUBSTRINGS AND BOUNDARIES , 1982 .

[3]  James C. Bezdek,et al.  Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[5]  Theodosios Pavlidis,et al.  A Hierarchical Syntactic Shape Analyzer , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  George C. Stockman,et al.  Matching Images to Models for Registration and Object Detection via Clustering , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Rangasami L. Kashyap,et al.  Using Polygons to Recognize and Locate Partially Occluded Objects , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[9]  H. Baird Model-Based Image Matching Using Location , 1985 .

[10]  Swapan K. Parui,et al.  Shape similarity measures for open curves , 1983, Pattern Recognit. Lett..

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

[12]  B. John Oommen,et al.  Scale Preserving Smoothing of Polygons , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.