Sciweavers

12 search results - page 2 / 3
» Incremental Singular Value Decomposition of Uncertain Data w...
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 4 days ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
AMDO
2004
Springer
13 years 9 months ago
On-the-Fly Training
Abstract. A new algorithm for the incremental learning and non-intrusive tracking of the appearance of a previously non-seen face is presented. The computation is done in a causal ...
Javier Melenchón, Lourdes Meler, Ignasi Iri...
AAAI
2011
12 years 5 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
14 years 6 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
TSP
2008
178views more  TSP 2008»
13 years 5 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen