Sciweavers

147 search results - page 7 / 30
» Very sparse random projections
Sort
View
CSDA
2008
108views more  CSDA 2008»
13 years 7 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
ICPR
2010
IEEE
14 years 15 days ago
On the Dimensionality Reduction for Sparse Representation Based Face Recognition
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
Lei Zhang, Meng Yang, Zhizhao Feng, David Zhang
SDM
2011
SIAM
370views Data Mining» more  SDM 2011»
12 years 10 months ago
Sparse Latent Semantic Analysis
Latent semantic analysis (LSA), as one of the most popular unsupervised dimension reduction tools, has a wide range of applications in text mining and information retrieval. The k...
Xi Chen, Yanjun Qi, Bing Bai, Qihang Lin, Jaime G....
CVPR
2008
IEEE
14 years 9 months ago
Simultaneous image transformation and sparse representation recovery
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
DAWAK
2000
Springer
14 years 2 days ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton