Image Classification Based on Sparse Representation in the Quaternion Wavelet Domain

被引:5
作者
Ngo, Long H. [1 ]
Sirakov, Nikolay M. [2 ]
Luong, Marie [1 ]
Viennet, Emmanuel [1 ]
Thuong Le-Tien [3 ]
机构
[1] Univ Sorbonne Paris Nord, Lab Traitement & Transport Informat L2TI, UR 3043, F-93430 Villetaneuse, France
[2] Texas A&M Univ Commerce, Dept Math, Commerce, TX 75428 USA
[3] Natl Univ Ho Chi Minh City, Univ Technol, Dept Telecommun, Ho Chi Minh City 700000, Vietnam
关键词
Face/object classification; quaternion algebra; quaternion wavelet; sparse representation; wavelet; FACE RECOGNITION; K-SVD; DICTIONARY; ALGORITHM; MODELS;
D O I
10.1109/ACCESS.2022.3159701
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this study, we propose a novel sparse representation learning method in the Quaternion Wavelet (QW) domain for multi-class image classification. The proposed method takes advantages from: i) the QW decomposition, which promotes sparsity and provides structural information about the image data while allowing approximate shift-invariance, to extract meaningful features from low-frequency QW subbands, ii) the dimensionality reduction method using Principal Component Analysis (PCA) for reducing the complexity of the problem, and iii) the sparse representation of the generated QW features to efficiently learn and capture the meaningful and compact information of this data. After the QW decomposition, the features extracted from low-frequency image sub-bands information are projected, by the PCA, into a new feature space with lower dimensionality. The features extracted from the training samples are used to construct a dictionary, while the features of the test samples are sparsely coded for the classification step. The sparse coding problem is formulated in a QW Least Absolute Shrinkage and Selection Operator (QWLasso) model applying quaternion l(1) minimization. A novel Quaternion Fast Iterative Shrinkage-Thresholding Algorithm (QFISTA) is developed to solve the QWLasso model. The experiments conducted on various public image datasets validated that the proposed method possesses higher accuracy, sparsity, and robustness in comparison with several contemporary methods in the field including Neural Networks.
引用
收藏
页码:31548 / 31560
页数:13
相关论文
共 48 条
[1]   Deep Sparse Representation-Based Classification [J].
Abavisani, Mandi ;
Patel, Vishal M. .
IEEE SIGNAL PROCESSING LETTERS, 2019, 26 (06) :948-952
[2]   A survey on data-efficient algorithms in big data era [J].
Adadi, Amina .
JOURNAL OF BIG DATA, 2021, 8 (01)
[3]  
Aggarwa C.C., 2015, Data Classification: Algorithms and Applications
[4]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[5]  
Alom MZ, 2018, IEEE IJCNN
[6]  
[Anonymous], 1998, The AR Face Database
[7]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[8]  
Bishop C.M., 2006, PATTERN RECOGNITION, DOI [DOI 10.18637/JSS.V017.B05, 10.1117/1.2819119]
[9]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[10]  
Bulow T, 1999, Hypercomplex spectral signal representations for the processing and analysis of images