skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Visualizing the Uncertainty of Graph-based 2D Segmentation with Min-path Stability

Journal Article · · Computer Graphics Forum
DOI:https://doi.org/10.1111/cgf.13174· OSTI ID:1418630
 [1];  [2];  [3]
  1. Tulane Univ., New Orleans, LA (United States)
  2. Sorbonne Univ., Paris (France)
  3. Univ. of Utah, Salt Lake City, UT (United States)

This paper presents a novel approach to visualize the uncertainty in graph-based segmentations of scalar data. Segmentation of 2D scalar data has wide application in a variety of scientific and medical domains. Typically, a segmentation is presented as a single unambiguous boundary although the solution is often uncertain due to noise or blur in the underlying data as well as imprecision in user input. Our approach provides insight into this uncertainty by computing the “min-path stability”, a scalar measure analyzing the stability of the segmentation given a set of input constraints. Our approach is efficient, easy to compute, and can be generally applied to either graph cuts or live-wire (even partial) segmentations. In addition to its general applicability, our new approach to graph cuts uncertainty visualization improves on the time complexity of the current state-oft-the-art with an additional fast approximate solution. We also introduce a novel query enabled by our approach which provides users with alternate segmentations by efficiently extracting local minima of the segmentation optimization. Finally, we evaluate our approach and demonstrate its utility on data from scientific and medical applications.

Research Organization:
Univ. of Utah, Salt Lake City, UT (United States)
Sponsoring Organization:
National Science Foundation (NSF); USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
NA0002375; SC0007446
OSTI ID:
1418630
Alternate ID(s):
OSTI ID: 1756071
Journal Information:
Computer Graphics Forum, Vol. 36, Issue 3; ISSN 0167-7055
Publisher:
WileyCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 5 works
Citation information provided by
Web of Science

References (27)

Minimum s - t Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time journal February 1983
Gigapixel surface imaging of radical prostatectomy specimens for comprehensive detection of cancer-positive surgical margins using structured illumination microscopy journal June 2016
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision journal September 2004
Maximum Flow in Planar Networks journal May 1979
CandidTree: Visualizing Structural Uncertainty in Similar Hierarchies journal September 2007
Lazy snapping journal August 2004
A note on two problems in connexion with graphs journal December 1959
Vessel architectural imaging identifies cancer patient responders to anti-angiogenic therapy journal August 2013
Random Walks for Image Segmentation journal November 2006
Panorama weaving: fast and flexible seam processing journal July 2012
Fast approximate energy minimization via graph cuts journal January 2001
Diverse M-Best Solutions in Markov Random Fields book January 2012
3D Variational Brain Tumor Segmentation using a High Dimensional Feature Set conference October 2007
Automatic Heart Isolation for CT Coronary Visualization Using Graph-Cuts conference January 2006
Level-set evolution with region competition: automatic 3-D segmentation of brain tumors conference January 2002
Interactive seismic interpretation with piecewise global energy minimization conference March 2011
Sketch-Based Editing Tools for Tumour Segmentation in 3D Medical Images: Sketch-Based Editing Tools for Tumor Segmentation journal August 2013
Interactive graph cut segmentation of touching neuronal structures from electron micrographs
  • Jagadeesh, Vignesh; Manjunath, B. S.
  • 2010 17th IEEE International Conference on Image Processing (ICIP 2010), 2010 IEEE International Conference on Image Processing https://doi.org/10.1109/ICIP.2010.5652042
conference September 2010
A novel nested graph cuts method for segmenting human lymph nodes in 3D high frequency ultrasound images
  • Kuo, Jen-wei; Mamou, Jonathan; Wang, Yao
  • 2015 IEEE 12th International Symposium on Biomedical Imaging (ISBI 2015), 2015 IEEE 12th International Symposium on Biomedical Imaging (ISBI) https://doi.org/10.1109/ISBI.2015.7163890
conference April 2015
Probabilistic Marching Cubes journal June 2011
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm conference October 2007
Seeded watershed cut uncertainty estimators for guided interactive segmentation conference June 2012
ProbExplorer: Uncertainty-guided Exploration and Editing of Probabilistic Medical Image Segmentation journal June 2010
Survey over image thresholding techniques and quantitative performance evaluation journal January 2004
Efficient planar graph cuts with applications in Computer Vision
  • Schmidt, Frank R.; Toppe, Eno; Cremers, Daniel
  • 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops), 2009 IEEE Conference on Computer Vision and Pattern Recognition https://doi.org/10.1109/CVPR.2009.5206863
conference June 2009
Revisiting uncertainty in graph cut solutions conference June 2012
Interactive grain image segmentation using graph cut algorithms conference February 2013

Figures / Tables (15)