International audiencePolygonal approximation is often involved in many applications of computer vision, image processing and data compression. In this context, we are interested in digital curves extracted from contours of objects contained in digital images. In particular, we propose a fully discrete structure, based on the notion of blurred segments, to study the geometrical features on such curves and apply it in a process of polygonal approximation. The experimental results demonstrate the robustness of the proposed method to local variation and noise on the curve
International audienceIn this paper, we present a generic topological and geometrical framework whic...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
International audiencePolygonal approximation is often involved in many applications of computer vis...
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 ...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
International audienceThe notion of meaningful scale was recently introduced to detect the amount of...
International audienceBlurred segments [Debled06] were introduced in discrete geometry to address po...
International audienceThe reconstruction of noisy digital shapes is a complex question and a lot of ...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
International audiencePolygonal approximation is often involved in many applications of computer vis...
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 ...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
International audienceThe notion of meaningful scale was recently introduced to detect the amount of...
International audienceBlurred segments [Debled06] were introduced in discrete geometry to address po...
International audienceThe reconstruction of noisy digital shapes is a complex question and a lot of ...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...