VLSI array processors
Parallel program design: a foundation
Parallel program design: a foundation
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Topographic distance and watershed lines
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
A connected component approach to the watershed segmentation
ISMM '98 Proceedings of the fourth international symposium on Mathematical morphology and its applications to image and signal processing
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
The watershed transform: definitions, algorithms and parallelization strategies
Fundamenta Informaticae - Special issue on mathematical morphology
Asynchronous circuits and systems: a promising design alternative
Proceedings of MIGAS fourth session on Microelectronics for telecommunications : managing high complexity and mobility: managing high complexity and mobility
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Associative Nets: A Graph-Based Parallel Computing Model
IEEE Transactions on Computers
DEM registration using watershed algorithm and chain coding
COMPUTE '11 Proceedings of the Fourth Annual ACM Bangalore Conference
Advances on watershed processing on GPU architecture
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
A parallel solution for high resolution histological image analysis
Computer Methods and Programs in Biomedicine
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Computers and Electrical Engineering
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.00 |
A joint algorithm-architecture study has resulted into a new version of a picture segmentation system complying with multimedia mobile terminal constraints, i.e., real-time computing, and low power consumption. Previously published watershed segmentation algorithms required at least three global synchronization points: minima detection, labeling and flooding. This paper presents a new fully asynchronous algorithm, where pixels can compute their local data in parallel and independently from one another, and which requires only a unique final global synchronization point. This paper provides a formal demonstration of the convergence and correctness of this new parallel asynchronous algorithm using a mathematical model of data propagation in a graph: the associative net formalism. We demonstrate the simplicity of implementation of this algorithm on parallel processor arrays. We explore, simulate, and validate several configurations of the algorithm-architecture using a "SystemC” model. Simulations reveal an image segmentation rate up to 66,000 QCIF images/sec, i.e., a speed-up factor of more than 1,000 times compared with state of the art watershed algorithms. A fine grain processor array design using STmicroelectronics 0.18\mu m CMOS technology confirms that this new approach is a breakthrough in the domain of real-time image segmentation.