𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An adaptive dominant point detection algorithm for digital curves

✍ Scribed by Mohan S. Kankanhalli

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
336 KB
Volume
14
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel algorithm for detecting domin
A parallel algorithm for detecting dominant points on multiple digital curves
✍ Xintong Zhang; Dongming Zhao πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 542 KB

A new parallel algorithm is proposed for detecting corners of multiple planar curves or shapes. This algorithm is based on an analysis of morphological residues and corner characteristics. The method is different from traditional chain-code based corner detection algorithms which associate with a ch

An adaptive method for detecting dominan
An adaptive method for detecting dominant points
✍ Wen-Yen Wu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 329 KB

In this paper, we propose an adaptive method for the polygonal approximation of a digitized curve. Instead of setting a ΓΏxed length of support region in advance, the new method will compute the suitable length of support region for each point to ΓΏnd the best approximated curvature. The dominant poin

An optimal parallel algorithm for digita
An optimal parallel algorithm for digital curve segmentation
✍ Peter Damaschke πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 935 KB

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