paper-with-me

홈 › Papers

Multiple Hankel matrix rank minimization for audio inpainting

2023-03-31 · Pavel Záviška, Pavel Rajmic, Ondřej Mokrý

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.

📄 PDF Abstract BibTeX arXiv:2303.18023

Code (0)

등록된 구현이 없습니다.

Tasks

Audio declippingAudio inpainting

Methods 이 논문이 사용한 방법론

Inpainting Train a convolutional neural network to generate the contents of an arbitrary image region conditioned on its surroundings.

Similar Papers 제목 키워드 기반

Low-Rank Approximation of Weighted Tree Automata

2015-11-04 · Guillaume Rabusseau, Borja Balle, Shay B. Cohen

We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposi…

Extracting Weighted Automata for Approximate Minimization in Language Modelling

2021-06-05 · Clara Lacroce, Prakash Panangaden, Guillaume Rabusseau

In this paper we study the approximate minimization problem for language modelling. We assume we are given some language model as a black box. The objective is to obtain a weighted finite automaton (WFA) that fits within…

Language ModelingLanguage Modelling

Harmonic Retrieval Using Weighted Lifted-Structure Low-Rank Matrix Completion

2023-11-08 · Mohammad Bokaei, Saeed Razavikia, Stefano Rini, Arash Amini 외

In this paper, we investigate the problem of recovering the frequency components of a mixture of $K$ complex sinusoids from a random subset of $N$ equally-spaced time-domain samples. Because of the random subset, the sam…

Low-Rank Matrix CompletionMatrix CompletionRetrieval

On Low-Rank Hankel Matrix Denoising

2020-12-14 · Mingzhou Yin, Roy S. Smith

The low-complexity assumption in linear systems can often be expressed as rank deficiency in data matrices with generalized Hankel structure. This makes it possible to denoise the data by estimating the underlying struct…

Denoising

One-shot Generative Prior in Hankel-k-space for Parallel Imaging Reconstruction

2022-08-15 · Hong Peng, Chen Jiang, Jing Cheng, Minghui Zhang 외

Magnetic resonance imaging serves as an essential tool for clinical diagnosis. However, it suffers from a long acquisition time. The utilization of deep learning, especially the deep generative models, offers aggressive …