Sciweavers

220 search results - page 6 / 44
» SMOS L1 algorithms
Sort
View
CVPR
2010
IEEE
14 years 7 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
NIPS
2008
14 years 11 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
90
Voted
ICASSP
2010
IEEE
14 years 9 months ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
82
Voted
ICASSP
2010
IEEE
14 years 8 months ago
L1 regularized room modeling with compact microphone arrays
Acoustic room modeling has several applications. Recent results using large microphone arrays show good performance, and are helpful in many applications. For example, when design...
Demba E. Ba, Flavio Ribeiro, Cha Zhang, Dinei A. F...
88
Voted
AAAI
2007
14 years 12 months ago
Learning Graphical Model Structure Using L1-Regularization Paths
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
Mark W. Schmidt, Alexandru Niculescu-Mizil, Kevin ...