D EEP
A UDIO P RIOR
Anonymous authors
Paper under double-blind review
A BSTRACT
Deep convolutional neural networks are known to specialize in distilling compact and robust prior from a large amount of data.
We are interested in applying deep networks in the absence of training dataset.
In this paper, we introduce deep audio prior (DAP) which leverages the structure of a network and the temporal information in a single audio ﬁle.
Speciﬁcally, we demonstrate that a randomly-initialized neural network can be used with carefully designed audio prior to tackle challenging audio problems such as universal blind source separation, interactive audio editing, audio texture synthesis, and audio co-separation.
To understand the robustness of the deep audio prior, we construct a benchmark dataset Universal-150 for universal sound source separation with a diverse set of sources.
We show superior audio results than previous work on both qualitative and quantitative evaluations.
We also perform thorough ablation study to validate our design choices.
https://iclr-dap.github.io/Deep-Audio-Prior/
I NTRODUCTION
Typically, a deep neural network distills robust priors from a large amount of labeled or unlabeled data (Deng et al., 2009; Jansen et al., 2018).
In audio research, neural networks such as VGGish (Hershey et al., 2017) and Wave-U-Net (Stoller et al., 2018) have shown great success in audio classiﬁcation, audio source separation, and many other challenging tasks.
While large audio datasets have greatly improved supervised training, the collection and especially the cleaning of a large amount of audio data still remain an open challenge (Fonseca et al., 2017).
For example, in
AudioSet (Gemmeke et al., 2017), one of the popular audio datasets, we often ﬁnd audios/videos that contain content beyond what the label speciﬁes 1 .
In this paper, we combine the power of deep neural networks and temporal prior in audio without any external training data.
Similar ideas have been explored in deep image prior (DIP) (Ulyanov et al., 2018).
Double-DIP from Gandelsman et al.
(2019) further showed that it is possible to achieve robust unsupervised image decomposition from a single-image input, without pre-training on any data.
Deep Audio Prior (DAP)’s capability to train on a single audio ﬁle has several advantages.
First, with proper selection of the audio priors, we show that DAP generalizes well to a wide variety of unseen types of data.
Second, our training process is fully unsupervised and therefore make it possible to pre-process large volumes of data in the wild.
Last but not least, we show several novel applications that are only possible because of the unique features of DAP, including universal source separation, interactive editing, audio texture synthesis, and audio co-separation.
Coherence and discontinuity in audio.
Domain gap between audio and visual images precludes direct adoption of the image priors.
Many assumptions or priors that are true for images no longer hold for audio.
By nature, audio signals exhibit strong temporal coherence, e.g. one’s voice changes smoothly (See A → B in inset).
Since images tend to have more spatial patterns, most existing deep image priors have focused on how to encapsulate the spatial redundancy.
Another challenge speciﬁc to audio is the activation discontinuity.
Unlike in videos where an object moves continuously in the scene, a sound source can make sound or turn complete silence at any given time (see A → C in inset).
Our proposed deep audio prior framework has the following main contributions:
• A temporally coherent source generator that can reproduce a wide spectrum of natural sound sources including human speech, musical instruments, animal sounds, etc.
[Figure]
• A novel mask activation scheme to enable and disable sources with frequency binning and without temporal dependence.
• We demonstrated the effectiveness of DAP in several challenging applications, including universal audio source separation, interactive mask-based editing, audio texture synthesis, and audio co-separation.
• We also introduce Universal-150, a benchmark dataset on blind source separation for universal sound sources.
We showed that DAP outperforms other blind source separation (BSS) methods in multiple numerical metrics.
D EEP A UDIO P RIOR F RAMEWORK
Deep Audio Prior is an unsupervised blind source separation framework.
More speciﬁcally, DAP does not train on any extra data other than the input audio mixture.
Similar to image foreground and background segmentation, audio blind two-source separation can be expressed as:
[Equation]
where S 1 and S 2 are two audio generator networks, M 1 and M 2 are two mask networks, z 1 , zand g 1 , g 2 are sampled from random distributions.
Our method works in Time-Frequency (T-F) spectrogram space (Cohen, 1995).
All the input and output variables are of dimension F × T .
Waveforms are transformed into spectrograms by Short-Time Fourier Transform (STFT) with a frame size of 1022 and hop size of 172, and audio sampling rate is 11000 Hz.
Figure 1 shows an overview of our framework.
The intuition for our single-audio source separation is inspired by single-image decomposition: it is much easier for two generator networks ( S 1 and S 2 ) to learn two distinct sound sources respectively, rather than forcing one of the generators to learn the mixture.
Gandelsman et al.
(2019) analyzed this in terms of complex mixture versus simple individual components.
In audio, as shown in §3.1, we show that networks tend to quickly learn patterns from two distinct sources.
Reconstruction Loss Let S ∗ 1 = S 1 ( z 1 ) ∗ M 1 ( g 1 ) and S ∗ 2 =
S 2 ( z 2 ) ∗ M 2 ( g 2 ) , then we have
S ∗ mixture =
S ∗ 1 + S ∗ 2 .
Clearly, when combining the separated sounds S ∗ 1 and S ∗ 2 , we should obtain the original sound mixture S mixture .
The data ﬁdelity term is expressed as a reconstruction loss, l rec , which will push the combination of the two separated sounds to be close to the original sound mixture.
[Equation]
2. T EMPORALLY C OHERENT AND D YNAMIC S OURCE G ENERATOR
Temporally Coherent Source Generation Sound signals from the same source across time would be similar (Rosen, 1992).
To explicitly model the temporal property, we use multiple audio frames with temporal consistent noise as inputs for each sound source.
We split the S mixture into N frames along the time axis and obtain { S i mixture } Ni =1 .
Accordingly, we use n noise input pairs { z i 1 , z i 2 } Ni =1 to predict the corresponding sounds { S 1 ( z i 1 ) , S 2 ( z i 2 ) } Ni =1 .
For the rest of this paper, we will omit the underscript when there is no confusion, i.e. z i instead of z i 1 .
To explicitly enforce the temporal coherence, we impose strong correlations on input noises: z
[Equation]
n [Equation] where ∆ u i is a random noise sampled from an uniform distribution with a variance signiﬁcantly lower than that of Gaussian noise n ∗ initialization of z 1 .
Since we use shared networks S 1 and
S 2 across different frames for predicting individual sounds and the noise inputs are temporally consistent, which will enforce the network to predict temporal consistent sounds.
A similar idea was also adopted in (Gandelsman et al., 2019) to preserve video coherence but they use the noise to predict masks.
We also employ a temporal continuity loss function to further enforce it by pushing the absolute of gradients along time to be small (Chambolle, 2004):
[Equation]
Dynamic Source Generation Audio signals can also have dynamic patterns with large variations.
Since values in z i − z
i − 1 = ∆ u
i are very small by construction, the temporally consistent noise can only handle small variations and is not capable of capturing temporally dynamic sound patterns.
To preserve the temporally consistent patterns in predictions and also hallucinate dynamic patterns, in spirit of curriculum learning (Bengio et al., 2009), we gradually add dynamic noise into inputs as we progress more training iterations:
[Equation]
where the t denotes optimization iteration, and n i refers to a random Gaussian noise.
Unlike the temporal consistent noise in (3) that have a constant n ∗ as initialization, n i is independently sampled for each frame i .
To balance the n ∗ and n i throughout our training iterations, we introduce a coefﬁcient α ( t ) :
[Equation]
[Table]
[Equation]
where T 1 and T 2 are two thresholds and T 2 > T 1 .
If t < T 1 , only a temporally shared constant noise n ∗ is used; if T 1 ≤ t < T 2 , the dynamic sampled noise n i will be gradually added; if t > T 2 , only a dynamic noise is used.
The noise input design will ﬁrst let the model predict stable temporally consistent sound patterns and then push the model to capture large variations in spectrograms to reduce the reconstruction loss.
Note that α ( t ) is not continuous with respect to t (see red curve in inset).
In practice, we found this abrupt change in α ( t ) improves the ability to capture dynamic audio change.
See more discussion in §4.
Frequency Domain Exclusion We assume that two different sounds S ∗ 1 and S ∗ 2 are dissimilar.
To enforce the constraint, we utilize an exclusion loss function from Zhang et al.
(2018) in which it is formulated as the product of normalized gradient ﬁelds of the two sound predictions at L spatial resolutions:
[Equation]
where λ 1 and λ 2 are regularizers, n the spatial patch index, || · || F the Frobenius norm, (cid:12) denotes element-wise multiplication. We set L = 3 , λ 1 = (cid:113) ||∇ y || F ||∇ x || F , and λ 2 = (cid:113)
||∇ x || F ||∇ y || F .
2. 1D M ASK C ONSTRAINTS FOR A UDIO
Sound sources will not always make sounds all the time, which would break the temporal consistency in the spectrogram domain.
To address this issue, we introduce audio masks to activate sounding spectrum regions and deactivate silent regions.
If a source is sounding at a time, the spectrum bin at the time should be activated.
Based on the observation, mask values within the same temporal bin should be consistent and binary.
Namely, if a dog barking sound is present, it should appear across all frequency range under the same timestamp.
Therefore, we force the mask within the same temporal bin to be consistent: M i (0 , q ) =
M i (1 , q ) = ...
=
M i ( F − 1 , q ) = m qi , where i refers to i -th sound source, q ∈ { 0 , 1 ..., T } , F and T are height (frequency axis) and width (time axis) of the spectrogram M .
In our implementation, we use a max pooling operator to aggregate the mask content along frequency-coordinate and generate mask value m qi using a Sigmoid function.
m qi represents the mask for i -th source at time q .
We deﬁne m qi to be a continuous variable for ease of optimization and will enforce an extra binary loss term.
Non-Zero Masks Furthermore, at any time, if there is a sound in S mixture , at least one of the masks should be activated.
To this end, we introduce a nonzero mask loss term:
[Equation]
where (cid:15) =
10 − 6 for numerical stability and σ = 1 is a margin value.
The margin value is to ensure when the sum of mask activation is already larger than the σ , the loss will not continue to push the mask values.
w q is to suppress this loss term if there is no sound in S mixture at time q .
Moreover, in our observations, we found that masks are either fully activated or fully deactivated.
Very rarely would a sound source be at 50% activation level.
Therefore, we introduce a differential loss term to encourage the mask networks to generate binary masks: l binary =
(cid:80) i ( (cid:15)
+ (cid:80) p,q | M i ( p, q ) − 0 .
5 | ) − 1 , where again (cid:15) =
10 − 6 is used to avoid numerical issues.
The l binary will force the mask values to be as far away as possible to 0 . 5 , which means they are close to either 0 or 1 .
2. W ALKTHROUGH ON S YNTHETIC S EPARATION E XAMPLES
With all the pieces together, our total loss is deﬁned as:
[Equation]
We optimize the networks in an end-to-end manner with all the loss functions.
We empirically keep the weights for all loss terms the same, with the only exception being l binary has a 0 .
01 factor.
To validate the implementation of our algorithm, we generate two types of synthetic spectrograms.
(i) Single-frequency band fake sounds We generate a synthetic mixture where each of the two audio sources is producing a ﬂat tone at a single frequency.
For this test, since we know the spectrogram at different segment will always produce the same output (each sound source is just a ﬂat bar), we set the input noise z
=
z 21 = · · · = z n 1 for sound source 1 and the same for source 2.
The top two rows from Figure 2 show that our DAP achieves perfect prediction on both the source generators and masks.
[Figure] [Figure]
Qualitatively, DAP signiﬁcantly outperforms all the other blind separation methods.
For full results, please check out our project page: https://iclr-dap.github.io/Deep-Audio-Prior/ (ii) Curved input sounds Our next test is to validate if our DAP framework can handle temporally coherent spectrogram changes.
Two shifted cosine curves are combined together as input to our separation pipeline (see bottom two rows in Figure 2).
We set the input noise according to equation (3).
Again, our DAP framework achieves the desired separation of sources and masks.
A PPLICATIONS
Next, we present several challenging applications with DAP.
For the best experience, please use
Adobe PDF Reader 2 or visit our anonymous webpage 3 to listen to our audio results.
Unless speciﬁed otherwise, all the experiments for the same application are run with the same set of parameters.
3. U NIVERSAL B LIND S OURCE S EPARATION
Given a sound mixture S mixture , universal blind source separation aims to separate individual sounds from the sound mixture without using any external data.
Universal blind separation is challenging because the input audio can be in arbitrary domain, not just commonly studied speech or music domains.
Universal-150 Audio Benchmark
To the best of our knowledge, there is no publicly available universe audio source separation dataset .
Therefore, we built such a dataset that contains 150 audio mixtures and each sample is a two-sound mixture.
These mixture samples come from pairs of 30 unique sounds from YouTube and ESC50 sound classiﬁcation dataset (Piczak, 2015) covering a large range of sound categories appeared in our daily life, such as animal ( e.g., dog, cat, and rooster), human ( e.g., human speech, baby crying, and baby laughing), music ( e.g., violin and guitar), natural sounds ( e.g., rain, sea wave, and crackling ﬁre), domestic and urban sounds ( e.g., clock, keyboard typing, and siren).
Comparison with Blind Separation Methods We compare our method with several blind source separation (BSS) methods: non-negative matrix factorization (NMF) from Spiertz & Gnann (2009), robust principal component analysis (RPCA) from Huang et al.
and kernel additive modelling (KAM) from Yela et al.
Figure 3 shows that our method outperforms the compared methods qualitatively.
Please either use Adobe PDF Reader and click on each spectrogram or visit our webpage to listen to the audios.
For implementations, we use (Manilow et al., 2018) for
NMF and RPCA and (Yela et al., 2018) for KAM.
page:
[Table]
Moreover, to quantitatively evaluate sound separation performance of different BSS methods, we run separation on all 150 sounds and compare these methods in three metrics: Signal-to-Distortion
Ratio (SDR), Signal-to-Interference Ratio (SIR), and Audio Spectrum Distance (LSD) (Vincent et al., 2006; Morgado et al., 2018).
The SDR and SIR measure the distortion and interferences in the separated audios.
LSD measures the Euclidean distance between a predicted audio spectrum magnitude and the corresponding ground truth audio spectrogram magnitude.
DAP outperforms these three BSS methods in all three numerical metrics, as shown in Table 1.
Note that all these four methods, including DAP, do not require any training data.
The only input to the algorithm is the single mixture audio ﬁle.
Comparison with Methods using Deep Networks Since existing deep audio separation networks were usually trained on music or speech data, they are supervised and can not handle unseen sounds in our universe sound separation dataset.
So we compare our method with two state-of-the-art deep audio networks: Deep Network Prior (DNP) from Michelashvili & Wolf (2019) and Speech
Enhancement Generative Adversarial Network (SEGAN) from Pascual et al.
(2017) on noisy speech data.
Figure 4 illustrates speech denoising results.
For supervised model, in our tests, SEGAN works well on noises that are similar to the training set.
However, for unseen novel noises like the keyboard typing noise in Figure 4 (a), SEGAN did not remove the noise.
The proposed DAP can remove background noise.
A side effect of DAP aggressively removing noises is the excessive removal of speech signals, which might lead to lower quality in some cases.
Note that we do not impose any speech-related denoising prior in the universal DAP model.
3. I NTERACTIVE M ASK - BASED E DITING
Since the output of our method contains both a mask and the sound generator, we can add additional constraints on either the mask or the sound spectrogram.
Traditionally this type of interaction is only performed on spectrograms since they don’t have the predicted masks available (Bryan et al., 2014).
There are several drawbacks with using spectrogram strokes: spectrograms are non-intuitive for non-audio professionals, and even then, a lot of strokes are needed for real-world audios.
In comparison, constraints on 1D masks are a lot easier for users to specify.
Figure 5 shows the simple 1D box given by the user can quickly improve the results.
These 1D box constraints can be easily drawn by users that are not familiar with frequency spectrograms.
Basically they select
[Figure] [Figure]
[Figure]
the regions they think should have sound or should be silence for source k .
These selected regions would become input activation masks: M act k or deactivate mask:
M deact k , respectively.
The values in the annotated regions are one.
To encode these annotations, we introduce mask activation and deactivation losses to reﬁne results from our separation networks:
[Equation]
With the activation and deactivation losses, our DAP framework reﬁnes the source generator and masks.
This reﬁnement process typically takes tens of seconds.
Figure 5 shows an interactive mask editing result.
We can see that with adding a mask deactivation loss for the “dog” sound into optimization, our network will remove the “violin” patterns from it.
3. A UDIO T EXTURE S YNTHESIS
Another interesting application is audio synthesis or audio interpolation/extrapolation.
The goal of audio synthesis is to lengthen a given audio.
This has wide applications in audio texture generation for arbitrary length to match visual content.
Here we show an example on how we can leverage the input noise latent space to achieve audio texture synthesis (Figure 6).
Given an audio texture, we apply DAP framework and obtain the temporally coherent input noises [ z 1 , z 2 , ..., z n ] for the whole sequence and a generator S .
To lengthen the input texture, we can ﬁrst use straightforward interpolation : we can insert more noise frame between every two consecutive noise frames: z int =
[ z 1 , z 1 . 5 , z 2 , z 2 . 5 , ..., z n − 0 .
5 , z n ] .
Those symbols in boxes are new interpolated ones – this way we can easily double (or more) the length of the input audio.
If we want to explore more diversity in our learned generator, we can also extrapolate in the latent space.
[Figure]
In other words, we can create a brand new latent vector that are slightly outside our input training manifold: z ext =
[ z n +1 , z n +2 , ..., z 2 ∗ n ] .
These new input latent vectors z int and z ext can be used as input to source generator S .
Figure 6 shows that we can prolong a 3-second audio texture to a 12-second one with a combination of interpolation and extrapolation in latent space.
No direct copy and paste is used, so we naturally avoid the seam discontinuity problem.
3. C O - SEPARATION / A UDIO W ATERMARK R EMOVAL
Audio watermarks are commonly used in the music industry for copyright-protected audios.
Supervised deep networks will require a lot of training data to learn both diverse clean audio patterns and watermark patterns for separating watermark sounds from clean sounds (Muth et al., 2018).
Our
DAP model can also easily generalize to handle co-separation for removing audio watermarks.
Given K sounds: S k
= S ∗ k + S watermark ( k = 1 , 2 , ..., K ) containing the mixture of the same unknown audio watermark S watermark and the clean audios: S ∗ 1 , S ∗ 2 , ..., S ∗ K .
The goal is to recover the clean audios.
Using the proposed separation framework, we learn K + 1 generator networks; K for the music signals and 1 for the watermark with shared network weights and input noise.
As shown in
Figure 7, from the K = 3 input mixtures, we can extract the clean music as well as the embedded watermark.
A BLATION S TUDY AND D ISCUSSION
Temporal Noise Input To capture the temporal coherence prior within audio spectrograms, we decompose individual noise inputs into temporally consistent segments.
To justify the temporal noise, we compare to a variant of our model without temporal noise (w/o TN), which has no temporal consistency but with only random per-frame noise.
As shown in Figure 8 (b), we can see that the model without temporal noise fails to preserve temporal coherent “basketball” sound structures while our DAP model can well capture the temporal consistent patterns in the “basketball” sound.
Dynamic Noise We introduce dynamic noise from curriculum learning to capture large variations in individual sounds and preserve temporal consistent structures.
In particular, we use abruptly changing dynamic noise during noise input transition for better quickly learning dynamic patterns for individual sound predictions.
To show the effects of dynamic noise and abrupt noise transition, we compare to two baseline models, which are without dynamic noise (w/o DN) and without abruptly changing noise (w/o AC), respectively.
The results are illustrated in Figure 8 (c) and (d).
We see that the w/o DN model fails to separate the two sounds and it can only capture few dynamic structures in the “violin” sound due to its weak dynamic modeling capacity.
Although the w/o AC model can restore more dynamic “violin” patterns, it incorrectly adds “violin” sounds into the “basketball” sounds.
In comparison, our full DAP model has strong dynamic modeling capacity for the two individual sound prediction networks immediately.
[Figure]
[Figure]
1D Mask Design Unlike commonly used unconstrained masks used in images/videos, we design a 1D mask.
This design explicitly decomposes sound estimation into two sub-problems: temporal sound prediction and mask modulation, which will ease mask learning and temporal consistency modeling.
Such disentanglement idea has been widely used in separating geometry and appearance estimation (Janner et al., 2017;
Lin et al., 2019)
To validate the effectiveness of the 1D mask, we compare it to a baseline model with unconstrained masks.
As illustrated in Figure 9 (a), we can see that the model without the strong 1D mask constraint easily ﬁnd a short-cut to minimize the loss functions and the unconstrained masks also capture sound content.
With the 1D mask, our
DAP model disentangles sound prediction and mask modulation and successfully separates the two sounds.
Non-Zero Mask To demonstrate the effectiveness of the proposed nonzero mask loss, we empirically show results of our DAP without the loss during optimization in Figure 9 (b).
From the mask results, we can ﬁnd that mask values even in some sounding regions are close to zero for both two sounds.
With the loss term, DAP can reconstruct sounds for all sounding regions.
Discussion RPCA decomposes a spectrogram matrix S into a low-rank matrix S l and a sparse matrix S s and S =
S l + S s .
To satisfy the principle of the decomposition, S l will capture repeating structures in the audio spectrogram and the remaining large variations in the spectrogram will be preserved in the sparse matrix.
KAM assumes an audio source at a timestep can be estimated using its values at other nearby times through a source-speciﬁc proximity kernel, allowing addressing local redundancy in audio sources but missing modeling dynamic patterns.
In essence, various formulations have been proposed to utilize temporal redundancy and dynamics.
However, it is challenging for a traditional formulation to capture the temporal consistency and dynamic patterns due to its limited capacity.
To model both, we take advantage of the large capacity from deep networks and utilize temporal consistent noise inputs, which helps our network simultaneously restore temporal consistent sounds and capture large variations.
R ELATED W ORK
As discussed in the introduction, our work is inspired by the recent advances in deep image prior (DIP) and double-DIP (Ulyanov et al., 2018; Gandelsman et al., 2019).
Recently, Michelashvili & Wolf (2019) tried to learn a deep network prior for audio by following DIP process.
Instead of learning the priors from audio signals, a predicted apriori SNR of input audio is fed into traditional denoising methods, such as LSA (Ephraim & Malah, 1985) or the Weiner ﬁlter, to perform audio denoising.
Therefore their method still relied on the accuracy of existing denoising algorithms.
In our deep audio prior framework, we propose to capture the inherent audio priors using deep networks without relying on or bottlenecked by the previous method.
Audio source separation is a classical problem in signal processing (Haykin & Chen, 2005; Naik et al., 2014; Makino, 2018).
To address the problem, many blind audio source separation methods have been proposed, such as NMF (Virtanen, 2007; Smaragdis & Brown, 2003), RPCA (Huang et al., 2012), and KAM (Liutkus et al., 2014; Yela et al., 2018).
For multichannel audios, independent component analysis (ICA) is also commonly used (Hyvärinen & Oja, 2000; Smaragdis, 1998;
Dinh et al., 2014); in our paper, we focus on separation from single-channel audios.
To improve separation performance, supervised NMFs are explored in (Mysore & Smaragdis, 2011; Smaragdis, 2006).
However, these methods usually have limited capacity to handle various and complicate sound patterns.
In our work, we leverage the large capacity from deep neural networks to encode both the temporal audio priors and large variances that exist in real-world complex audios.
Recently, deep audio separation networks are proposed (Chandna et al., 2017; Hershey et al., 2016;
Isik et al., 2016; Chen et al., 2017; Smaragdis & Venkataramani, 2017; Le Roux et al., 2015; Wang &
Chen, 2018), all of which require a large amount of audio training data.
Also, a deep model trained on a certain type of sound sources cannot generalize well on audios from unseen categories, as we shown in §3.1.
These limitations restrict the existing deep networks to address scalable universal audio separation.
Unlike the existing approaches, our DAP framework is only trained on the single input mixture audio, does not require any additional training data, and hence is immune from the data mismatch between training and testing sets.
C ONCLUSION AND F UTURE W ORK
We have introduced Deep Audio Prior, a new audio prior framework that requires zero training data.
Thanks to the universal and unsupervised nature, we are excited about the potential applications that DAP can enable.
We have demonstrated impressive results on challenging tasks, even when comparing our model to models trained on a large amount of supervised data.
All of our examples are listed on the anonymous webpage: https://iclr-dap.github.io/
Deep-Audio-Prior/
Limitations and Future Work Our framework naturally extends to multiple sound sources, e.g., co-segmentation with 4 sources in total.
Yet for audio recorded in the wild, one main challenge is to decide how many effective sound sources are present (Girin et al., 2018).
One direction that we would like to explore is to use the output/error metrics from DAP separation to iteratively decide the optimal number of effective sources.
Visual information can also be used to guide this process (Sodoyer et al., 2002; Aytar et al., 2016).
It remains an open challenge on how to design a deep audiovisual prior to combine audio and visual information to distill a more robust representation.
In the interactive editing demo (§3.2), we show that the progressive reﬁnement based on user input can be easily done within seconds.
However, the initial DAP separation usually takes in the order of minutes for a short audio segment.
Possible acceleration in the initial training stage is a promising direction.
In supervised deep learning, distilling knowledge from multiple models has shown great success (Hinton et al., 2015).
Given that DAP works for audios in the wild, we are interested in how to robustly distill useful information from a large amount of learned generators from many single audios. A A PPENDIX A. N ETWORK S TRUCTURE
We use an UNet architecture as in Ulyanov et al.
(2018) for our audio and mask generator networks.
In the networks, the downsampling is achieved by setting the stride of the convolutional layer as 2, and the upscaling is implemented by Bilinear interpolation.
In our implementation, we use a relative smaller UNet structure, which only consists of N = 3 downsampling modules and upsampling modules.
The parameters of the used UNet are n d = n u = [16 , 32 , 64] , k d = k u
= [5 , 5 , 5] , ns =
ks =
[None, None, 1].
During tuning parameters of the UNet, we have the same observation as Ulyanov et al.
(2018) that a wide of range of hyper-parameters for the UNet can achieve similar performance.
We empirically found that our models can be converged initerations.
A. A DDITIONAL S OUND S EPARATION R ESULTS
To further clarify the numerical results in the Table 1, except from the mean SDR, mean SIR, and mean LSD, which are sensitive to over large or over small values (variance also has the same issue), we count the better sample ratio based on the three metrics.
The ratio will count our DAP is better than the compared the method on how many testing samples.
For example, compared to the NMF in terms of SDR, the ratio is 0.753, which shows that our method is better than the NMF on 75.3% testing samples.
The comparison results are shown in Table 2.
We can see that our DAP achieve better results on a majority of testing samples comparing to NMF/RPCA/KAM.
To further validate our DAP on sound source separation, we compare with other methods on a standard sound separation benchmark from (Vincent et al., 2007), which has 20 testing samples and each sample has 3 clean sounds.
To evaluate different sound separation methods, we take the ﬁrst two sounds from each sample to compose 2-sound mixtures.
As shown in Table 3, We can see that
[Table]
[Table]
our method outperforms the three compared methods in terms of SDR, SIR, and LSD.
The Tableillustrates better ratio results.
We can also ﬁnd that our DAP still achieves overall better results.
A. D YNAMIC R ESULTS
To model dynamic patterns with large variations in audio sources, we we gradually add dynamic noise into inputs as we progress more training iterations.
In our implementation, the two iteration parameters: T 1 and T 2 in the Equation (6) are set as 2000 and 4000, respectively.
Note that the maximum training iteration number is 5000.
When iteration number is smaller than T 1 , only temporal coherent noise inputs are used; when iteration number is in [2000, 4000], we gradually add dynamic noise into inputs; when iteration number is large than 4000, noise inputs are ﬁxed.
To illustrate the training dynamics, we show separation results at different training iterations in
Figure 11.
We can see that our model ﬁrst restore temporal coherent audio sources with the input noise constraint; when we introduce dynamic noise into input (after 2000 iterations), the model will quickly learn the dynamic patterns in the sound mixtures and well capture sound variations while preserving temporal consistent audio sources.
[Figure]
[Figure]