A Probabilistic Segmentation Scheme

Authors:
Dmitrij Schlesinger;Boris Flach
Affiliations:
Dresden University of Technology,;Dresden University of Technology,
Venue:
Proceedings of the 30th DAGM symposium on Pattern Recognition
Year:
2008

Citing 5
Cited 2

What Energy Functions Can Be Minimized via Graph Cuts?

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Convergent Tree-Reweighted Message Passing for Energy Minimization

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Review of Statistical Approaches to Level Set Segmentation: Integrating Color, Texture, Motion and Shape

International Journal of Computer Vision
A multiphase level set framework for motion segmentation

Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
A new class of upper bounds on the log partition function

IEEE Transactions on Information Theory

Combining Shape Priors and MRF-Segmentation

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Incremental learning in the energy minimisation framework for interactive segmentation

Proceedings of the 32nd DAGM conference on Pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a probabilistic segmentation scheme, which is widely applicable to some extend. Besides the segmentation itself our model incorporates object specific shading. Dependent upon application, the latter is interpreted either as a perturbation or as meaningful object characteristic. We discuss the recognition task for segmentation, learning tasks for parameter estimation as well as different formulations of shading estimation tasks.