Graph-based adaptive and discriminative subspace learning for face image clustering

2021 ◽  
pp. 116359
Author(s):  
Mengmeng Liao ◽  
Yunjie Li ◽  
Meiguo Gao
2020 ◽  
Vol 50 (5) ◽  
pp. 2138-2151 ◽  
Author(s):  
Dong Zhang ◽  
Yunlian Sun ◽  
Qiaolin Ye ◽  
Jinhui Tang

Author(s):  
Haoliang Yuan ◽  
Loi Lei Lai

Subspace learning (SL) is an important technology to extract the discriminative features for hyperspectral image (HSI) classification. However, in practical applications, some acquired HSIs are contaminated with considerable noise during the imaging process. In this case, most of existing SL methods yield limited performance for subsequent classification procedure. In this paper, we propose a robust subspace learning (RSL) method, which utilizes a local linear regression and a supervised regularization function simultaneously. To effectively incorporate the spatial information, a local linear regression is used to seek the recovered data from the noisy data under a spatial set. The recovered data not only reduce the noise effect but also include the spectral-spatial information. To utilize the label information, a supervised regularization function based on the idea of Fisher criterion is used to learn a discriminative subspace from the recovered data. To optimize RSL, we develop an efficient iterative algorithm. Extensive experimental results demonstrate that RSL greatly outperforms many existing SL methods when the HSI data contain considerable noise.


Author(s):  
Xiangguang Dai ◽  
Keke Zhang ◽  
Juntang Li ◽  
Jiang Xiong ◽  
Nian Zhang ◽  
...  

AbstractNon-negative matrix factorization and its extensions were applied to various areas (i.e., dimensionality reduction, clustering, etc.). When the original data are corrupted by outliers and noise, most of non-negative matrix factorization methods cannot achieve robust factorization and learn a subspace with binary codes. This paper puts forward a robust semi-supervised non-negative matrix factorization method for binary subspace learning, called RSNMF, for image clustering. For better clustering performance on the dataset contaminated by outliers and noise, we propose a weighted constraint on the noise matrix and impose manifold learning into non-negative matrix factorization. Moreover, we utilize the discrete hashing learning method to constrain the learned subspace, which can achieve a binary subspace from the original data. Experimental results validate the robustness and effectiveness of RSNMF in binary subspace learning and image clustering on the face dataset corrupted by Salt and Pepper noise and Contiguous Occlusion.


Author(s):  
Kan Xie ◽  
Wei Liu ◽  
Yue Lai ◽  
Weijun Li

Subspace learning has been widely utilized to extract discriminative features for classification task, such as face recognition, even when facial images are occluded or corrupted. However, the performance of most existing methods would be degraded significantly in the scenario of that data being contaminated with severe noise, especially when the magnitude of the gross corruption can be arbitrarily large. To this end, in this paper, a novel discriminative subspace learning method is proposed based on the well-known low-rank representation (LRR). Specifically, a discriminant low-rank representation and the projecting subspace are learned simultaneously, in a supervised way. To avoid the deviation from the original solution by using some relaxation, we adopt the Schatten [Formula: see text]-norm and [Formula: see text]-norm, instead of the nuclear norm and [Formula: see text]-norm, respectively. Experimental results on two famous databases, i.e. PIE and ORL, demonstrate that the proposed method achieves better classification scores than the state-of-the-art approaches.


2019 ◽  
Vol 26 (1) ◽  
pp. 154-158 ◽  
Author(s):  
A. Venkata Subramanyam ◽  
Vanshika Gupta ◽  
Rahul Ahuja

Sign in / Sign up

Export Citation Format

Share Document