Fast Transforms for Acoustic Imaging—Part II: Applications

In Part I [“Fast Transforms for Acoustic Imaging-Part I: Theory,” IEEE Transactions on Image Processing], we introduced the Kronecker array transform (KAT), a fast transform for imaging with separable arrays. Given a source distribution, the KAT produces the spectral matrix which would be measured by a separable sensor array. In Part II, we establish connections between the KAT, beamforming and 2-D convolutions, and show how these results can be used to accelerate classical and state of the art array imaging algorithms. We also propose using the KAT to accelerate general purpose regularized least-squares solvers. Using this approach, we avoid ill-conditioned deconvolution steps and obtain more accurate reconstructions than previously possible, while maintaining low computational costs. We also show how the KAT performs when imaging near-field source distributions, and illustrate the trade-off between accuracy and computational complexity. Finally, we show that separable designs can deliver accuracy competitive with multi-arm logarithmic spiral geometries, while having the computational advantages of the KAT.

[1]  Harry L. Van Trees,et al.  Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory , 2002 .

[2]  Stephen P. Boyd,et al.  An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares , 2007, IEEE Journal of Selected Topics in Signal Processing.

[3]  D. Donoho,et al.  Atomic Decomposition by Basis Pursuit , 2001 .

[4]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[5]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[6]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[7]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[8]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[9]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[10]  S. Haykin,et al.  Nonredundant arrays , 1986, Proceedings of the IEEE.

[11]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[12]  Flavio P. Ribeiro,et al.  Fast Transforms for Acoustic Imaging— Part I: Theory , 2011, IEEE Transactions on Image Processing.

[13]  P. Stoica,et al.  Sparsity constrained deconvolution approaches for acoustic source mapping. , 2008, The Journal of the Acoustical Society of America.

[14]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[15]  P. Strevens Iii , 1985 .

[16]  Chengbo Li An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing , 2010 .

[17]  Daniel Blacodon,et al.  Spectral estimation method for noisy data using a noise reference , 2011 .

[18]  Robert P. Dougherty,et al.  Extensions of DAMAS and Benefits and Limitations of Deconvolution in Beamforming , 2005 .

[19]  J. Capon High-resolution frequency-wavenumber spectrum analysis , 1969 .