Javascript must be enabled to continue!
Multi‐view intrinsic low‐rank representation for robust face recognition and clustering
View through CrossRef
Abstract
In the last years, subspace‐based multi‐view
face recognition has attracted increasing attention and many related methods have been proposed. However, the most existing methods ignore the specific local structure of different views. This drawback can cause these methods' discriminating ability to degrade when many noisy samples exist in data. To tackle this problem, a multi‐view low‐rank representation method is proposed, which exploits both intrinsic relationships and specific local structures of different views simultaneously. It is achieved by hierarchical Bayesian methods that constrain the low‐rank representation of each view so that it matches a linear combination of an intrinsic representation matrix and a specific representation matrix to obtain common and specific characteristics of different views. The intrinsic representation matrix holds the consensus information between views, and the specific representation matrices indicate the diversity among views. Furthermore, the model injects a clustering structure into the low‐rank representation. This approach allows for adaptive adjustment of the clustering structure while pursuing the optimization of the low‐rank representation. Hence, the model can well capture both the relationship between data and the clustering structure explicitly. Extensive experiments on several datasets demonstrated the effectiveness of the proposed method compared to similar state‐of‐the‐art methods in classification and clustering.
Institution of Engineering and Technology (IET)
Title: Multi‐view intrinsic low‐rank representation for robust face recognition and clustering
Description:
Abstract
In the last years, subspace‐based multi‐view
face recognition has attracted increasing attention and many related methods have been proposed.
However, the most existing methods ignore the specific local structure of different views.
This drawback can cause these methods' discriminating ability to degrade when many noisy samples exist in data.
To tackle this problem, a multi‐view low‐rank representation method is proposed, which exploits both intrinsic relationships and specific local structures of different views simultaneously.
It is achieved by hierarchical Bayesian methods that constrain the low‐rank representation of each view so that it matches a linear combination of an intrinsic representation matrix and a specific representation matrix to obtain common and specific characteristics of different views.
The intrinsic representation matrix holds the consensus information between views, and the specific representation matrices indicate the diversity among views.
Furthermore, the model injects a clustering structure into the low‐rank representation.
This approach allows for adaptive adjustment of the clustering structure while pursuing the optimization of the low‐rank representation.
Hence, the model can well capture both the relationship between data and the clustering structure explicitly.
Extensive experiments on several datasets demonstrated the effectiveness of the proposed method compared to similar state‐of‐the‐art methods in classification and clustering.
Related Results
Does face-drawing experience enhance face processing abilities? Evidence from hidden Markov modeling of eye movements
Does face-drawing experience enhance face processing abilities? Evidence from hidden Markov modeling of eye movements
Recent research has suggested the importance of part-based information in face recognition in addition to global information. Consistent with this finding, eye movement patterns th...
Disentangling the Motivation-Achievement Paradox of Immigrant Students
Disentangling the Motivation-Achievement Paradox of Immigrant Students
Students with an immigration background tend to show similar or sometimes even higher intrinsic motivation compared to their native peers (Kigel, McElvany, & Becker, 2015, Miya...
Multiview Common Subspace Clustering via Coupled Low Rank Representation
Multiview Common Subspace Clustering via Coupled Low Rank Representation
Multi-view subspace clustering (MVSC) finds a shared structure in latent low-dimensional subspaces of multi-view data to enhance clustering performance. Nonetheless, we observe tha...
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Increased life expectancy of heart failure patients in a rural center by a multidisciplinary program
Abstract
Funding Acknowledgements
Type of funding sources: None.
INTRODUCTION Patients with heart failure (HF)...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Volume 10, Index
Volume 10, Index
<p><strong>Vol 10, No 1 (2015)</strong></p><p><strong> </strong></p><p><a href="http://www.world-education-center.org/index...
Juvenile rank acquisition influences fitness independent of adult rank
Juvenile rank acquisition influences fitness independent of adult rank
Abstract
Social rank has been identified as a significant determinant of fitness in a variety of species. The importance of social rank suggests that the process by...
The impact of sparsity in low-rank recurrent neural networks
The impact of sparsity in low-rank recurrent neural networks
Abstract
Neural population dynamics are often highly coordinated, allowing task-related computations to be understood as neural trajectories through low-dimensional...

