Increased discrimination in level set methods with embedded conditional random fields

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 328-335

  Cobzas, Dana ^b   Schmidt, Mark ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; IMAGE SEGMENTATION; MEDICAL IMAGING; RANDOM PROCESSES;

CONDITIONAL RANDOM FIELD; CONTINUOUS LEVELS; ENERGY FUNCTIONS; LEVEL SET; LEVEL SET METHOD; LOCAL POTENTIALS; POTENTIAL FUNCTION; SHAPE PRIORS;

NUMERICAL METHODS;

EID: 70450178477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206812     Document Type: Conference Paper

References (22)

1. J. Besag. Spatial interaction and the statistical analysis of lattice systems. RoyalStat, B-36(2): 192-236, 1974.
2. Y. Boykov and V. Kolmogorov. Computing geodesics and minimal surfaces via graph cuts. In ICCV, pages 26-33, 2003.
3. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in computer vision. IEE PAMI, 26(9): 1124-1137, 2004.
4. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. Data Min. Knowl. Discov., 2(2): 121- 167, 1998.
5. R. H. Byrd, P. Lu, J. Nocedal, and C. Zhu. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput., 16(5): 1190-1208, 1995.
6. T. Chan and L. Vese. Active contours without edges. IEEE Trans. Image Processing, 10(2): 266-277, 2001.
7. D. Cremers, M. Rousson, and R. Deriche. A review of statistical approaches to level set segmentation: integrating color, texture, motion and shape. IJCV, 72(2), April 2007.
8. M. Everingham, L. Van Gool, C. K. I.Williams, J.Winn, and A. Zisserman. The PASCAL Visual Object Classes Challenge (VOC2007).
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. In EuroCOLT, pages 23-37, 1995.
10. L. Grady and C. Alvino. Reformulating and optimizing the mumford-shah functional on a graph - a faster, lower energy solution. In ECCV, pages 248-261, 2008.
11. R. Huang, V. Pavlovic, and D. N. Metaxas. A graphical model framework for coupling mrfs and deformable models. In CVPR, pages 739-746, 2004.
12. V. Kolmogorov and Y. Boykov. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In ICCV, pages 564-571, 2005.
13. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? PAMI, 26(2): 147-159, 2004.
14. M. P. Kumar, P. H. S. Torr, and A. Zisserman. Obj cut. In CVPR, pages 18-25, 2005.
15. S. Kumar and M. Hebert. Discriminative random fields. Int. J. Comput. Vision, 68(2): 179-201, 2006.
16. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, pages 282-289, 2001.
17. N. Paragios and R. Deriche. Geodesic active regions: A new paradigm to deal with frame partition problems in computer vision. Visual Communication and Image Representation, 13: 249-268, 2002.
18. C. Rother, V. Kolmogorov, and A. Blake. "grabcut": interactive foreground extraction using iterated graph cuts. ACM Trans. Graph., 23(3): 309-314, 2004.
19. M. Rousson, T. Brox, and R. Deriche. Active unsupervised texture segmentation on a diffusion based feature space. In CVPR, 2003.
20. M. Rousson and N. Paragios. Shape priors for level set representations. In ECCV (2), pages 78-92, 2002.
21. B. Taskar, V. Chatalbashev, and D. Koller. Learning associative Markov networks. In ICML, page 102, 2004.
22. G. Tsechpenakis and D. Metaxas. Crf-driven implicit deformable model. In CVPR, 2007.