Sciweavers

154 search results - page 13 / 31
» Algorithms for Batch Matrix Factorization with Application t...
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
CVPR
2008
IEEE
14 years 10 months ago
Unsupervised estimation of segmentation quality using nonnegative factorization
We propose an unsupervised method for evaluating image segmentation. Common methods are typically based on evaluating smoothness within segments and contrast between them, and the...
Roman Sandler, Michael Lindenbaum
CVPR
2010
IEEE
13 years 5 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
ICML
2010
IEEE
13 years 9 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...