Name
Abstract | ||
|---|---|---|
A perfectly parallel thinning algorithm (PPTA) is proposed. It can generate per fect skeletons, which consist of end points, break points, and hole points only. Exper imental results show that the proposed PPTA can also preserve image connectivity, produce thinner skeletons, and is faster than many existing thinning algorithms. For example, it is twice as fast as one of the fastest parallel thinning algorithm by Holt, Stewart, Clint and Perrorte. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1142/S0218001494000504 | IJPRAI |
Keywords | Field | DocType |
image processing,parallel thinning,pattern recognition.,perfect skeleton,pattern recognition | Thinning,Parallel algorithm,Computer science,Algorithm,Image processing,Thinning algorithm | Journal |
Volume | Issue | Citations |
8 | 5 | 2 |
PageRank | References | Authors |
0.41 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edward Y. Y. Zhang | 1 | 13 | 2.31 |
| patrick s p wang | 2 | 303 | 47.66 |