Image Classification Based on Sparse Representation and ROI

Article Preview

Abstract:

A new image classification method based on regions of interest (ROI) and sparse representation is introduced in the paper. Firstly, the saliency map of each image is extracted by different methods. Then, we choose sparse representation to represent and classify the saliency maps. Four different ROI extraction methods are chosen as examples to evaluate the performance of the proposed method. Experimental results show that it is more effective for image classification based on ROI.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4906-4910

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] D Lu, Q Weng. A survey of image classification methods and techniques for improving classification performance [J]. International journal of Remote sensing, 2007, 28(5): 823-870.

DOI: 10.1080/01431160600746456

Google Scholar

[2] M Jassem, A Hamid. Image Classification using Statistical Learning Methods [J]. Journal of Software Engineering and Applications, 2013, 5: 200-203.

Google Scholar

[3] M M Cheng, G X Zhang, N J Mitra, et al. Global contrast based saliency region detection[C]. 2011 IEEE Conference on Computer Vision and Pattern Recognition, 2011: 409-416.

Google Scholar

[4] R Achanta, S Hemami, F Estrada, et al. Frequency-tuned saliency region detection[C]. 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009: 1597-1604.

DOI: 10.1109/cvpr.2009.5206596

Google Scholar

[5] X Hou, L Zhang. Saliency detection: A spectral residual approach[C]. 2007 IEEE Conference on Computer Vision and Pattern Recognition, 2007: 1-8.

DOI: 10.1109/cvpr.2007.383267

Google Scholar

[6] B A Olshausen. Emergence of simple-cell receptive field properties by learning a sparse code for natural images [J]. Nature, 1996, 381(6583): 607-609.

DOI: 10.1038/381607a0

Google Scholar

[7] S G Mallat, Z Zhang. Matching pursuits with time-frequency dictionaries [J]. IEEE Transactions On Signal Processing, 1993, 41(12): 3397-3415.

DOI: 10.1109/78.258082

Google Scholar

[8] Y C Pati, R Rezaiifar, P S Krishnaprasad. Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition [C]. IEEE Conference Record of the Twenty-Seventh Asilomar Conference on Signals, Systems and Computers [A], 1993: 40-44.

DOI: 10.1109/acssc.1993.342465

Google Scholar

[9] S S Chen, D L Donoho, M A Saunders. Atomic decomposition by basis pursuit [J]. SIAM review, 2001, 43(1): 129-159.

DOI: 10.1137/s003614450037906x

Google Scholar

[10] Q Zhao, D Y Zhao, Z B Xu. regularized logistic regression [J]. Pattern Recognition and Artificial Intelligence, 2012, 25(5): 721-728. (in Chinese).

Google Scholar

[11] R Tibshirani. Regression shrinkage and selection via the lasso [J]. Journal of the Royal Statistical Society. Series B (Methodological), 1996, 267-288.

DOI: 10.1111/j.2517-6161.1996.tb02080.x

Google Scholar

[12] SPGL1. http: /www. cs. ubc. ca/~mpf/spgl1.

Google Scholar