Multiresolution histograms for SVM-based texture classification

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

Abstract

Multiresolution histograms have been recently proposed as robust and efficient features for texture classification. In this paper, we evaluate the performance of multiresolution histograms for texture classification using support vector machines (SVMs). We observe that the dimensionality of multiresolution histograms can be greatly reduced with a Laplacian pyramidal decomposition. With an appropriate kernel, we show that SVMs significantly improve the performance of multiresolution histograms compared to the previously used nearest-neighbor (NN) classifiers on a texture classification problem involving Brodatz textures. Experimental results indicate that multiresolution histograms in conjunction with SVMs are also robust to noise. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Andra, S., & Wu, Y. (2005). Multiresolution histograms for SVM-based texture classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3656 LNCS, pp. 754–761). https://doi.org/10.1007/11559573_92

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