Multiple Hankel matrix rank minimization for audio inpainting
arXiv:2303.18023 · doi:10.1109/TSP59544.2023.10197741
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.
References in corpus (7)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- GACELA -- A generative adversarial context encoder for long audio inpainting
- A survey and an extensive evaluation of popular audio declipping methods
- Introducing SPAIN (SParse Audio INpainter)
- Audio Inpainting: Revisited and Reweighted
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Soft Smoothness for Audio Inpainting Using a Latent Matrix Model in Delay-embedded Space