Constructive Fitting and Extraction of Geometric Primitives

We propose a constructive method for fitting and extracting geometric primitives. This method formalizes the merging process of geometric primitives, which is often used in computer vision. Constructive fitting starts from small uniform fits of the data, which are called elemental fits, and uses them to construct larger uniform fits. We present formal results that involve the calculation of the fitting cost, the way in which the elemental fits must be selected, and the way in which they must be combined to construct a large fit. The rules used to combine the elemental fits are very similar to the engineering principles used when building rigid mechanical constructions with rods and joins. In fact, we will characterize the quality of a large fit by a rigidity parameter. Because of its bottom-up approach constructive fitting is particularly well suited for the extraction of geometric primitives when there is a need for a flexible system. To illustrate the main aspects of constructive fitting we discuss the following applications: exact Least Median of Squares fitting, linear regression with a minimal number of elemental fits, the design of a flatness estimator to compute the local flatness of an image, the decomposition of a digital arc into digital straight line segments, and the merging of circle segments.

[1]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[2]  B. Roth,et al.  The rigidity of graphs, II , 1979 .

[3]  E. Bolker,et al.  How to Brace a One-Story Building , 1977 .

[4]  M. Levine,et al.  Extracting geometric primitives , 1993 .

[5]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[6]  Arnold J. Stromberg,et al.  Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression , 1993, SIAM J. Sci. Comput..

[7]  Erkki Oja,et al.  Probabilistic and non-probabilistic Hough transforms: overview and comparisons , 1995, Image Vis. Comput..

[8]  Robert Connelly,et al.  Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks , 1996, SIAM J. Discret. Math..

[9]  Deborah S. Franzblau Combinatorial Algorithm for a Lower Bound on Frame Rigidity , 1995, SIAM J. Discret. Math..

[10]  H. Crapo,et al.  Spatial Realizations of Linear Scenes , 1986 .

[11]  Erkki Oja,et al.  Randomized hough transform (rht) : Basic mech-anisms, algorithms, and computational complexities , 1993 .

[12]  Robert Connelly,et al.  Higher-order rigidity—What is the proper definition? , 1994, Discret. Comput. Geom..

[13]  A. Recski Matroid theory and its applications in electric network theory and in statics , 1989 .

[14]  Ethan D. Bolker,et al.  BRACING RECTANGULAR FRAMEWORKS. I , 1979 .

[15]  Ruud M. Bolle,et al.  A Complete and Extendable Approach to Visual Recognition , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Arnold W. M. Smeulders,et al.  Decomposition of discrete curves into piecewise straight segments in linear time , 1991 .

[17]  P. Kelly,et al.  Geometry and Convexity: A Study in Mathematical Methods , 1979 .

[18]  Peter J. Rousseeuw,et al.  Robust regression and outlier detection , 1987 .

[19]  B. Roth,et al.  The rigidity of graphs , 1978 .

[20]  W. Whiteley Infinitesimally rigid polyhedra. I. Statics of frameworks , 1984 .

[21]  Henry Crapo Invariant-Theoretic Methods in Scene Analysis and Structural Mechanics , 1991, J. Symb. Comput..

[22]  J. Stoer,et al.  Convexity and Optimization in Finite Dimensions I , 1970 .

[23]  Peter Veelaert Recognition of digital algebraic surfaces by large collections of inequalities , 1995, Other Conferences.

[24]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..