Research Article  Open Access
Spectral Intrinsic Decomposition Method for Adaptive Signal Representation
Abstract
We propose a new method called spectral intrinsic decomposition (SID) for the representation of nonlinear signals. This approach is based on the spectral decomposition of partial differential equation (PDE) based operators which interpolate the characteristic points of a signal. The SID’s components which are the eigenvectors of these PDE interpolation operators underlie the new signal decompositionreconstruction method. The usefulness and the efficiency of this method is illustrated, in signal reconstruction or denoising aim, in some examples using artificial and pathological signals.
1. Introduction
The signal decomposition into atoms is an popular approach in signal analysis. The Fourier representation technics and other based on wavelets and timefrequency, or time scales analysis methods [1], and recently the Empirical Mode Decomposition [2] are extensively used in signal and image processing. The objective is to understand the contents of the signal by analyzing its components. It is sometimes desirable to have these components well suited to the separation of the noise or data in some scale analysis. Sparse representations of signals have like pursuit methods [3], the Poper Orthogonal Decomposition (POD) [4], or Singular Value Decomposition (SVD) received a great deal of attentions in last recent years. The problem solved by the sparse representation is the most compact representation of a signal in terms of combination of atoms in an overcomplete dictionary. The Empirical Mode Decomposition [2] is a self adaptive decomposition method which is essentially algorithmic and can decompose a nonlinear signal into Amplitude ModulationFrequency Modulation (AMFM) component plus an residue. The characteristic points of a signal like local extrema are very useful in signal analysis as its shown in EMD algorithm. The interpolation of the characteristic points provides a low frequency component of a signal whose iterative extraction is the basis of the EMD sifting process.
To overcome the lack of a solid theoretical framework of EMD, we have proposed an analytical approach for sifting process based on partial differential equation (PDE) in [5–8]. We give in particular a noniterative scheme to solve the coupled PDEs system for upper and lower envelopes estimation with an adequate definition of the characteristic points of the signal to be decomposed, see [6, 8]. In this following work, we use all the eigenvectors of upper and lower PDEenvelope operators and propose a new Spectral Intrinsic Decomposition (SID) method for nonlinear signal representation. The decomposition obtained with SID acts like a sparse representation and provides relevant results for signal denoising with an competitive rate of reconstruction. In the following, we introduce in Section 2 the PDEinterpolation operator and its spectral numerical resolution. Section 3 describes the Spectral Intrinsic Decomposition method with an discussion on the SID’s component properties in Section 3.2. In Section 4, some comparison of tests are performed between SIDbased method for signal reconstruction and the waveletsbased one. Finally, conclusion and perspectives are given in Section 5.
2. PDEInterpolator Decomposition
As proposed in [5–7], the upper () or lower () envelopes of an signal can be computed as the asymptotic solution of a coupled PDEs system as the following: where is the tension parameter which ranges from to .
The initial value solution of this equation is , and are the stopping or diffusivity functions depending on signal derivatives, with . An diffusivity function for Maximum Curvature Points (MCP) interpolation of is given by where denote the sign function.
2.1. Spectral Resolution of the Coupled PDEs System
Numerical resolutions for coupled PDEs system in (1) are implemented in [5] via classical iterative CrankNicolson or Du Fort and Frankel schemes.
Equation (1) can be resolved numerically in its discrete implicit unconditionally stable scheme as follows: where is the column vector of signal samples for upper or lower envelopes for example, or . The time step is denoted by and is a matrix formed with finite difference approximation coefficients of second and fourth order differential operators (resp., and ), as with the diagonal matrix of stopping function values constructed with discrete version of stopping function values as below: where and with and forward and backward first difference operators on the dimension, and where stands for the minmod limiter [6, 7] for derivatives estimation, .
So the explicit form leads to the following numerical resolution: with the identity matrix. Finally (1) can be decomposed into a linear system from implicit numerical scheme (6) by where is the linear operator including stopping function values and differential operator formed by fourthorder and secondorder derivative. So, referring to numerical schemes (6), is given by The operator matrix , has realvalued eigenvalues that are always greater or equal to . Then, eigenvalues, , of are always smaller or equal to , (), see [7]. In Figure 1(d), the sequence of eigenvalues is plotted for an given tested signal.
(a)
(b)
(c)
(d)
2.2. The Asymptotic Solution as an Linear Combination of Fixed Vector Point of Upper and Lower Envelope Operators
The iterative scheme (7) can be rewrite in term of initial solution as after convergence, the asymptotic solution, , is given by
Let be a matrix of ’s sequence of eigenvectors and a diagonal matrix having ’s sequence of eigenvalues , at the diagonal. So we have the following decomposition: It is easy to see that So, the asymptotic solution in (10) is obtained by
The asymptotic eigenvalue matrix is a diagonal matrix with eigenvalues only at loci where matrix is zeroed, and where , for example, for .
In the following, denotes either the upper or lower envelope operator. The upper and lower envelope of the signal are calculated with the eigenvectors associated to eigenvalue . Hence, as its shown in (13), is a linear combination of 1eigenvectors weighted by the signal amplitude. Instead of focusing only on the envelope calculus, we now consider all the set of eigenvalues of the envelope operator .
3. The Spectral Intrinsic Decomposition Method
Let us consider all the eigenvalues of the envelope operator of a signal . The set of eigenvectors of is an pseudodictionary, each of its component called Spectral Proper Mode Function (SPMF), is intrinsic to the signal. The SID decomposition deals to the combination of all SPMF.
3.1. On the Properties of SPMF and Spectral Intrinsic Decomposition Principle
The atoms SPMF calculated from the operator are adaptive and well localized around the caracteristic points of the signal. In Figure 1, we show the original signal in Figure 1(a), and some eigenvectors (SPMFs ) associated to lowest eigenvalues for the upper envelope in Figure 1(b). Figure 1(c) presents the SPMFs numbers , , , , and . Around the intermittency at the coordinate , the last SPMFs corresponding to lesser eigenvalues present an nonstationarity but contribute everywhere else to the signal composition, with a centred and stationary component which is Amplitude ModulationFrequency Modulation (AMFM).
It is interesting to note that the EMD Sifting process [2] allows for tracking of these AMFM components by searching iteratively around the extrema. Even in SID the role of extrema in the occurrence of nonstationarity is noted. Also, the SPMF contains local frequencies of the signal. Hence localy, the SPMF decomposition (SID) works like the basic EMD’s principle that considers a signal as an superposition of a lower frequency component and a most higher frequency component.
When the classical EMDs principle leads to a locally decomposition with two components, the SID decomposition gives a sequence (of number greater than the number of characteristic points) of really localized component as follows: where denotes an eigenvector of (SPMF) and the decomposition coefficient depending on . The first term of (14) corresponds to the envelope of . Then it appears that the SID provides a generalization of the EMD’s basic principle because in (14), we have more than the number of maxima or minima components. SPMF participates in the whole dynamic of the signal with a strong localization around the points that generated the eigenvectors.
In most cases, an SPMF can be viewed as a (nonlinear) frequency narrowband wavelet with Amplitude Modulation by a lower frequency signal : The redundancy and the orthogonality of the dictionary of all SPMF depend on the properties of the operator . When is symmetric, we can have the orthogonality and SPMF too similar to a wavelet function (see example in Figure 1).
3.2. The Spectral Intrinsic Decomposition
The Spectral Intrinsic Decomposition procedure is define as the calculus of all the SPMF for an given signal. Let us take the same notation than in Section 3.1 and consider the upper envelope operator . The same procedure can be performed with the lower envelope. The eigen decomposition of gives: , where and (with the possibility zeros to complete the size of the vector) are, respectively, the set of eigenvectors and the set of eigenvalues of . The coefficient reconstruction of is given by: Hence is computed by the formula .
The Spectral Intrinsic Decomposition of described in Algorithm 1, is given as follows:
This decomposition is intrinsic and depends only to the position of caracteristic points of that define the diffusivity function in the interpolation operator. We notice that the SID versus lower envelope works like the SID with the upper envelope and has the same reconstruction ability.
The reason is that the PDEinterpolation operator use all the data in and these SPMFs generate the same functional space. All the SPMF participate locally in the reconstruction of the signal . Hence, in the sense of the superposition principle, SID is more general than the EMD’s classical principe.
4. Application to Signal Reconstruction and Filtering
The SIDbased signal denoising principle is derived from the idea that regular signal can be accurately approximated using a small number of approximation coefficients (at a suitably chosen level) or some of the detail coefficients. The SPMF corresponding to smaller eigenvalues contain the noise or the highest frequency component of any given signal. The denoising procedure contains three steps: decompositionthresholdreconstruction (DTR). The decomposition classically can be a wavelets representation depending on a choice of wavelet and a level . For each level from to , a threshold is selected and hard thresholding is applied to the detail coefficients. At last we compute wavelet reconstruction using the original approximation coefficients of level and the modified detail coefficients of levels from to . In following we propose a new reconstruction and denoising method by taking the Spectral Intrinsic instead of the wavelet at the decomposition step of the DTR procedure. There are two denoising approaches that can be explored here for test results. The first consists of taking the wavelet expansion of the signal and keeping the largest absolute value coefficients. In this case, one can set a global threshold and evaluate the denoising performance by the signaltonoise ratio (SNR), or the relative error of reconstruction. Thus, only a single parameter needs to be selected. The second approach consists of applying visually determined leveldependent thresholds. In Algorithm 2, we have described the SIDbased reconstruction method as follows: with the SID of , we first compute the set of all reconstruction coefficients by and retain all the SPMF corresponding to the 1eigenvalues of that gives the significant SPMF in SID representation of , by calculating the coefficients for eigenvalues denoted by . After, like in the wavelet reconstruction or denoising method, we fix the number of supplementary SPMF (by estimating ) to add to the significant set of SPMF retained before. Secondly we reconstruct an approximate and denoised version of by forming the reconstruction coefficient: and completing by zeros for equalization of matrix size. In [7] we have proposed an optimal method to compose by regularization technique. The reconstructed signal version is Finally we compute the SNR and the number of points or number of SPMF retained for the signal reconstruction. In example tests presented in Figures 2(a), 2(b), 3(a), and 3(b) we apply a global thresholding, for a given and unoptimized wavelet choice, to produce a nearly complete square norm recovery for a signal and compare it with the SID version one. For signal 3 reconstruction, the high frequency component is lost with wavelet method while SIDreconstruction retains quite perfectly this essential component. We can clearly see in Figures 4(b), 4(c), 5(a), 5(b), and 6 that the SIDbased reconstruction works better than the classical wavelet method with fewest reconstruction error and gives better SNR. Another advantage of the SID basedreconstruction method is its selfadaptability and its unique dependence on signal to be approximate. To compare scores of these methods we compute the retained energy in percentage defined by and we have compare the percentage of the number of useful points for signal reconstruction, see Figure 4(a).

(a)
(b)
(a)
(b)
(a)
(b)
(c)
(a)
(b)
(a)
(b)
(c)
(d)
5. Conclusion
In this paper we have introduced a new decomposition method based on a spectral decomposition of an intrinsic interpolation operator of a signal. The new SID method is self adaptive and works more generally than the EMD basic principle. The SID gives a dictionary in terms of SPMF that are similar to atoms in sparse representation. The test results demonstrate that SID can be used in signal denoising as much as the wavelets technic, with the advantage of self adaptability. The SID is also suitable for signal compression, one issue of our future works.
References
 B. Boashash, Time Frequence Signal Analysis and Processing, Elsevier, 2003.
 N. E. Huang, Z. Shen, S. R. Long et al., “The empirical mode decomposition and the Hubert spectrum for nonlinear and nonstationary time series analysis,” Proceedings of the Royal Society of London A, vol. 454, no. 1971, pp. 903–995, 1998. View at: Google Scholar
 S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33–61, 1998. View at: Google Scholar
 F. van Belzen and S. Weiland, “Reconstruction and approximation of multidimensional signals described by proper orthogonal decompositions,” IEEE Transactions on Signal Processing, vol. 56, no. 2, pp. 576–587, 2008. View at: Publisher Site  Google Scholar
 E. Deléchelle, J. Lemoine, and O. Niang, “Empirical mode decomposition: an analytical approach for sifting process,” IEEE Signal Processing Letters, vol. 12, no. 11, pp. 764–767, 2005. View at: Publisher Site  Google Scholar
 O. Niang, Empirical mode decomposition: contribution à la modélisation mathématique et application en traitement du signal et l'image [Ph.D. thesis], University of Paris, Créteil, France, 2007.
 O. Niang, E. Delechelle, and J. Lemoine, “A spectral approach for sifting process in empirical mode decomposition,” IEEE Transactions on Signal Processing, vol. 58, no. 11, pp. 5612–5623, 2010. View at: Publisher Site  Google Scholar
 O. Niang, A. Thioune, M. C. ElGueirea, E. Delchelle, and J. Lemoine, “Partial differential equationbased approach for empirical mode decomposition: application on image analysis,” IEEE Transaction on Image Processing, vol. 21, no. 9, pp. 3991–4001, 2012. View at: Google Scholar
Copyright
Copyright © 2012 Oumar Niang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.