As speech and communication devices have become ubiquitous and are likely to be used in adverse conditions, the demand for speech enhancement methods which can cope with adverse environments has increased. Consequently, for example, in mobile phones it is by now common to use noise attenuation methods as a pre-processing block/step for all subsequent speech processing such as speech coding. There exist various approaches which incorporate speech enhancement into speech coders [1, 2, 3, 4]. While such designs do improve transmitted speech quality, cascaded processing does not allow a joint perceptual optimization/minimization of quality, or a joint minimization of quantization noise and interference has at least been difficult.
The goal of speech codecs is to allow transmission of high quality speech with a minimum amount of transmitted data. To reach this goal an efficient representations of the signal is needed, such as modelling of the spectral envelope of the speech signal by linear prediction, the fundamental frequency by a long-time predictor and the remainder with a noise codebook. This representation is the basis of speech codecs using the code excited linear prediction (CELP) paradigm, which is used in major speech coding standards such as Adaptive Multi-Rate (AMR), AMR-Wide-Band (AMR-WB), Unified Speech and Audio Coding (USAC) and Enhanced Voice Service (EVS) [5, 6, 7, 8, 9, 10, 11].
For natural speech communication, speakers often use devices in hands-free modes. In such scenarios the microphone is usually far from the mouth, whereby the speech signal can easily become distorted by interferences such as reverberation or background noise. The degradation does not only affect the perceived speech quality, but also the intelligibility of the speech signal and can therefore severely impede the naturalness of the conversation. To improve the communication experience, it is then beneficial to apply speech enhancement methods to attenuate noise and reduce the effects of reverberation. The field of speech enhancement is mature and plenty of methods are readily available [12]. However, a majority of existing algorithms are based on overlap-add methods, such as transforms like the short-time Fourier transform (STFT), that apply overlap-add based windowing schemes, whereas in contrast, CELP codecs model the signal with a linear predictor/linear predictive filter and apply windowing only on the residual. Such fundamental differences make it difficult to merge enhancement and coding methods. Yet it is clear that joint optimization of enhancement and coding can potentially improve quality, reduce delay and computational complexity.
Therefore, there is a need for an improved approach.
According to an embodiment, an encoder for encoding an audio signal with reduced background noise using linear predictive coding may have: a background noise estimator configured to estimate a representation of background noise of the audio signal; a background noise reducer configured to generate a representation of a background noise reduced audio signal by subtracting the representation of the estimated background noise of the audio signal from a representation of the audio signal; a predictor configured to subject the representation of the audio signal to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients and to subject the representation of the background noise reduced audio signal to linear prediction analysis to obtain a second set of linear prediction filter (LPC) coefficients; and an analysis filter composed of a cascade of time-domain filters controlled by the obtained first set of LPC coefficients and the obtained second set of LPC coefficients to obtain a residual signal from the audio signal.
According to another embodiment, a system may have: the encoder for encoding an audio signal with reduced background noise using linear predictive coding, which encoder may have: a background noise estimator configured to estimate a representation of background noise of the audio signal; a background noise reducer configured to generate a representation of a background noise reduced audio signal by subtracting the representation of the estimated background noise of the audio signal from a representation of the audio signal; a predictor configured to subject the representation of the audio signal to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients and to subject the representation of the background noise reduced audio signal to linear prediction analysis to obtain a second set of linear prediction filter (LPC) coefficients; and an analysis filter composed of a cascade of time-domain filters controlled by the obtained first set of LPC coefficients and the obtained second set of LPC coefficients to obtain a residual signal from the audio signal; a decoder configured to decode the encoded audio signal.
According to another embodiment, a method for encoding an audio signal with reduced background noise using linear predictive coding may have the steps of: estimating a representation of background noise of the audio signal; generating a representation of a background noise reduced audio signal by subtracting the representation of the estimated background noise of the audio signal from a representation of the audio signal; subjecting the representation of the audio signal to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients and subjecting the representation of the background noise reduced audio signal to linear prediction analysis to obtain a second set of linear prediction filter (LPC) coefficients; and controlling a cascade of time domain filters by the obtained first set of LPC coefficients and the obtained second set of LPC coefficients to obtain a residual signal from the audio signal.
According to another embodiment, a non-transitory digital storage medium may have a computer program stored thereon to perform the method for encoding an audio signal with reduced background noise using linear predictive coding, which method may have the steps of: estimating a representation of background noise of the audio signal; generating a representation of a background noise reduced audio signal by subtracting the representation of the estimated background noise of the audio signal from a representation of the audio signal; subjecting the representation of the audio signal to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients and subjecting the representation of the background noise reduced audio signal to linear prediction analysis to obtain a second set of linear prediction filter (LPC) coefficients; and controlling a cascade of time domain filters by the obtained first set of LPC coefficients and the obtained second set of LPC coefficients to obtain a residual signal from the audio signal, when said computer program is run by a computer.
Embodiments of the present invention show an encoder for encoding an audio signal with reduced background noise using linear predictive coding. The encoder comprises a background noise estimator configured to estimate background noise of the audio signal, a background noise reducer configured to generate background noise reduced audio signal by subtracting the estimated background noise of the audio signal from the audio signal, and a predictor configured to subject the audio signal to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients and to subject the background noise reduced audio signal to linear prediction analysis to obtain a second set of linear prediction filter (LPC) coefficients. Furthermore, the encoder comprises an analysis filter composed of a cascade of time-domain filters controlled by the obtained first set of LPC coefficients and the obtained second set of LPC coefficients.
The present invention is based on the finding that an improved analysis filter in a linear predictive coding environment increases the signal processing properties of the encoder. More specifically, using a cascade or a series of serially connected time domain filters improves the processing speed or the processing time of the input audio signal if said filters are applied to an analysis filter of the linear predictive coding environment. This is advantageous since the typically used time-frequency conversion and the inverse frequency-time conversion of the inbound time domain audio signal to reduce background noise by filtering frequency bands which are dominated by noise is omitted. In other words, by performing the background noise reduction or cancelation as a part of the analysis filter, the background noise reduction may be performed in the time domain. Thus, the overlap-and-add procedure of for example a MDCT/IDMCT ([inverse] modified discrete cosine transform), which may be used for time/frequency/time conversion, is omitted. This overlap-and-add method limits the real time processing characteristic of the encoder, since the background noise reduction cannot be performed on a single frame, but only on consecutive frames.
In other words, the described encoder is able to perform the background noise reduction and therefore the whole processing of the analysis filter on a single audio frame, and thus enables real time processing of an audio signal. Real time processing may refer to a processing of the audio signal without a noticeable delay for participating users. A noticeable delay may occur for example in a teleconference if one user has to wait for a response of the other user due to a processing delay of the audio signal. This maximum allowed delay may be less than 1 second, advantageously below 0.75 seconds or even more advantageously below 0.25 seconds. It has to be noted that these processing times refer to the entire processing of the audio signal from the sender to the receiver and thus include, besides the signal processing of the encoder also the time of transmitting the audio signal and the signal processing in the corresponding decoder.
According to embodiments, the cascade of time domain filters, and therefore the analysis filter, comprises two times a linear prediction filter using the obtained first set of LPC coefficients and one time an inverse of a further linear prediction filter using the obtained second set of LPC coefficients. This signal processing may be referred to as Wiener filtering. Thus, in other words, the cascade of time domain filters may comprise a Wiener filter.
According to further embodiments, the background noise estimator may estimate an autocorrelation of the background noise as a representation of the background noise of the audio signal. Furthermore, the background noise reducer may generate the representation of the background noise reduced audio signal by subtracting the autocorrelation of the background noise from an estimated autocorrelation of the audio signal, wherein the estimated audio correlation of the audio signal is the representation of the audio signal and wherein the representation of the background noise reduced audio signal is an autocorrelation of the background noise reduced audio signal. Using the estimation of autocorrelation functions instead of using the time domain audio signal for calculating the LPC coefficients and to perform the background noise reduction enables a signal processing completely in the time domain. Therefore, the autocorrelation of the audio signal and the autocorrelation of the background noise may be calculated by convolving or by using a convolution integral of an audio frame or a subpart of the audio frame. Thus, the autocorrelation of the background noise may be performed in a frame or even only in a subframe, which may be defined as the frame or the part of the frame where (almost) no foreground audio signal such as speech is present. Furthermore, the autocorrelation of the background noise reduced audio signal may be calculated by subtracting the autocorrelation of background noise and the autocorrelation of the audio signal (comprising background noise). Using the autocorrelation of the background noise reduced audio signal and the audio signal (typically having background noise) enables calculating the LPC coefficients for the background noise reduced audio signal and the audio signal, respectively. The background noise reduced LPC coefficients may be referred to as the second set of LPC coefficients, wherein the LPC coefficients of the audio signal may be referred to as the first set of LPC coefficients. Therefore, the audio signal may be completely processed in the time domain, since the application of the cascade of time domain filters also perform their filtering on the audio signal in time domain.
Before embodiments are described in detail using the accompanying figures, it is to be pointed out that the same or functionally equal elements are given the same reference numbers in the figures and that a repeated description for elements provided with the same reference numbers is omitted. Hence, descriptions provided for elements having the same reference numbers are mutually exchangeable.
Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:
In the following, embodiments of the invention will be described in further detail. Elements shown in the respective figures having the same or a similar functionality with have associated therewith the same reference signs.
Following will describe a method for joint enhancement and coding, based on Wiener filtering [12] and CELP coding. The advantages of this fusion are that 1) inclusion of Wiener filtering in the processing chain does not increase the low algorithmic delay of the CELP codec, and that 2) the joint optimization simultaneously minimizes distortion due to quantization and background noise. Moreover, the computational complexity of the joint scheme is lower than the one of the cascaded approach. The implementation relies on recent work on residual-windowing in CELP-style codecs [13, 14, 15], which allows to incorporate the Wiener filtering into the filters of the CELP codec in a new way. With this approach it can demonstrated that both the objective and subjective quality is improved in comparison to a cascaded system.
The proposed method for joint enhancement and coding of speech, thereby avoids accumulation of errors due to cascaded processing and further improving perceptual output quality. In other words, the proposed method avoids accumulation of errors due to cascaded processing, as a joint minimization of interference and quantization distortion is realized by an optimal Wiener filtering in a perceptual domain.
Furthermore, the encoder 4 may comprise a predictor 18 configured to subject the representation of the audio signal 8 to linear prediction analysis to obtain a first set of linear prediction filter (LPC) coefficients 20a and to subject the representation of the background noise reduced audio signal 16 to linear prediction analysis to obtain a second set of linear prediction filter coefficients 20b. Similar to the background noise reducer 14, the predictor 18 may comprise a generator to internally generate the representation of the audio signal 8 from the audio signal 8′. However, it may be advantageous to use a common or central generator 17 to calculate the representation 8 of the audio signal 8′ once and to provide the representation of the audio signal, such as the autocorrelation of the audio signal 8′, to the background noise reducer 14 and the predictor 18. Thus, the predictor may receive the representation of the audio signal 8 and the representation of the background noise reduced audio signal 16, for example the autocorrelation of the audio signal and the autocorrelation of the background noise reduced audio signal, respectively, and to determine, based on the inbound signals, the first set of LPC coefficients and the second set of LPC coefficients, respectively.
In other words, the first set of LPC coefficients may be determined from the representation of the audio signal 8 and the second set of LPC coefficients may be determined from the representation of the background noise reduced audio signal 16. The predictor may perform the Levinson-Durbin algorithm to calculate the first and the second set of LPC coefficients from the respective autocorrelation.
Furthermore, the encoder comprises an analysis filter 22 composed of a cascade 24 of time domain filters 24a, 24b controlled by the obtained first set of LPC coefficients 20a and the obtained second set of LPC coefficients 20b. The analysis filter may apply the cascade of time domain filters, wherein filter coefficients of the first time domain filter 24a are the first set of LPC coefficients and filter coefficients of the second time domain filter 24b are the second set of LPC coefficients, to the audio signal 8′ to determine a residual signal 26. The residual signal may comprise the signal components of the audio signal 8′ which may not be represented by a linear filter having the first and/or the second set of LPC coefficients.
According to embodiments, the residual signal may be provided to a quantizer 28 configured to quantize and/or encode the residual signal and/or the second set of LPC coefficients 24b before transmission. The quantizer may for example perform transform coded excitation (TCX), code excited linear prediction (CELP), or a lossless encoding such as for example entropy coding.
According to a further embodiment, the encoding of the residual signal may be performed in a transmitter 30 as an alternative to the encoding in the quantizer 28. Thus, the transmitter for example performs transform coded excitation (TCX), code excited linear prediction (CELP), or a lossless encoding such as for example entropy coding to encode the residual signal. Furthermore, the transmitter may be configured to transmit the second set of LPC coefficients. An optional receiver is the decoder 6. Therefore, the transmitter 30 may receive the residual signal 26 or the quantized residual signal 26′. According to an embodiment, the transmitter may encode the residual signal or the quantized residual signal, at least if the quantized residual signal is not already encoded in the quantizer. After optional encoding the residual signal or alternatively the quantized residual signal, the respective signal provided to the transmitter is transmitted as an encoded residual signal 32 or as an encoded and quantized residual signal 32′. Furthermore, the transmitter may receive the second set of LPC coefficients 20b′, optionally encode the same, for example with the same encoding method as used to encode the residual signal, and further transmit the encoded second set of LPC coefficients 20b′, for example to the decoder 6, without transmitting the first set of LPC coefficients. In other words, the first set of LPC coefficients 20a does not need to be transmitted.
The decoder 6 may further receive the encoded residual signal 32 or alternatively the encoded quantized residual signal 32′ and additionally to one of the residual signals 32 or 32′ the encoded second set of LPC coefficients 20b′. The decoder may decode the single received signals and provide the decoded residual signal 26 to a synthesis filter. The synthesis filter may be the inverse of a linear predictive FIR (finite impulse response) filter having the second set of LPC coefficients as filter coefficients. In other words, a filter having the second set of LPC coefficients is inverted to form the synthesis filter of the decoder 6. Output of the synthesis filter and therefore output of the decoder is the decoded audio signal 8″.
According to embodiments, the background noise estimator may estimate an autocorrelation 12 of the background noise of the audio signal as a representation of the background noise of the audio signal. Furthermore, the background noise reducer may generate the representation of the background noise reduced audio signal 16 by subtracting the autocorrelation of the background noise 12 from an autocorrelation of the audio signal 8, wherein the estimated autocorrelation 8 of the audio signal is the representation of the audio signal and wherein the representation of the background noise reduced audio signal 16 is an autocorrelation of the background noise reduced audio signal.
Both
As already described with respect to
In other words with respect to
Let sk=[sk, sk−1, . . . , sk−M]T be a vector of the input signal where the superscript T denotes the transpose. The residual can then be expressed as
rk=aTsk. (1)
Given the autocorrelation matrix Rss of the speech signal vector sk
Rss=E{skskT}, (2)
an estimate of the prediction filter of order M can be given as [20]
a=σe2Rss−1u, (3)
where u=[1, 0, 0, . . . , 0]T and the scalar prediction error σe2 is chosen such that α0=1. Observe that the linear predictive filter αn, is a whitening filter, whereby rk is uncorrelated white noise. Moreover, the original signal sn can be reconstructed from the residual rn through IIR filtering with the predictor αn. The next step is to quantize vectors of the residual rk=[rkN, rkN−1, . . . , rkN−N+1]T with a vector quantizer to {tilde over (r)}k, such that perceptual distortion is minimized. Let a vector of the output signal be sk′=[skN, skN−1, . . . , sk−N+1]T and {tilde over (s)}k′ its quantized counterpart, and W a convolution matrix which applies perceptual weighting on the output. The perceptual optimization problem can then be written as
where H is a convolution matrix corresponding to the impulse response of the predictor αn.
The process of CELP type speech coding is depicted in
Wiener Filtering
In single channel speech enhancement, it is assume that the signal yn is acquired, which is an additive mixture of the desired clean speech signal sn and some undesired interference vn, that is
yn=sn+vn. (5)
The goal of the enhancement process is to estimate the clean speech signal sn, while accessible is only to the noisy signal yn and estimates of the correlation matrices
Rss=E{skskT} and Ryy=E{ykykT} (6)
Where yk=[yk, yk−1, . . . , yk−M]T. Using a filter matrix H, the estimate of the clean speech signal ŝn is defined as
ŝk=Hyk. (7)
The optimal filter in the minimum mean square error (MMSE) sense, known as the Wiener filter can be readily derived as [12]
H=RssRyy−1. (8)
Usually, Wiener filtering is applied onto overlapping windows of the input signal and reconstructed using the overlap-add method [21, 12]. This approach is illustrated in Enhancement-block of
To obtain such a connection, the estimated speech signal ŝk is substituted into Eq. 1, whereby
rk=aTŝk=aTHyk=σe2uTRss−1RssRyy−1yk=σe2uTRyy−1yk=γa′Tyk (9)
where γ is a scaling coefficient and
a′={circumflex over (σ)}e2Ryy−1u (10)
is the optimal predictor for the noisy signal yn. In other words, by filtering the noisy signal with a′ the (scaled) residual of the estimated clean signal is obtained. The scaling is ratio between the ratio between the expected residual errors of the clean and noisy signals, σe2 and {circumflex over (σ)}e2, respectively, that is, γ=σe2/{circumflex over (σ)}e2. This derivation thus shows that Wiener filtering and linear prediction are intimately related methods and in the following section, this connection will be used to develop a joint enhancement and coding method.
Incorporating Wiener Filtering into a CELP Codec
An objective is to merge Wiener filtering and a CELP codecs (described in section 3 and section 2) into a joint algorithm. By merging these algorithms the delay of overlap-add windowing which may be used by usual implementations of Wiener filtering can be avoided, and reduces the computational complexity.
Implementation of the joint structure is then straightforward. It is shown that the residual of the enhanced speech signal can be obtained by Eq. 9. The enhanced speech signal can therefore be reconstructed by IIR filtering the residual with the linear predictive model αn of the clean signal.
For quantization of the residual, Eq. 4 can be modified by replacing the clean signal sk′ with the estimated signal {tilde over (s)}k′ to obtain
In other words, the objective function with the enhanced target signal {tilde over (s)}k′ remains the same as if having access to the clean input signal sk′.
In conclusion, the only modification to standard CELP is to replace the analysis filter a of the clean signal with that of the noisy signal a′. The remaining parts of the CELP algorithm remains unchanged. The proposed approach is illustrated in
It is clear that the proposed method can be applied in any CELP codecs with minimal changes whenever noise attenuation is desired and when having access to an estimate of the autocorrelation of the clean speech signal Rss. If an estimate of the clean speech signal autocorrelation is not available, it can be estimated using an estimate of the autocorrelation of the noise signal Rvv, by Rss≈Ryy−Rvv or other common estimates.
The method can be readily extended to scenarios such as multi-channel algorithms with beamforming, as long as an estimate of the clean signal is obtainable using time-domain filters.
The advantage in computational complexity of the proposed method can be characterized as follows. Note that in the conventional approach it is needed to determine the matrix-filter H, given by Eq. 8. The matrix inversion which may be used is of complexity (M3). However, in the proposed approach only Eq. 3 is to be solved for the noisy signal, which can be implemented with the Levinson-Durbin algorithm (or similar) with complexity (N2).
Code Excited Linear Prediction
In other words with respect to
The linear predictive filter as for one frame of the input signal s can be obtained, minimizing
where u=[1 0 0 . . . 0]T. The solution follows as:
as=σe2Rss−1u. (13)
With the definition of the convolution matrix As, consisting of the filter coefficients α of as
the residual signal can be obtained by multiplying the input speech frame with the convolution matrix As
es=As·s. (15)
Windowing is here performed as in CELP-codecs by subtracting the zero-input response from the input signal and reintroducing it in the resynthesis [15].
The multiplication in Equation 15 is identical to the convolution of the input signal with the prediction filter, and therefore corresponds to FIR filtering. The original signal can be reconstructed from the residual, by a multiplication with the reconstruction filter Hs
s=Hs·es. (16)
where Hs, consists of the impulse response η=[1, η1 . . . ηN−1] of the prediction filter
such that this operation corresponds to IIR filtering.
The residual vector is quantized applying vector quantization. Therefore, the quantized vector ês is chosen, minimizing the perceptual distance, in the norm−2 sense, to the desired reconstructed clean signal:
where es is the unquantized residual and W(z)=A (0.92z) is the perceptual weighting filter, as used in the AMR-WB speech codec [6].
Application of Wiener Filtering in a CELP Codec
For the application of single-channel speech enhancement, assuming that the acquired microphone signal yn, is an additive mixture of the desired clean speech signal sn and some undesired interference vn, such that yn=sn+vn. In the Z-domain, equivalently Y(z)=S(z)+V(z).
By applying a Wiener filter B(z) it is possible to reconstruct the speech signal S(z) from the noisy observation Y(z) by filtering, such that the estimated speech signal is Ŝ(z):=B(z)Y(z)≈S(z). The minimum mean square solution for the Wiener filter follows as [12]
given the assumption that the speech and noise signals sn and vn, respectively, are uncorrelated.
In a speech codec, an estimate of the power spectrum is available of the noisy signal yn, in the form of the impulse response of the linear predictive model |Ay(z)|−2. In other words, |S(z)|2+|V(z)|2≈γ|Ay(z)|−2 where γ is a scaling coefficient. The noisy linear predictor can be calculated from the autocorrelation matrix Ryy of the noisy signal as usual.
Furthermore, it may be estimated the power spectrum of the clean speech signal |S(z)|2 or equivalently, the autocorrelation matrix Rss of the clean speech signal. Enhancement algorithms often assume that the noise signal is stationary, whereby the autocorrelation of the noise signal as Rvv can be estimated from a non-speech frame of the input signal. The autocorrelation matrix of the clean speech signal Rss can then be estimated as {circumflex over (R)}ss=Ryy−Rvv. Here it is advantageous to make the usual precautions to ensure that {circumflex over (R)}ss remains positive definite.
Using the estimated autocorrelation matrix for clean speech {circumflex over (R)}ss, the corresponding linear predictor can be determined, which impulse response in Z-domain is Âs−1(z). Thus, |S(z)|2≈|Âs(z)|−2 and Eq. 19 can be written as
In other words, by filtering twice with the predictors of the noisy and clean signals, in FIR and IIR mode respectively, a Wiener estimate of the clean signal can be obtained.
The convolution matrices may be denoted corresponding to FIR filtering with predictors Âs(z) and Ay(z) by As and Ay, respectively. Similarly, let Hs and Hy be the respective convolution matrices corresponding to predictive filtering (IIR). Using these matrices, conventional CELP coding can be illustrated with a flow diagram as in
The conventional approach to combining enhancement with coding is illustrated in
Finally, in the proposed approach Wiener filtering is combined with CELP type speech codecs. Comparing the cascaded approach from
Thus, this approach jointly minimizes the distance between the clean estimate and the quantized signal, whereby a joint minimization of the interference and the quantization noise in the perceptual domain is feasible.
The performance of the joint speech coding and enhancement approach was evaluated using both objective and subjective measures. In order to isolate the performance of the new method, a simplified CELP codec is used, where only the residual signal was quantized, but the delay and gain of the long term prediction (LTP), the linear predictive coding (LPC) and the gain factors were not quantized. The residual was quantized using a pair-wise iterative method, where two pulses are added consecutively by trying them on every position, as described in [17]. Moreover, to avoid any influence of estimation algorithms, the correlation matrix of the clean speech signal Rss was assumed to be known in all simulated scenarios. With the assumption that the speech and the noise signal are uncorrelated, it holds that Rss=Ryy−Rvv. In any practical application the noise correlation matrix Rvv or alternatively the clean speech correlation matrix Rss has to be estimated from the acquired microphone signal. A common approach is to estimate the noise correlation matrix in speech brakes, assuming that the interference is stationary.
The evaluated scenario consisted of a mixture of the desired clean speech signal and additive interference. Two types of interferences have been considered: stationary white noise and a segment of a recording of car noise from the Civilisation Soundscapes Library [18]. Vector quantization of the residual was performed with a bitrate of 2.8 kbit/s and 7.2 kbit/s, corresponding to an overall bitrate of 7.2 kbit/s and 13.2 kbit/s respectively for an AMR-WB codec [6]. A sampling-rate of 12.8 kHz was used for all simulations.
The enhanced and coded signals were evaluated using both objective and subjective measures, therefore a listening test was conducted and a perceptual magnitude signal-to-noise ratio (SNR) was calculated, as defined in Equation 23 and Equation 22. This perceptual magnitude SNR was used as the joint enhancement process has no influence on the phase of the filters, as both the synthesis and the reconstruction filters are bound to the constraint of minimum phase filters, as per design of prediction filters.
With the definition of the Fourier transform as operator (·), the absolute spectral values of the reconstructed clean reference and the estimated clean signal in the perceptual domain follow as:
S=|(WHsek)| and Ŝ=|(WHsêk)|. (22)
The definition of the modified perceptual signal to noise ratio (PSNR) follows as:
For the subjective evaluation, speech items were used from the test set used for the standardization of USAC [8], corrupted by white- and car-noise, as described above. It was conducted a Multiple Stimuli with Hidden Reference and Anchor (MUSHRA) [19] listening test with 14 participants, using STAX electrostatic headphones in a soundproof environment. The results of the listening test are illustrated in
The absolute MUSHRA test results in
To obtain a more detailed comparison of the joint and the pre-enhanced methods, the differential MUSHRA scores are presented in
In other words, a method for joint speech enhancement and coding is shown, which allows minimization of overall interference and quantization noise. In contrast, conventional approaches apply enhancement and coding in cascaded processing steps. Joining both processing steps is also attractive in terms of computational complexity, since repeated windowing and filtering operations can be omitted.
CELP type speech codecs are designed to offer a very low delay and therefore avoid an overlap of processing windows to future processing windows. In contrast, conventional enhancement methods, applied in the frequency domain rely on overlap-add windowing, which introduces an additional delay corresponding to the overlap length. The joint approach does not require overlap-add windowing, but uses the windowing scheme as applied in speech codecs [15], whereby avoiding the increase in algorithmic delay.
A known issue with the proposed method is that, in difference to conventional spectral Wiener filtering where the signal phase is left intact, the proposed method applies time-domain filters, which do modify the phase. Such phase-modifications can be readily treated by application of suitable all-pass filters. However, since having not noticed any perceptual degradation attributed to phase-modifications, such all-pass filters were omitted to keep computational complexity low. Note, however, that in the objective evaluation, perceptual magnitude SNR was measured, to allow fair comparison of methods. This objective measure shows that the proposed method is on average three dB better than cascaded processing.
The performance advantage of the proposed method was further confirmed by the results of a MUSHRA listening test, which show an average improvement of 6.4 points. These results demonstrate that application of joint enhancement and coding is beneficial for the overall system in terms of both quality and computational complexity, while maintaining the low algorithmic delay of CELP speech codecs.
It is to be understood that in this specification, the signals on lines are sometimes named by the reference numerals for the lines or are sometimes indicated by the reference numerals themselves, which have been attributed to the lines. Therefore, the notation is such that a line having a certain signal is indicating the signal itself. A line can be a physical line in a hardwired implementation. In a computerized implementation, however, a physical line does not exist, but the signal represented by the line is transmitted from one calculation module to the other calculation module.
Although the present invention has been described in the context of block diagrams where the blocks represent actual or logical hardware components, the present invention can also be implemented by a computer-implemented method. In the latter case, the blocks represent corresponding method steps where these steps stand for the functionalities performed by corresponding logical or physical hardware blocks.
Although some aspects have been described in the context of an apparatus, it is clear that these aspects also represent a description of the corresponding method, where a block or device corresponds to a method step or a feature of a method step. Analogously, aspects described in the context of a method step also represent a description of a corresponding block or item or feature of a corresponding apparatus. Some or all of the method steps may be executed by (or using) a hardware apparatus, like for example, a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some one or more of the most important method steps may be executed by such an apparatus.
The inventive transmitted or encoded signal can be stored on a digital storage medium or can be transmitted on a transmission medium such as a wireless transmission medium or a wired transmission medium such as the Internet.
Depending on certain implementation requirements, embodiments of the invention can be implemented in hardware or in software. The implementation can be performed using a digital storage medium, for example a floppy disc, a DVD, a Blu-Ray, a CD, a ROM, a PROM, and EPROM, an EEPROM or a FLASH memory, having electronically readable control signals stored thereon, which cooperate (or are capable of cooperating) with a programmable computer system such that the respective method is performed. Therefore, the digital storage medium may be computer readable.
Some embodiments according to the invention comprise a data carrier having electronically readable control signals, which are capable of cooperating with a programmable computer system, such that one of the methods described herein is performed.
Generally, embodiments of the present invention can be implemented as a computer program product with a program code, the program code being operative for performing one of the methods when the computer program product runs on a computer. The program code may, for example, be stored on a machine readable carrier.
Other embodiments comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier.
In other words, an embodiment of the inventive method is, therefore, a computer program having a program code for performing one of the methods described herein, when the computer program runs on a computer.
A further embodiment of the inventive method is, therefore, a data carrier (or a non-transitory storage medium such as a digital storage medium, or a computer-readable medium) comprising, recorded thereon, the computer program for performing one of the methods described herein. The data carrier, the digital storage medium or the recorded medium are typically tangible and/or non-transitory.
A further embodiment of the invention method is, therefore, a data stream or a sequence of signals representing the computer program for performing one of the methods described herein. The data stream or the sequence of signals may, for example, be configured to be transferred via a data communication connection, for example, via the internet.
A further embodiment comprises a processing means, for example, a computer or a programmable logic device, configured to, or adapted to, perform one of the methods described herein.
A further embodiment comprises a computer having installed thereon the computer program for performing one of the methods described herein.
A further embodiment according to the invention comprises an apparatus or a system configured to transfer (for example, electronically or optically) a computer program for performing one of the methods described herein to a receiver. The receiver may, for example, be a computer, a mobile device, a memory device or the like. The apparatus or system may, for example, comprise a file server for transferring the computer program to the receiver.
In some embodiments, a programmable logic device (for example, a field programmable gate array) may be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor in order to perform one of the methods described herein. Generally, the methods are advantageously performed by any hardware apparatus.
While this invention has been described in terms of several embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations and equivalents as fall within the true spirit and scope of the present invention.
Number | Date | Country | Kind |
---|---|---|---|
15186901 | Sep 2015 | EP | regional |
16175469 | Jun 2016 | EP | regional |
This application is a continuation of co-pending International Application No. PCT/EP2016/072701, filed Sep. 20, 2016, which is incorporated herein by reference in its entirety, and additionally claims priority from European Applications Nos. 15186901.3, filed Sep. 25, 2015, and EP 16175469.2, filed Jun. 21, 2016, both of which are incorporated herein by reference in their entirety. The present invention relates to an encoder for encoding an audio signal with reduced background noise using linear predictive coding, a corresponding method and a system comprising the encoder and a decoder. In other words, the present invention relates to a joint speech enhancement and/or encoding approach, such as for example joint enhancement and coding of speech by incorporating in a CELP (codebook excited linear predictive) codec.
Number | Name | Date | Kind |
---|---|---|---|
5173941 | Yip | Dec 1992 | A |
5307460 | Garten | Apr 1994 | A |
5550924 | Helf | Aug 1996 | A |
5590242 | Juang | Dec 1996 | A |
5706395 | Arslan | Jan 1998 | A |
6001131 | Raman | Dec 1999 | A |
6028890 | Salami | Feb 2000 | A |
6263307 | Arslan et al. | Jul 2001 | B1 |
6757395 | Fang | Jun 2004 | B1 |
7065486 | Thyssen | Jun 2006 | B1 |
8949120 | Every | Feb 2015 | B1 |
20020147595 | Baumgarte | Oct 2002 | A1 |
20040015349 | Vinton | Jan 2004 | A1 |
20050049857 | Seltzer | Mar 2005 | A1 |
20050058278 | Gallego Hugas | Mar 2005 | A1 |
20050261893 | Toyama | Nov 2005 | A1 |
20060222184 | Buck | Oct 2006 | A1 |
20080071528 | Ubale | Mar 2008 | A1 |
20080097763 | Van De Par | Apr 2008 | A1 |
20130246059 | Kechichian | Sep 2013 | A1 |
20140052439 | Rose | Feb 2014 | A1 |
20140236587 | Subasingha | Aug 2014 | A1 |
20140270226 | Borgstrom | Sep 2014 | A1 |
20150124987 | Hazrati | May 2015 | A1 |
20180075859 | Song | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
1944761 | Jul 2008 | EP |
2608200 | Aug 2014 | EP |
2676264 | Jan 2015 | EP |
2002-175100 | Jun 2002 | JP |
2010-518434 | May 2010 | JP |
2483368 | May 2013 | RU |
2523215 | Jul 2014 | RU |
WO 2014 202788 | Dec 2014 | WO |
Entry |
---|
Soundeffects.ch: “Civilisation soundscapes library”; accessed: Sep. 23, 2015; Online Available: https://www.soundeffects.ch/de/geraeusch-archive/soundeffects.ch-_produkte/civilisation-soundscapes-d.php\ (9 pages). |
3GPP TS 26.071 V9.0.0 (Dec. 2009) “Mandatory speech CODEC speech processing functions; AMR speech Codec; General description”; Online Available: http://www.3gpp.org/ftp/Specs/html-info/26071.htm (12 pages). |
3GPP TS 26.190 V7.0.0 (Jun. 2007) Adaptive Multi-Rate (AMR-WB) speech codec, 2007 (53 pages). |
3GPP TS 26.190 V9.0.0 (Dec. 2009) “Speech codec speech processing functions; Adaptive Multi-Rate-Wideband (AMR-WB) speech codec; Transcoding functions”; Online Available: http://www.3gpp.org/ftp/Specs/html-info/26190.htm (51 pages). |
3GPP TS 26.445 V12.1.0 (Dec. 2014) EVS Codec Detailed Algorithmic Description (Release 12); 2014 (24 pages). |
J. Allen: “Short-term spectral analysis, and modification by discrete Fourier transform”; IEEE Trans. Acoust., Speech, Signal Process.; vol. 25; pp. 235-238; 1977 (4 pages). |
T. Bäckström: “Computationally efficient objective function for algebraic codebook optimization in ACELP”; Proc. Interspeech; Aug. 2013 (5 pages). |
T. Bäckström: “Comparison of windowing in speech and audio coding”; Proc. WASPAA; Oct. 2013 (4 pages). |
T. Bäckström et al.: “Decorrelated innovative codebooks for ACELP using factorization of autocorrelation matrix”; Proc. Interspeech; 2014; pp. 2794-2798 (5 pages). |
B. Bessette et al.: “The adaptive multirate wideband speech codec (AMR-WB)”; IEEE Transactions on Speech and Audio Processing; vol. 10; No. 8; pp. 620-636; Nov. 2002 (18 pages). |
M. Dietz et al.: “Overview of the EVS codec architecture”; IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP); Apr. 2015; pp. 5698-5702 (5 pages). |
Fapi et al.: “Noise Reduction within Network through Modification of LPC Parameters”; 7th International ITG Conference on Source and Channel Coding (SCC); Jan. 14, 2008; pp. 1-6; XP055312348; Retrieved from the Internet: URL:http://ieeexplore.ieee.org/ielx5/5755489/5755490/05755780.pdf?tp=&arnumber=5755780&isnumber=5755490 [retrieved on Oct. 19, 2016] (6 pages). |
J. Fischer et al.: “Comparison of windowing schemes for speech coding”; Proc EUSIPCO; 2015 (5 pages). |
ISO/IEC 23003-3:2012 “MPEG-D (MPEG audio technologies), Part 3: Unified speech and audio coding”; 2012 (286 pages). |
M. Jeub et al.: “Enhancement of reverberant speech using the CELP postfilter”; Proc. ICASSP; Apr. 2009; pp. 3993-3996 (4 pages). |
M. Jeub et al.: “Noise reduction for dual-microphone mobile phones exploiting power level differences”; Proc. ICASSP; Mar. 2012; pp. 1693-1696 (4 pages). |
R. Martin et al.: “Optimized estimation of spectral parameters for the coding of noisy speech”; Proc. ICASSP; vol. 3; 2000; pp. 1479-1482 (4 pages). |
M. Neuendorf et al.: “Unified speech and audio coding scheme for high quality at low bitrates”; IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP); Apr. 2009; pp. 1-4 (4 pages). |
Recommendation ITU-R BS.1534 “Method for the subjective assessment of intermediate quality levels of coding systems”; 2003; Online Available: http://www.itu.int/rec/R-REC-BS.1534/en. (18 pages). |
M. Schroeder et al.: “Code-excited linear prediction (CELP): High-quality speech at very low bit rates”; Proc. ICASSP; IEEE; 1985, pp. 937-940 (4 pages). |
S. Srinivasan et al.: “Codebook Driven Short-Term Predictor Parameter Estimation for Speech Enhancement”; IEEE Transactions on Audio, Speech and Language Processing; vol. 14; No. 1; Jan. 2006; pp. 163-176; XP00255173 (14 pages). |
H. Taddei et al.: “Noise reduction on speech codec parameters”; Proc. ICASSP; vol. 1; May 2004; pp. I-497-I-500 (4 pages). |
P. P. Vaidyanathan: “The theory of linear prediction”; Synthesis Lectures on Signal Processing; vol. 2; pp. 1-184; Morgan & Claypool publishers; 2007 (198 pages). |
J. Benesty et al.: “Springer Handbook of Speech Processing”; Springer; 2008 (publication information flyer only). |
Office Action in the parallel Russian patent application No. 2018115191 dated Dec. 27, 2018 (12 pages). |
Office Action dated Mar. 5, 2019 issued in the parallel JP patent application No. 2018-515646 (6 pages with English translation). |
Number | Date | Country | |
---|---|---|---|
20180204580 A1 | Jul 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCT/EP2016/072701 | Sep 2016 | US |
Child | 15920907 | US |