Sparse representation based histogram in color texture retrieval

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sparse representation is proposed to generate the histogram of feature vectors, namely sparse representation based histogram (SRBH), in which a feature vector is represented by a number of basis vectors instead of by one basis vector in classical histogram. This amelioration makes the SRBH to be a more accurate representation of feature vectors, which is confirmed by the analysis in the aspect of reconstruction errors and the application in color texture retrieval. In color texture retrieval, feature vectors are constructed directly from coefficients of Discrete Wavelet Transform (DWT). Dictionaries for sparse representation are generated by K-means. A set of sparse representation based histograms from different feature vectors is used for image retrieval and chisquared distance is adopted for similarity measure. Experimental results assessed by Precision-Recall and Average Retrieval Rate (ARR) on four widely used natural color texture databases show that this approach is robust to the number of wavelet decomposition levels and outperforms classical histogram and state-of-the-art approaches.

Cite

CITATION STYLE

APA

Bai, C., Chen, J. N., Zhang, J., Kpalma, K., & Ronsin, J. (2016). Sparse representation based histogram in color texture retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9916 LNCS, pp. 55–64). Springer Verlag. https://doi.org/10.1007/978-3-319-48890-5_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free