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 β¦
A parallel procedure for the detection of dominant points on a digital curve
β Scribed by P.V. Sankar; C.U. Sharma
- Publisher
- Elsevier Science
- Year
- 1978
- Weight
- 440 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0146-664X
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
Polygonal representation of digital plan
β
Majed Marji; Pepe Siy
π
Article
π
2004
π
Elsevier Science
π
English
β 569 KB
A parallel algorithm for the optimal det
β
P. Bertolazzi; M. Pirozzi
π
Article
π
1984
π
Elsevier Science
β 473 KB
In this paper the problem of recognizing a black curve in a noisy environment using a multiprocessor system is investigated. A dynamic programming parallel algorithm which can solve that image processing problem is presented. It is shown that, under hypothesis of unbounded parallelism and using a si
A parallel algorithm for the optimal det
β
Paola Bertolazzi; Massimo Pirozzi
π
Article
π
1984
π
Elsevier Science
β 80 KB
A recursive procedure for finding the in
β
J.J Little; T.K Peucker
π
Article
π
1979
π
Elsevier Science
β 713 KB
The number of lattice points on a convex
β
H.P.F. Swinnerton-Dyer
π
Article
π
1974
π
Elsevier Science
π
English
β 417 KB