Sciweavers

495 search results - page 21 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
CVPR
2005
IEEE
16 years 2 days ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja
CISS
2010
IEEE
14 years 1 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 4 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
CVPR
2011
IEEE
14 years 1 months ago
Robust Tracking Using Local Sparse Appearance Model and K-Selection
Online learned tracking is widely used for it’s adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of erro...
Baiyang Liu, junzhou Huang, Casimir Kulikowski, Li...
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
15 years 1 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...