Decomposition of a curve into arcs and line segments based on dominant point detection

Authors:
Thanh Phuong Nguyen;Isabelle Debled-Rennesson
Affiliations:
ADAGIo Team, LORIA, UMR 7503, Nancy University, Vandoeuvre-ls-Nancy Cedex, France;ADAGIo Team, LORIA, UMR 7503, Nancy University, Vandoeuvre-ls-Nancy Cedex, France
Venue:
SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Year:
2011

Citing 11
Cited 1

Segmentation of edges into lines and arcs

Image and Vision Computing
An Efficiently Computable Metric for Comparing Polygonal Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves

Pattern Recognition Letters
Shape Similarity Measure Based on Correspondence of Visual Parts

IEEE Transactions on Pattern Analysis and Machine Intelligence
A dynamic programming approach for fitting digital planar curves with line segments and circular arcs

Pattern Recognition Letters
An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs

Pattern Recognition Letters
A new method to detect arcs and segments from curvature profiles

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
Optimal blurred segments decomposition of noisy shapes in linear time

Computers and Graphics
Curvature estimation in noisy curves

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
A discrete geometry approach for dominant point detection

Pattern Recognition
Approximation of a polyline with a sequence of geometric primitives

ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II

Ellipse detection through decomposition of circular arcs and line segments

ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new solution is proposed to decompose a curve into arcs and straight line segments in O(n log n) time. It is a combined solution based on arc detection [1] and dominant point detection [2] to strengthen the quality of the segmentation results. Experimental results show the fastness of the proposed method.