Block diagonal representation learning with local invariance for face clustering

被引:0
作者
Wang L. [1 ]
Chen S. [1 ]
Yin M. [2 ]
Hao Z. [1 ,3 ]
Cai R. [1 ]
机构
[1] School of Computer, Guangdong University of Technology, Guangzhou
[2] School of Semiconductor Science and Technology and Institute of Semiconductor, South China Normal University, Foshan
[3] College of Science, Shantou University, Shantou
基金
中国国家自然科学基金;
关键词
Block diagonal representation; Diffusion Processing; Face clustering; Manifold learning; Subspace clustering;
D O I
10.1007/s00500-024-09698-9
中图分类号
学科分类号
摘要
Facial data under non-rigid deformation are often assumed lying on a highly non-linear manifold. The conventional subspace clustering methods, such as Block Diagonal Representation (BDR), can only handle the high-dimensionality of facial data, ignoring the useful non-linear property embedded in data. Yet, discovering the local invariance in facial data remains a critical issue for face clustering. To this end, we propose a novel Block Diagonal Representation via Manifold learning (BDRM) in this paper. To be concrete, the manifold information within facial data can be learned by Locally Linear Embedding (LLE). Then manifold structure and block diagonal representation are considered jointly to uncover the intrinsic structure of facial data, which leads to a better representation for subsequent clustering task. Furthermore, the diffusion process is adopted to derive the final affinity matrix with context-sensitive, by which the learned affinity matrix can be spread and re-evaluated to enhance the connectivity of data belonging to the same intra-subspace. The extensive experimental results show that our proposed approach achieves a superior clustering performance against the state-of-the-art methods on both synthetic data and real-world facial data. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.
引用
收藏
页码:8133 / 8149
页数:16
相关论文
共 40 条
[1]  
Shi Y., Otto C., Jain A.K., Face clustering: representation and pairwise constraints, IEEE Trans Inf Forensics Secur, 13, 7, pp. 1626-1640, (2018)
[2]  
Yang A.Y., Et al., Unsupervised segmentation of natural images via lossy data compression, Computer Vision and Image Understanding, 110, 2, pp. 212-225, (2008)
[3]  
Ng A.Y., Jordan Michaelyair I., On Spectral Clustering: Analysis and an algorithm.” Advances in Neural Information Processing Systems, (2002)
[4]  
Chong Y., Daniel R., Ren V., Scalable sparse subspace clustering by orthogonal matching pursuit, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, (2016)
[5]  
Behrooz N., Richard H., Graph connectivity in sparse subspace clustering, CVPR 2011., (2011)
[6]  
Elhamifar E., Vidal R., Sparse subspace clustering: Algorithm, theory, and applications, IEEE Trans Pattern Anal Mach Intell, 35, 11, pp. 2765-2781, (2013)
[7]  
Guangcan L., Zhouchen L., Yong Y., Robust subspace segmentation by low-rank representation, ” ICML, 1, (2010)
[8]  
Robust and efficient subspace segmentation via least squares regression, European Conference on Computer Vision. Springer, (2012)
[9]  
Guo Z., Chi-Man P., Nonnegative Self-Representation with a Fixed Rank Constraint for Subspace Clustering, Information Sciences, (2020)
[10]  
Lu C., Et al., Correlation adaptive subspace segmentation by trace lasso, Proceedings of the IEEE International Conference on Computer Vision, (2013)