DOA Estimation in Non-Uniform Noise Using Matrix Completion via Alternating Projection
نویسندگان
چکیده
منابع مشابه
Wideband DOA Estimation through Projection Matrix Interpolation
This paper presents a method to reduce the complexity of the deterministic maximum likelihood (DML) estimator in the wideband direction-of-arrival (WDOA) problem, which is based on interpolating the array projection matrix in the temporal frequency variable. It is shown that an accurate interpolator like Chebyshev’s is able to produce DML cost functions comprising just a few narrowband-like sum...
متن کاملNoisy Matrix Completion Using Alternating Minimization
The task of matrix completion involves estimating the entries of a matrix, M ∈ Rm×n, when a subset, Ω ⊂ {(i, j) : 1 ≤ i ≤ m, 1 ≤ j ≤ n} of the entries are observed. A particular set of low rank models for this task approximate the matrix as a product of two low rank matrices, M̂ = UV T , where U ∈ Rm×k and V ∈ Rn×k and k min{m,n}. A popular algorithm of choice in practice for recovering M from t...
متن کاملMatrix Completion via Non-convex Programming
We consider the matrix completion problem in the noisy setting. To achieve statistically efficient estimation of the unknown low-rank matrix, solving convex optimization problems with nuclear norm constraints has been both theoretically and empirically proved a successful strategy under certain regularity conditions. However, the bias induced by the nuclear norm penalty may compromise the estim...
متن کامل2-D DOA Estimation via Matrix Partition and Stacking Technique
A novel approach is proposed for the efficient estimation of the two-dimensional (2-D) direction-of-arrival (DOA) of signals impinging on two orthogonal uniform linear arrays (ULAs). By partitioning the cross-correlation matrix (CCM) between two ULAs data into a great deal of submatrices and making use of the submatrices and the symmetric subarrays, an extended correlation matrix is constructed...
متن کاملNoise-Tolerant Life-Long Matrix Completion via Adaptive Sampling
We study the problem of recovering an incomplete m× n matrix of rank r with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer vision, system identification, etc. The challenge is to design provable algorithms tolerant to a large amount of noises, with small sample complexity. In this work, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Open Journal of Antennas and Propagation
سال: 2021
ISSN: 2637-6431
DOI: 10.1109/ojap.2021.3059474