Sciweavers

186 search results - page 13 / 38
» Fast Computation of Sparse Datacubes
Sort
View
JCNS
2010
90views more  JCNS 2010»
13 years 3 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
CVPR
2010
IEEE
13 years 8 months ago
Robust RVM regression using sparse outlier model
Kernel regression techniques such as Relevance Vector Machine (RVM) regression, Support Vector Regression and Gaussian processes are widely used for solving many computer vision p...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
ICCV
2003
IEEE
14 years 1 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
14 years 5 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
CVPR
2010
IEEE
14 years 4 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang