Label set perturbation for MRF based neuroimaging segmentation

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 849-856

  Hower, Dylan ^a   Singh, Vikas ^b   Johnson, Sterling C ^b  

^a EPIC SYSTEMS CORPORATION   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRAIN IMAGES; INPUT IMAGE; LOWER ENERGIES; NEURO-IMAGING; PARAMETER LEARNING; WEIGHTING FUNCTIONS;

ALGORITHMS; COMPUTER VISION; SEED; THREE DIMENSIONAL;

LABELS;

EID: 77953213973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459305     Document Type: Conference Paper

References (27)

1. J. Ashburner and K. Friston. Unified segmentation. Neuroimage, 26(3):839-851, 2005.
2. Y. Boykov and M. P. Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. Proc. of Intl. Conf. on Computer Vis., 1:105, 2001.
3. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell., 23(11):1222-1239, 2001.
4. A. Dale, B. Fischl, and M. Sereno. Cortical Surface-Based Analysis I. Segmentation and Surface Reconstruction. Neuroimage, 9(2):179-194, 1999.
5. L. Grady and M. P. Jolly. Weights and topology: A study of the effects of graph construction on 3D image segmentation. In Proc. of Med. Im. Comp. & Comp. Assisted Inter., 2008.
6. D. Hochbaum. An efficient algorithm for image segmentation, markov random fields and related problems. J. of the ACM, 48(4):686-701, 2001.
7. D. Hochbaum. The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research, 56(4):992-1009, 2008.
8. D. Hochbaum and M. Queyranne. Minimizing a convex cost closure set. SIAM J. Discr. Math., 16(2):192-207, 2003.
9. H. Ishikawa and D. Geiger. Occlusions, discontinuities, and epipolar lines in stereo. Lecture Notes in Computer Science, 1406:232-248, 1998.
10. C. Jack, M. Bernstein, N. Fox, P. Thompson, et al. The Alzheimer's disease neuroimaging initiative (ADNI): MRI methods. J. of Magnetic Resonance Imaging, 2008.
11. O. Juan and Y. Boykov. Active graph cuts. In Proc. of Conf. on Computer Vis. and Pattern Recog., 2006.
12. F. Klauschen, A. Goldman, V. Barra, A. Meyer-Lindberg, et al. Evaluation of automated brain MR image segmentation & volumetry methods. Human Brain Mapping, 2008.
13. P. Kohli and P. Torr. Measuring Uncertainty in Graph Cut Solutions-Efficiently Computing Min-marginal Energies Using Dynamic Graph Cuts. Lecture Notes in Computer Science, 3952:30-42, 2006.
14. P. Kohli and P. Torr. Measuring uncertainty in graph cut solutions. Comput. Vis. Image Under., 112(1):30-38, 2008.
15. V. Kolmogorov, Y. Boykov, and C. Rother. Applications of parametric maxflow in computer vision. In Proc. of Intl. Conf. on Computer Vis., pages 1-8, 2007.
16. S. Kumar, J. August, and M. Hebert. Exploiting Inference for approximate parameter learning in discriminative fields. In Proc. of Conf. on Energy Minim. Met. in Computer Vis. and Pattern Recog., 2005.
17. V. Lempitsky, A. Blake, and C. Rother. Image Segmentation by Branch-and-Mincut. Lecture Notes in Computer Science, 5305:15-29, 2008.
18. D. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and application to evaluating segmentation algorithms & measuring ecological statistics. In Proc. of Intl. Conf. on Computer Vis., 2001.
19. B. Peng and O. Veksler. Parameter selection for graph cut based image segmentation. In Proc. of British Machine Vis. Conf., 2008.
20. D. Scharstein and C. Pal. Learning Conditional Random Fields for stereo. In Proc. of Conf. on Computer Vis. and Pattern Recog., 2007.
21. A. Sinop and L. Grady. A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In Proc. of Intl. Conf. on Computer Vis., 2007.
22. S. Smith, M. Jenkinson, M. Woolrich, et al. Advances in functional and structural MR image analysis and implementation as FSL. Neuroimage, 23:208-219, 2004.
23. M. F. Tappen. Utilizing Variational Optimization to learn markov random fields. In Proc. of Conf. on Computer Vis. and Pattern Recog., 2007.
24. M. F. Tappen, C. Liu, E. Adelson, and W. Freeman. Learning Gaussian Conditional Fields for low-level vision. In Proc. of Conf. on Computer Vis. and Pattern Recog., 2007.
25. S. S. Vempala. The Random Projection Method. American Mathematical Society, 2004.
26. C. Yanover and Y. Weiss. Finding the M most probable configurations in arbitrary graphical models. In Advances in Neural Information Processing Systems, 2003.
27. R. Zabih and V. Kolmogorov. Spatially coherent clustering using graph cuts. In Proc. of Conf. on Computer Vis. and Pattern Recog., 2004.