Arnold Meijster

13 papers C 3Journal 5Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
A Linear Time Algorithm for Local Minimum and Maximum Filters.
DGMM
Arnold Meijster, Mattia Marziali
2018 J jnl
A Hybrid Shared-Memory Parallel Max-Tree Algorithm for Extreme Dynamic-Range Images.
IEEE Trans. Pattern Anal. Mach. Intell.
Ugo Moschini, Arnold Meijster, Michael H. F. Wilkinson
2008 J jnl
Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines.
IEEE Trans. Pattern Anal. Mach. Intell.
Michael H. F. Wilkinson, Hui Gao, Wim H. Hesselink, Jan-Eppo Jonker, Arnold Meijster
2002 J jnl
A Comparison of Algorithms for Connected Set Openings and Closings.
IEEE Trans. Pattern Anal. Mach. Intell.
Arnold Meijster, Michael H. F. Wilkinson
2001 J jnl
Concurrent determination of connected components.
Sci. Comput. Program.
Wim H. Hesselink, Arnold Meijster, Coenraad Bron
2001 — conf
Fast computation of morphological area pattern spectra.
ICIP (3)
Arnold Meijster, Michael H. F. Wilkinson
2000 C conf
A General Algorithm for Computing Distance Transforms in Linear Time.
ISMM
Arnold Meijster, Jos B. T. M. Roerdink, Wim H. Hesselink
2000 J jnl
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies.
Fundam. Informaticae
Jos B. T. M. Roerdink, Arnold Meijster
2000 — conf
Towards an Implementation of a Multilevel ILU Preconditioner on Shared-Memory Computers.
HPCN Europe
Arnold Meijster, Fred W. Wubs
1998 — conf
A disjoint set algorithm for the watershed transform.
EUSIPCO
Arnold Meijster, Jos B. T. M. Roerdink
1996 C conf
Computation of Watersheds Based on Parallel Graph Algorithms.
ISMM
Arnold Meijster, Jos B. T. M. Roerdink
1996 — conf
Segmentation by watersheds: definition and parallel implementation.
TFCV
Jos B. T. M. Roerdink, Arnold Meijster
1995 C conf
A Proposal for the Implementation of a Parallel Watershed Algorithm.
CAIP
Arnold Meijster, Jos B. T. M. Roerdink