Sciweavers

367 search results - page 33 / 74
» Sketch-based tree modeling using Markov random field
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
ICIP
2000
IEEE
14 years 9 months ago
Motion Estimation Using Adaptive Blocksize Observation Model and Efficient Multiscale Regularization
Bayesian motion estimation requires two pdf models: observation model and motion field (prior) model. The optimization process for this method uses sequential approach, e.g. simul...
Stephanus Suryadarma Tandjung, Teddy Surya Gunawan...
EMMCVPR
2005
Springer
14 years 1 months ago
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...
Sanjiv Kumar, Jonas August, Martial Hebert
WIDM
2004
ACM
14 years 1 months ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
CVPR
2000
IEEE
14 years 9 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu