O-Buffer based IFT watershed from markers for large medical datasets

The watershed transform from markers is a very popular image segmentation operator. The image foresting transform (IFT) watershed is a common method to compute the watershed transform from markers using a priority queue, but which can consume too much memory when applied to three-dimensional medical datasets. This is a considerable limitation on the applicability of the IFT watershed, as the size of medical datasets keeps increasing at a faster pace than physical memory technologies develop. This paper presents the O-IFT watershed, a new type of IFT watershed based on the O-Buffer framework, and introduces an efficient data representation which considerably reduces the memory consumption of the algorithm. In addition, this paper introduces the O-Buckets, a new implementation of the priority queue which further reduces the memory consumption of the algorithm. The new O-IFT watershed with O-Buckets allows the application of the watershed transform from markers to large medical datasets.

[1]  J. Roerdink,et al.  Mathematical Morphology and its Applications to Image and Signal Processing , 1998 .

[2]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004 .

[3]  Alexander Sasov.  Ultrafast micro-CT for in vivo small animal imaging and industrial applications , 2004, SPIE Optics + Photonics.

[4]  Jos B. T. M. Roerdink,et al.  The Watershed Transform: Definitions, Algorithms and Parallelization Strategies , 2000, Fundam. Informaticae.

[5]  Edward R. Dougherty,et al.  Mathematical Morphology in Image Processing , 1992 .

[6]  Arie E. Kaufman,et al.  O-buffer: a framework for sample-based graphics , 2004, IEEE Transactions on Visualization and Computer Graphics.

[7]  Jos B. T. M. Roerdink,et al.  Computation of Watersheds Based on Parallel Graph Algorithms , 1996, ISMM.

[8]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Marc Shapiro,et al.  Generic virtual memory management for operating system kernels , 1989, SOSP '89.

[10]  Mie Sato,et al.  Penalized-Distance Volumetric Skeleton Algorithm , 2001, IEEE Trans. Vis. Comput. Graph..

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Serge Beucher,et al.  Use of watersheds in contour detection , 1979 .

[13]  Jayaram K. Udupa,et al.  Ultrafast user-steered image segmentation paradigm: live-wire-on-the-fly , 1999, Medical Imaging.

[14]  José Crespo,et al.  The flat zone approach: A general low-level region merging segmentation method , 1997, Signal Process..

[15]  Alexandre X. Falcão,et al.  The Ordered Queue and the Optimality of the Watershed Approaches , 2000, ISMM.

[16]  Alexandre X. Falcão,et al.  IFT-Watershed from gray-scale marker , 2002, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing.

[17]  Rainer Wegenkittl,et al.  Implementation and Complexity of the Watershed‐from‐Markers Algorithm Computed as a Minimal Cost Forest , 2001, Comput. Graph. Forum.

[18]  Alexandre X. Falcão,et al.  Interactive volume segmentation with differential image foresting transforms , 2004, IEEE Transactions on Medical Imaging.

[19]  Moncef Gabbouj,et al.  Parallel watershed transformation algorithms for image segmentation , 1998, Parallel Comput..

[20]  Jayaram K. Udupa,et al.  An ultra-fast user-steered image segmentation paradigm: live wire on the fly , 2000, IEEE Transactions on Medical Imaging.

[21]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[22]  Luc Vincent,et al.  Morphological grayscale reconstruction in image analysis: applications and efficient algorithms , 1993, IEEE Trans. Image Process..

[23]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[24]  Montse Pardàs,et al.  Morphological operators for image and video compression , 1996, IEEE Trans. Image Process..

[25]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..