145 search results - page 13 / 29 » On Constrained Sparse Matrix Factorization |
SIAMMAX
2010
14 years 6 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a sparse non-negative image coding based on simulated annealing and matrix pseudo-inversion. We show that sparsity and non-negativity are both important to obtain part-...
128
click to vote
JMLR
2012
13 years 2 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
100
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...