Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10365
Title: Supervised and unsupervised parallel subspace learning for large-scale image recognition
Authors: Jing, XY
Li, S
Zhang, D 
Yang, J
Yang, JY
Keywords: Feature selection
Graph embedding
Large-scale image recognition
Parallel linear discriminant analysis (PLDA)
Parallel locality preserving projection (PLPP)
Parallel subspace learning framework
Issue Date: 2012
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on circuits and systems for video technology, 2012, v. 22, no. 10, 6209404, p. 1497-1511 How to cite?
Journal: IEEE transactions on circuits and systems for video technology 
Abstract: Subspace learning is an effective and widely used image feature extraction and classification technique. However, for the large-scale image recognition issue in real-world applications, many subspace learning methods often suffer from large computational burden. In order to reduce the computational time and improve the recognition performance of subspace learning technique under this situation, we introduce the idea of parallel computing which can reduce the time complexity by splitting the original task into several subtasks. We develop a parallel subspace learning framework. In this framework, we first divide the sample set into several subsets by designing two random data division strategies that are equal data division and unequal data division. These two strategies correspond to equal and unequal computational abilities of nodes under parallel computing environment. Next, we calculate projection vectors from each subset in parallel. The graph embedding technique is employed to provide a general formulation for parallel feature extraction. After combining the extracted features from all nodes, we present a unified criterion to select most distinctive features for classification. Under the developed framework, we separately propose supervised and unsupervised parallel subspace learning approaches, which are called parallel linear discriminant analysis (PLDA) and parallel locality preserving projection (PLPP). PLDA selects features with the largest Fisher scores by estimating the weighted and unweighted sample scatter, while PLPP selects features with the smallest Laplacian scores by constructing a whole affinity matrix. Theoretically, we analyze the time complexities of proposed approaches and provide the fundamental supports for applying random division strategies. In the experiments, we establish two real parallel computing environments and employ four public image and video databases as the test data. Experimental results demonstrate that the proposed approaches outperform several related supervised and unsupervised subspace learning methods, and significantly reduce the computational time.
URI: http://hdl.handle.net/10397/10365
ISSN: 1051-8215
EISSN: 1558-2205
DOI: 10.1109/TCSVT.2012.2202079
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
Citations as of Jul 15, 2017

Page view(s)

39
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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