A New Image Retrieval Algorithm Based on Sparse Coding

DOI

10.2991/aiie-15.2015.7How to use a DOI?

Keywords

bag of visual words; spatial pyramid matching; sparse coding; image retrieval

Abstract

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 L2 norm replace L0 norm in SPM vector quantization. The local information was incorporated into sparse term by local adapter. Sparse coding was transformed into least square convex optimization proplem. Each block was encoded by the k nearest neighbor (KNN) approach, and the coding coefficients were integrated by the max pooling function. Each block required different weight according to the image itself information. Euclidean distance and the cosine theorem were combined with the similarity calculation. Our method is evaluated on the two datasets—Caltech-101 and Corel-1000. Comparing with the BOVW and SPM, the results are shown that the new approach greatly improves the image retrieval accuracy.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - R.X. Wang
AU  - G.H. Peng
AU  - H.C. Zheng
PY  - 2015/07
DA  - 2015/07
TI  - A New Image Retrieval Algorithm Based on Sparse Coding
BT  - Proceedings of the 2015 International Conference on Artificial Intelligence and Industrial Engineering
PB  - Atlantis Press
SP  - 21
EP  - 24
SN  - 1951-6851
UR  - https://doi.org/10.2991/aiie-15.2015.7
DO  - 10.2991/aiie-15.2015.7
ID  - Wang2015/07
ER  -