|Title||Sparsity Constrained Deconvolution Approaches for Acoustic Source Mapping|
|Publication Type||Journal Article|
|Year of Publication||2008|
|Authors||Yardibi, T., J. Li, P. Stoica, and L. Cattafesta|
|Journal||J. Acous. Soc. Amer.|
Using microphone arrays for estimating source locations and strengths has become common practice in aeroacoustic applications. The classical delay-and-sum approach suffers from low resolution and high sidelobes and the resulting beamforming maps are difficult to interpret. The deconvolution approach for the mapping of acoustic sources (DAMAS) deconvolution algorithm recovers the actual source levels from the contaminated delay-and-sum results by defining an inverse problem that can be represented as a linear system of equations. In this paper, the deconvolution problem is carried onto the sparse signal representation area and a sparsity constrained deconvolution approach (SC-DAMAS) is presented for solving the DAMAS inverse problem. A sparsity preserving covariance matrix fitting approach (CMF) is also presented to overcome the drawbacks of the DAMAS inverse problem. The proposed algorithms are convex optimization problems. Our simulations show that CMF and SC-DAMAS outperform DAMAS and as the noise in the measurements increases, CMF works better than both DAMAS and SC-DAMAS. It is observed that the proposed algorithms converge faster than DAMAS. A modification to SC-DAMAS is also provided which makes it significantly faster than DAMAS and CMF. For the correlated source case, the CMF-C algorithm is proposed and compared with DAMAS-C. Improvements in performance are obtained similar to the uncorrelated case.