Deep Unfolding of Iteratively Reweighted ADMM for Wireless RF Sensing

We address the detection of material defects, which are inside a layered material structure using compressive sensing based multiple-output (MIMO) wireless radar. Here, the strong clutter due to the reflection of the layered structure's surface often makes the detection of the defects challenging. Thus, sophisticated signal separation methods are required for improved defect detection. In many scenarios, the number of defects that we are interested in is limited and the signaling response of the layered structure can be modeled as a low-rank structure. Therefore, we propose joint rank and sparsity minimization for defect detection. In particular, we propose a non-convex approach based on the iteratively reweighted nuclear and ℓ_1-norm (a double-reweighted approach) to obtain a higher accuracy compared to the conventional nuclear norm and ℓ_1-norm minimization. To this end, an iterative algorithm is designed to estimate the low-rank and sparse contributions. Further, we propose deep learning to learn the parameters of the algorithm (i.e., algorithm unfolding) to improve the accuracy and the speed of convergence of the algorithm. Our numerical results show that the proposed approach outperforms the conventional approaches in terms of mean square errors of the recovered low-rank and sparse components and the speed of convergence.

READ FULL TEXT

page 1

page 11

research
06/11/2014

Truncated Nuclear Norm Minimization for Image Restoration Based On Iterative Support Detection

Recovering a large matrix from limited measurements is a challenging tas...
research
11/18/2019

Nonconvex Nonsmooth Low-Rank Minimization for Generalized Image Compressed Sensing via Group Sparse Representation

Group sparse representation (GSR) based method has led to great successe...
research
03/07/2012

In-network Sparsity-regularized Rank Minimization: Algorithms and Applications

Given a limited number of entries from the superposition of a low-rank m...
research
09/12/2017

Bridge the Gap Between Group Sparse Coding and Rank Minimization via Adaptive Dictionary Learning

Both sparse coding and rank minimization have led to great successes in ...
research
04/23/2013

A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank

Rank minimization has attracted a lot of attention due to its robustness...
research
08/16/2016

A Comparative Study for the Weighted Nuclear Norm Minimization and Nuclear Norm Minimization

Nuclear norm minimization (NNM) tends to over-shrink the rank components...
research
02/08/2018

Online Decomposition of Compressive Streaming Data Using n-ℓ_1 Cluster-Weighted Minimization

We consider a decomposition method for compressive streaming data in the...

Please sign up or login with your details

Forgot password? Click here to reset