Sciweavers

19 search results - page 2 / 4
» Robust tensor factorization using R1 norm
Sort
View
IJON
2010
150views more  IJON 2010»
13 years 3 months ago
Linear discriminant analysis using rotational invariant L1 norm
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition....
Xi Li, Weiming Hu, Hanzi Wang, Zhongfei Zhang
ICCV
2009
IEEE
14 years 10 months ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
CVPR
2010
IEEE
13 years 3 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
JMLR
2012
11 years 7 months ago
Sparse Higher-Order Principal Components Analysis
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...
Genevera Allen
ICA
2007
Springer
13 years 11 months ago
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) ...
Andrzej Cichocki, Rafal Zdunek, Shun-ichi Amari