A split and merge procedure for polygonal border detection of dot pattern

An approach to find the polygonal border of a dot pattern is proposed. The procedure starts with a convex hull of the dot pattern and obtains the final border by the process of splitting followed by merging. During splitting one or more sides of the convex hull are deleted and new sides are added to take care of the inherent concavity. To obtain a smooth polygonal border, two or more sides are merged into a single one. An advantage of the procedure is that the user can set a priori the number of sides of the polygon. Also, it works quite well if there is a gradual transition of dot density in the pattern. Given the convex hull, the procedure can be executed in O(nm) time for a pattern consisting of n dots and an m-sided polygonal border. Moreover, the procedure can be implemented in a parallel system as the operations on each side of the convex hull polygon are independent as well as localised.

[1]  P. Taylor.  Quantitative methods in geography: An introduction to spatial analysis , 1977 .

[2]  K. Mardia.  Statistics of Directional Data , 1972 .

[3]  Bidyut Baran Chaudhuri.  Applications of Quadtree, Octree, and Binary Tree Decomposition Techniques to Shape Analysis and Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  John D. Radke,et al.  On the Shape of a Set of Points , 1988 .

[5]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[6]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..

[7]  David G. Kirkpatrick,et al.  On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.

[8]  Shinji Umeyama.  Parameterized Point Pattern Matching and Its Application to Recognition of Object Families , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[10]  John F. O'Callaghan,et al.  An Alternative Definition for "Neighborhood of a Point" , 1975, IEEE Transactions on Computers.

[11]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[12]  Bidyut B. Chaudhuri,et al.  A multiseed non-hierarchical clustering technique for data analysis , 1995 .

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

[14]  Bidyut Baran Chaudhuri,et al.  A Novel Approach to Computation of the Shape of a Dot Pattern and Extraction of Its Perceptual Border , 1997, Comput. Vis. Image Underst..

[15]  Hideo Ogawa.  Labeled point pattern matching by Delaunay triangulation and maximal cliques , 1986, Pattern Recognit..

[16]  Narendra Ahuja,et al.  Extraction of early perceptual structure in dot patterns: Integrating region, boundary, and component gestalt , 1989, Comput. Vis. Graph. Image Process..

[17]  G. Toussaint.  A Graph-Theoretical Primal Sketch , 1988 .

[18]  Robert P. W. Duin,et al.  An Evaluation of Intrinsic Dimensionality Estimators , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Christian Ronse,et al.  A Bibliography on Digital and Computational Convexity (1961-1988) , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Derek Thompson,et al.  Fundamentals of spatial information systems , 1992, A.P.I.C. series.

[21]  Swapan K. Parui,et al.  Computing the shape of a point set in digital images , 1993, Pattern Recognit. Lett..

[22]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[23]  O. Faugeras.  Three-dimensional computer vision: a geometric viewpoint , 1993 .

[24]  Narendra Ahuja,et al.  Supervised classification of early perceptual structure in dot patterns , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems.