Medical image segmentation via min s-t cuts with sides constraints

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Chen, Jiun Hung ^a   Shapiro, Linda G ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS; IMAGE SEGMENTATION; LINEAR PROGRAMMING; PATTERN RECOGNITION;

COMPUTER VISION APPLICATIONS; FOREGROUND/BACKGROUND SEGMENTATION; GRAPH CUT; LINEAR PROGRAMMING RELAXATION; NP-HARD; SIDE CONSTRAINTS;

MEDICAL IMAGE PROCESSING;

EID: 77957970478     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2008.4761572     Document Type: Conference Paper

References (16)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
2. A. M. Ali, A. A. Farag, and A. El-Baz. Graph cuts framework for kidney segmentation with prior shape constraints. In MICCAI'07.
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. Y. Y. Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In ICCV, pages 105-112, 2001.
5. M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman. The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results. http://www.pascalnetwork.org/challenges/VOC/voc2007/workshop/index.html.
6. D. Freedman and P. Drineas. Energy minimization via graph cuts: Settling what is possible. In CVPR, pages 939-946, 2005.
7. D. Freedman and T. Zhang. Interactive graph cut based segmentation with shape priors. In CVPR'05.
8. O. Juan and Y. Boykov. Active graph cuts. In CVPR, pages 1023-1029, 2006.
9. P. Kohli and P. H. S. Torr. Effciently solving dynamic markov random fields using graph cuts. In ICCV '05, pages 922-929, 2005.
10. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell., 26(2):147-159, 2004.
11. G. L. Nemhauser and L. A. Wolsey. Integer and combinatorial optimization. Wiley-Interscience, New York, NY, USA, 1988.
12. G. Slabaugh and G. Unal. Graph cuts segmentation using an elliptical shape prior. In ICIP, volume 2, pages 1222-1225, 2005.
13. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
14. N. Xu, N. Ahuja, and R. Bansal. Object segmentation using graph cuts based active contours. Comput. Vis. Image Underst., 107(3):210-224, 2007.
15. Y. B. Yuri Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. In EMMCVPR '01, pages 359-374, 2001.
16. Y. Zeng, D. Samaras, W. Chen, and Q. Peng. Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in n-d images. 2007.