Sciweavers

203 search results - page 27 / 41
» Inference for Order Reduction in Markov Random Fields
Sort
View
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
14 years 7 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
ICIP
2008
IEEE
14 years 9 months ago
Efficient BP stereo with automatic paramemeter estimation
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
Shafik Huq, Andreas Koschan, Besma R. Abidi, Mongi...
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
ICML
2005
IEEE
14 years 8 months ago
Variational Bayesian image modelling
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
Li Cheng, Feng Jiao, Dale Schuurmans, Shaojun Wang
ECCV
2010
Springer
13 years 10 months ago
Automatic Learning of Background Semantics in Generic Surveilled Scenes
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analy...
Carles Fernández, Jordi Gonzàlez, Xavier Roca