Abstract
Compressive sensing is an emerging field predicated upon the fact that, if a signal has a sparse representationin some basis, then it can be almost exactly reconstructed from very few random measurements.Many signals and natural images, for example under the wavelet basis, have very sparse representations,thus those signals and images can be recovered from a small amount of measurements with very highaccuracy. This paper is concerned with the dimensionality reduction problem based on the compressiveassumptions. We propose novel unsupervised and semi-supervised dimensionality reduction algorithmsby exploiting sparse data representations. The experiments show that the proposed approaches outperformstate-of-the-art dimensionality reduction methods.
Original language | English |
---|---|
Pages (from-to) | 1163-1170 |
Number of pages | 8 |
Journal | Pattern Recognition Letters |
Volume | 33 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jul 2012 |