Algorithms for audio inpainting based on probabilistic nonnegative matrix factorization
원문 초록
Audio inpainting, i.e., the task of restoring missing or occluded audio signal samples, usually relies on sparse representations or autoregressive modeling. In this paper, we propose to structure the spectrogram with nonnegative matrix factorization (NMF) in a probabilistic framework. First, we treat the missing samples as latent variables, and derive two expectation-maximization algorithms for estimating the parameters of the model, depending on whether we formulate the problem in the time- or time-frequency domain. Then, we treat the missing samples as parameters, and we address this novel problem by deriving an alternating minimization scheme. We assess the potential of these algorithms for the task of restoring short- to middle-length gaps in music signals. Experiments reveal great convergence properties of the proposed methods, as well as competitive performance when compared to state-of-the-art audio inpainting techniques.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Janssen 2.0: Audio Inpainting in the Time-frequency Domain
Tweaking autoregressive methods for inpainting of gaps in audio signals
Diffusion-Based Audio Inpainting
Msanii: High Fidelity Music Synthesis on a Shoestring Budget
Solving Audio Inverse Problems with a Diffusion Model
Deep Audio Waveform Prior
토론
이 논문과 연결된 포럼 글이 아직 없습니다.