1994
DOI: 10.1109/83.277898
|View full text |Cite
|
Sign up to set email alerts
|

A multiscale random field model for Bayesian image segmentation

Abstract: Many approaches to Bayesian image segmentation have used maximum a posteriori (MAP) estimation in conjunction with Markov random fields (MRF). Although this approach performs well, it has a number of disadvantages. In particular, exact MAP estimates cannot be computed, approximate MAP estimates are computationally expensive to compute, and unsupervised parameter estimation of the MRF is difficult. The authors propose a new approach to Bayesian image segmentation that directly addresses these problems. The new … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

7
417
0
7

Year Published

2004
2004
2014
2014

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 526 publications
(431 citation statements)
references
References 45 publications
7
417
0
7
Order By: Relevance
“…To address the problems associated with nonhierarchical models, multiscale MRF models were formulated and have been extensively discussed in the image processing literature (Bouman and Shapiro, 1994;Kato et al 1996Kato et al , 1999Laferté et al, 2000;Liang and Tjahjadi, 2006;Mignotte et al, 2000;Wilson and Li, 2003). In those hierarchical MRF models, there is a series of random fields at a range of scales or resolutions, and the random field at each scale depends only on the next coarser random field above it.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To address the problems associated with nonhierarchical models, multiscale MRF models were formulated and have been extensively discussed in the image processing literature (Bouman and Shapiro, 1994;Kato et al 1996Kato et al , 1999Laferté et al, 2000;Liang and Tjahjadi, 2006;Mignotte et al, 2000;Wilson and Li, 2003). In those hierarchical MRF models, there is a series of random fields at a range of scales or resolutions, and the random field at each scale depends only on the next coarser random field above it.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, approximation techniques such as the mean field approximation (Celeux et al, 2003;Tonazzini et al, 2006;Zhang, 1992) and pseudo-likelihood method (Chalmond, 1989;Zhang et al, 1994) are used. The EM algorithm has been extended for parameter estimation on a quadtree (Bouman and Shapiro, 1994;Laferté et al, 2000). …”
Section: Related Workmentioning
confidence: 99%
“…A particular form of such models is a causal tree in which each node has only one parent. These models have been used with some success in various segmentation and labeling problems (Bouman and Shapiro, 1994) (Cheng and Bouman, 2001) (Feng et al, 2002) (Wilson and Li, 2003) (Kumar and Hebert, 2003c).…”
Section: Causal Modelsmentioning
confidence: 99%
“…In the graphical-models literature, the bestknown inference algorithm for TSBNs is Pearl's message passing scheme [5,18]; similar algorithms have been proposed in the image-processing literature [8,14,15]. Essentially, all these algorithms perform belief propagation up and down the tree, where after a number of training cycles, we obtain all the tree parameters necessary to compute P (X|Y ).…”
Section: Tree-structured Belief Networkmentioning
confidence: 99%
“…The most commonly used MRF model is the tree-structured belief network (TSBN) [8,9,[14][15][16]. A TSBN is a generative model comprising hidden, X, and observable, Y , random variables (RVs) organized in a tree structure.…”
Section: Tree-structured Belief Networkmentioning
confidence: 99%