Orthogonal Subspace Decomposition: A New Perspective of Learning Discriminative Features for Face Clustering
Face clustering is an important task, due to its wide applications in practice. Graph-based face clustering methods have recently made a great progress and achieved new state-of-the-art results. Learning discriminative node features is the key to further improve the performance of graph-based face clustering. To this end, most previous methods focus on new loss functions, such as margin-based or center loss. In this paper, we propose subspace learning as a new way to learn discriminative node features, which is implemented by a new orthogonal subspace decomposition (OSD) module. In graph-based face clustering, OSD leads to more discriminative node features, which better reflect the relationship between each pair of faces, thereby boosting the accuracy of face clustering. Extensive experiments show that OSD outperforms state-of-the-art results with a healthy margin.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringFace ClusteringSimilar Papers 제목 키워드 기반
Orthogonal Subspace Clustering: Enhancing High-Dimensional Data Analysis through Adaptive Dimensionality Reduction and Efficient Clustering
This paper presents Orthogonal Subspace Clustering (OSC), an innovative method for high-dimensional data clustering. We first establish a theoretical theorem proving that high-dimensional data can be decomposed into orth…
Dimensionality ReductionOrthogonal Mode Decomposition for Finite Discrete Signals
In this paper, an orthogonal mode decomposition method is proposed to decompose ffnite length real signals on both the real and imaginary axes of the complex plane. The interpolation function space of ffnite length discr…
Efficient Discriminative Nonorthogonal Binary Subspace with its Application to Visual Tracking
One of the crucial problems in visual tracking is how the object is represented. Conventional appearance-based trackers are using increasingly more complex features in order to be robust. However, complex representations…
feature selectionObjectObject TrackingTemplate Matching+1Refine and Purify: Orthogonal Basis Optimization with Null-Space Denoising for Conditional Representation Learning
Conditional representation learning aims to extract criterion-specific features for customized tasks. Recent studies project universal features onto the conditional feature subspace spanned by an LLM-generated text basis…
Representation LearningOrthogonal Transforms for Signals on Directed Graphs
In this paper we consider the problem of defining transforms for signals on directed graphs, with a specific focus on defective graphs where the corresponding graph operator cannot be diagonalized. Our proposed method is…