Relaxed image foresting transforms for interactive volume image segmentation

The Image Foresting Transform (IFT) is a framework for image partitioning, commonly used for interactive segmentation. Given an image where a subset of the image elements (seed-points) have been assigned correct segmentation labels, the IFT completes the labeling by computing minimal cost paths from all image elements to the seed-points. Each image element is then given the same label as the closest seed-point. Here, we propose the relaxed IFT (RIFT). This modified version of the IFT features an additional parameter to control the smoothness of the segmentation boundary. The RIFT yields more intuitive segmentation results in the presence of noise and weak edges, while maintaining a low computational complexity. We show an application of the method to the refinement of manual segmentations of a thoracolumbar muscle in magnetic resonance images. The performed study shows that the refined segmentations are qualitatively similar to the manual segmentations, while intra-user variations are reduced by more than 50%.

[1]  Filip Malmberg,et al.  Interactive Segmentation with Relaxed Image Foresting Transforms , 2009 .

[2]  Andrew Mehnert,et al.  An improved seeded region growing algorithm , 1997, Pattern Recognit. Lett..

[3]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[5]  Ingela Nyström,et al.  Fast and Robust Semi-automatic Liver Segmentation with Haptic Interaction , 2006, MICCAI.

[6]  Claude Kauffmann,et al.  Seeded ND medical image segmentation by cellular automaton on GPU , 2010, International Journal of Computer Assisted Radiology and Surgery.

[7]  Duncan G Walker,et al.  Quadratus lumborum asymmetry and L4 pars injury in fast bowlers: a prospective MR study. , 2007, Medicine and science in sports and exercise.

[8]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.

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

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

[12]  Guillermo Sapiro,et al.  A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting , 2007, 2007 IEEE 11th International Conference on Computer Vision.

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

[14]  S. Crozier,et al.  Automated segmentation of the quadratus lumborum muscle from magnetic resonance images using a hybrid atlas based - geodesic active contour scheme , 2008, 2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[15]  S. Svensson,et al.  Minimal Cost-Path for Path-Based Distances , 2007, 2007 5th International Symposium on Image and Signal Processing and Analysis.