This book covers the most important topics in the area of pattern recognition, object recognition, computer vision, robot vision, medical computing, computational geometry, and bioinformatics systems. Students and researchers will find a comprehensive treatment of polygonal approximation and its real life applications. The book not only explains the theoretical aspects but also presents applications with detailed design parameters. The systematic development of the concept of polygonal approximation of digital curves and its scale-space analysis are useful and attractive to scholars in many f
In this chapter, the problem of approximating a closed digital curve with a simplified representatio...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
Abstract: The objective of matching polygonal curves is to deter-mine their perceptual similarity, t...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
In this paper, a polygonal approximation approach based on a multi-objective genetic algorithm is pr...
International audienceIn this paper, a polygonal approximation approach based on a multi-objective g...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
International audiencePolygonal approximation is often involved in many applications of computer vis...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented...
In a recent paper we described a method for assessing the accuracy of polyg-onal approximation algor...
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...
Fourier descriptors have long been used to describe the underling continuous contours of two-dimensi...
Fourier descriptors have long been used to describe the underling continuous contours of two-dimensi...
In this chapter, the problem of approximating a closed digital curve with a simplified representatio...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
Abstract: The objective of matching polygonal curves is to deter-mine their perceptual similarity, t...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
In this paper, a polygonal approximation approach based on a multi-objective genetic algorithm is pr...
International audienceIn this paper, a polygonal approximation approach based on a multi-objective g...
This chapter presents an iterative smoothing technique for polygonal approximation of digital image ...
International audiencePolygonal approximation is often involved in many applications of computer vis...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented...
In a recent paper we described a method for assessing the accuracy of polyg-onal approximation algor...
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...
Fourier descriptors have long been used to describe the underling continuous contours of two-dimensi...
Fourier descriptors have long been used to describe the underling continuous contours of two-dimensi...
In this chapter, the problem of approximating a closed digital curve with a simplified representatio...
The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2...
Abstract: The objective of matching polygonal curves is to deter-mine their perceptual similarity, t...