A High-resolution DOA Estimation Method with a Family of Nonconvex Penalties

12/06/2017
by   Xiaohuan Wu, et al.
0

The low-rank matrix reconstruction (LRMR) approach is widely used in direction-of-arrival (DOA) estimation. As the rank norm penalty in an LRMR is NP-hard to compute, the nuclear norm (or the trace norm for a positive semidefinite (PSD) matrix) has been often employed as a convex relaxation of the rank norm. However, solving a nuclear norm convex problem may lead to a suboptimal solution of the original rank norm problem. In this paper, we propose to apply a family of nonconvex penalties on the singular values of the covariance matrix as the sparsity metrics to approximate the rank norm. In particular, we formulate a nonconvex minimization problem and solve it by using a locally convergent iterative reweighted strategy in order to enhance the sparsity and resolution. The problem in each iteration is convex and hence can be solved by using the optimization toolbox. Convergence analysis shows that the new method is able to obtain a suboptimal solution. The connection between the proposed method and the sparse signal reconstruction (SSR) is explored showing that our method can be regarded as a sparsity-based method with the number of sampling grids approaching infinity. Two feasible implementation algorithms that are based on solving a duality problem and deducing a closed-form solution of the simplified problem are also provided for the convex problem at each iteration to expedite the convergence. Extensive simulation studies are conducted to show the superiority of the proposed methods.

READ FULL TEXT
research
04/29/2014

Generalized Nonconvex Nonsmooth Low-Rank Minimization

As surrogate functions of L_0-norm, many nonconvex penalty functions hav...
research
06/13/2020

Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers

Rank minimization is of interest in machine learning applications such a...
research
08/14/2020

Efficient Low-Rank Matrix Learning by Factorizable Nonconvex Regularization

Matrix learning is at the core of many machine learning problems. To enc...
research
09/17/2021

Accurate, Interpretable, and Fast Animation: An Iterative, Sparse, and Nonconvex Approach

Digital human animation relies on high-quality 3D models of the human fa...
research
10/30/2015

Robust Subspace Clustering via Tighter Rank Approximation

Matrix rank minimization problem is in general NP-hard. The nuclear norm...
research
06/14/2021

Gridless Evolutionary Approach for Line Spectral Estimation with Unknown Model Order

Gridless methods show great superiority in line spectral estimation. The...
research
01/30/2020

A Sparsity Inducing Nuclear-Norm Estimator (SpINNEr) for Matrix-Variate Regression in Brain Connectivity Analysis

Classical scalar-response regression methods treat covariates as a vecto...

Please sign up or login with your details

Forgot password? Click here to reset