4.5 Article

Iterative algorithm for solving acoustic source characterization problems under block sparsity constraints

Journal

JOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA
Volume 143, Issue 6, Pages 3747-3757

Publisher

ACOUSTICAL SOC AMER AMER INST PHYSICS
DOI: 10.1121/1.5042221

Keywords

-

Funding

  1. Ministry of Science and Technology (MOST) in Taiwan, Republic of China [105-2221-E-007-030-MY3]
  2. Telecom Electroacoustics Audio laboratory (TEA lab)

Ask authors/readers for more resources

In this paper, an iterative Compressive Sensing (CS) algorithm is proposed for acoustical source characterization problems with block sparsity constraints. Source localization and signal separation are accomplished in a unified CS framework. The inverse problem is formulated with the Equivalent Source Method as a linear underdetermined system of equations. As conventional approaches based on convex optimization can be computationally expensive and fail to deal with continuously distributed sources, the proposed approach that is adapted from the Newton's method and is augmented with a special pruning procedure is capable of solving the inverse problem far more efficiently with comparable accuracy. The pruning procedure employs a binary mask that admits sparsity constraints of two-dimensional block sources. The binary mask is heuristic in that it tends to promote nonzero positive source magnitudes. In each iteration, the source amplitude vector is on one hand updated by the Newton's method and on the other hand pruned with the binary mask. With the pruning procedure, the source magnitudes become increasingly sparse and clustered such that the block characteristics are enhanced. In the post-processing phase, particle velocity is calculated on the basis of the equivalent source amplitudes. Numerical and experimental investigations are conducted to validate the proposed technique. The results have demonstrated the efficacy of the proposed Compressive Newton's method in imaging block sources and extracting signal waveforms with little computational cost, as compared to a convex optimization package. (C) 2018 Acoustical Society of America.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available