Sparse coding has received an increasing amount of interest in recent years. It finds a basis set that captures high-level semantics in the data and learns sparse coordinates in terms of the basis set. However, most of the existing approaches fail to consider the geometrical structure of the data space. Recently, a graph regularized sparse coding (GraphSC) is proposed to learn the sparse repres...

Sparse coding provides a class of algorithms for finding succinct representations of stimuli; given only unlabeled input data, it discovers basis functions that capture higher-level features in the data. However, finding sparse codes remains a very difficult computational problem. In this paper, we present efficient sparse coding algorithms that are based on iteratively solving two convex optim...

Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that promotes sparsity. We show how smoother priors can preserve the benefits of these sparse priors while adding stability to the Maximum A-Posteriori (MAP) estimate that makes it more useful for prediction problems. Addi...

This paper explores sparse coding of natural images in the highly overcomplete regime. We show that as the overcompleteness ratio approaches 10x, new types of dictionary elements emerge beyond the classical Gabor function shape obtained from complete or only modestly overcomplete sparse coding. These more diverse dictionaries allow images to be approximated with lower L1 norm (for a fixed SNR),...

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics, etc. However, the conventional sparse coding algorithms and its manifold regularized variants (graph sparse coding and Laplacian sparse coding), learn the codebook and codes in a unsupervised manner and neglect the class informati...

We propose an image classification framework by leveraging the non-negative sparse coding, correlation constrained low rank and sparse matrix decomposition technique (CCLR-ScSPM). First, we propose a new non-negative sparse coding along with max pooling and spatial pyramid matching method (ScSPM) to extract local feature’s information in order to represent images, where non-negative sparse codi...

The sparse coding hypothesis has enjoyed much success in predicting response properties of simple cells in primary visual cortex (V1) based solely on the statistics of natural scenes. In typical sparse coding models, model neuron activities and receptive fields are optimized to accurately represent input stimuli using the least amount of neural activity. As these networks develop to represent a...

Drosophila melanogaster has been established as a model organism for investigating the fundamental principles of developmental gene interactions. The gene expression patterns of Drosophila melanogaster can be documented as digital images, which are annotated with anatomical ontology terms to facilitate pattern discovery and comparison. The automated annotation of gene expression pattern images ...

Recently, there has been considerable interest in employing unsupervised learning methods as feature extractors for supervised learning tasks such as classification. The literature shows that methods based on this approach have proved to be competitive with established state-of-the-art machine learning strategies. One important recent advance was the discovery by (Hinton, Osindero, & Teh, 2006)...

This short paper describes a simple coding technique, Sparse Sequential Dirichlet Coding, for multi-alphabet memoryless sources. It is appropriate in situations where only a small, unknown subset of the possible alphabet symbols can be expected to occur in any particular data sequence. We provide a competitive analysis which shows that the performance of Sparse Sequential Dirichlet Coding will ...