Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79683
Title: An integrated optimisation algorithm for feature extraction, dictionary learning and classification
Authors: Cui, Y 
Jiang, JL 
Lai, ZH 
Wong, WK 
Hu, ZJ
Keywords: Feature extraction
Dictionary optimisation
Sparse representation
Supervised learning
Unsupervised learning
Issue Date: 2018
Publisher: Elsevier
Source: Neurocomputing, 31 Jan. 2018, v. 275, p. 2740-2751 How to cite?
Journal: Neurocomputing 
Abstract: Recently, sparse representation-based classification (SRC) has received much attention for its robustness in pattern recognition. Because SRC deals with high-dimensional data, huge computational resources are required to compute sparse representations of query samples, which renders SRC solutions of high-dimensional problems infeasible. To overcome this problem, an integrated optimisation algorithm is proposed to implement feature extraction, dictionary learning and classification simultaneously. First, to obtain sparse representation coefficients, a sparsity preserving embedding map is learnt to reduce the dimensionality of the data. Second, an optimal dictionary is adaptively obtained from the training data to reduce trivial information. Third, the training samples are reclassified using sparse representation coefficients. Furthermore, the integrated learning algorithm is extended to unsupervised learning. Experimental results clearly demonstrate that the proposed method achieves better performance than several popular feature extraction and classification methods.
URI: http://hdl.handle.net/10397/79683
ISSN: 0925-2312
EISSN: 1872-8286
DOI: 10.1016/j.neucom.2017.11.043
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Citations as of Jan 5, 2019

WEB OF SCIENCETM
Citations

1
Citations as of Jan 14, 2019

Page view(s)

2
Citations as of Jan 14, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.