2021
DOI: 10.1121/10.0006790
|View full text |Cite
|
Sign up to set email alerts
|

Gridless three-dimensional compressive beamforming with the Sliding Frank-Wolfe algorithm

Abstract: The application of the Sliding Frank-Wolfe algorithm to gridless compressive beamforming is investigated, for single and multi-snapshots measurements, and estimation of the three-dimensional position of the sources and their amplitudes. Sources are recovered by solving an infinite dimensional optimization problem, promoting sparsity of the solutions, and avoiding the basis mismatch issue. The algorithm does not impose constraints on the source model or the array geometry. A variant of the algorithm is proposed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 32 publications
0
6
0
Order By: Relevance
“…The regularization parameter λ can be tuned to find the number of sources. In this work, we assume the number of trajectories to be known; thus, we set λ = 0 and develop greedy iterative algorithms 47 . From the solution ∆ * , we obtain estimates for the trajectory parameters W and their corresponding amplitudes using (13).…”
Section: A Beurling Lassomentioning
confidence: 99%
See 2 more Smart Citations
“…The regularization parameter λ can be tuned to find the number of sources. In this work, we assume the number of trajectories to be known; thus, we set λ = 0 and develop greedy iterative algorithms 47 . From the solution ∆ * , we obtain estimates for the trajectory parameters W and their corresponding amplitudes using (13).…”
Section: A Beurling Lassomentioning
confidence: 99%
“…Gridless localization has been formulated as an atomic norm minimization (ANM) problem and solved using semi-definite programming in 1D and 2D scenarios [32][33][34][35][36][37][38][39][40][41] . Additionally, gridless methods have been applied for nonuniform arrays and wideband processing [42][43][44][45][46][47] . The Newtonized OMP (NOMP) algorithm is a variation of OMP that employs Newton steps to refine source parameters in each iteration 48 .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Classical beamforming methods, proved useful in practice, are based on “Fourier transform in direction domain” and can obtain high resolution on the promise that the input SNR is high enough or the datasheet is long enough. Among the beamforming methods, conventional beamforming (CBF) has lower resolution ratio but higher adaptability since CBF uses phase deviation without prior known number of sources, which is needed in high-resolution beamforming methods, such as Minimum Variance Distortion-less Response (MVDR) and Multiple Signal Classification (MUSIC) [ 2 , 3 ]. Recently, conversion methods of time-frequency are boosting, with better and faster performance to obtain frequency.…”
Section: Introductionmentioning
confidence: 99%
“…The general classical beamforming method is based on Fourier transform in the directional domain, where the input signal-to-noise ratio condition must be satisfied to ensure high resolution. The conventional beamforming method (CBF) achieves better adaptability by exploiting the phase deviation without prior knowledge of the number of signal sources, such as minimum variance distortion-free response (MVDR) and multiple signal classification (MUSIC) [ 4 , 5 ]. Although there are many beamforming methods for long-distance signals, the conditions of a high signal-to-noise ratio generally cannot be met.…”
Section: Introductionmentioning
confidence: 99%