Multidimensional empirical wavelet transform
Abstract
The empirical wavelet transform is a data-driven time-scale representation consisting of an adaptive filter bank. Its robustness to data has made it the subject of intense developments and an increasing number of applications in the last decade. However, it has been mostly studied theoretically for signals and its extension to images is limited to a particular generating function. This work presents a general framework for multidimensional empirical wavelet transform based on any wavelet kernel. It also provides conditions to build wavelet frames for both continuous and discrete transforms. Moreover, numerical simulations of transforms are given.
Keywords: empirical wavelets, multidimensional transform, frames, image processing.
MSCcodes: 42C15, 42C40, 68U10.
1 Introduction
The wavelet transform is a reference tool for time-scale representation used in many signal and image processing techniques, such as denoising, deconvolution and texture segmentation. Originally, it consists of projecting data onto wavelet filters that are built from a mother wavelet which is scaled and modulated independently of the data. In practice, this leads to the construction of wavelet filters based on a prescribed scheme, such as a dyadic decomposition. Although this approach is widely used in contemporary research, it is not guaranteed to be optimal for the data at hand, since a prescribed scheme does not take into account the specificity of the underlying Fourier spectrum. Therefore, data-driven filtering approaches have received much attention to provide an accurate time-scale representation that is robust to the data. Among them, empirical mode decomposition [14], a purely algorithmic approach which behaves as a filter bank [6], has been widely used in real-world applications. Inspired by this decomposition, empirical wavelet transform has been introduced in [7] to provide a more consistant decomposition with a sound theoretical foundation [18, 30]. In the last decade, this transform has been the subject of an increasing interest through a continuous development and numerous applications in various fields, as reviewed in [15, 23]. To name a few applications, we can mention seismic time-frequency analysis [22], electrocardiogram (ECG) signal compression [19], epileptic seizure detection [1, 27], speech recognition [21], time series forecasting [25], glaucoma detection [24], hyperspectral image classification [26], texture segmentation [16], multimodal medical image fusion [28] and cancer histopathological image classification [5]. Particularly, this transform has shown to outperform traditional wavelet transforms for texture segmentation [15] and framelet tranforms for texture denoising [17].
The construction of empirical wavelet systems consists of two steps: extracting supports of the harmonic modes of the function under study, and constructing empirical wavelet filters that are compactly (or very rapidly decaying) supported in the Fourier domain by the extracted supports. This construction is the core of an ongoing and active research effort for one-dimensional (1D) and two-dimensional (2D) functions. For 1D functions, the detection of the segments supporting each harmonic modes in the Fourier domain is usually performed by extracting the lowest minima between them using a scale-space representation [11]. For 2D functions, several different techniques have been proposed to delimit the supports of the harmonic modes, such as the Curvelet [12], Watershed [17] and Voronoi [9] partitioning methods. The construction of wavelet filters based on the detected supports is usually done in the Fourier domain. In the 1D domain, [8] proposed a general framework to build continuous empirical wavelet filters from a generating function, such as the Meyer, Shannon or Gabor scaling functions. These 1D empirical wavelet systems are written as modulations and dilations of a wavelet kernel based on segments that divide the Fourier line. Such systems have been shown to induce both continuous and discrete frames in [10]. In the 2D domain, empirical wavelet filters have been designed following the Littlewood-Palley wavelet formulation for various Fourier partitioning methods [9, 12, 17]. However, the proposed construction is only valid for discrete images and is entirely based on the distance to the support boundaries, which limits its extension to classic scaling functions. So far, no construction of empirical wavelets in higher dimensions has been proposed. In addition, empirical wavelet filters for real-valued functions are built from supports that take into account the symmetry of the corresponding Fourier transform, but these have been little studied theoretically.
This work aims to provide a general framework for empirical wavelet transforms of multidimensional functions, thus extending the 1D framework in [8, 10]. We show that we can build empirical wavelets on Fourier supports, symmetric or not, from any wavelet kernel defined in the Fourier domain, using diffeomorphisms that map these supports to the wavelet kernel’s Fourier support. Both continuous and discrete transforms are considered. In addition, conditions for the construction of wavelet frames are examined.
The paper is organized as follows. The construction of the multidimensional empirical wavelet systems and the resulting transforms is described in Section 3. Theoretical results on these systems as frames are given in Section 4. The special case of Fourier supports resulting from affine deformations of the wavelet kernel’s Fourier support is studied in Section 5. Finally, in Section 6, specific 2D wavelet systems are tailored from classic wavelet kernels and studied numerically on images. A Matlab toolbox will be made publicly available at the time of publication.
2 Notations and reminders
We respectively denote and the boundary and closure of a set . We denote the subset of positive elements of a set . The Jacobian of a differentiable function is denoted . We recall that a function is called a diffeomorphism if it is infinitely differentiable and invertible of inverse infinitely differentiable.
We consider that the space of square integrable functions is endowed with the usual inner product
The Fourier transform of a function and its inverse are given by, respectively,
where stands for the usual dot product in . The translation operator of a function for is defined by
We recall hereafter definitions on frames that are essential throughout this work. A set of functions of is a frame if there exist two constants such that, for every ,
with a measure set. In particular, is called a tight frame if and a Parseval frame if . A frame is the dual frame of if, for every ,
It is well known that a frame is a tight frame if and only if there exist such that is a dual frame of . In these definitions, the set can be a cartesian product of both uncountable and countable sets. In particular, countable sets equipped with a counting measure lead to summations instead of integrals. For an in-depth introduction to frames, interested readers can see [2].
3 Multidimensional dimensional empirical wavelet system
In this section, we build empirical wavelet systems for the analysis of a given -variate function , with . A key feature of empirical wavelet filters is that they are adaptive: they are constructed from a Fourier domain partitioning scheme that is data-driven rather than pre-specified. We first define this Fourier partitioning. We then provide the formalism to construct empirical wavelet systems. Finally, we define empirical wavelet transforms.
3.1 Fourier domain partitions
In this section, we introduce the formalism used for the Fourier supports involved in the construction of empirical wavelet systems.
Definition 1.
A partition of the Fourier domain is defined as a family of disjoint connected open sets , with , of closures covering the Fourier domain, i.e., satisfying
A partition can consist of either an infinite number of with compact closure or a finite number of composed of both compact and non-compact closures . Since the sets are connected, the closure is compact if and only if is bounded.
In the 1D domain, this definition coincides with the Fourier line partitioning proposed by [8] where unbounded intervals, called rays, correspond to non-compact supported closures and segments to compact supported closures. An example of a partition of the Fourier domain in the 2D domain is given in fig. 1.

The partition is usually constructed such that each set contains one mode of the Fourier domain. To this end, we can first detect the modes of the Fourier spectrum using the scale-space representation [11] and then define boundaries separating these modes. In 1D, the intervals can be defined using the lowest minima between these modes. In 2D, the extraction of supports can be performed by various methods, such as the Tensor (grid) [7], Ridgelet (radial), Curvelet (radial and angular) [12], Watershed [17] or Voronoi [9] tilings.
A special case is raised by the real-valued functions since their Fourier spectrum is even. It is therefore natural to consider a symmetric partition , defined as follows.
Definition 2.
A partition is called symmetric if
This definition implies that the region contains the zero frequency. A procedure of symmetrization of partitions has been proposed in [17]. For such partitions, we will build filters on sets of paired regions rather than on single regions .
3.2 Empirical wavelet filter bank
In this section, we introduce empirical wavelet filter banks induced by a wavelet kernel for a given Fourier domain partition. Two types of filters are proposed, depending on the symmetry of the Fourier domain supports.
Let be a wavelet kernel such that its Fourier transform is localized in frequency and verifies, for some connected open bounded subset ,
This condition ensures that is mostly supported by . Generally, is homogeneous or separable, implying that is a -ball or -ball in .
Given a partition , the goal of this section is to define, from any wavelet kernel , two banks of wavelet filters that are mostly supported in the Fourier domain by , or in the case of a symmetric partition. To this end, we make the following assumption, which is used throughout the paper.
Hypothesis 1.
For every , there exists a diffeomorphism on such that
A diffeomorphism on a bounded set is illustrated in Figure 2. This assumption is mild since, by the Hadamard-Cacciopoli theorem [4], if is simply connected (i.e., has no hole), an infinitely differentiable function is a diffeomorphism if and only if it is proper, i.e., the preimage of any compact set under is compact.

First, we consider the case of a partition that is not necessarily symmetric.
Definition 3.
The empirical wavelet system, denoted , corresponding to the partition is defined by, for every ,
The determinant is a normalization coefficient for the conservation of energy when , i.e.,
Example 3.1.
We consider the 1D case (). Let a wavelet kernel on of Fourier transform with support and a family of non-overlapping open bounded intervals with center such that . Then are diffeomorphisms such that and the empirical wavelet system is given by, for every ,
(1) |
This definition is in agreement with the definition given in [8]. For the diffeomorphisms also satisfying , Definition 1 becomes, for every ,
which is different from Equation 1 if is not even.
Now, we consider that is a symmetric partition. To build wavelet filters which are mostly supported by , we assume that satisfies
Necessarily, the system must be symmetric with respect to frequency band, that is, it must satisfy the property
In this context, we only consider the diffeomorphisms for . The function is a diffeomorphism, that verifies when , which suggests the following definition.
Definition 4.
The symmetric empirical wavelet system, denoted , corresponding to the symmetric partition is defined by, for every ,
(2) |
where and .
In this definition, is not necessarily even for any , but ensures that the parity of implies the parity of . Moreover, we can write Equation 2 explicitely as follows, for every and ,
Thus, for such that and , the factor guarantees the conservation of the energy, i.e.,
In particular, if and are disjoint, the conservation of energy is guaranteed when has a compact support.
Example 3.2.
As in Example 3.1, we consider , on with support and a family of non-overlapping bounded intervals with center such that . For the diffeomorphism , the symmetric empirical wavelet system reads, for every ,
Remark 1.
Due to the linearity of the inverse Fourier tranform, the symmetric empirical wavelet system also satisfies, in the spatial domain, for every ,
(3) |
It is therefore sufficient to write in the spatial domain to write in the spatial domain.
3.3 Empirical wavelet transform
In this section, we introduce continuous and discrete transforms of a function based on either the empirical wavelet systems or the symmetric empirical wavelet systems .
Definition 5.
The -dimensional continuous empirical wavelet transform of a real or complex-valued function is defined by, for every and ,
(4) |
The -dimensional continuous symmetric empirical wavelet transform of a real-valued function is defined by, for every and ,
(5) |
In this definition, the -dimensional continuous symmetric empirical wavelet transform is symmetric for the frequency variable but not for the translation variable .
The following proposition shows that the -dimensional continuous empirical wavelet transform can be rewritten as a filtering process. It is a straight generalization of Proposition 1 of [8]. We will adopt the notation , and denote and the convolution and pointwise product of functions, respectively.
Proposition 1 (Filtering process).
The -dimensional continuous empirical wavelet transform is equivalent to the convolution of with the function , i.e., for every and ,
(6) |
In addition, if is a real-valued function, for every and ,
(7) |
Proof.
Given functions and , we have,
This proves the first equality of Equation 6. Now, noticing that
we can rewrite the convolution obtained above as a pointwise multiplication in the Fourier domain,
This provides the second equality of Equation 6.
Given the relation between and in the spatial domain, which is given by Equation 3, Equation 7 directly stems from Equation 6 using the linearity of the convolution, the inner product and the inverse Fourier transform. ∎
Definition 6.
Let . The -dimensional discrete empirical wavelet transform of a real or complex-valued function is defined by, for every and ,
The -dimensional discrete symmetric empirical wavelet transform of a real-valued function is defined by, for every and ,
with .
4 Frames of empirical wavelets
In this section, we provide conditions to build empirical wavelet frames for both continuous and discrete empirical wavelet transforms of a given function . In particular, we examine the potential reconstruction of .
4.1 Continuous frames
In this section, we build dual frames for the two proposed systems
with , involved in the continuous wavelet transform of Definition 5. This allows to find sufficients conditions for these systems to be tight frames.
First, we consider the system . The following theorem guarantees the exact reconstruction of a function from the continuous empirical wavelet transform given by Equation 4. It is a straight generalization of Proposition 2 of [8] to the -dimensional case.
Theorem 1 (Continuous dual frame).
Let assume that, for ,
Then, for every ,
(8) |
where the set of dual empirical wavelets is defined by, for every and ,
Proof.
Using the Fourier transform and its inverse, we can write
This proves the first equality of Equation 8. Moreover, we can rewrite
This proves the second equality of Equation 8. ∎
A particular case of the previous theorem is given by the following corollary.
Corollary 1 (Continuous tight frame).
If, for ,
then is a continuous tight frame. Specifically, for every ,
Proof.
Now, we consider the symmetric wavelet filter bank . The following theorem guarantees the exact reconstruction of a real-valued function from the continuous symmetric empirical wavelet transform given in Equation 5.
Theorem 2 (Continuous symmetric dual frame).
Let assume that, for ,
Then, for any ,
(9) |
where the set of dual symmetric empirical wavelets is defined by, for every and ,
Proof.
First, we have
which ensures that the symmetric empirical wavelet filters are well defined. Then, Equation 9 stems from the same computation as in the proof of Theorem 1. ∎
Similarly to Corollary 1, the following corollary gives a particular case of the previous theorem.
Corollary 2 (Continuous symmetric tight frame).
If, for ,
then is a continuous tight frame. Specifically, for every ,
Proof.
We can write
and the result follows from the fact that . ∎
4.2 Discrete frames
In this section, we exhibit conditions to build discrete wavelet frames involved in the wavelet transforms of Definition 6. These conditions depend on the compactness of the support of the wavelet kernel’s Fourier transform . The two underlying cases are examined separately.
4.2.1 Compactly supported
In this section, we consider that has a compact support. Excluding the supports of a partition with non-compact closure, we can state sufficient and necessary conditions for which the systems
are Parseval frames, with
The following theorem first gives a sufficient and necessary condition to build a tight frame from . It is a straight generalization of Theorems 4-7 of [10] to the -dimensional case.
Theorem 3 (Discrete Parseval frame).
Let us denote and . The system is a Parseval frame for if and only if, for ,
for every , where
and stands for the Kronecker delta function on , i.e., if and otherwise.
Proof.
Let us denote Theorem 2.1 in [13] states, with , and , the desired equivalence under the condition that
The condition above is given by the proof of Theorem 4 in [10], replacing by . This results comes from the fact that and are compact and that there are finitely many that intersect . This proves the equivalence. ∎
Remark 2.
The previous theorem implicitely permits to easily build dual frames when, for ,
as follows:
Similarly, the following theorem gives a sufficient and necessary condition to build a tight frame from the symmetric filter bank .
Theorem 4 (Discrete symmetric Parseval frame).
Let us denote and . Then, the system is a Parseval frame for if and only if, for ,
(10) |
for every , where
and stands for the Kronecker delta function on .
Proof.
Let us denote Noticing that
Theorem 2.1 in [13] states (by taking , and ) that the system is a Parseval frame for if and only if, for ,
under the condition that
This condition is given by the proof of Theorem 4 in [10], replacing by and by . It results from the fact that and are compact and that there are finitely many that intersect . This proves the equivalence. ∎
4.2.2 Non-compactly supported
In this section, we assume that the support of is not compact. The following theorems state sufficient conditions for which the system
are frames. The first theorem, for the system , is a straight generalization of Theorem 8 in [10]
Theorem 5 (Discrete frame).
If
and
then the system is a frame for with frame bounds and .
Proof.
Let . We follow the proof of Theorem 8 in [10], replacing by and by . First, we use arguments similar to the proof of Theorem 3.4 in [20]. Since can be written as a disjoint union with , we rewrite
with .
The function belongs to and each of its component is -periodic. Thus, by Parseval’s identity, we get
Hence, by the change of indices , we get
Splitting the terms when and , we obtain
(11) |
where
Finally, the arguments of the proof of Theorem 3.1 in [3], with , , and , give the results. ∎
Theorem 6 (Discrete symmetric frame).
If
and
then the system is a frame for with frame bounds and .
Proof.
This results from the argumentation of the proof of Theorem 5 by replacing by and by . ∎
5 Empirical wavelet systems from affine deformations
In this section, we consider a partition for which we can find diffeomorphisms that are affine functions, i.e., of the form with a linear function. If the construction of the empirical wavelet systems introduced in Section 3 is natural in the Fourier domain, it is also possible to build them directly in the spatial domain for affine mappings.
First, the following Lemma gives the explicit expression of a function with Fourier transform deformed by a linear function.
Lemma 1.
Let be a linear function (non identically zero), with . The function corresponding to the inverse Fourier transform of the deformation of the Fourier transform of a function by , i.e., , is given by, for every ,
(12) |
where .
Proof.
By taking the inverse Fourier transform, we have (using the substitution )
∎
Finally, for affine diffeormorphisms, empirical wavelet systems can be built in the spatial domain using the following proposition.
Proposition 2 (Spatial domain construction).
Let be a partition of the Fourier domain and a wavelet kernel. Let assume there exists a set of linear functions such that if is bounded and otherwise. The set of empirical wavelets, , defined in the Fourier domain by, for every ,
is given in the spatial domain by, for every ,
Proof.
Moreover, since the translation by in the Fourier domain is a modulation of frequency in the spatial domain, we can rewrite
By applying Lemma 1 with and , we obtain the result. ∎
Example 5.1.
As in Example 3.1, we consider the 1D case with of support the open interval of size centered on and a partition of open bounded intervals with center . The diffeomorphism , satisfying , can be rewritten with and . The associated empirical wavelet system is therefore given in the spatial domain by, for every ,
We thus retrieve the definition given in [8].
Example 5.2.
We can also build wavelets on a 2D dyadic tiling. We consider a separable wavelet kernel , where is a scaling function supported by an open interval centered in , and the diffeomorphism , , with , and . The associated translated empirical wavelet system is given in the spatial domain by, for every and ,
Finally, the transform resulting from definition 6 using this system is similar to the classic discrete wavelet transform.
The construction of a symmetric empirical wavelet system , induced by affine diffeomorphisms, in the spatial domain stems from Proposition 2, using Equation 3.
Example 5.3.
We consider again the 1D domain. From the system defined as in Example 5.1, we can build a symmetric system as follows, for every ,
and, for ,
In particular, this extends the definitions of 1D empirical wavelet systems in [8] to symmetric partitions of the Fourier domain.
6 Construction of empirical wavelet systems
In this section, 2D continuous empirical wavelet systems are constructed from Gabor and Shannon wavelet kernels and we examine their guarantees of reconstruction. Their practical behaviors are analyzed through numerical experiments conducted on two different (real-valued) images: a toy image of size and the classic Barbara image of size . These images are shown in Figure 3 (left).
For the Fourier domain partitioning of both images, the harmonic modes are detected by the scale-space representation [11] on the logarithm of the Fourier spectrum, using a scale-space parameter set to . We get for the toy image and for the Barbara image. The Fourier domain is then partitioned by separating the detected modes using either the Watershed [17] or Voronoi [9] methods, which provide as many connected supports of low constrained shapes as modes. Figure 3 (middle and right) shows the (symmetric) Fourier tranform of both images, partitioned by either Watershed or Voronoi into symmetric regions , with .






To numerically construct empirical wavelet systems as in Equation 2, we need to compute an estimate of the diffeomorphism . This estimation is performed using the demons algorithm [29], which is inspired by a diffusion process and is widely used in medical image registration. This algorithm estimates a displacement field representing the desired mapping by alternating between solving the flow equations and regularization. For each region , the pair of smoothing parameter and number of multiresolution image pyramid levels is selected by a grid search minimizing the quadratic risk on the values in , where is the highest integer such that is smaller than each dimension of the image. The number of iterations at the pyramid levels are set to from the highest to the lowest pyramid level.
For all the numerical experiments, the symmetric empirical wavelet transform is computed as in Definition 6 with for every , so that the results for continuous wavelet frames in Section 4 apply. To each wavelet transform coefficient of an image of size , we associate the wavelet transform spectrum defined as and the Fourier spectrum energy of the underlying region that reads
The reconstruction of given by Equation 9 is assessed by the Mean Squared Error (MSE) given by
6.1 2D empirical Gabor wavelets
The Fourier transform of the 1D Gabor wavelet kernel is given by (see [8]), for every ,
which is mostly supported by . We define its extension to 2D by, for every ,
which is mostly supported by the open disk of center and radius denoted .
The following proposition gives guarantees of reconstruction from a Gabor empirical wavelet systems.
Proposition 3 (Gabor empirical wavelet reconstruction).
Let assume that the diffeomorphisms satisfy, for , for every and is a bounded sequence. Then, the continuous reconstruction is guaranteed for the empirical wavelet systems and induced by , and is given by Equations 8 and 9.
Proof.
We have, for every ,
First, since is a diffeomorphism, we have, for every , and therefore
Now, let us denote . For and every , the are all different and the condition means that there are at most integers for which the have the same value as . It follows that, for ,
where the last line comes from the fact that is a sampling of and is a positive function. Then, Theorem 1 applies and gives a dual frame of . This guarantees the reconstruction using Equation 8.
In addition, in the case of a symmetric partition , we show similarly that, for ,
Then, Theorem 2 applies and gives a dual frame of . The reconstruction is then given by Equation 9. ∎
For the toy image, Figures 4 and 5 compare the preimage of under the diffeomorphism estimate to the targeted and show the symmetric empirical Gabor wavelet coefficients induced by , for the Watershed and Voronoi partitions, respectively, and . The diffeomorphisms are well estimated for both partitions but the more constrained shapes of the Voronoi partition allow for better estimates. The MSE of the reconstruction from the Watershed and Voronoi transforms are, respectively, and , confirming the accurate diffeomorphism estimation. In addition, the different components of the toy image are well recovered by the wavelet coefficients associated with the highest Fourier spectrum energies.
For the Barbara image, Figures 6 and 7 compare the preimage of under to the targeted and show the symmetric empirical Gabor wavelet coefficients induced by , for the Watershed and Voronoi partitions, respectively, and . The diffeomorphism estimation is much more accurate on the Vornoi partition than on the Watershed partition, in particular for the region which is very large for the Watershed partition. Thus, in terms of reconstruction, Watershed and Voronoi partition lead to MSE of and , respectively.
6.2 2D empirical Shannon wavelets
The 1D Shannon scaling function is a function given in the Fourier domain by, for every ,
This definition can be extended to the 2D domain as a separable function given by, for every ,
which is supported by the square centered in of side length denoted .
The following proposition gives guarantees of reconstruction of Shannon empirical wavelet systems.
Proposition 4 (Shannon wavelet reconstruction).
Assume that the boundaries have measures zero. Then, the continuous reconstruction is guaranteed for the empirical wavelet systems and induced by , and is given by Equations 8 and 9.
Proof.
Let fix . For every ,
Since is a diffeomorphism, it follows that, for , and therefore
This corresponds to the condition of Theorem 1, which gives the reconstruction from a dual frame of using Equation 8.
In addition, for every ,
Then, Theorem 2 gives a dual frame of permitting the reconstruction following Equation 9. ∎
For the toy image, Figures 8 and 9 compare the preimage of under the diffeomorphism estimate to the targeted and show the symmetric empirical Shannon wavelet coefficients induced by , for the Watershed and Voronoi partitions, respectively, and . Most of the diffeomorphisms are well estimated for both partitions except for the region of the Watershed partition. Thus, the MSE of the reconstruction from the Watershed and Voronoi transforms are, respectively, and , confirming the higher accuracy of the diffeormophism estimation for the Voronoi partition. However, the components of the toy image are better separated by the wavelet coefficients associated to the Watershed partition.
For the Barbara image, Figures 10 and 11 compare the preimage of under to the targeted along with the symmetric empirical Shannon wavelet coefficients induced by , for the Watershed and Voronoi partitions, respectively, and . The diffeomorphism estimates associated with the Watershed partition show little accuracy for some regions, in particular regions , and . In contrast, the Voronoi partition allows for better estimates despite some singularity due to the irregularity at the corner of the square . The reconstruction from the Watershed and Voronoi partitions lead to MSE of, respectively, and , which quantifies the higher accuracy of diffeomorphism estimation for the Voronoi partition.
6.3 Discussion
As illustrated in this section, continuous wavelet frames can easily be built theoretically but the resulting numerical transform significantly relies on the estimation of the mappings . Overall, the Voronoi partitions provides regions that are easier to map than the Watershed partitions, particularly when the wavelet kernel’s Fourier support is a square. However, the Voronoi partition can lead to a less adapted separation of the harmonic modes, implying that different wavelet coefficients can contain information of the same frequency band. These observations highlight the need for an efficient diffeomorphism estimator robust to sets and for extensions to higher dimensions and applications. Moreover, a perfect detection and delimitation of harmonic modes is difficult in practice, which suggests to explore several wavelet kernels in applications.
7 Conclusions
In this work, we proposed a general formalism to build multidimensional empirical wavelet systems for a large variety of (potentially symmetric) Fourier domain partitions based on continuous wavelet kernels. Moreover, we showed conditions for the existence of continuous and discrete empirical wavelet frames, which in particular allow to guarantee the reconstruction from the wavelet transforms. Specific wavelet systems based on classic wavelet kernels have also been developed and have been shown to be frames under mild assumptions on the Fourier supports. In addition, the implementation toolbox of these wavelet systems will be made freely available at the time of publication. Future work will focus on estimating robustly and efficiently the diffeomorphisms involved in the proposed definitions in 2D and 3D. Applications will also be considered.
Acknowledgements
This work has been sponsored by the Air Force Office of Scientific Research, grant FA9550-21-1-0275.
References
- [1] A. Bhattacharyya, V. Gupta, and R. B. Pachori, Automated identification of epileptic seizure EEG signals using empirical wavelet transform based Hilbert marginal spectrum, in Proceedings of the 22nd International Conference on Digital Signal Processing (DSP), 2017, pp. 1–5, https://doi.org/10.1109/icdsp.2017.8096122.
- [2] O. Christensen, Frames and bases: An introductory course, Birkhäuser Boston, MA, 2008, https://doi.org/10.1007/978-0-8176-4678-3.
- [3] O. Christensen and A. Rahimi, Frame properties of wave packet systems in , Advances in Computational Mathematics, 29 (2008), pp. 101–111, https://doi.org/10.1007/s10444-007-9038-3.
- [4] G. De Marco, G. Gorni, and G. Zampieri, Global inversion of functions: an introduction, Nonlinear Differential Equations and Applications NoDEA, 1 (1994), pp. 229–248, https://doi.org/10.1007/BF01197748.
- [5] B. S. Deo, M. Pal, P. K. Panigrahi, and A. Pradhan, An ensemble deep learning model with empirical wavelet transform feature for oral cancer histopathological image classification, International Journal of Data Science and Analytics, (2024), pp. 1–18, https://doi.org/10.1007/s41060-024-00507-y.
- [6] P. Flandrin, G. Rilling, and P. Goncalves, Empirical mode decomposition as a filter bank, IEEE signal processing letters, 11 (2004), pp. 112–114.
- [7] J. Gilles, Empirical wavelet transform, IEEE Transactions on Signal Processing, 61 (2013), pp. 3999–4010, https://doi.org/10.1109/TSP.2013.2265222.
- [8] J. Gilles, Continuous empirical wavelets systems, Advances in Data Science and Adaptive Analysis, 12 (2020), p. 2050006, https://doi.org/10.1142/S2424922X20500060.
- [9] J. Gilles, Empirical voronoi wavelets, Constructive Mathematical Analysis, 5 (2022), pp. 183–189, https://doi.org/10.33205/cma.1181174.
- [10] J. Gilles and R. Castro, Empirical wavelet frames, arXiv preprint arXiv:2407.16089, (2024).
- [11] J. Gilles and K. Heal, A parameterless scale-space approach to find meaningful modes in histograms - application to image and spectrum segmentation, International Journal of Wavelets, Multiresolution and Information Processing, 12 (2014), p. 1450044, https://doi.org/10.1142/S0219691314500441.
- [12] J. Gilles, G. Tran, and S. Osher, 2D Empirical transforms. Wavelets, Ridgelets and Curvelets Revisited, SIAM Journal on Imaging Sciences, 7 (2014), pp. 157–186, https://doi.org/10.1137/130923774.
- [13] E. Hernández, D. Labate, and G. Weiss, A unified characterization of reproducing systems generated by a finite family, ii, The Journal of Geometric Analysis, 12 (2002), pp. 615–662, https://doi.org/10.1007/BF02930656.
- [14] N. E. Huang, Z. Shen, S. R. Long, M. C. Wu, H. H. Shih, Q. Zheng, N.-C. Yen, C. C. Tung, and H. H. Liu, The empirical mode decomposition and the hilbert spectrum for nonlinear and non-stationary time series analysis, Proceedings of the Royal Society of London. Series A: mathematical, physical and engineering sciences, 454 (1998), pp. 903–995, https://doi.org/10.1098/rspa.1998.0193.
- [15] Y. Huang, V. De Bortoli, F. Zhou, and J. Gilles, Review of wavelet-based unsupervised texture segmentation, advantage of adaptive wavelets, IET Image Processing, 12 (2018), pp. 1626–1638, https://doi.org/10.1049/iet-ipr.2017.1005.
- [16] Y. Huang, F. Zhou, and J. Gilles, Empirical curvelet based fully convolutional network for supervised texture image segmentation, Neurocomputing, 349 (2019), pp. 31–43, https://doi.org/10.1016/j.neucom.2019.04.021.
- [17] B. Hurat, Z. Alvarado, and J. Gilles, The empirical watershed wavelet, Journal of Imaging, 6 (2020), p. 140, https://doi.org/10.3390/jimaging6120140.
- [18] M. Kedadouche, M. Thomas, and A. Tahan, A comparative study between empirical wavelet transforms and empirical mode decomposition methods: Application to bearing defect diagnosis, Mechanical Systems and Signal Processing, 81 (2016), pp. 88–107.
- [19] R. Kumara and I. Saini, Empirical Wavelet Transform based ECG signal compression, IETE Journal of Research, 60 (2014), pp. 423–431, https://doi.org/10.1080/03772063.2014.963173.
- [20] D. Labate, G. Weiss, and E. Wilson, An approach to the study of wave packet systems, Contemporary Mathematics, 345 (2004), pp. 215–236, https://doi.org/10.1090/conm/345/06250.
- [21] O. Lavrynenko, D. Bakhtiiarov, V. Kurushkin, S. Zavhorodnii, V. Antonov, and P. Stanko, A method for extracting the semantic features of speech signal recognition based on empirical wavelet transform, Radioelectronic and Computer Systems, (2023), pp. 101–124, https://doi.org/10.32620/reks.2023.3.09.
- [22] W. Liu, S. Cao, and Y. Chen, Seismic time-frequency analysis via empirical wavelet transform, IEEE Geoscience and Remote Sensing Letters, 13 (2016), pp. 28–32, https://doi.org/10.1109/lgrs.2015.2493198.
- [23] W. Liu and W. Chen, Recent advancements in empirical wavelet transform and its applications, IEEE Access, 7 (2019), pp. 103770–103780, https://doi.org/10.1109/ACCESS.2019.2930529.
- [24] S. Maheshwari, R. B. Pachori, and U. R. Acharya, Automated diagnosis of glaucoma using empirical wavelet transform and correntropy features extracted from fundus images, IEEE journal of biomedical and health informatics, 21 (2016), pp. 803–813, https://doi.org/10.1109/JBHI.2016.2544961.
- [25] H. A. Mohammadi, S. Ghofrani, and A. Nikseresht, Using empirical wavelet transform and high-order fuzzy cognitive maps for time series forecasting, Applied Soft Computing, 135 (2023), p. 109990, https://doi.org/10.1016/j.asoc.2023.109990.
- [26] T. V. Nidhin Prabhakar and P. Geetha, Two-dimensional empirical wavelet transform based supervised hyperspectral image classification, ISPRS Journal of Photogrammetry and Remote Sensing, 133 (2017), pp. 37–45, https://doi.org/10.1016/j.isprsjprs.2017.09.003.
- [27] S. Panda, A. Das, S. Mishra, and M. N. Mohanty, Epileptic seizure detection using deep ensemble network with empirical wavelet transform, Measurement Science Review, 21 (2021), pp. 110–116, https://doi.org/10.2478/msr-2021-0016.
- [28] S. Polinati and R. Dhuli, Multimodal medical image fusion using empirical wavelet decomposition and local energy maxima, Optik, 205 (2020), p. 163947, https://doi.org/10.1016/j.ijleo.2019.163947.
- [29] J.-P. Thirion, Image matching as a diffusion process: an analogy with maxwell’s demons, Medical image analysis, 2 (1998), pp. 243–260, https://doi.org/10.1016/S1361-8415(98)80022-4.
- [30] A. N. Wardana, A comparative study of emd, ewt and vmd for detecting the oscillation in control loop, in 2016 International Seminar on Application for Technology of Information and Communication (ISemantic), IEEE, 2016, pp. 58–63.