Sciweavers

63 search results - page 7 / 13
» Computational aspects of Bayesian partition models
Sort
View
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
ICCV
2007
IEEE
14 years 9 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
TMI
2010
175views more  TMI 2010»
13 years 2 months ago
Spatially Adaptive Mixture Modeling for Analysis of fMRI Time Series
Within-subject analysis in fMRI essentially addresses two problems, the detection of brain regions eliciting evoked activity and the estimation of the underlying dynamics. In [1, 2...
Thomas Vincent, Laurent Risser, Philippe Ciuciu
CVPR
2005
IEEE
14 years 9 months ago
OBJ CUT
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICML
2009
IEEE
14 years 8 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...