Alternating minimisation for glottal inverse filtering
dc.contributor | Aalto-yliopisto | fi |
dc.contributor | Aalto University | en |
dc.contributor.author | Bleyer, Ismael Rodrigo | en_US |
dc.contributor.author | Lybeck, Lasse | en_US |
dc.contributor.author | Auvinen, Harri | en_US |
dc.contributor.author | Airaksinen, Manu | en_US |
dc.contributor.author | Alku, Paavo | en_US |
dc.contributor.author | Siltanen, Samuli | en_US |
dc.contributor.department | Department of Signal Processing and Acoustics | en |
dc.contributor.groupauthor | Speech Communication Technology | en |
dc.contributor.organization | University of Helsinki | en_US |
dc.date.accessioned | 2018-06-18T09:20:31Z | |
dc.date.available | 2018-06-18T09:20:31Z | |
dc.date.issued | 2017-05-17 | en_US |
dc.description.abstract | A new method is proposed for solving the glottal inverse filtering (GIF) problem. The goal of GIF is to separate an acoustical speech signal into two parts: the glottal airflow excitation and the vocal tract filter. To recover such information one has to deal with a blind deconvolution problem. This ill-posed inverse problem is solved under a deterministic setting, considering unknowns on both sides of the underlying operator equation. A stable reconstruction is obtained using a double regularization strategy, alternating between fixing either the glottal source signal or the vocal tract filter. This enables not only splitting the nonlinear and nonconvex problem into two linear and convex problems, but also allows the use of the best parameters and constraints to recover each variable at a time. This new technique, called alternating minimization glottal inverse filtering (AM-GIF), is compared with two other approaches: Markov chain Monte Carlo glottal inverse filtering (MCMC-GIF), and iterative adaptive inverse filtering (IAIF), using synthetic speech signals. The recent MCMC-GIF has good reconstruction quality but high computational cost. The state-of-the-art IAIF method is computationally fast but its accuracy deteriorates, particularly for speech signals of high fundamental frequency (F0). The results show the competitive performance of the new method: With high F0, the reconstruction quality is better than that of IAIF and close to MCMC-GIF while reducing the computational complexity by two orders of magnitude. | en |
dc.description.version | Peer reviewed | en |
dc.format.extent | 19 | |
dc.format.mimetype | application/pdf | en_US |
dc.identifier.citation | Bleyer, I R, Lybeck, L, Auvinen, H, Airaksinen, M, Alku, P & Siltanen, S 2017, ' Alternating minimisation for glottal inverse filtering ', Inverse Problems, vol. 33, no. 6, 065005 . https://doi.org/10.1088/1361-6420/aa6eb8 | en |
dc.identifier.doi | 10.1088/1361-6420/aa6eb8 | en_US |
dc.identifier.issn | 0266-5611 | |
dc.identifier.issn | 1361-6420 | |
dc.identifier.other | PURE UUID: 9d1c7eb6-da91-4624-b3d8-14cf2607eb3a | en_US |
dc.identifier.other | PURE ITEMURL: https://research.aalto.fi/en/publications/9d1c7eb6-da91-4624-b3d8-14cf2607eb3a | en_US |
dc.identifier.other | PURE LINK: http://www.scopus.com/inward/record.url?scp=85020039048&partnerID=8YFLogxK | en_US |
dc.identifier.other | PURE FILEURL: https://research.aalto.fi/files/21546890/Bleyer_Alternating_minimisation_2017_Inverse_Problems_33_065005.pdf | en_US |
dc.identifier.uri | https://aaltodoc.aalto.fi/handle/123456789/31932 | |
dc.identifier.urn | URN:NBN:fi:aalto-201806183350 | |
dc.language.iso | en | en |
dc.relation.ispartofseries | Inverse Problems | en |
dc.relation.ispartofseries | Volume 33, issue 6 | en |
dc.rights | openAccess | en |
dc.subject.keyword | alternating minimization | en_US |
dc.subject.keyword | deterministic | en_US |
dc.subject.keyword | double regularization | en_US |
dc.subject.keyword | glottal airflow | en_US |
dc.subject.keyword | glottal inverse filtering | en_US |
dc.subject.keyword | ill-posed problems | en_US |
dc.subject.keyword | wavelets | en_US |
dc.title | Alternating minimisation for glottal inverse filtering | en |
dc.type | A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä | fi |
dc.type.version | publishedVersion |