Sparse Embedding: A Framework for Sparsity Promoting Dimensionality Reduction

Hien V. Nguyen¹, Vishal M. Patel¹, Nasser M. Nasrabadi², and Rama Chellappa¹

¹University of Maryland, College Park, MD, USA

²U.S. Army Research Laboratory, Adelphi, MD, USA

Abstract. We introduce a novel framework, called sparse embedding (SE), for simultaneous dimensionality reduction and dictionary learning. We formulate an optimization problem for learning a transformation from the original signal domain to a lower-dimensional one in a way that preserves the sparse structure of data. We propose an efficient optimization algorithm and present its non-linear extension based on the kernel methods. One of the key features of our method is that it is computationally efficient as the learning is done in the lower-dimensional space and it discards the irrelevant part of the signal that derails the dictionary learning process. Various experiments show that our method is able to capture the meaningful structure of data and can perform significantly better than many competitive algorithms on signal recovery and object classification tasks.

LNCS 7577, p. 414 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012