The watershed transform: Definitions, algorithms and parallelization strategies
JBTM Roerdink, A Meijster - Fundamenta informaticae, 2000 - content.iospress.com
The watershed transform is the method of choice for image segmentation in the field of
mathematical morphology. We present a critical review of several definitions of the …
mathematical morphology. We present a critical review of several definitions of the …
Parallel image component labelling with watershed transformation
AN Moga, M Gabbouj - IEEE transactions on pattern analysis …, 1997 - ieeexplore.ieee.org
The parallel watershed transformation used in gray scale image segmentation is
reconsidered on the basis of the component labeling problem. The main idea is to break the …
reconsidered on the basis of the component labeling problem. The main idea is to break the …
Computer vision algorithms on reconfigurable logic arrays
Computer vision algorithms are natural candidates for high performance computing systems.
Algorithms in computer vision are characterized by complex and repetitive operations on …
Algorithms in computer vision are characterized by complex and repetitive operations on …
[PDF][PDF] Efficient sequential and parallel algorithms for morphological image processing
A Meijster - 2004 - research.rug.nl
This thesis deals with efficient algorithms for morphological image processing. Each chapter
deals with some algorithm from the field of mathematical morphology. Reviews of existing …
deals with some algorithm from the field of mathematical morphology. Reviews of existing …
Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study
This paper presents efficient and portable implementations of a powerful image
enhancement process, the Symmetric Neighborhood Filter (SNF), and an image …
enhancement process, the Symmetric Neighborhood Filter (SNF), and an image …
Parallel algorithms for image histogramming and connected components with an experimental study
DA Bader, J JáJá - Journal of parallel and distributed computing, 1996 - Elsevier
This paper presents efficient and portable implementations of two useful primitives in image
processing algorithms, histogramming and connected components. Our general framework …
processing algorithms, histogramming and connected components. Our general framework …
Automated real-time visual inspection system for high-resolution superimposed printings
This paper describes an automatic real-time inspection system of printed products. This
system has been applied to the inspection of objects having superimposed printings with …
system has been applied to the inspection of objects having superimposed printings with …
[图书][B] Advances in Digital and Computational Geometry
R Klette, A Rosenfeld, F Sloboda - 1998 - researchgate.net
ADVANCES IN DIGITAL AND COMPUTATIONAL GEOMETRY Page 1 ADVANCES IN
DIGITAL AND COMPUTATIONAL GEOMETRY Reinhard Klette Azriel Rosenfeld Fridrich …
DIGITAL AND COMPUTATIONAL GEOMETRY Reinhard Klette Azriel Rosenfeld Fridrich …
A parallel Euclidean distance transformation algorithm
H Embrechts, D Roose - Computer Vision and Image Understanding, 1996 - Elsevier
We present a parallel algorithm for the Euclidean distance transformation (EDT). It is a
“divide-and-conquer” algorithm based on a fast sequential algorithm for the signed EDT …
“divide-and-conquer” algorithm based on a fast sequential algorithm for the signed EDT …
Parallel Wolff cluster algorithms
S Bae, SH Ko, PD Coddington - International Journal of Modern …, 1995 - World Scientific
The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo
simulation of many spin models. Due to the irregular size, shape and position of the Wolff …
simulation of many spin models. Due to the irregular size, shape and position of the Wolff …