Augmented tree partitioning for interactive image segmentation

Proceedings - International Conference on Image Processing, ICIP

Volumn , Issue , 2008, Pages 2292-2295

  Jia, Yangqing ^a   Wang, Jingdong ^b   Zhang, Changshui ^a   Hua, Xian Sheng ^b  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

Augmented tree; Dynamic programming; Image segmentation

Indexed keywords

AUGMENTED TREE; EXISTING METHOD; GRAPH STRUCTURES; GRAPH-BASED METHODS; INTERACTIVE IMAGE SEGMENTATION; MINIMUM SPANNING TREES; MODEL IMAGES; OPTIMIZATION PROBLEMS; PARTITIONING PROBLEM; SEGMENTATION RESULTS; SEMI-SUPERVISED; TREE PARTITIONING; TREE-BASED STRUCTURES;

DIGITAL IMAGE STORAGE; DYNAMIC PROGRAMMING; GRAPH THEORY; GRAPHIC METHODS; IMAGING SYSTEMS; SYSTEMS ENGINEERING;

IMAGE SEGMENTATION;

EID: 69949161997     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2008.4712249     Document Type: Conference Paper

References (12)

1. Yuri Boykov and Marie-Pierre Jolly, "Graph Cuts and Efficient N-D Image Segmentation," Int. J. Comput. Vision, vol. 70, no. 2, pp. 109-131, 2006.
2. Olivier Juan and Yuri Boykov, "Active Graph Cuts," in CVPR, 2006, pp. 1023-1029.
3. Pushmeet Kohli and Philip H. S. Torr, "Effciently Solving Dynamic Markov Random Fields Using Graph Cuts," in ICCV, 2005, pp. 922-929.
4. Adrian Barbu and Song-Chun Zhu, "Generalizing Swendsen-Wang to Sampling Arbitrary Posterior Probabilities," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 8, pp. 1239-1253, 2005.
5. Noam Shental, Assaf Zomet, Tomer Hertz, and Yair Weiss, "Learning and Inferring Image Segmentations using the GBP Typical Cut Algorithm," in ICCV, 2003, pp. 1243-1250.
6. Yin Li, Jian Sun, Chi-Keung Tang, and Heung-Yeung Shum, "Lazy Snapping," in ACM SIGGRAPH, 2004, pp. 303-308.
7. C. Rother, V. Kolmogorov, and A. Blake, "GrabCut": Inter-active Foreground Extraction Using Iterated Graph Cuts," in Proceedings of ACM SIGGRAPH., 2004, pp. 309-314.
8. Pedro F. Felzenszwalb and Daniel P. Huttenlocher, "Efficient Graph-Based Image Segmentation," Int. J. Comput. Vision, vol. 59, no. 2, pp. 167-181, 2004.
9. Olga Veksler, "Stereo Correspondence by Dynamic Programming on a Tree," in CVPR, 2005, pp. 384-390.
10. Vladimir Kolmogorov, "Convergent Tree-Reweighted Message Passing for Energy Minimization," in AISTATS, 2005.
11. L. Vincent and P. Soille, "Watersheds in Digital Spaces: an Efficient Algorithm Based on Immersion Simulations," IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, no. 6, pp. 583-598, June 1991.
12. Leo Grady, "Random Walks for Image Segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 11, pp. 1768-1783, 2006.