Solution strategies for linear inverse problems in spatial audio signal processing

Mingsian R. Bai*, Chun Chung, Po Chen Wu, Yi Hao Chiang, Chun-May Yang

*Corresponding author for this work

Research output: Contribution to journalArticle

11 Scopus citations

Abstract

The aim of this study was to compare algorithms for solving inverse problems generally encountered in spatial audio signal processing. Tikhonov regularization is typically utilized to solve overdetermined linear systems in which the regularization parameter is selected by the golden section search (GSS) algorithm. For underdetermined problems with sparse solutions, several iterative compressive sampling (CS) methods are suggested as alternatives to traditional convex optimization (CVX) methods that are computationally expensive. The focal underdetermined system solver (FOCUSS), the steepest descent (SD) method, Newton's (NT) method, and the conjugate gradient (CG) method were developed to solve CS problems more efficiently in this study. These algorithms were compared in terms of problems, including source localization and separation, noise source identification, and analysis and synthesis of sound fields, by using a uniform linear array (ULA), a uniform circular array (UCA), and a random array. The derived results are discussed herein and guidelines for the application of these algorithms are summarized.

Original languageEnglish
Article number582
JournalApplied Sciences (Switzerland)
Volume7
Issue number6
DOIs
StatePublished - 5 Jun 2017

Keywords

  • Compressive sensing (CS)
  • Conjugate gradient (CG)
  • Convex optimization (CVX)
  • Focal underdetermined system solver (FOCUSS)
  • Golden section search (GSS)
  • Inverse problems
  • Newton's method (NT)
  • Steepest descent (SD)
  • Tikhonov regularization

Fingerprint Dive into the research topics of 'Solution strategies for linear inverse problems in spatial audio signal processing'. Together they form a unique fingerprint.

  • Cite this