In this paper, we propose an original manner to employ a tangential cover algorithm - minDSS - in order to geometrically reconstruct noisy digital contours. To do so, we exploit the representation of graphical objects by maximal primitives we have introduced in previous works. By calculating multi-scale and irregular isothetic representations of the contour, we obtained 1-D (one-dimensional) intervals, and achieved afterwards a decomposition into maximal line segments or circular arcs. By adapting minDSS to this sparse and irregular data of 1-D intervals supporting the maximal primitives, we are now able to reconstruct the input noisy objects into cyclic contours made of lines or arcs with a minimal number of primitives. In this work, we ex...
International audienceIn the paper, we present a method for decomposing a discrete noisy curve into ...
The problem of estimating the regular and visible portions of the contours in an image is formulated...
[[abstract]]©2004-Reconstructing an unknown curve or surface from sample points is an important task...
In this paper, we propose an original manner to employ a tangential cover algorithm - minDSS - in or...
International audienceThe reconstruction of noisy digital shapes is a complex question and a lot of ...
International audienceIn this paper, we present an original algorithm to build a polygonal reconstru...
International audienceThis paper proposes and evaluates a new method for reconstructing a polygonal ...
International audienceThe notion of tangential cover, based on maximal segments, is a well-known too...
International audienceThe notion of tangential cover, based on maximal segments, is a well-known too...
International audienceBlurred segments [Debled06] were introduced in discrete geometry to address po...
The interpretation and recognition of noisy contours, such as silhouettes, have proven to be difficu...
International audienceThe automatic detection of noisy or damaged parts along digital contours is a ...
International audienceIn the paper, we present a method for decomposing a discrete noisy curve into ...
The problem of estimating the regular and visible portions of the contours in an image is formulated...
[[abstract]]©2004-Reconstructing an unknown curve or surface from sample points is an important task...
In this paper, we propose an original manner to employ a tangential cover algorithm - minDSS - in or...
International audienceThe reconstruction of noisy digital shapes is a complex question and a lot of ...
International audienceIn this paper, we present an original algorithm to build a polygonal reconstru...
International audienceThis paper proposes and evaluates a new method for reconstructing a polygonal ...
International audienceThe notion of tangential cover, based on maximal segments, is a well-known too...
International audienceThe notion of tangential cover, based on maximal segments, is a well-known too...
International audienceBlurred segments [Debled06] were introduced in discrete geometry to address po...
The interpretation and recognition of noisy contours, such as silhouettes, have proven to be difficu...
International audienceThe automatic detection of noisy or damaged parts along digital contours is a ...
International audienceIn the paper, we present a method for decomposing a discrete noisy curve into ...
The problem of estimating the regular and visible portions of the contours in an image is formulated...
[[abstract]]©2004-Reconstructing an unknown curve or surface from sample points is an important task...