Solution Strategies for Linear Inverse Problems in Spatial Audio Signal Processing
AbstractThe 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. View Full-Text
Share & Cite This Article
Bai, M.R.; Chung, C.; Wu, P.-C.; Chiang, Y.-H.; Yang, C.-M. Solution Strategies for Linear Inverse Problems in Spatial Audio Signal Processing. Appl. Sci. 2017, 7, 582.
Bai MR, Chung C, Wu P-C, Chiang Y-H, Yang C-M. Solution Strategies for Linear Inverse Problems in Spatial Audio Signal Processing. Applied Sciences. 2017; 7(6):582.Chicago/Turabian Style
Bai, Mingsian R.; Chung, Chun; Wu, Po-Chen; Chiang, Yi-Hao; Yang, Chun-May. 2017. "Solution Strategies for Linear Inverse Problems in Spatial Audio Signal Processing." Appl. Sci. 7, no. 6: 582.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.