Optimized polygonal approximation by dominant point deletion

Masood, Asif

doi:10.1016/j.patcog.2007.05.021

Cited by 72 publications

(67 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All contour points (including two candidate contour points) from current point Q j to next candidate contour point P 1 are fitted with least square arc, the centre and radius 1 r of arc are Q j P 1 calculated and obtained. According to the principle of HOUGH transform arc detection, if next to next candidate contour point P 2 belongs to circle which contain the arc Q j P 1 , then the three-dimensional erect taper surface corresponding with next to next candidate contour point P 2 and that corresponding with arc Q j P 1 are intersected at point 1 , it is indicated that arc Q j P 1 and arc P 1 P 2 belong to the same arc, and should be merged, the candidate contour property of the next candidate contour point P 1 is clear, the next to next candidate contour point P 2 is set as next candidate contour point and the calculation is continued and recycled. If…”

Section: Fig 2 Principle Of Projection Height Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Planar Contour Primitive Recognition of Thin Sheet Part Dimensional Inspection System

Qin

2011

AEF

View full text Add to dashboard Cite

Abstract. According to the two indices of inspection accuracy and inspection speed, a planar contour primitive recognition method of thin sheet part dimensional inspection system based on curvature and HOUGH transform is proposed. A contour point classification algorithm based on neighborhood values is developed, and a curvature threshold method is selected to filter the contour points, and a projection height method is selected to distinguish the property of the primitive and classify the contour points, and the straight line primitive and arc primitive segmentation and merging algorithms are constructed respectively by HOUGH transform. The inspection accuracy and inspection speed of the proposed method are compared and analyzed by contrast experiments between the proposed method and four dominant point detection methods such as Chung & Tsai method and so on. The dominant point detection ability of the proposed method is tested by a simulation planar contour which includes all kinds of dominant points. The experimental results indicate that the proposed method can recognize primitives exactly, the inspection speed is fast and the universality is good.

show abstract

Section: Fig 2 Principle Of Projection Height Methodsmentioning

confidence: 99%

“…, the absolute value of the difference between 1 r and 3 r namely 2 3 1 r r ε = − is calculated, and 2 ε is compared with threshold T=0.001. If 2 > T ε , then P is set as new next to next candidate contour point, if 2 ≤ T ε , then P is set as new next candidate contour point.…”

Section: Fig 2 Principle Of Projection Height Methodsmentioning

confidence: 99%

Planar Contour Primitive Recognition of Thin Sheet Part Dimensional Inspection System

Qin

2011

AEF

View full text Add to dashboard Cite

show abstract

“…Xiao et al [17] adopted a splitand-merge algorithm for describing curves with robust tolerance. Massod's approach [18], [19] starts from an initial set of dominant points where the integral square error from a given shape is zero and iteratively deletes most redundant dominant points till required approximation is achieved. Kolesnikov's [20] framework treats the problem of the polygonal approximation with a minimum number of approximation segments for a given error bound with L2-norm and the solution is based on searching for the shortest path in a feasibility graph that has been constructed on the vertices of the input curve.…”

Section: A Related Workmentioning

confidence: 99%

A Heuristic Strategy for Sub-Optimal ThickEdged Polygonal Approximation of 2-D Planar Shape

Saha¹,

Goswami²,

Mahapatra³

2018

IJIGSP

View full text Add to dashboard Cite

Abstract-This paper presents a heuristic approach to approximate a two-dimensional planar shape using a thick-edged polygonal representation based on some optimal criteria. The optimal criteria primarily focus on derivation of minimal thickness for an edge of the polygonal shape representation to handle noisy contour. Vertices of the shape-approximating polygon are extracted through a heuristic exploration using a digital geometric approach in order to find optimally thick-line to represent a discrete curve. The merit of such strategies depends on how efficiently a polygon having minimal number of vertices can be generated with modest computational complexity as a meaningful representation of a shape without loss of significant visual characteristics. The performance of the proposed framework is comparable to the existing schemes based on extensive empirical study with standard data set.

show abstract

“…The computational complexity of the Carmona algorithm is O((m − n d )n), where n is the number of the contour points, m is the number of initial break points, and n d is the number of final dominant points [5]. The computational complexity of the Masood method can be given as O((m − n d )n 2 ) owing to its optimization process [23].…”

Section: 2mentioning

confidence: 99%

“…• Heuristic approach: these methods construct the approximating polygon using some reasonable geometric or perceptual features of the contours [10] -Parametric approach: these methods take into account a parameter to generate the polygonal approximations [2,4,5,7,18,21,22,23].…”

Section: Introductionmentioning

confidence: 99%

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

Optimized polygonal approximation by dominant point deletion

Cited by 72 publications

References 44 publications

Planar Contour Primitive Recognition of Thin Sheet Part Dimensional Inspection System

Planar Contour Primitive Recognition of Thin Sheet Part Dimensional Inspection System

A Heuristic Strategy for Sub-Optimal ThickEdged Polygonal Approximation of 2-D Planar Shape

A new thresholding approach for automatic generation of polygonal approximations

Contact Info

Product

Resources

About