Title: Solution Strategies for Linear Inverse Problems in Spatial Audio Signal Processing
Authors: Bai, Mingsian R.
Chung, Chun
Wu, Po-Chen
Chiang, Yi-Hao
Yang, Chun-May
電子工程學系及電子研究所
Department of Electronics Engineering and Institute of Electronics
Keywords: inverse problems;Tikhonov regularization;compressive sensing (CS);convex optimization (CVX);focal underdetermined system solver (FOCUSS);steepest descent (SD);Newton's method (NT);conjugate gradient (CG);golden section search (GSS)
Issue Date: 1-Jun-2017
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.
URI: http://dx.doi.org/10.3390/app7060582
http://hdl.handle.net/11536/145731
ISSN: 2076-3417
DOI: 10.3390/app7060582
Journal: APPLIED SCIENCES-BASEL
Volume: 7
Issue: 6
Begin Page: 0
End Page: 0
Appears in Collections:Articles


Files in This Item:

  1. b2e6d268eee2044b0e4970634161cb99.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.