Sciweavers

98 search results - page 16 / 20
» Propagation Algorithms for Variational Bayesian Learning
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
MM
2005
ACM
134views Multimedia» more  MM 2005»
14 years 1 months ago
Graph based multi-modality learning
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...
Hanghang Tong, Jingrui He, Mingjing Li, Changshui ...
CVPR
2008
IEEE
14 years 9 months ago
Visual tracking via incremental Log-Euclidean Riemannian subspace learning
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...
ECCV
2008
Springer
14 years 9 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
NIPS
2004
13 years 9 months ago
Incremental Learning for Visual Tracking
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
Jongwoo Lim, David A. Ross, Ruei-Sung Lin, Ming-Hs...