Label Set Perturbation for MRF based Neuroimaging Segmentation

被引:5
作者
Hower, Dylan [2 ]
Singh, Vikas [1 ,3 ]
Johnson, Sterling C. [1 ,3 ]
机构
[1] Univ Wisconsin Madison, Dept Biostat & Med Inform, Madison, WI 53706 USA
[2] Epic Syst Inc, Madison, WI USA
[3] Univ Wisconsin, Dept Med, Madison, WI 53706 USA
来源
2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV) | 2009年
关键词
MEASURING UNCERTAINTY; IMAGE SEGMENTATION; ALGORITHM;
D O I
10.1109/ICCV.2009.5459305
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph-cuts based algorithms are effective for a variety of segmentation tasks in computer vision. Ongoing research is focused toward making the algorithms even more general, as well as to better understand their behavior with respect to issues such as the choice of the weighting function and sensitivity to placement of seeds. In this paper, we investigate in the context of neuroimaging segmentation, the sensitivity/stability of the solution with respect to the input "labels" or "seeds". In particular, as a form of parameter learning, we are interested in the effect of allowing the given set of labels (and consequently, the response/ statistics of the weighting function) to vary for obtaining lower energy segmentation solutions. This perturbation leads to a "refined" label set (or parameters) better suited to the input image, yielding segmentations that are less sensitive to the set of labels or seeds provided. Our proposed algorithm (using Parametric Pseudoflow) yields improvements over graph-cuts based segmentation with a fixed set of labels. We present experiments on about 450 3-D brain image volumes demonstrating the efficacy of the algorithm.
引用
收藏
页码:849 / 856
页数:8
相关论文
共 26 条
[1]  
[Anonymous], J MAGNETIC RESONANCE
[2]  
[Anonymous], 2001, Interactive Graph Cuts, DOI DOI 10.1109/ICCV.2001.937505
[3]  
[Anonymous], 2001, P INT C COMP VIS
[4]   Unified segmentation [J].
Ashburner, J ;
Friston, KJ .
NEUROIMAGE, 2005, 26 (03) :839-851
[5]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[6]   Cortical surface-based analysis - I. Segmentation and surface reconstruction [J].
Dale, AM ;
Fischl, B ;
Sereno, MI .
NEUROIMAGE, 1999, 9 (02) :179-194
[7]  
Grady L., 2008, P MED IM COMP COMP A
[8]   The pseudoflow algorithm: A new algorithm for the maximum-flow problem [J].
Hochbaum, Dorit S. .
OPERATIONS RESEARCH, 2008, 56 (04) :992-1009
[9]   Minimizing a convex cost closure set [J].
Hochbaum, DS ;
Queyranne, M .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) :192-207
[10]   An efficient algorithm for image segmentation, Markov random fields and related problems [J].
Hochbaum, DS .
JOURNAL OF THE ACM, 2001, 48 (04) :686-701