2008
DOI: 10.1007/978-3-540-69321-5_19
|View full text |Cite
|
Sign up to set email alerts
|

A Probabilistic Segmentation Scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…2D may require lots of iterations to converge. Alternatively, to recover a better shading, a segmentation should be introduced into the model, similar to [1]. Different objects in the image could then have different GMM models and shadings, and the sharp boundary would be ensured by the segmentation.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…2D may require lots of iterations to converge. Alternatively, to recover a better shading, a segmentation should be introduced into the model, similar to [1]. Different objects in the image could then have different GMM models and shadings, and the sharp boundary would be ensured by the segmentation.…”
Section: Discussionmentioning
confidence: 99%
“…K) and initial shading h = 0. The algorithm iteratively updates variables (α, π k , Σ k ), via (9), (10), (12), (13), and variables (h, µ) via solving linear system (11), (1). Each of the updates maximizes the objective E(h, θ, α) w.r.t.…”
Section: Optimizationmentioning
confidence: 99%
See 2 more Smart Citations
“…The number of segments and the numbers of Gaussians for each segment (typically from 2 to 4) as well as the parameters α and λ were estimated experimentally. The appearance model includes additional a-priori slowly varying shading fields for each segment (see [13] for details). These shadings were learned simultaneously withq in a fully unsupervised manner.…”
Section: Other Experimentsmentioning
confidence: 99%