Dominant point detection by reverse polygonization of digital curves

Masood, Asif

doi:10.1016/j.imavis.2007.08.006

Cited by 62 publications

(85 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The hybrid ellipse detection methods use one or more of the above approaches as just an intermediate step in the ellipse detection algorithm. Other steps like sophisticated digital curve pre-processing techniques (Bhowmick and Bhattacharya, 2007;Carmona-Poyato et al, 2010;Masood, 2008;Prasad and Leung, 2010d;Prasad et al, 2011b;Prasad et al, 2012), curvature estimation and correction techniques (Anderson and Bezdek, 1984;Cazals and Pouget, 2005;Heikkila, 1998;Matas et al, 1995;Prasad et al, 2011a;Worring and Smeulders, 1993;Zhong et al, 2009), partial retrieval of ellipses' parameters using some geometric properties of ellipses (Guil and Zapata, 1997;Ho and Chen, 1995;Yuen et al, 1989;Zhang and Liu, 2005) are usually added before the actual ellipse detection method. Further, most hybrid methods include some or other form of grouping mechanism to group the edges that possibly belong to the same ellipse (Chia et al, 2011;Hahn et al, 2008;Kawaguchi and Nagata, 1998b;Kim et al, 2002;Mai et al, 2008).…”

Section: Contemporary Ellipse Detection Methodsmentioning

confidence: 99%

Methods for Ellipse Detection from Edge Maps of Real Images

Prasad¹,

Leung²

2012

Machine Vision - Applications and Systems

View full text Add to dashboard Cite

Section: Contemporary Ellipse Detection Methodsmentioning

confidence: 99%

Methods for Ellipse Detection from Edge Maps of Real Images

Prasad¹,

Leung²

2012

Machine Vision - Applications and Systems

View full text Add to dashboard Cite

“…Thus, the compression ratio, ρ = m /m, is taken as a measure of approximation quality. This measure is also used in most of the related work (Bhowmick and Bhattacharya, 2007;Masood, 2008;Teh and Chin, 1989;Yin, 2004). As the control parameter τ increases, ρ decreases.…”

Section: Quality Of Approximationmentioning

confidence: 99%

On the Farey sequence and its augmentation for applications to image analysis

Pratihar

Bhowmick

2017

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

We introduce a novel concept of the augmented Farey table (AFT). Its purpose is to store the ranks of fractions of a Farey sequence in an efficient manner so as to return the rank of any query fraction in constant time. As a result, computations on the digital plane can be crafted down to simple integer operations; for example, the tasks like determining the extent of collinearity of integer points or of parallelism of straight lines-often required to solve many image-analytic problemscan be made fast and efficient through an appropriate AFT-based tool. We derive certain interesting characterizations of an AFT for its efficient generation. We also show how, for a fraction not present in a Farey sequence, the rank of the nearest fraction in that sequence can efficiently be obtained by the regula falsi method from the AFT concerned. To assert its merit, we show its use in two applications-one in polygonal approximation of digital curves and the other in skew correction of engineering drawings in document images. Experimental results indicate the potential of the AFT in such image-analytic applications.

show abstract

“…Sarkar [36] proposed the to make the tradeoff between the compression ratio (CR) and the total distortion (ISE) caused [22]. Rosin [32] showed that the two terms CR and ISE used by F OM are not balanced, causing the measure to be biased towards approximations with lower ISE (which can be easily attained by increasing the number of detected dominant points).…”

Section: Performance Quality Measuresmentioning

confidence: 99%

“…The Rosin's evaluation can compare results of different algorithms with different number of dominant points. Nevertheless, Masood [22] pointed out that this method also suffers a few weaknesses. The polygon that consists of just break points will produce Fidelity = 100, Efficiency = 100 and Merit = 100.…”

Section: Eopt Eapprmentioning

confidence: 99%

See 1 more Smart Citation

A new thresholding approach for automatic generation of polygonal approximations

Fernández-García

Martínez

Carmona-Poyato

et al. 2016

Journal of Visual Communication and Image Representation

View full text Add to dashboard Cite

The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2D closed contours based on a new thresholding method. The new proposal computes the significance level of the contour points using a new symmetric version of the well-known Ramer, DouglasPeucker method, and then a new Adaptive method is applied to threshold the normalized significance level of the contour points to generate the polygonal approximation. The experiments have shown that the new algorithm has good performance for generating polygonal approximations of 2D closed contours. Futhermore, the new algorithm does not require any parameter to be tuned.

show abstract

Dominant point detection by reverse polygonization of digital curves

Cited by 62 publications

References 39 publications

Methods for Ellipse Detection from Edge Maps of Real Images

Methods for Ellipse Detection from Edge Maps of Real Images

On the Farey sequence and its augmentation for applications to image analysis

A new thresholding approach for automatic generation of polygonal approximations

Contact Info

Product

Resources

About