Graph cut segmentation with a global constraint: Recovering region distribution via a bound of the bhattacharyya measure

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 3288-3295

  Ayed, Ismail Ben ^a,b   Chen, Hua Mei ^b   Punithakumar, Kumaradevan ^a   Ross, Ian ^b   Li, Shuo ^a,b  

^a GE HEALTHCARE   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY FUNCTIONS; BHATTACHARYYA MEASURES; EFFICIENT ALGORITHM; GLOBAL CONSTRAINTS; GLOBALOPTIMUM; GRAPH CUT; IMAGE DISTRIBUTIONS; MICROSOFT; OBJECT TRACKING; OPTIMALITY; QUANTITATIVE EVALUATION; SEGMENTATION ACCURACY; STATE-OF-THE-ART METHODS; STATISTICAL INTERPRETATION; UPPER BOUND;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; COMPUTER VISION;

IMAGE SEGMENTATION;

EID: 77955997380     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540045     Document Type: Conference Paper

References (23)

1. C. Rother, V. Kolmogorov, T. Minka, and A. Blake, Cosegmentation of Image Pairs by Histogram Matching-Incorporating a Global Constraint into MRFs, CVPR, 2006.
2. I. Ben Ayed, S. Li, and I. Ross, A Statistical Overlap Prior for Variational Image Segmentation, Int. J. of Computer Vision, 85(1): 115-132, 2009.
3. T. Zhang and D. Freedman, Improving performance of distribution tracking through background mismatch, IEEE Trans. on Pattern Anal. and Machine Intell., 27(2):282-287, 2005.
4. D. Freedman and T. Zhang, Active contours for tracking distributions, IEEE Trans. on Image Processing, 13(4):518-526, 2004.
5. T. F. Chan, S. Esedoglu, and K. Ni, Histogram Based Segmentation Using Wasserstein Distances, SSVM 2007, pp. 697-708.
6. G. Aubert, M. Barlaud, O. Faugeras, and S. Jehan-Besson, Image Segmentation Using Active Contours: Calculus of Variations or Shape Gradients?, SIAM Applied Mathematics, 63(6): 2128-2154, 2003.
7. O. V. Michailovich, Y. Rathi, and A. Tannenbaum, Image Segmentation Using Active Contours Driven by the Bhattacharyya Gradient Flow, IEEE Trans. on Image Processing, 16(11):2787-2801, 2007.
8. D. Comaniciu, V. Ramesh, and P. Meer, Kernel-based object tracking, IEEE Trans. on Pattern Anal. and Machine Intell., 25(5):564-577, 2003.
9. V. Kolmogorov, Y. Boykov, and C. Rother, Applications of parametric maxflow in computer vision, ICCV 2007.
10. Y. Boykov and V. Kolmogorov, An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, IEEE Trans. on Pattern Anal. and Machine Intell., 26(9):1124-1137, 2004.
11. Y. Boykov, O. Veksler, and R. Zabih, Efficient Approximate Energy Minimization via Graph Cuts, IEEE Trans. on Pattern Anal. and Machine Intell., 20(12):1222-1239, 2001.
12. V. Kolmogorov and R. Zabih, What Energy Functions can be Minimized via Graph Cuts?, IEEE Trans. on Pattern Anal. and Machine Intell., 26(2):147-159, 2004.
13. D. P. Bertsekas, Nonlinear Programming, Athena Scientific, 2nd edition, 1999.
14. F. Aherne, N. Thacker, and P. Rockett, The Bhattacharyya metric as an absolute similarity measure for frequency coded data, Kybernetika, 32(4):1-7, 1997.
15. M. Narasimhan and J. Bilmes, A supermodular-submodular procedure with applications to discriminative structure learning, In UAI, July 2005.
16. Y. Boykov, and G. Funka-Lea, Graph Cuts and Efficient N-D Image Segmentation, Int. J. of Computer Vision, 70(2):109-131, 2006.
17. C. Rother, V. Kolmogorov, and A. Blake, Grabcut-interactive foreground extraction using iterated graph cuts, SIGGRAPH, ACM Trans. on Graphics, 2004.
18. X. Liu, O. Veksler, and J. Samarabandu, Graph Cut with Ordering Constraints on Labels and its Applications, CVPR, 2008.
19. J. Malcolm, Y. Rathi, and A. Tannenbaum, Multi-Object Tracking Through Clutter Using Graph Cuts, ICCV, 2007.
20. V. Lempitsky, S. Roth, and C. Rother, FusionFlow: Discrete-Continuous Optimization for Optical Flow Estimation, CVPR, 2008.
21. J. Kim, V. Kolmogorov, and R. Zabih, Visual Correspondence Using Energy Minimization and Mutual Information, ICCV, 2003.
22. Y. Boykov and V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, ICCV, 2003.
23. D. D. Lee and H.S. Seung, Algorithms for nonnegative matrix factorization, Advances in Neural Information Processing Systems (NIPS) 2002, 13: 556-562.