Differential and Relaxed Image Foresting Transform for Graph-Cut Segmentation of Multiple 3D Objects

Graph-cut algorithms have been extensively investigated for interactive binary segmentation, when the simultaneous delineation of multiple objects can save considerable user's time. We present an algorithm (named DRIFT) for 3D multiple object segmentation based on seed voxels and Differential Image Foresting Transforms (DIFTs) with relaxation. DRIFT stands behind efficient implementations of some state-of-the-art methods. The user can add/remove markers (seed voxels) along a sequence of executions of the DRIFT algorithm to improve segmentation. Its first execution takes linear time with the image's size, while the subsequent executions for corrections take sublinear time in practice. At each execution, DRIFT first runs the DIFT algorithm, then it applies diffusion filtering to smooth boundaries between objects (and background) and, finally, it corrects possible objects' disconnection occurrences with respect to their seeds. We evaluate DRIFT in 3D CT-images of the thorax for segmenting the arterial system, esophagus, left pleural cavity, right pleural cavity, trachea and bronchi, and the venous system.

[1]  Jayaram K. Udupa,et al.  Joint graph cut and relative fuzzy connectedness image segmentation algorithm , 2013, Medical Image Anal..

[2]  Pushmeet Kohli,et al.  User-Centric Learning and Evaluation of Interactive Segmentation Systems , 2012, International Journal of Computer Vision.

[3]  Jayaram K. Udupa,et al.  Fuzzy model-based body-wide anatomy recognition in medical images , 2013, Medical Imaging.

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

[5]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[6]  Jayaram K. Udupa,et al.  Iterative relative fuzzy connectedness for multiple objects with multiple seeds , 2007, Comput. Vis. Image Underst..

[7]  Camille Couprie,et al.  Power Watershed: A Unifying Graph-Based Optimization Framework , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Andrew Mehnert,et al.  Relaxed image foresting transforms for interactive volume image segmentation , 2010, Medical Imaging.

[9]  Leo Grady,et al.  A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[10]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

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

[12]  Pushmeet Kohli,et al.  Dynamic Graph Cuts for Efficient Inference in Markov Random Fields , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Jayaram K. Udupa,et al.  Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis , 2012, Journal of Mathematical Imaging and Vision.