Sciweavers

791 search results - page 90 / 159
» Non-Linear Dimensionality Reduction
Sort
View
158
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Online performance guarantees for sparse recovery
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
Raja Giryes, Volkan Cevher
ICCV
2011
IEEE
14 years 4 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
CVPR
2008
IEEE
16 years 6 months ago
Robust tensor factorization using R1 norm
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
Heng Huang, Chris H. Q. Ding
ICML
2009
IEEE
16 years 5 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
ICML
2006
IEEE
16 years 5 months ago
Local distance preservation in the GP-LVM through back constraints
The Gaussian process latent variable model (GP-LVM) is a generative approach to nonlinear low dimensional embedding, that provides a smooth probabilistic mapping from latent to da...
Joaquin Quiñonero Candela, Neil D. Lawrence