In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the
An Elementary Algorithm for Digital Arc Segmentation
✍ Scribed by David Coeurjolly; Laure Tougne; Yan Gérard; Jean-Pierre Reveillès
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 200 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
First we give an optimal EREW PRAM algorithm that finds an unknown discrete monotone function f, with domain and range of size n, in O(log n) time using O(n) independent threshold queries of kind "f(x) > y?". Here "independent" means that simultaneous queries always refer to mutually disjoint values
A digital naive plane is a subset of points (x, y, z) ∈ Z 3 verifying a double inequality h ≤ ax + by + cz < h + max{|a|, |b|, |c|} where (a, b, c) ∈ R/ {(0,0,0)} and h ∈ R. Given a finite subset of Z 3 , a problem is to determine whether or not there exists a digital naive plane containing it. This
This article presents a novel algorithm for image segbeen developed for classification purposes. In addition, many mentation via the use of the multiresolution wavelet analysis and the authors have discovered significant advantages in the use of the expectation maximization (EM) algorithm. The devel
This article presents a new framework for the motion segmentation and estimation task on sequences of two gray images without a priori information of the number of moving regions present in the sequence. The proposed algorithm uses temporal information, by using an accurate Generalized Least-Squares