Sciweavers

12 search results - page 2 / 3
» Penalty Decomposition Methods for Rank Minimization
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
13 years 11 months 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
ICASSP
2010
IEEE
13 years 5 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
ICML
2004
IEEE
14 years 5 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
11 years 7 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
PAMI
2012
11 years 8 months ago
Simultaneous Video Stabilization and Moving Object Detection in Turbulence
Turbulence mitigation refers to the stabilization of videos with non-uniform deformations due to the influence of optical turbulence. Typical approaches for turbulence mitigation ...
Omar Oreifej, Xin Li, and Mubarak Shah