Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Bi-sparsity pursuit: A paradigm for robust subspace recovery

Journal Article · · Signal Processing
 [1];  [2];  [2]
  1. North Carolina State University, Raleigh, NC (United States); DOE/OSTI
  2. North Carolina State University, Raleigh, NC (United States)
The success of sparse models in computer vision and machine learning is due to the fact that, high dimensional data is distributed in a union of low dimensional subspaces in many real-world applications. The underlying structure may, however, be adversely affected by sparse errors. In this paper, we propose a bi-sparse model as a framework to analyze this problem, and provide a novel algorithm to recover the union of subspaces in the presence of sparse corruptions. We further show the effectiveness of our method by experiments on real-world vision data.
Research Organization:
North Carolina State Univ., Raleigh, NC (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
NA0002576
OSTI ID:
1614542
Alternate ID(s):
OSTI ID: 1548246
Journal Information:
Signal Processing, Journal Name: Signal Processing Vol. 152; ISSN 0165-1684
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English

References (16)

A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging journal December 2010
On the Role of Sparse and Redundant Representations in Image Processing journal June 2010
Sparse Representation for Computer Vision and Pattern Recognition journal June 2010
Sparse and Redundant Representation Modeling—What Next? journal December 2012
Subspace Clustering via Optimal Direction Search journal December 2017
Playing with Duality: An overview of recent primal?dual approaches for solving large-scale optimization problems journal November 2015
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information journal February 2006
Binary- and Multi-class Group Sparse Canonical Correlation Analysis for Feature Extraction and Classification journal October 2013
Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Models journal March 2009
Robust Recovery of Subspace Structures by Low-Rank Representation journal January 2013
Sparse Subspace Clustering: Algorithm, Theory, and Applications journal November 2013
Innovation Pursuit: A New Approach to Subspace Clustering journal December 2017
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming journal May 1974
Robust principal component analysis? journal May 2011
A geometric analysis of subspace clustering with outliers journal August 2012
Robust subspace clustering journal April 2014

Cited By (1)

Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion journal October 2020

Similar Records

BI-sparsity pursuit for robust subspace recovery
Journal Article · Mon Aug 31 20:00:00 EDT 2015 · Conference: IEEE conference on Image Processing (ICIP) · OSTI ID:1438406

Sparsity and Nullity: Paradigms for Analysis Dictionary Learning
Journal Article · Tue Aug 09 00:00:00 EDT 2016 · SIAM Journal on Imaging Sciences · OSTI ID:1437433