An efficient distributed thinning algorithm

DOI10.1016/0167-8191(92)90110-SzbMATH Open0791.68171OpenAlexW1991701348MaRDI QIDQ1185918

Christian Neusius, Jan Olszewski, Dieter Scheerer

Publication date: 28 June 1992

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90110-s

zbMATH Keywords

distributed computationthinning of digital patterns

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Related Items (2)

A noniterative thinning algorithm ⋮ Parallel thinning algorithms on multicomputers: Experimental study on load balancing

Recommendations

• Optimization and performance analysis of thinning algorithms on parallel computers 👍 👎
• A parallel thinning algorithm with fine grain subtasking 👍 👎
• Parallel thinning algorithms on multicomputers: Experimental study on load balancing 👍 👎
• Distributed Minimum Cut Approximation 👍 👎
• Fast fully parallel thinning algorithms 👍 👎
• An asynchronous thinning algorithm 👍 👎
• A noniterative thinning algorithm 👍 👎
• A flexible thinning algorithm allowing parallel, sequential, and distributed application 👍 👎
• Rapid randomized pruning for fast greedy distributed algorithms 👍 👎
• Almost-Tight Distributed Minimum Cut Algorithms 👍 👎

This page was built for publication: An efficient distributed thinning algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185918)