A probabilistic segmentation scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5096 LNCS, Issue , 2008, Pages 183-192

  Schlesinger, Dmitrij ^a   Flach, Boris ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING TASKS; OBJECT CHARACTERISTICS; RECOGNITION TASKS; SEGMENTATION SCHEMES;

FEATURE EXTRACTION; PARAMETER ESTIMATION; PATTERN RECOGNITION;

PROBABILITY;

EID: 54249134509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69321-5_19     Document Type: Conference Paper

References (11)

1. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. In: Proc. of the 7. Intl. Conf. on Computer Vision, vol. 1, pp. 377-384 (1999)
2. Cremers, D.: A multiphase level set framework for variational motion segmentation. In: Grifin, L.D., Lillholm, M. (eds.) Scale-Space Methods in Computer Vision (Isle of Skye), vol. 2695, pp. 599-614. Springer, Heidelberg (2003)
3. Cremers, D., Rousson, M., Deriche, R.: A review of statistical approaches to level set segmentation: integrating color, texture, motion and shape. International Journal of Computer Vision 72(2), 195-215 (2007)
4. Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence
5. 6(6), 721-741 (1984)
6. Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 28(10), 1568-1583 (2006)
7. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2350, pp. 65-81. Springer, Heidelberg (2002)
8. Micusik, B., Pajdla, T.: Multi-label image segmentation via max-sum solver. In: Proc. of Computer Vision and Pattern Recognition (2007)
9. Schlesinger, D., Flach, B.: Transforming an arbitrary minsum problem into a binary one, Tech. report, Dresden University of Technology, TUD-FI06-01 (April 2005), http://www.bv.inf.tu-dresden.de/flds24/tr kto2.pdf
10. Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Tree-reweighted belief propagation algorithms and approximate ML estimation via pseudo-moment matching. In: Workshop on Artificial Intelligence and Statistics (January 2003)
11. Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory 51(7), 2313-2335 (2005)