In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour. For that, we have extended a method [Debled & al 03] defined in a previous paper to a multiorder analysis. It is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we hav...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
Contour polygonal approximation is usually defined as a set of selected points, which describes a po...
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...
<p>(A) Original polygonal curve. (B) First approximation by a line segment, and determination of the...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
International audienceThis paper presents a first step in analyzing how digital shapes behave with r...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we hav...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
Contour polygonal approximation is usually defined as a set of selected points, which describes a po...
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...
<p>(A) Original polygonal curve. (B) First approximation by a line segment, and determination of the...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
International audienceThis paper presents a first step in analyzing how digital shapes behave with r...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
International audienceThis paper presents an algorithm dealing with the data reduction and the appro...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...