Online sparse learning utilizing multi-feature combination for image classification

@article{Zhang2011OnlineSL,
  title={Online sparse learning utilizing multi-feature combination for image classification},
  author={L. Zhang and Kunyu Zhang and Xiaoli Dong},
  journal={2011 18th IEEE International Conference on Image Processing},
  year={2011},
  pages={197-200},
  url={https://api.semanticscholar.org/CorpusID:16960005}
}
  • L. ZhangKunyu ZhangXiaoli Dong
  • Published in 18th IEEE International… 29 December 2011
  • Computer Science, Engineering
  • 2011 18th IEEE International Conference on Image Processing
An online sparse learning algorithm, which utilizes the reconstruction error to update the current codebook, and outperforms offline learning with a single type of descriptors.
View on IEEE
doi.org
2 Citations
Background Citations
1

2 Citations

Structure-constrained low-rank and partial sparse representation for image classification

A Structure-Constrained Low-Rank and Partial Sparse Representation algorithm for image classification which imposes both structure and low-rank restriction on the coefficient matrix and demonstrates the effectiveness of the proposed algorithm.

Multifeature analysis and semantic context learning for image classification

An image classification approach in which the semantic context of images and multiple low-level visual features are jointly exploited to infer object classes within images is introduced.

13 References

Linear spatial pyramid matching using sparse coding for image classification

An extension of the SPM method is developed, by generalizing vector quantization to sparse coding followed by multi-scale spatial max pooling, and a linear SPM kernel based on SIFT sparse codes is proposed, leading to state-of-the-art performance on several benchmarks by using a single type of descriptors.

Locality-constrained Linear Coding for image classification

This paper presents a simple but effective coding scheme called Locality-constrained Linear Coding (LLC) in place of the VQ coding in traditional SPM, using the locality constraints to project each descriptor into its local-coordinate system, and the projected coordinates are integrated by max pooling to generate the final representation.

Pyramid Match Kernels: Discriminative Classification with Sets of Image Features (version 2)

A new fast kernel function is presented which maps unordered feature sets to multi-resolution histograms and computes a weighted histogram intersection in this space and is shown to be positive-definite, making it valid for use in learning algorithms whose optimal solutions are guaranteed only for Mercer kernels.

The pyramid match kernel: discriminative classification with sets of image features

A new fast kernel function is presented which maps unordered feature sets to multi-resolution histograms and computes a weighted histogram intersection in this space and is shown to be positive-definite, making it valid for use in learning algorithms whose optimal solutions are guaranteed only for Mercer kernels.

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

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.

Towards a Computational Model for Object Recognition in IT Cortex

This verification procedure provides a model for the serial process of attention in human vision that integrates features belonging to a single object that can achieve rapid and robust object recognition in cluttered partially-occluded images.

Learning Model Complexity in an Online Environment

This paper proposes a new framework which enables online learning algorithms to adjust the complexity of the learned model to the amount of the training data as more examples become available, and implements an online Support Vector Machine with increasing complexity.

Efficient sparse coding algorithms

These algorithms are applied to natural images and it is demonstrated that the inferred sparse codes exhibit end-stopping and non-classical receptive field surround suppression and, therefore, may provide a partial explanation for these two phenomena in V1 neurons.

A Bayesian hierarchical model for learning natural scene categories

This work proposes a novel approach to learn and recognize natural scene categories by representing the image of a scene by a collection of local regions, denoted as codewords obtained by unsupervised learning.

Representing and Recognizing the Visual Appearance of Materials using Three-dimensional Textons

A unified model to construct a vocabulary of prototype tiny surface patches with associated local geometric and photometric properties, represented as a set of linear Gaussian derivative filter outputs, under different lighting and viewing conditions is provided.