Deep latent low-rank fusion network for progressive subspace discovery

15Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Low-rank representation is powerful for recovering and clustering the subspace structures, but it cannot obtain deep hierarchical information due to the single-layer mode. In this paper, we present a new and effective strategy to extend the single-layer latent low-rank models into multiple-layers, and propose a new and progressive Deep Latent Low-Rank Fusion Network (DLRF-Net) to uncover deep features and structures embedded in input data. The basic idea of DLRF-Net is to refine features progressively from the previous layers by fusing the subspaces in each layer, which can potentially obtain accurate features and subspaces for representation. To learn deep information, DLRF-Net inputs shallow features of the last layers into subsequent layers. Then, it recovers the deeper features and hierarchical information by congregating the projective subspaces and clustering subspaces respectively in each layer. Thus, one can learn hierarchical subspaces, remove noise and discover the underlying clean subspaces. Note that most existing latent low-rank coding models can be extended to multilayers using DLRF-Net. Extensive results show that our network can deliver enhanced performance over other related frameworks.

Cite

CITATION STYLE

APA

Zhang, Z., Ren, J., Zhang, Z., & Liu, G. (2020). Deep latent low-rank fusion network for progressive subspace discovery. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2021-January, pp. 2762–2768). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2020/383

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free