Skip to main content

Accelerating the clean-SC and CMF beamforming deconvolution methods using neural gridcompression

Buy Article:

$15.00 + tax (Refund Policy)

Deconvolution algorithms can considerably improve the spatial resolution of sound sources when applied to beamforming techniques. However, they are often associated with additional computation time, which can be prohibitive for real-time applications, especially when using high-resolution scanning grids. Additionally, depending on the size of the problem, full deconvolution may not even be possible due to memory constraints. Recently, it has been shown that a neural network approach to compress the possible source directions can speed up the results of the DAMAS deconvolution algorithm by orders of magnitude. In this paper, this neural grid compression preprocessing is evaluated for the CLEAN-SC and CMF deconvolution techniques, and it is shown that it is possible to achieve dramatic speedups without significant loss of accuracy and even improve the results in some examples, especially for the CLEAN-SC technique.

The requested document is freely available to subscribers. Users without a subscription can purchase this article.

Sign in

Document Type: Research Article

Affiliations: 1: HEAD acoustics GmbH 2: RWTH Aachen Institute for Hearing Technology and Acoustics

Publication date: 04 October 2024

More about this publication?
  • The Noise-Con conference proceedings are sponsored by INCE/USA and the Inter-Noise proceedings by I-INCE. NOVEM (Noise and Vibration Emerging Methods) conference proceedings are included. All NoiseCon Proceedings one year or older are free to download. InterNoise proceedings from outside the USA older than 10 years are free to download. Others are free to INCE/USA members and member societies of I-INCE.

  • Membership Information
  • INCE Subject Classification
  • Ingenta Connect is not responsible for the content or availability of external websites
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content