Bi-sparsity pursuit: A paradigm for robust subspace recovery

Bian, Xiao; Panahi, Ashkan; Krim, Hamid

doi:10.1016/j.sigpro.2018.05.024

Title: Bi-sparsity pursuit: A paradigm for robust subspace recovery

Full Record
Other Related Research

Authors:

Bian, Xiao;

; Krim, Hamid

Publication Date:: 2018-11-01

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1548246

Grant/Contract Number:: NA0002576

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Signal Processing

Additional Journal Information:: Journal Name: Signal Processing Journal Volume: 152 Journal Issue: C; Journal ID: ISSN 0165-1684

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Bian, Xiao, Panahi, Ashkan, and Krim, Hamid. Bi-sparsity pursuit: A paradigm for robust subspace recovery.  Netherlands: N. p., 2018. 
Web.  doi:10.1016/j.sigpro.2018.05.024.

Copy to clipboard


                    Bian, Xiao, Panahi, Ashkan, & Krim, Hamid. Bi-sparsity pursuit: A paradigm for robust subspace recovery.  Netherlands.  https://doi.org/10.1016/j.sigpro.2018.05.024

Copy to clipboard


                    Bian, Xiao, Panahi, Ashkan, and Krim, Hamid. Thu .  
"Bi-sparsity pursuit: A paradigm for robust subspace recovery".  Netherlands.  https://doi.org/10.1016/j.sigpro.2018.05.024.

Copy to clipboard


                    
@article{osti_1548246,

  title        = {Bi-sparsity pursuit: A paradigm for robust subspace recovery},

  author       = {Bian, Xiao and Panahi, Ashkan and Krim, Hamid},

  abstractNote = {},

  doi          = {10.1016/j.sigpro.2018.05.024},

  journal      = {Signal Processing},

  number       = C,

  volume       = 152,

  place        = {Netherlands},

  year         = {2018},

  month        = {11}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.sigpro.2018.05.024

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Bi-sparsity pursuit: A paradigm for robust subspace recovery

Journal Article Bian, Xiao ; Panahi, Ashkan ; Krim, Hamid - Signal Processing

Not provided.
https://doi.org/10.1016/j.sigpro.2018.05.024
BI-sparsity pursuit for robust subspace recovery

Journal Article Bian, Xiao ; Krim, Hamid - Conference: IEEE conference on Image Processing (ICIP)

Here, the success of sparse models in computer vision and machine learning in many real-world applications, may be attributed in large part, to the fact that many high dimensional data are distributed in a union of low dimensional subspaces. The underlying structure may, however, be adversely affected by sparse errors, thus inducing additional complexity in recovering it. In this paper, we propose a bi-sparse model as a framework to investigate and analyze this problem, and provide as a result , a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We additionally demonstrate the effectiveness ofmore »« less
https://doi.org/10.1109/ICIP.2015.7351462

Full Text Available
Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusion

Journal Article Ghanem, Sally ; Panahi, Ashkan ; Krim, Hamid ; ... - IEEE Sensors Journal

Robust Subspace Recovery (RoSuRe) algorithm was recently introduced as a principled and numerically efficient algorithm that unfolds underlying Unions of Subspaces (UoS) structure, present in the data. The union of Subspaces (UoS) is capable of identifying more complex trends in data sets than simple linear models. In this work, we build on and extend RoSuRe to prospect the structure of different data modalities individually. We propose a novel multi-modal data fusion approach based on group sparsity which we refer to as Robust Group Subspace Recovery (RoGSuRe). Relying on a bi-sparsity pursuit paradigm and non-smooth optimization techniques, the introduced framework learnsmore »« less
https://doi.org/10.1109/jsen.2020.2999461

Full Text Available
Beyond union of subspaces: Subspace pursuit on Grassmann manifold for data representation

Journal Article Shen, Xinyue ; Krim, Hamid ; Gu, Yuantao - 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

Discovering the underlying structure of a high-dimensional signal or big data has always been a challenging topic, and has become harder to tackle especially when the observations are exposed to arbitrary sparse perturbations. Here in this paper, built on the model of a union of subspaces (UoS) with sparse outliers and inspired by a basis pursuit strategy, we exploit the fundamental structure of a Grassmann manifold, and propose a new technique of pursuing the subspaces systematically by solving a non-convex optimization problem using the alternating direction method of multipliers. This problem as noted is further complicated by non-convex constraints onmore »« less
https://doi.org/10.1109/ICASSP.2016.7472444

Full Text Available
Signal-Preserving Erratic Noise Attenuation via Iterative Robust Sparsity-Promoting Filter

Journal Article Zhao, Qiang ; Du, Qizhen ; Gong, Xufei ; ... - IEEE Transactions on Geoscience and Remote Sensing

Sparse domain thresholding filters operating in a sparse domain are highly effective in removing Gaussian random noise under Gaussian distribution assumption. Erratic noise, which designates non-Gaussian noise that consists of large isolated events with known or unknown distribution, also needs to be explicitly taken into account. However, conventional sparse domain thresholding filters based on the least-squares (LS) criterion are severely sensitive to data with high-amplitude and non-Gaussian noise, i.e., the erratic noise, which makes the suppression of this type of noise extremely challenging. Here, in this paper, we present a robust sparsity-promoting denoising model, in which the LS criterion ismore »« less
Cited by 10
https://doi.org/10.1109/TGRS.2018.2802462

Full Text Available

Similar Records