The purpose of this paper is to discuss length estimation based on digitized curves. Information on a curve in the Euclidean plane is lost after digitization. Higher resolution supports a convergence of a digital image towards the original curve with respect to Hausdorff metric. No matter how high resolution is assumed, it is impossible to know the length of an original curve exactly. In image analysis we estimate the length of a curve in the Euclidean plane based on an approximation. An approximate polygon converges to the original curve with an increase of resolution. Several approximation methods have been proposed so far. This paper proposes a new approximation method which generates polygonal curves closer (in the sense of Hausdorff me...
Thesis (Ph.D.)--University of Washington, 2019Accurate and robust curve estimation is important for ...
Our study is about perimeter estimation of continuous shapes based on their digitization (i.e. their...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
This paper compares previously published length estimators in image analysis having digitized curves...
International audienceThe paper compares previously published length estimators in image analysis ha...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
The paper details two linear-time algorithms, one for the partition of the boundary line of a digita...
Image analysis deals with discrete picture, obtained by a process of digitization. Through this proc...
In this paper, we propose an algorithm that, from a maximum error and a digital curve (4- or 8-conne...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
We propose adaptive multiscale refinement algorithms for approximating and encoding curves by polygo...
We present a simple and practical (1+e)-approximation algorithm for the Fréchet distance between two...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
Curves on surfaces play an important role in computer-aided geometric design. Because of the conside...
Softcover, ISBN 978-3-642-19866-3International audienceGiven a digital curve and a maximum error, we...
Thesis (Ph.D.)--University of Washington, 2019Accurate and robust curve estimation is important for ...
Our study is about perimeter estimation of continuous shapes based on their digitization (i.e. their...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
This paper compares previously published length estimators in image analysis having digitized curves...
International audienceThe paper compares previously published length estimators in image analysis ha...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
The paper details two linear-time algorithms, one for the partition of the boundary line of a digita...
Image analysis deals with discrete picture, obtained by a process of digitization. Through this proc...
In this paper, we propose an algorithm that, from a maximum error and a digital curve (4- or 8-conne...
Comparing curves is an important and common problem in computer science. Curves are usually compared...
We propose adaptive multiscale refinement algorithms for approximating and encoding curves by polygo...
We present a simple and practical (1+e)-approximation algorithm for the Fréchet distance between two...
This book covers the most important topics in the area of pattern recognition, object recognition, c...
Curves on surfaces play an important role in computer-aided geometric design. Because of the conside...
Softcover, ISBN 978-3-642-19866-3International audienceGiven a digital curve and a maximum error, we...
Thesis (Ph.D.)--University of Washington, 2019Accurate and robust curve estimation is important for ...
Our study is about perimeter estimation of continuous shapes based on their digitization (i.e. their...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...