Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 731-738

  Couprie, Camille ^a   Grady, Leo ^b   Najman, Laurent ^a   Talbot, Hugues ^a  

^a UNIVERSITÉ PARIS EST   (France)

^b SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE WEIGHTS; ENERGY FUNCTIONS; ENERGY MINIMIZATION; GENERAL MODEL; GRAPH CUT; NEIGHBORING NODES; NEW PARAMETERS; RANDOM WALKERS; SEGMENTATION ALGORITHMS; SHORTEST PATH; WATER-SHED ALGORITHM; WATERSHED SEGMENTATION; WEIGHTED GRAPH;

ALGORITHMS; COMPUTER VISION; DIGITAL IMAGE STORAGE; EDGE DETECTION; GRAPH THEORY; LANDFORMS; OPTIMIZATION; PARAMETER ESTIMATION; WATERSHEDS;

IMAGE SEGMENTATION;

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

References (37)

1. K. Alahari, P. Kohli, and P. Torr. Reduce, reuse & recycle: Efficiently solving multilabel MRFs. In CVPR, 2008.
2. C. Allène, J.-Y. Audibert, M. Couprie, J. Cousty, and R. Keriven. Some links between min cuts, optimal spanning forests and watersheds. In ISMM'07, volume 2, pages 253-264. INPE, 2007.
3. C. V. Alvino, G. B. Unal, G. Slabaugh, B. Peny, and T. Fang. Efficient segmentation based on Eikonal and diffusion equations. IJCM, 84(9):1309-1324, 2007. (Pubitemid 47346890)
4. B. Appleton and H. Talbot. Globally optimal surfaces by continuous maximal flows. PAMI, 28(1):106-118, 2006.
5. X. Bai and G. Sapiro. A geodesic framework for fast interactive image and video segmentation and matting. In ICCV, 2007.
6. S. Beucher and F. Meyer. The morphological approach to segmentation: The watershed transformation. In E. R. Dougherty, editor, Mathematical Morphology in Image Processing, pages 433-481. CRC, 1993.
7. A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr. Interactive image segmentation using an adaptive GMMRF model. In ECCV, LNCS 3021, pages 428-441, 2004.
8. A. Blake and A. Zisserman. Visual Reconstruction. MIT Press, 1987.
9. Y. Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In ICCV, pages 105-112, 2001.
10. Y. Boykov and V. Kolmogorov. Computing geodesics and minimal surfaces via graph cuts. In ICCV, volume 1, 2003.
11. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM, 47(6):1028-1047, 2000.
12. L. D. Cohen and R. Kimmel. Global minimum for active contour models: A minimal path approach. IJCV, 24(1):57-78, 1997.
13. R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. W. Zucker. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. PNAS, 102(21):7426-7431, 2005.
14. J. Cousty, G. Bertrand, L. Najman, and M. Couprie. Watershed cuts. In ISMM '07, volume 1, pages 301-312. INPE, 2007.
15. J. Cousty, G. Bertrand, L. Najman, and M. Couprie. Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle. pages 1362-1374, August 2008.
16. A. Criminisi, T. Sharp, and A. Blake. GeoS: Geodesic image segmentation. In ECCV, pages 99-112, 2008.
17. O. Duchenne, J. Audibert, R. Keriven, J. Ponce, and F. Ségonne. Segmentation by transduction. In CVPR, 2008.
18. A. X. Falcão, R. A. Lotufo, and G. Araujo. The image foresting transformation. PAMI, 26(1):19-29, 2004.
19. A. X. Falcão, J. K. Udupa, S. Samarasekera, S. Sharma, B. H. Elliot, and R. de A. Lotufo. User-steered image segmentation paradigms: Live wire and live lane. GMIP, 60(4):233-260, 1998.
20. S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. PAMI, 6(6):721-741, 1984.
21. L. Grady. Computing exact discrete minimal surfaces: Extending and solving the shortest path problem in 3D with application to segmentation. In CVPR, volume 1, pages 69-78, 2006.
22. L. Grady. Random walks for image segmentation. PAMI, 28(11):1768-1783, 2006.
23. L. Grady and A. K. Sinop. Fast approximate random walker segmentation using eigenvector precomputation. In CVPR, 2008.
24. P. Kohli, M. P. Kumar, and P. Torr. P3 & beyond: Solving energies with higher order cliques. In CVPR, 2007.
25. V. S. Lempitsky, S. Roth, and C. Rother. Fusionflow: Discrete-continuous optimization for optical flow estimation. In CVPR, 2008.
26. A. Levin, D. Lischinski, and Y. Weiss. A closed form solution to natural image matting. PAMI, 30(2):228-242, 2008.
27. Y. Li, J. Sun, C. Tang, and H. Shum. Lazy snapping. In SIGGRAPH, pages 303-308, 2004.
28. E. Mortensen and W. Barrett. Interactive segmentation with intelligent scissors. GMIP, 60(5):349-384, 1998.
29. D. Mumford and J. Shah. Optimal approximations by piecewise smooth functions and associated variational problems. CPAM, 42:577-685, 1989.
30. L. Najman and M. Schmitt. Geodesic Saliency of Watershed Contours and Hierarchical Segmentation. PAMI, 18(12):1163-1173, 1996.
31. C. Rother, V. Kolmogorov, and A. Blake. "GrabCut" - Interactive foreground extraction using iterated graph cuts. In SIGGRAPH, pages 309-314, 2004.
32. R. Shen, I. Cheng, X. Li, and A. Basu. Stereo matching using random walks. In ICPR, 2008.
33. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8):888-905, 2000.
34. A. K. Sinop and L. Grady. A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In ICCV, 2007.
35. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI, 30(6):1068-1080, 2008.
36. M. Unger, T. Pock, D. Cremers, and H. Bischof. TVSeg - Interactive total variation based image segmentation. In BMVC, 2008.
37. S. Vicente, V. Kolmogorov, and C. Rother. Graph cut based image segmentation with connectivity priors. In CVPR, 2008.