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 the method defined in [4, 5] to a multiorder analysis. It is based on the arithmetical definition of discrete lines [11] 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 thresholdfree and automatically provides a partitioning of a digital curve into its meaningful parts
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
The segmentation of digitized data to divide a free form surface into patches is one of the key step...
In this thesis, we are interested in the study of discrete curves and its applications in image anal...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
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 audiencePolygonal approximation is often involved in many applications of computer vis...
International audienceA multi-scale approach is proposed for polygonal repre- sentation of a digital...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of ...
International audienceThe notion of meaningful scale was recently introduced to detect the amount of...
Since the inception of successful rasterization of curves and objects in the digital space, several ...
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...
AbstractThe concept of blurred segment is introduced, it allows the flexible segmentation of discret...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
The segmentation of digitized data to divide a free form surface into patches is one of the key step...
In this thesis, we are interested in the study of discrete curves and its applications in image anal...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
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 audiencePolygonal approximation is often involved in many applications of computer vis...
International audienceA multi-scale approach is proposed for polygonal repre- sentation of a digital...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of ...
International audienceThe notion of meaningful scale was recently introduced to detect the amount of...
Since the inception of successful rasterization of curves and objects in the digital space, several ...
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...
AbstractThe concept of blurred segment is introduced, it allows the flexible segmentation of discret...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
The segmentation of digitized data to divide a free form surface into patches is one of the key step...
In this thesis, we are interested in the study of discrete curves and its applications in image anal...