Abstract
Compressive sensing is an emerging field predicated upon the fact that, if a signal has a sparse representation in 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 high accuracy. This paper is concerned with the dimensionality reduction problem based on the compressive assumptions. We propose novel unsupervised and semi-supervised dimensionality reduction algorithms by exploiting sparse data representations. The experiments show that the proposed approaches outperform state-of-the-art dimensionality reduction methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
