Subspace segmentation by dense block and sparse representation
From MaRDI portal
Publication:2418108
DOI10.1016/j.neunet.2015.11.011zbMath1414.68078OpenAlexW2195250169WikidataQ40155431 ScholiaQ40155431MaRDI QIDQ2418108
Kewei Tang, Jiangxin Dong, David B. Dunson, Risheng Liu, Jie Zhang, Zhi-Xun Su
Publication date: 3 June 2019
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2015.11.011
Learning and adaptive systems in artificial intelligence (68T05) Machine vision and scene understanding (68T45)
Related Items
Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data, Sparse subspace clustering for data with missing entries and high-rank matrix completion
Cites Work
- Characterization of the subdifferential of some matrix norms
- A geometric analysis of subspace clustering with outliers
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Saliency Detection by Multitask Sparsity Pursuit
- Metrics and models for handwritten character recognition