scispace - formally typeset
Journal ArticleDOI

Multiple Kernel Learning for Sparse Representation-Based Classification

TLDR
This paper proposes a multiple kernel learning (MKL) algorithm that is based on the sparse representation-based classification (SRC) method that can perform significantly better than many competitive image classification algorithms.
Abstract
In this paper, we propose a multiple kernel learning (MKL) algorithm that is based on the sparse representation-based classification (SRC) method. Taking advantage of the nonlinear kernel SRC in efficiently representing the nonlinearities in the high-dimensional feature space, we propose an MKL method based on the kernel alignment criteria. Our method uses a two step training method to learn the kernel weights and sparse codes. At each iteration, the sparse codes are updated first while fixing the kernel mixing coefficients, and then the kernel mixing coefficients are updated while fixing the sparse codes. These two steps are repeated until a stopping criteria is met. The effectiveness of the proposed method is demonstrated using several publicly available image classification databases and it is shown that this method can perform significantly better than many competitive image classification algorithms.

read more

Citations
More filters
Journal ArticleDOI

Joint Sparse Representation and Robust Feature-Level Fusion for Multi-Cue Visual Tracking

TL;DR: The proposed joint sparse representation model dynamically removes unreliable features to be fused for tracking by using the advantages of sparse representation and is extended into a general kernelized framework, which is able to perform feature fusion on various kernel spaces.
Journal ArticleDOI

Visual–Tactile Fusion for Object Recognition

TL;DR: The multivariate-time-series model is used to represent the tactile sequence and the covariance descriptor to characterize the image, and a joint group kernel sparse coding method is designed to tackle the intrinsically weak pairing problem in visual–tactile data samples.
BookDOI

Computer Vision, Graphics, and Image Processing

TL;DR: A novel intelligent multiple watermarking techniques are proposed that has reduced the amount of data to be embedded and consequently improved perceptual quality of the watermarked image.
Journal ArticleDOI

Sparse Representation-Based Open Set Recognition

TL;DR: In this article, a generalized sparse representation-based classification (SRC) algorithm was proposed for open set recognition where not all classes presented during testing are known during training, and the SRC algorithm uses class reconstruction errors for classification.
Journal ArticleDOI

Multilayer Convolutional Sparse Modeling: Pursuit and Dictionary Learning

TL;DR: This work represents a bridge between matrix factorization, sparse dictionary learning, and sparse autoencoders, and it is shown that the training of the filters is essential to allow for nontrivial signals in the model, and an online algorithm to learn the dictionaries from real data, effectively resulting in cascaded sparse convolutional layers.
References
More filters
Journal ArticleDOI

Distinctive Image Features from Scale-Invariant Keypoints

TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.

Distinctive Image Features from Scale-Invariant Keypoints

TL;DR: The Scale-Invariant Feature Transform (or SIFT) algorithm is a highly robust method to extract and consequently match distinctive invariant features from images that can then be used to reliably match objects in diering images.
Journal ArticleDOI

Atomic Decomposition by Basis Pursuit

TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI

Robust Face Recognition via Sparse Representation

TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Proceedings ArticleDOI

Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories

TL;DR: This paper presents a method for recognizing scene categories based on approximate global geometric correspondence that exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories.
Related Papers (5)