Sparse coding represents a signal sparsely by using an overcomplete dictionary, and obtains promising performance in practical computer vision applications, especially for signal restoration tasks such as image denoising and image inpainting. In recent years, many discriminative sparse coding algorithms have been developed for classification problems, but they cannot naturally handle visual dat...

The issue of visual discomfort has long been restricting the develop‐ ment of advanced stereoscopic 3D video technology. Bolstered by the require‐ ment of highly comfortable three-dimensional (3D) content service, predicting the degree of visual comfort automatically with high accuracy has become a topic of intense study. This paper presents a novel visual comfort assessment (VCA) metric based ...

The Bag-of-visual-words (BOVW) model discards image spatial information, and the computing cost is expensive on spatial pyramid matching(SPM) model. Due to sparse coding approach exhibit super performance in information retrieval, hence, we propose a new sparse coding image retrieval algorithm. Using 2 l norm replace 0 l norm in SPM vector quantization. The local information was incorporated in...

BACKGROUND Ultrasound is considered a reliable, widely available, non-invasive, and inexpensive imaging technique for assessing and detecting the development phases of cancer; both in vivo and ex vivo, and for understanding the effects on cell cycle and viability after ultrasound treatment. METHODS Based on the topological continuity characteristics, and that adjacent points or areas represen...

1 Olfactory coding: Unusual conductances contribute to sparse neural 2 representations. 3 4 Focus on “Intrinsic Membrane Properties and Inhibitory Synaptic Input of 5 Kenyon Cells as Mechanisms for Sparse Coding?” 6 7 8 Rose C. Ong and Mark Stopfer 9 10 National Institute of Child Health and Human Development, US National Institutes 11 of Health, Bethesda, Maryland; and Department of Biochemist...

An r-identifying code on a graph G is a set C ⊂ V (G) such that for every vertex in V (G), the intersection of the radius-r closed neighborhood with C is nonempty and different. Here, we provide an overview on codes for the n-dimensional lattice, discussing the case of 1-identifying codes, constructing a sparse code for the 4-dimensional lattice as well as showing that for fixed n, the minimum ...

Sparse coding performs well in image classification. However, robust target recognition requires a lot of comprehensive template images and the sparse learning process is complex. We incorporate sparsity into a template matching concept to construct a local sparse structure matching (LSSM) model for general infrared target recognition. A local structure preserving sparse coding (LSPSc) formulat...

The goals of this paper are: 1) the introduction of a shiftinvariant sparse coding model together with learning rules for this model; 2) the comparison of this model to the traditional sparse coding model; and 3) the analysis of some limitations of the newly proposed approach. To evaluate the model we will show that it can learn features from a toy problem as well as note-like features from a p...