12 April 2016 Multitask joint spatial pyramid matching using sparse representation with dynamic coefficients for object recognition
Mohammad-Hossein Hajigholam, Abolghasem-Asadollah Raie, Karim Faez
Author Affiliations +
Abstract
Object recognition is considered a necessary part in many computer vision applications. Recently, sparse coding methods, based on representing a sparse feature from an image, show remarkable results on several object recognition benchmarks, but the precision obtained by these methods is not yet sufficient. Such a problem arises where there are few training images available. As such, using multiple features and multitask dictionaries appears to be crucial to achieving better results. We use multitask joint sparse representation, using dynamic coefficients to connect these sparse features. In other words, we calculate the importance of each feature for each class separately. This causes the features to be used efficiently and appropriately for each class. Thus, we use variance of features and particle swarm optimization algorithms to obtain these dynamic coefficients. Experimental results of our work on Caltech-101 and Caltech-256 databases show more accuracy compared with state-of-the art ones on the same databases.
© 2016 SPIE and IS&T 1017-9909/2016/$25.00 © 2016 SPIE and IS&T
Mohammad-Hossein Hajigholam, Abolghasem-Asadollah Raie, and Karim Faez "Multitask joint spatial pyramid matching using sparse representation with dynamic coefficients for object recognition," Journal of Electronic Imaging 25(2), 023019 (12 April 2016). https://doi.org/10.1117/1.JEI.25.2.023019
Published: 12 April 2016
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Particle swarm optimization

Object recognition

Particles

Detection and tracking algorithms

Scanning probe microscopy

Feature extraction

Databases

Back to Top