The MUSIC algorithm for sparse objects: a compressed sensing analysis

DOI10.1088/0266-5611/27/3/035013MaRDI QIDQ3086014zbMATH OpenOpenAlexFDO

Authors Albert Fannjiang

Publication date 29 March 2011

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.1678

zbMATH Keywords

compressed sensing techniquesHelmholtz equationinverse scatteringMUSIC

Mathematics Subject Classification ID

Inverse problems for PDEs (35R30) Computing methodologies for image processing (68U10) Inverse problems (including inverse scattering) in optics and electromagnetic theory (78A46)

Abstract: The MUSIC algorithm, with its extension for imaging sparse {em extended} objects, is analyzed by compressed sensing (CS) techniques. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant (RIC) are employed to establish sufficient conditions for the exact localization by MUSIC with or without the presence of noise. In the noiseless case, the sufficient condition gives an upper bound on the numbers of random sampling and incident directions necessary for exact localization. In the noisy case, the sufficient condition assumes additionally an upper bound for the noise-to-object ratio in terms of the RIC and the condition number of objects. Rigorous comparison of performance between MUSIC and the CS minimization principle, Lasso, is given. In general, the MUSIC algorithm guarantees to recover, with high probability, $s$ scatterers with $n=cO(s^2)$ random sampling and incident directions and sufficiently high frequency. For the favorable imaging geometry where the scatterers are distributed on a transverse plane MUSIC guarantees to recover, with high probability, $s$ scatterers with a median frequency and $n=cO(s)$ random sampling/incident directions. Numerical results confirm that the Lasso outperforms MUSIC in the well-resolved case while the opposite is true for the under-resolved case. The latter effect indicates the superresolution capability of the MUSIC algorithm. Another advantage of MUSIC over the Lasso as applied to imaging is the former's flexibility with grid spacing and guarantee of {em approximate} localization of sufficiently separated objects in an arbitrarily fine grid. The error can be bounded from above by $cO(lambdas)$ for general configurations and $cO(lambda)$ for objects distributed in a transverse plane.

Recommendations

• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• Robust multifrequency imaging with MUSIC
• Spectral compressive sensing
• Data structures for robust multifrequency imaging
• The linear sampling method and the MUSIC algorithm

Cited in

(15)

• A sparsity-constrained sampling method with applications to communications and inverse scattering
• A novel study on the MUSIC-type imaging of small electromagnetic inhomogeneities in the limited-aperture inverse scattering problem
• On rank awareness, thresholding, and MUSIC for joint sparse recovery
• Stable super-resolution limit and smallest singular value of restricted Fourier matrices
• Data structures for robust multifrequency imaging
• Super-resolution radar
• Robust multifrequency imaging with MUSIC
• Super-resolution from noisy data
• Quantitative signal subspace imaging
• High-resolution, quantitative signal subspace imaging for synthetic aperture radar
• Recovery analysis of damped spectrally sparse signals and its relation to MUSIC
• Nonlinear Iterative Hard Thresholding for Inverse Scattering
• Mathematical foundation of sparsity-based multi-snapshot spectral estimation
• Incorporating a priori information into MUSIC-algorithms and analysis
• MUSIC for single-snapshot spectral estimation: stability and super-resolution

This page was built for publication: The MUSIC algorithm for sparse objects: a compressed sensing analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086014)