论文信息 - A Multiscale Parallel Thinning Algorithm

A Multiscale Parallel Thinning Algorithm

This paper presents a new parallel thinning algorithm. Thinning algorithms based on contour tracing are strongly sequential and irregular, with a complexity of O(n2). Thinning algorithms using parallel neighboring operations are regular with a complexity of O(n3).

Jean-Luc Levaire | Stéphane Ubéda | S. Ubéda | Jean-Luc Levaire

[1] Ronald H. Perrott,et al. An improved parallel thinning algorithm , 1987, CACM.

[2] Carlo Arcelli,et al. Pattern thinning by contour tracing , 1981 .

[3] Zicheng Guo,et al. Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.

[4] Roland T. Chin,et al. A one-pass thinning algorithm and its parallel implementation , 1987, Comput. Vis. Graph. Image Process..

[5] T. Pavlidis. A thinning algorithm for discrete binary images , 1980 .

[6] Gabriella Sanniti di Baja,et al. A thinning algorithm based on prominence detection , 1981, Pattern Recognit..

[7] Jan Olszewski,et al. A flexible thinning algorithm allowing parallel, sequential, and distributed application , 1992, TOMS.

[8] C. J. Hilditch. Comparison of thinning algorithms on a parallel processor , 1983, Image Vis. Comput..