Discrete analytical hyperplanes
Graphical Models and Image Processing
Geometrical parameters extraction from discrete paths
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
(n, m)-Cubes and Farey Nets for Naive Planes Understanding
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Recognition of Digital Naive Planes and Polyhedrization
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Discrete linear objects in dimension n: the standard model
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
Reversible vectorisation of 3D digital planar curves and applications
Image and Vision Computing
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
The supercover of an m-flat is a discrete analytical object
Theoretical Computer Science
A generalized preimage for the digital analytical hyperplane recognition
Discrete Applied Mathematics
Discrete Applied Mathematics
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Analysis and comparative evaluation of discrete tangent estimators
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Properties and applications of the simplified generalized perpendicular bisector
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Unsupervised polygonal reconstruction of noisy contours by a discrete irregular approach
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
Computer Vision and Image Understanding
Hi-index | 0.00 |
This paper present an adaptive pixel resizing method based on a parameter space approach. The pixel resizing is designed for both multiscale recognition and reconstruction purposes. The general idea is valid in any dimension. In this paper we present an illustration of our method in 2D. Pixels are resized according to the local curvature of the curve to control the local error margin of the reconstructed Euclidean object. An efficient 2D algorithm is proposed.