Robust Subspace Clustering by Bi-Sparsity Pursuit: Guarantees and Sequential Algorithm

Cite

Text

Panahi et al. "Robust Subspace Clustering by Bi-Sparsity Pursuit: Guarantees and Sequential Algorithm." IEEE/CVF Winter Conference on Applications of Computer Vision, 2018. doi:10.1109/WACV.2018.00147

Markdown

[Panahi et al. "Robust Subspace Clustering by Bi-Sparsity Pursuit: Guarantees and Sequential Algorithm." IEEE/CVF Winter Conference on Applications of Computer Vision, 2018.](https://mlanthology.org/wacv/2018/panahi2018wacv-robust/) doi:10.1109/WACV.2018.00147

BibTeX

@inproceedings{panahi2018wacv-robust,
  title     = {{Robust Subspace Clustering by Bi-Sparsity Pursuit: Guarantees and Sequential Algorithm}},
  author    = {Panahi, Ashkan and Bian, Xiao and Krim, Hamid and Dai, Liyi},
  booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
  year      = {2018},
  pages     = {1302-1311},
  doi       = {10.1109/WACV.2018.00147},
  url       = {https://mlanthology.org/wacv/2018/panahi2018wacv-robust/}
}