Geometric primitive feature extraction - concepts, algorithms, and applications

05/16/2013
by   Dilip K. Prasad, et al.
0

This thesis presents important insights and concepts related to the topic of the extraction of geometric primitives from the edge contours of digital images. Three specific problems related to this topic have been studied, viz., polygonal approximation of digital curves, tangent estimation of digital curves, and ellipse fitting anddetection from digital curves. For the problem of polygonal approximation, two fundamental problems have been addressed. First, the nature of the performance evaluation metrics in relation to the local and global fitting characteristics has been studied. Second, an explicit error bound of the error introduced by digitizing a continuous line segment has been derived and used to propose a generic non-heuristic parameter independent framework which can be used in several dominant point detection methods. For the problem of tangent estimation for digital curves, a simple method of tangent estimation has been proposed. It is shown that the method has a definite upper bound of the error for conic digital curves. It has been shown that the method performs better than almost all (seventy two) existing tangent estimation methods for conic as well as several non-conic digital curves. For the problem of fitting ellipses on digital curves, a geometric distance minimization model has been considered. An unconstrained, linear, non-iterative, and numerically stable ellipse fitting method has been proposed and it has been shown that the proposed method has better selectivity for elliptic digital curves (high true positive and low false positive) as compared to several other ellipse fitting methods. For the problem of detecting ellipses in a set of digital curves, several innovative and fast pre-processing, grouping, and hypotheses evaluation concepts applicable for digital curves have been proposed and combined to form an ellipse detection method.

READ FULL TEXT

page 21

page 24

research
01/01/2018

A clustering method for misaligned curves

We consider the problem of clustering misaligned curves. According to ou...
research
08/19/2019

The Topological Complexity of Spaces of Digital Jordan Curves

This research is motivated by studying image processing algorithms throu...
research
11/30/2018

Constructing Trivariate B-splines with Positive Jacobian by Pillow Operation and Geometric Iterative Fitting

The advent of isogeometric analysis has prompted a need for methods to g...
research
08/28/2023

Solving Fréchet Distance Problems by Algebraic Geometric Methods

We study several polygonal curve problems under the Fréchet distance via...
research
09/02/2020

Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision

This paper presents the first purely numerical (i.e., non-algebraic) sub...
research
06/15/2009

Maximal digital straight segments and convergence of discrete geometric estimators

Discrete geometric estimators approach geometric quantities on digitized...
research
10/26/2014

On Chord and Sagitta in Z^2: An Analysis towards Fast and Robust Circular Arc Detection

Although chord and sagitta, when considered in tandem, may reflect many ...

Please sign up or login with your details

Forgot password? Click here to reset