2000 character limit reached
Multiple Hankel matrix rank minimization for audio inpainting (2303.18023v2)
Published 31 Mar 2023 in eess.AS
Abstract: Sasaki et al. (2018) presented an efficient audio declipping algorithm, based on the properties of Hankel-structure matrices constructed from time-domain signal blocks. We adapt their approach to solving the audio inpainting problem, where samples are missing in the signal. We analyze the algorithm and provide modifications, some of them leading to an improved performance. Overall, it turns out that the new algorithms perform reasonably well for speech signals but they are not competitive in the case of music signals.