2000 character limit reached
Multiple Hankel matrix rank minimization for audio inpainting
Published 31 Mar 2023 in eess.AS | (2303.18023v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.