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
โฆ LIBER โฆ
Parallel algorithm for corner finding on digital curves
โ Scribed by Fang-Hsuan Cheng; Wen-Hsing Hsu
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 376 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A parallel algorithm for detecting domin
โ
Xintong Zhang; Dongming Zhao
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 542 KB
Parallel algorithms for corner stitching
โ
Mehta, Dinesh P.; Wilson, Erica D.
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 252 KB
๐ 1 views
Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor. In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithm
An algorithm for finding closed curves
โ
Ming Xie; Monique Thonnat
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 900 KB
A highly parallel algorithm for track fi
โ
Mauro Dell'orso; Luciano Ristori
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 265 KB
A parallel algorithm for finding congrue
โ
Z.C Shih; R.C.T Lee; S.N Yang
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 646 KB
A parallel algorithm for finding the max
โ
Susumu Horiguchi; Willard L Miranker
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 424 KB