190 search results - page 8 / 38 » Markov Random Fields with Efficient Approximations |
3DOR
2008
13 years 11 months ago
2008
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Partially occluded faces are common in many applications
of face recognition. While algorithms based on sparse
representation have demonstrated promising results, they
achieve t...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
PAMI
2010
13 years 7 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...