2019 27th European Signal Processing Conference (EUSIPCO) 2019
DOI: 10.23919/eusipco.2019.8902560
|View full text |Cite
|
Sign up to set email alerts
|

Introducing SPAIN (SParse Audio INpainter)

Abstract: A novel sparsity-based algorithm for audio inpainting is proposed. It is an adaptation of the SPADE algorithm by Kitić et al., originally developed for audio declipping, to the task of audio inpainting. The new SPAIN (SParse Audio INpainter) comes in synthesis and analysis variants. Experiments show that both A-SPAIN and S-SPAIN outperform other sparsity-based inpainting algorithms. Moreover, A-SPAIN performs on a par with the state-of-the-art method based on linear prediction in terms of the SNR, and, for lar… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 19 publications
(27 citation statements)
references
References 19 publications
0
27
0
Order By: Relevance
“…Our audio inpainting approach is inspired by the recently introduced algorithm SParse Audio INpainter (SPAIN) [17] and extends our work [34]. SPAIN is an adaptation of the so-called SParse Audio DEclipper (SPADE) algorithm [28] to the inpainting problem and exploits sparsity with respect to tight (Gabor) frames [35], [36].…”
Section: A Motivation and Contributionsmentioning
confidence: 93%
See 3 more Smart Citations
“…Our audio inpainting approach is inspired by the recently introduced algorithm SParse Audio INpainter (SPAIN) [17] and extends our work [34]. SPAIN is an adaptation of the so-called SParse Audio DEclipper (SPADE) algorithm [28] to the inpainting problem and exploits sparsity with respect to tight (Gabor) frames [35], [36].…”
Section: A Motivation and Contributionsmentioning
confidence: 93%
“…SPAIN is an adaptation of the so-called SParse Audio DEclipper (SPADE) algorithm [28] to the inpainting problem and exploits sparsity with respect to tight (Gabor) frames [35], [36]. In [17], both synthesis and analysis models are discussed and an efficient implementation with segment-wise application of the algorithm is presented. More specifically, the time-domain signal is segmented using overlapping Hann windows, sparsity with respect to an overcomplete Discrete Fourier Transform (DFT) dictionary is exploited, and the restored blocks are combined using an overlap-add scheme.…”
Section: A Motivation and Contributionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Dequantization is another example: each quantized signal sample has its origin in one of the non-overlapping intervals and our lemma is suitable to find signal coefficients that are consistent with the quantized observation [58]. As the last example, we name the signal inpainting problem, where a portion of samples is completely missing, while the others are considered reliable [35,50,59]. In this problem, nothing is directly known about the missing samples, thus the set Γ is defined such that the lower and upper bounds are set to minus and plus infinity, respectively; with this definition, projection lemma can be used here as well.…”
Section: Other Applicationsmentioning
confidence: 99%