Sciweavers

779 search results - page 88 / 156
» Multi-Instance Dimensionality Reduction
Sort
View
NIPS
2007
13 years 9 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
PR
2007
145views more  PR 2007»
13 years 7 months ago
Face recognition using a kernel fractional-step discriminant analysis algorithm
Feature extraction is among the most important problems in face recognition systems. In this paper, we propose an enhanced kernel discriminant analysis (KDA) algorithm called kern...
Guang Dai, Dit-Yan Yeung, Yuntao Qian
ISVC
2010
Springer
13 years 6 months ago
Combining Automated and Interactive Visual Analysis of Biomechanical Motion Data
Abstract. We present a framework for combining automated and interactive visual analysis techniques for use on high-resolution biomechanical data. Analyzing the complex 3D motion o...
Scott Spurlock, Remco Chang, Xiaoyu Wang, George A...
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ICASSP
2011
IEEE
12 years 11 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