Residual Encoder-Decoder Network for Deep Subspace Clustering
Not on the map. Why?
Abstract (arXiv)
Subspace clustering aims to cluster unlabeled data that lies in a union of low-dimensional linear subspaces. Deep subspace clustering approaches based on auto-encoders have become very popular to solve subspace clustering problems. However, the training of current deep methods converges slowly, which is much less efficient than traditional approaches. We propose a Residual Encoder-Decoder network for deep Subspace Clustering (RED-SC), which symmetrically links convolutional and deconvolutional layers with skip-layer connections, with which the training converges much faster. We use a self-expressive layer to generate more accurate linear representation coefficients through different latent representations from multiple latent spaces. Experiments show the superiority of RED-SC in training efficiency and clustering accuracy. Moreover, we are the first one to apply residual encoder-decoder on unsupervised learning tasks.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 12 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1.
4 papers.
- 2021Learning a Self-Expressive Network for Subspace Clusteringcited by 24
- 2022Self-Supervised Deep Subspace Clustering with Entropy-normcited by 0
- 2023Learning Structure Aware Deep Spectral Embeddingcited by 0
- 2024Federated Deep Subspace Clusteringcited by 0
- 2024Federated Deep Subspace Clustering31 Dec 2024
- 2023Learning Structure Aware Deep Spectral Embedding14 May 2023
- 2022Self-Supervised Deep Subspace Clustering with Entropy-norm10 Jun 2022
- 2021Learning a Self-Expressive Network for Subspace Clustering8 Oct 2021