Since Φ is translation invariant, the Lipschitz upper bound does not depend upon the maximum translation amplitude supx∣τ(x)∣ of the diffeomorphism metric (1). The Lipschitz continuity (2) implies that Φ is invariant to global translations, but it is much stronger. Φ is almost invariant to “local translations” by τ(x), up to the first and second order deformation terms.
The representation of stationary processes with the Fourier power spectrum results from the translation invariance of the Fourier modulus. Similarly, Section 4 defines an expected scattering transform which maps stationary processes to an l2 space. Scattering coefficients depend upon high order moments of stationary processes, and can thus discriminate processes having same second-order moments. As opposed to the Fourier spectrum, a scattering representation is Lipschitz continuous to random deformations up to a log term. For large classes of ergodic processes, it is numerically observed that the scattering transform of a single realization provides a mean-square consistent estimator of the expected scattering transform.
A software package is available at www.cmap.polytechnique.fr/scattering, to reproduce numerical experiments. Applications to audio and image classification can be found in .
Finite Path Scattering
Since ∣ξ∣ can be arbitrarily large, Φ(f)=∣f^∣ does not satisfy the Lipschitz continuity condition (2) when scaling high frequencies. The frequency displacement from ξ to (1−s)ξ has a small impact if sinusoidal waves are replaced by localized functions having a Fourier support which is wider at high frequencies. This is achieved by a wavelet transform , whose properties are briefly reviewed in this section.
Its Fourier transform is ψ^2jr(ω)=ψ^(2−jr−1ω). A scattering transform is computed with wavelets that can be written
If f is real then f^(−ω)=f^∗(ω) and if ψ^(ω) is real then W[−λ]f=W[λ]f∗. Let G+ denote the quotient of G with {−1,1}, where two rotations r and −r are equivalent. It is sufficient to compute W[2jr]f for “positive” rotations r∈G+. If f is complex then W[2jr]f must be computed for all r∈G=G+×{−1,1}.
A wavelet transform at a scale 2J only keeps wavelets of frequencies 2j>2−J. The low frequencies which are not covered by these wavelets are provided by an averaging over a spatial domain proportional to 2J:
If f is real then the wavelet transform W_{J}f=\Big{\{}A_{J}f\,,\,\Bigl{(}W[\lambda]f\Bigr{)}_{\lambda\in{\Lambda}_{J}}\Bigr{\}} is indexed by ΛJ={λ=2jr:r∈G+,2j>2−J}. Its norm is
where β=1 for complex functions and β=1/2 for real functions.
Proof: If f is complex, β=1 and one can verify that (9) is equivalent to
Since W[2jr]f(ω)=f^(ω)ψ^2jr(ω), multiplying (10) by ∣f^(ω)∣2, and applying the Plancherel formula proves that ∥WJf∥2=∥f∥2. For J=∞ the same result is obtained by letting J go to ∞.
Conversely, if ∥WJf∥2=∥f∥2 then (10) is satisfied for almost all ω. Otherwise, one can construct a function f=0 where f^ has a support in the domain of ω where (10) is not valid. With the Plancherel formula we verify that ∥WJf∥2=∥f∥2, which contradicts the hypothesis.
If f is real then ∣f^(ω)∣=∣f^(−ω)∣ so ∥W[2jr]f∥=∥W[−2jr]f∥. Hence ∥WJf∥ remains the same if r is restricted to G+ and ψ is multiplied by 2, which yields condition (9) with β=1/2. □
In all the following, ψ^ is a real function which satisfies the unitary condition (9). It implies that ψ^(0)=∫ψ(x)dx=0 and ∣ϕ^(rω)∣=∣ϕ^(ω)∣ for all r∈G. We choose ϕ^(ω) to be real and symmetric so that ϕ is also real and symmetric and ϕ(rx)=ϕ(x) for all r∈G. We also suppose that ϕ and ψ are twice differentiable and that their decay as well as the decay of their partial derivatives of order 1 and 2 is O((1+∣x∣)−d−2).
Since ϕ is invariant to rotations in G we verify that AJ commutes with rotations in G: AJ(g∘f)=g∘AJf for all g∈G.
In dimension d=1, G={−1,1}. According to (5), to build a complex wavelet ψ concentrated on a single frequency band, we set ψ^(ω)=0 for ω<0. Following (9), WJ is unitary if and only if
The one-dimensional function ψ^(∣ω∣) is chosen to satisfy (12). The Littlewood-Paley condition (9) is then equivalent to
2 Path Ordered Scattering
Convolutions with wavelets defines operators which are Lipschitz continuous to the action of diffeomorphisms, because wavelets are regular and localized functions. However, a wavelet transform is not invariant to translations, and W[λ]f=f⋆ψλ translates when f is translated. The main difficulty is to compute translation invariant coefficients, which remain stable to the action of diffeomorphisms, and retain high frequency information provided by wavelets. A scattering operator computes such a translation invariant representation. We first explain how to build translation invariant coefficients from a wavelet transform, while maintaining stability to the action of diffeomorphisms. Scattering operators are then defined, and their main properties are summarized.
If ψ(x)=eiη⋅xθ(x) then ψλ(x)=eiλη⋅xθλ(x), and hence
The convolution fλ⋆θλ is a low-frequency filtering because θ^λ(ω)=θ^(λ−1ω) covers a frequency ball centered at ω=0, of radius proportional to ∣λ∣. A non-zero invariant can thus be obtained by canceling the modulation term eiλη⋅x with M[λ]. A simple example is:
where Φ(h^(λη)) is the complex phase of h^(λη). This non-linear phase registration guarantees that M[λ] commutes with translations. It results from (13) that ∫M[λ]W[λ]f(x)dx=∣f^(λη)∣∣θ^(0)∣. It recovers the Fourier modulus representation, which is translation invariant but not Lipschitz continuous to diffeomorphisms as shown in (3). Indeed, the demodulation operator M[λ] in (14) commutes with translations but does not commute with the action of diffeomorphisms, and in particular with dilations. The commutator norm of M[λ] with a dilation is equal to 2, even for arbitrarily small dilations, which explains the resulting instabilities.
Lower frequencies created by a modulus result from interferences. For example, if f(x)=cos(ξ1⋅x)+acos(ξ2⋅x) where ξ1 and ξ2 are in the frequency band covered by ψ^λ then ∣f⋆ψλ(x)∣=2−1∣ψ^λ(ξ1)+aψ^λ(ξ2)ei(ξ2−ξ1)⋅x∣ oscillates at the interference frequency ∣ξ2−ξ1∣, which is smaller than ∣ξ1∣ and ∣ξ2∣.
The integration ∫U[λ]f(x)dx=∫∣f⋆ψλ(x)∣dx is translation invariant but it removes all the high frequencies of ∣f⋆ψλ(x)∣. To recover these high frequencies, a scattering also computes the wavelet coefficients of each U[λ]f: {U[λ]f⋆ψλ′}λ′. Translation invariant coefficients are again obtained with a modulus U[λ′]U[λ]f=∣U[λ]f⋆ψλ′∣ and an integration ∫U[λ′]U[λ]f(x)dx. If f(x)=cos(ξ1⋅x)+acos(ξ2⋅x) with a<1, ∣ξ2−ξ1∣≪∣λ∣ and ∣ξ2−ξ1∣ in the support of ψ^λ′ then U[λ′]U[λ]f is proportional to a∣ψλ(ξ1)∣∣ψλ′(∣ξ2−ξ1∣)∣. The second wavelet ψ^λ′ captures the interferences created by the modulus, between the frequency components of f in the support of ψ^λ. We now introduce the scattering propagator, which extends these decompositions.
Section 2.1 explains that if f is complex valued then its wavelet transform is W∞f={W[λ]f}−λ∈Λ∞λ∈Λ∞ whereas if f is real then W∞f={W[λ]f}λ∈Λ∞. If f is complex then at the next iteration U[λ1]f=∣W[λ1]f∣ is real so next stage wavelet transforms are computed only for λk∈Λ∞. The scattering propagator of a complex function is thus defined over “positive” paths p=(λ1,λ2,...,λm)∈Λ∞m and “negative” paths denoted −p=(−λ1,λ2,...,λm). This is analogous to the positive and negative frequencies of a Fourier transform. If f is real then W[−λ1]f=W[λ1]f∗ so U[−λ1]f=U[λ1]f and hence U[−p]f=U[p]f. To simplify explanations, all results are proved on real functions with scattering propagators restricted to positive paths. These results apply to complex functions by including negative paths.
If p=∅ then Sf(p) is non-linear but it preserves amplitude factors:
A scattering has similar scaling and rotation covariance properties as a Fourier transform. If f is scaled and rotated, 2lg∘f(x)=f(2lgx), then (11) implies that U[λ](2lg∘f)=2lg∘U[2−lgλ]f and cascading this result shows that
Inserting this result in the definition (18) proves that
The convolution with ϕ2J(x)=2−dJϕ(2−Jx) localizes the scattering transform over spatial domains of size proportional to 2J:
It defines an infinite family of functions indexed by PJ, denoted
For complex-valued functions, negative paths are also included in PJ, and SJ[−p]f=SJ[p]f if f is real.
Section 2.3 proves that for appropriate wavelets, ∥f∥2=∑p∈PJ∥SJ[p]f∥2. However, the signal energy is mostly concentrated on a much smaller set of frequency-decreasing paths p=(λk)k≤m for which ∣λk+1∣≤∣λk∣. Indeed, the propagator U[λ] progressively pushes the energy towards lower frequencies. The main theorem of Section 2.5 proves that a windowed scattering is Lipschitz continuous to the action of diffeomorphisms.
3 Scattering Propagation and Norm Preservation
A windowed scattering can be computed by iterating on the one-step propagator defined by
with AJf=f⋆ϕ2J and U[λ]f=∣f⋆ψλ∣. After calculating UJf, applying again UJ to each U[λ]f yields a larger infinite family of functions. The decomposition is further iterated by recursively applying UJ to each U[p]f. Since U[λ]U[p]=U[p+λ] and AJU[p]=SJ[p], it results that
Let ΛJm be the set of paths of length m, with ΛJ0={∅}. It is propagated into
Scattering calculations follow the general architecture of convolution neural-networks introduced by LeCun . Convolution networks cascade convolutions and a “pooling” non-linearity, which is here the modulus of a complex number. Convolution networks typically use kernels that are not predefined functions such as wavelets, but which are learned with backpropagation algorithms. Convolution network architectures have been successfully applied to number of recognition tasks and are studied as models for visual perception . Relations between scattering operators and path formulations of quantum field physics are also studied in .
Since WJ is unitary, setting h=0 also proves that ∥UJf∥=∥f∥, so UJ preserves the norm.
For any path set Ω the norms of SJ[Ω]f and U[Ω]f are
Since SJ[PJ] iterates on UJ which is nonexpansive, the following proposition derives that SJ[PJ] is also nonexpansive.
The scattering transform is nonexpansive:
Proof: Since UJ is nonexpansive, it results from (25) that
Summing these equations for m going from to ∞ proves that
Section 2.2 explains that each U[λ]f=∣f⋆ψλ∣ captures the frequency energy of f over a frequency band covered by ψ^λ and propagates this energy towards lower frequencies. The following theorem proves this result by showing that the whole scattering energy ultimately reaches the minimum frequency 2−J and is trapped by the low-pass filter ϕ2J. The propagated scattering energy thus goes to zero as the path length increases, and the theorem derives that ∥SJ[PJ]f∥=∥f∥. This result also applies to complex-valued functions by incorporating negative paths (−λ1,λ2,...,λm) in PJ.
Summing for m≤n<∞ proves that limm→∞∥U[ΛJm]f∥=0 is equivalent to limm→∞∑n=m∞∥SJ[ΛJn]f∥2=0. Since f=U[ΛJ0]f, summing (33) for 0≤n<m also proves that
so ∥SJ[PJ]f∥2=∑n=0∞∥SJ[ΛJn]f∥2=∥f∥2 if and only if limm→∞∥U[ΛJm]∥=0.
We now prove that condition (29) implies that limm→∞∥U[ΛJm]f∥2=0. It relies on the following lemma, which gives a lower bound of ∣f⋆ψλ∣ convolved with a positive function.
Appendix A uses this lemma to show that the scattering energy propagates progressively towards lower frequencies, and proves the following lemma.
Since U[Λm] is nonexpansive ∥U[ΛJm]f−U[ΛJm]fn∥≤∥f−fn∥ so
The proof shows that the scattering energy propagates progressively towards lower frequencies. The energy of U[p]f is mostly concentrated along frequency-decreasing paths p=(λk)k≤m for which ∣λk+1∣<∣λk∣. For example, if f=δ then paths of length 1 have an energy ∥U[2jr]δ∥2=∥ψ2jr∥2=2−dj∥ψ∥2. This energy is then propagated among all paths p∈PJ. For a cubic spline wavelet in dimension d=1, over 99.5% of this energy is concentrated along frequency-decreasing paths. Numerical implementations of scattering transforms thus limits computations to these frequency decreasing paths. The scattering transform of a signal of size N is computed along all frequency-decreasing paths, with O(NlogN) operations, by using a filter bank implementation .
The decay of ∑n=m∞∥SJ[ΛJn]f∥2 implies that we can neglect all paths of length larger than some m>0. The numerical decay of ∥SJ[ΛJn]f∥2 appears to be exponential in image and audio processing applications. The path length is limited to m=3 in classification applications .
4 Translation Invariance
We show that the scattering distance ∥SJ[PJ]f−SJ[PJ]h∥ is non-increasing when J increases, and thus converges when J goes to ∞. It defines a limit distance which is proved to be translation invariant. Section 3 studies the convergence of SJ[PJ]f when J goes to ∞, to the translation invariant scattering transform Sf.
Proof: Any p′∈PJ+1 can uniquely be written as an extension of a path p∈PJ where p is the longest prefix of p′ which belongs to PJ, and p′=p+q for some q∈PJ+1. The set of all extensions of p∈PJ in PJ+1 is
It defines a non-intersecting partition of PJ+1=∪p∈PJPJ+1p. We shall prove that such extensions are nonexpansive:
To later prove Proposition 3.3, we also verify that it preserves energy
Summing (40) on all p∈PJ proves (38).
Applying it to g=U[p]f−U[p]h together with U[p]f⋆ϕ2J=SJ[p]f and U[p]f⋆ψ2Jr=U[p+2Jr]f gives
Since SJ+1[PJ+1]U[p+2Jr]f={SJ+1[p+2Jr+p′′]}p′′∈PJ+1, and SJ+1[PJ+1]f is nonexpansive, it implies
which proves (40). Since SJ[PJ+1]f preserves the norm, setting h=0 in (2.4) gives
This proposition proves that ∥SJ[PJ]f−SJ[PJ]h∥ is positive and non-increasing when J increases, and thus converges. Since SJ[PJ] is nonexpansive, the limit metric is also nonexpansive
For admissible scattering wavelets which satisfy (30), Theorem 2.6 proves that ∥SJ[PJ]f∥=∥f∥ so limJ→∞∥SJ[PJ]f∥=∥f∥. The following theorem proves that the limit metric is translation invariant.
Proof: Since SJ[PJ]Lc=LcSJ[PJ] and SJ[PJ]f=AJU[PJ]f
This lemma is proved in Appendix B. Applying it to τ=c and hence ∥τ∥∞=∣c∣ proves that
Since the admissibility condition (30) is satisfied, Lemma 2.8 proves in (37) that for J>1
If ∥f∥w<∞ then it results from (46) that
so limJ→∞∥LcSJ[PJ]f−SJ[PJ]f∥=0.
Letting n go to ∞ proves that limJ→∞∥LcSJ[PJ]f−SJ[PJ]f∥=0, which finishes the proof.□
5 Lipschitz Continuity to Actions of Diffeomorphisms
We denote PJ,m the subset of PJ of paths of length strictly smaller than m, and (a∨b)=max(a,b).
Proof: Let [SJ[PJ],Lτ]=SJ[PJ]Lτ−LτSJ[PJ],
Similarly to (43) the first term on the right satisfies
Since SJ[PJ] iterates on UJ which is nonexpansive, Appendix D proves the following upper bound on scattering commutators.
Indeed, UJ=MWJ, where M{hJ,(hλ)λ∈ΛJ}={hJ,(∣hλ∣)λ∈ΛJ} is a nonexpansive modulus operator. Since MLτ=LτM
Inserting (55) with (56) and (54) in (52) gives
Lemma 2.11 proves that ∥LτAJ−AJ∥≤C2−J∥τ∥∞. This inequality and (58) imply that
To prove (49), the main difficulty is to compute an upper bound of ∥[WJ,Lτ]∥, and hence of ∥[WJ,Lτ]∥2=∥[WJ,Lτ]∗[WJ,Lτ]∥, where A∗ is the adjoint of an operator A. The wavelet commutator applied to f is
The operator [WJ,Lτ]∗[WJ,Lτ] has a singular kernel along the diagonal but Appendix E proves that its norm is bounded.
Inserting the wavelet commutator bound (61) in (59) proves the theorem inequality (49). One can verify that (49) remains valid when replacing PJ by the subset of paths of length smaller than m: PJ,m=∪n<mΛJn, if we replace ∥U[PJ]f∥1 by ∥U[PJ,m]f∥1. The inequality (51) results from
because U[ΛJn]f is computed in (24) by applying the norm-preserving operator UJ on U[ΛJn−1]f. □
The condition ∥∇τ∥∞≤1/2 can be replaced by ∥∇τ∥∞<1 if C is replaced by C(1−∥∇τ∥∞)−d. Indeed ∥SJ[PJ]f∥=∥f∥ and ∥SJ[PJ]Lτf∥≤∥f∥(1−∥∇τ∥∞)−d. This remark applies to all subsequent theorems where the condition ∥∇τ∥∞≤1/2 appears. The theorem proves that the distance ∥SJ[PJ]Lτf−SJ[PJ]f∥ produced by the diffeomorphism action Lτ is bounded by a translation term proportional to 2−J∥τ∥∞ and a deformation error proportional to ∥∇τ∥∞. This deformation term results from the wavelet transform commutator [WJ,Lτ]. The term log(∥Δτ∥∞/∥∇τ∥∞) can also be replaced by max(J,1) in the proof of Theorem 2.12. For compactly supported functions f, Corollary 2.15 replaces this term by the log of the support radius.
The following corollary derives from Theorem 2.12 that a windowed scattering is Lipschitz continuous to the action of diffeomorphisms over compactly supported functions.
Similarly to Theorem 2.12, if PJ is replaced by the subset PJ,m of paths of length smaller than m, then ∥U[PJ]f∥1 is replaced by m∥f∥ in (64). If Lτf(x)=f((1−s)x) with ∣∇τ(x)∣=∣s∣<1 then the upper bound (64) is proportional to m∣s∣∥f∥. In this case, a lower bound is simply obtained by observing that since ∥SJ[PJ]f∥=∥f∥ and ∥SJ[PJ]Lτf∥=∥Lτf∥=(1−s)−1∥f∥
Together with the upper bound (64), it proves that if τ(x)=sx then the scattering distance of f and Lτf is of the order of ∥∇τ∥∞∥f∥.
The next theorem reduces the translation error term 2−J∥τ∥∞ in Theorem 2.12 to a second-order term 2−2J∥τ∥∞2, with first-order Taylor expansion of each SJ[p]f. We denote ∇SJ[PJ]f(x)={∇SJ[p]f(x)}p∈PJ and τ(x)⋅∇SJ[PJ]f(x)={τ(x)⋅∇SJ[p]f(x)}p∈PJ.
Proof: The proof proceeds as the proof of Theorem 2.12. Replacing SJ[PJ]Lτ−SJ[PJ] by SJ[PJ]Lτ−SJ[PJ]+τ.∇SJ[PJ] in the derivation steps of the proof of Theorem 2.12 amounts to replace LτAJ−AJ by LτAJ−AJ+∇AJ. Equation (58) then becomes
Appendix C proves that there exists C>0 such that
Inserting the upper bound (61) of ∥[WJ,Lτ]∥ proves (67). □
If 2J≫∥τ∥∞ and ∥∇τ∥∞+∥Hτ∥∞≪1 then K(τ) becomes negligible and τ(x) can be estimated at each x by solving the system of linear equations resulting from (67):
In dimension d, the displacement τ(x) has d coordinates which can be computed if the system (70) has rank d. Estimating τ(x) has many applications. In image processing, the displacement field τ(x) between two consecutive images of a video sequence is proportional to the optical flow velocity of image points.
Normalized Scattering Transform
A path p∈PJ can be extended into an infinite set of paths in PJ+1 which refine p. In that sense, PJ+1 is a set of higher resolution paths. When J increases to ∞, these progressive extensions converge to paths of infinite length, which belong to an uncountable path set P∞. A measure and a metric are defined on P∞.
As elements of the topology, cylinder sets are open sets but are also closed. Indeed the complement of a cylinder set is a union of cylinders and is thus closed. As a result, the topology is a sigma algebra, on which a measure μ can be defined. The measure of a cylinder set C is written μ(C).
This family of cylinder sets generates the same sigma algebra as open cylinders since open cylinders can be written Cn(λ)=∪(λ1,...,λn)∈Λ∞nC(λ1,...,λn,λ). The following proposition defines a measure on Λ∞∞ from the scattering of a Dirac:
There exists a unique σ-finite Borel measure μ, called Dirac scattering measure, such that μ(C(p))=∥U[p]δ∥2 for all p∈P∞. For all 2lg∈Λ∞ and p∈P∞, μ(C(2lgp))=2dlμ(C(p)) If ∣ψ^(ω)∣+∣ψ^(−ω)∣=0 almost everywhere then ∥U[p]δ∥=0 for p∈P∞.
Proof: The Dirac scattering measure is defined as a subdivision measure over the tree that generates all paths. Each finite path p corresponds to a node of the subdivision tree. Its sons are the {p+λ}λ∈Λ∞, and C(p)=∪λ∈Λ∞C(p+λ) is a non-intersecting partition. Since
it results that μ(C(p))=∑λ∈Λ∞μ(C(p+λ)). The sigma additivity of the Dirac measure over all cylinder sets results from the tree structure, and the decomposition of the measure of a node μ(C(p)) as a sum of the measures μ(C(p+λ)) of all its sons. This subdivision measure is uniquely extended to the Borel sigma algebra through the sigma additivity. Since Λ∞∞=∪λ∈Λ∞C(λ) and μ(C(λ))=∥U[λ]δ∥2=∥ψλ∥2, this measure is σ-finite.
We showed in (20) that U[p](2lg∘f)=2lg∘U[2−lgp]f. Since 2lg∘δ=2−dlδ it results ∥U[2−lgp]δ∥2=2−dl∥U[p]δ∥2 and hence μ(C(2lgp))=2dlμ(C(p)).
A topology and a metric can now be constructed on the path set Λ∞∞. Neighborhoods are defined with cylinder sets of frequency resolution 2J:
If p∈P∞ is a path of length m then
Suppose that ∣ψ^(ω)∣+∣ψ^(−ω)∣=0 almost everywhere. For any q=q′∈P∞
defines a distance on P∞, and P∞ is complete for this metric.
Since U[p+λ]δ=U[p]δ⋆ψλ and ∣ϕ^2J(ω)∣2=∑∣λ∣≤2−Jλ∈Λ∞∣ψ^λ(ω)∣2, the Plancherel formula implies
Since SJ[p]δ=U[p]δ⋆ϕ2J, Young’s inequality implies ∥SJ[p]δ∥≤∥U[p]δ∥1∥ϕ2J∥. Moreover ∥U[λ]f∥1≤∥ψλ∥1∥f∥1 with ∥ψλ∥1=∥ψ∥1, so we verify by induction that ∥U[p]δ∥1≤∥ψ∥m. Inserting ∥ϕ2J∥2=2−dJ∥ϕ∥2 proves (72).
Let us now prove that dˉ defines a distance. If q=q′, we denote pˉ∈P∞ their common prefix of longest size m, which may be , and show that dˉ(q,q′)=0. Let ∣qm+1∣=2jm+1 and ∣qm+1′∣=2jm+1′ be the frequencies of their first different coordinate. If 2−J=max(∣qm+1∣,∣qm+1′∣) then (q,q′)∈CJ(pˉ)2 and it is the smallest set including both paths so dˉ(q,q′)=μ(CJ(pˉ)). It results that dˉ(q,q′)=0 because μ(CJ(pˉ))≥μ(C(pˉ+2Jr)) for r∈G+ and Proposition 3.1 proves that μ(C(p))=0 for all p∈P∞, so dˉ(q,q′)=0.
The triangle inequality is proved by showing that
This is verified by writing dˉ(q,q′)=μ(CJ(pˉ)), dˉ(q′,q′′)=μ(CJ′(pˉ′)) and dˉ(q′,q′′)=μ(CJ′′(pˉ′′)). Necessarily pˉ is a substring of pˉ′ or vice versa, and pˉ′′ is larger then the smallest of the two. If pˉ′′ is strictly larger then the smallest say pˉ, then μ(CJ′′(pˉ′′))≤μ(C(pˉ′′))≤CJ(pˉ), so (74) is satisfied. If pˉ′′=pˉ=pˉ′ then 2−J′′≤max(2−J,2−J′) and (74) is satisfied. Otherwise pˉ′′=pˉ is strictly smaller than pˉ′ and necessarily 2J′′=2J so (74) is also satisfied.
2 Scattering Convergence
It is a piecewise constant function of the path variable q, whose resolution increases with J. Since μ(CJ(p))=∥SJ[p]δ∥2,
The following proposition proves that SJ is a nonexpansive operator which preserves the norm.
where PJ+1=∪p∈PJPJ+1p is a disjoint partition. Applying this to f and h implies
Summing over p∈PJ and inserting (77) proves (78).
Since \Big{|}\|S_{J}[p]f\|-\|S_{J}[p]h\|\Big{|}\leq\|S_{J}[p]f-S_{J}[p]h\|, summing this inequality over p∈PJ and inserting (77) proves the first inequality of (79). The second inequality is obtained because SJ[PJ] is nonexpansive. Setting h=0 proves that ∥SJ∥P∞=∥SJ[PJ]f∥ and Theorem 2.6 proves ∥SJ[PJ]f∥=∥f∥, which gives (80). □
Since ∥SJf−SJh∥P∞ is non-decreasing and bounded when J increases, it converges to a limit which is smaller than the limit of the non-increasing sequence ∥SJ[PJ]f−SJ[PJ]h∥. The following proposition proves that SJf converges pointwise to the scattering transform on P∞ introduced in Definition 2.3.
Proof: If p∈P∞ then for J sufficiently large SJf(p)=∥SJ[p]f∥/∥SJ[p]δ∥. Let us prove that
and that this equality also holds for f=δ. Since SJ[p]f=U[p]f⋆ϕ2J, the Plancherel formula implies
Since ∣ψ^(ω)∣+∣ψ^(−ω)∣=0 almost everywhere, Proposition 3.1 proves that U[p]δ=0. Since it is positive, it has a non-zero integral. It results from (83) that limJ→∞∥SJ[p]f∥/∥SJ[p]δ∥=∫U[p]f(x)dx/∫U[p]δ(x)dx which proves (82). □
The scattering transform Sf can now be extended to P∞ as a windowed scattering limit:
then SJf converges in norm to Sf with ∥Sf∥P∞=∥f∥ and
Since L2(P∞,dμ) is complete, SJf(q) converges in norm to its limit inf Sf. Since ∥SJf∥=∥f∥, it also implies that ∥Sf∥P∞=∥f∥. Moreover, U[p+q]=U[q]U[p] so ∥SJU[p]f∥P∞2=∫C(p)∣SJf(q)∣2dμ(q). Since ∥SJU[p]f∥P∞2=∥U[p]f∥2 taking the limit when J goes to ∞ proves (86).
The windowed scattering convergence (87) relies on the following lemma.
Since (85) implies that SJf and SJh respectively converge in norm to Sf and Sh, the convergence (87) results from (88). Proving (88) is equivalent to proving that limJ→∞∑p∈PJIJ(f,h)[p]=0 for
When summing over p∈PJ, we separate ΩJf∪ΩJh from its complement in PJ. Since limJ→∞∥SJ[ΩJf]f∥2=0, ∥SJ[PJ]f∥2=∥f∥2, limJ→∞∥SJ[ΩJh]h∥2=0, and ∥SJ[PJ]h∥2=∥h∥2, dividing the sum over ΩJf and ΩJh and applying Cauchy-Schwartz proves that
and ∑p∈PJ∥SJ[p]f∥∥SJ[p]h∥≤∥f∥∥h∥. The hypothesis (85) applied to f and h gives
so (3.2) implies that limJ→∞∑p∈PJIJ(f,h)[p]=0, which finishes the Lemma proof.
3 Numerical Comparisons with Fourier
In higher dimensions d≥1, this construction is extended as follow. All cylinders C(λ) for all paths p=λ=2jr of length 1 are mapped to non-intersecting hyper-rectangles q−1(C(λ)) of measure
The property q−1(C(p+λ))⊂q−1(C(p)) for all λ∈Λ∞ is obtained with a progressive packing strategy. We first construct q−1(C(p+λ)) for all λ=2jr with j≥0, by defining a partition of a closed subset of q−1(C(p)) of measure ∑λ∈Λ∞,∣λ∣≥1∥U[p+λ]δ∥2. The remaining q−1(C(p+λ)) are then progressively constructed for λ=2jr and j going from −1 to −∞, within the remaining closed subset of q−1(C(p)) not already allocated. This is possible since we guarantee that the frontier of each q−1(C(p)) has a zero measure. □
If f satisfies (85) then Sf(q(ω)) and ∣f^(ω)∣ have an equivalent decay over dyadic frequency bands, because their norm is equal over these frequency bands. Indeed, for a frequency band λ=2jr of radius proportional to ∣λ∣=2j, the measure preservation (91) together with (86) prove that ∥U[λ]f∥=∥f⋆ψλ∥ satisfies
Figure 2(c,d,e) illustrates the convergence of the windowed scattering transform SJf(q(ω)) when J increases, for a Gaussian second derivative f. SJf(q(ω)) is constant if q(ω)=p is constant and hence if ω∈q−1(CJ(p)). The frequency interval q−1(CJ(p)) has a width μ(CJ(p))=∥SJδ[p]∥2, which goes to zero as J goes to ∞ as shown by (72). When J increases, each q−1(CJ(p)) is subdivided into smaller intervals q−1(CJ+1(p′)) corresponding to paths p which are prolongations of p. For each ω, the graph color specifies the length of the path p=q(ω). At low frequencies, q(ω)=∅ is shown as a yellow interval. Paths q(ω) of length 1 to 4 are respectively coded in red, green, blue and violet.
In these numerical examples, the total energy of SJf(q(ω)) on frequency-decreasing paths q(ω) is about 105 times larger than the energy of scattering coefficients on all other paths. We thus only compute SJf(q(ω)) for frequency-decreasing paths, with an O(NlogN) filter bank algorithm described in . It is implemented with the complex cubic spline Battle-Lemarié wavelet ψ. As expected from (92), SJf(q(ω))f has an amplitude and a frequency localization which is similar to the Fourier modulus ∣f^(ω)∣ shown in Figure 2(a). The discontinuities of S(q(ω))f along ω are produced by the discontinuities of the mapping q(ω), as opposed to discontinuities of S(q)f relatively to the scattering metric in P∞.
Figure 3 compares S(q(ω))fi and ∣f^i(ω)∣ for four functions fi with 1≤i≤4. For f1=1, the first row of Figure 3 shows that ∣f^1(ω)∣=O((1+∣ω∣)−1) has the same decay in ω as Sf1(q(ω)). The second row corresponds to a Gabor function f2(x)=eiξxe−x2/2 and the third row shows a small scaling f3(x)=f2((1−s)x) with s=−0.1. The support of f^3(ω)=(1−s)−1f^2((1−s)−1ω) is shifted towards higher frequencies relatively to the support of f^2. A numerical computation gives ∥∣f^2∣−∣f^3∣∥=C∣s∣∥f2∥ with C=13.5. As shown by (3), the constant C grows proportionally to the center frequency ξ of f^2. It illustrates the instability of the Fourier modulus under the action of diffeomorphisms. On the contrary, the scattering distance remains stable. We numerically obtain ∥Sf2−Sf3∥=C∣s∣∥f2∥, with C=1.5, and this constant does not grow with ξ. It illustrates the Lipschitz continuity of a scattering relatively to deformations. In the fourth row, f4 is a sum of two high-frequency Gabor functions, and ∣f^4(ω)∣ includes two narrow peaks localized within the support of f^3. The wavelet transform has a bad frequency localization at such high frequencies, and can not discriminate the two frequency peaks of f^4 from f^3. However, these two frequency peaks create low frequency interferences, which appear in the graph of f4, and which are captured by second order scattering coefficients. As a result, Sf4 is very different from Sf3, which illustrates the high frequency resolution of a scattering transform obtained through interferences.
Scattering Stationary Processes
A scattering defines a representation of stationary processes in l2(P∞), having different properties than a Fourier power spectrum. The Fourier power spectrum depends only on second-order moments. A scattering transform incorporates higher-order moments that can discriminate processes having same second-order moments. Section 4.2 shows that it is Lipschitz continuous to random deformations, up to a log term.
The expected scattering transform of a sationary process X is defined for all p=(λ1,...,λm)∈P∞ by
This definition replaces the normalized integral of the scattering transform (18) by an expected value. The expected scattering distance between two stationary processes X and Y is
Scattering coefficients depend upon normalized high order moments of X. This is shown by decomposing
A first-order approximation assumes that ∣ϵ∣≪1. Since ∫ψλ(x)dx=0, and U[p]X(x)=∣U[p]X(x)∣2, computing U[p+λ]X=∣U[p]X⋆ψλ∣ with 1+ϵ≈1+ϵ/2 gives
Iterating on (93) proves that SX(p)=E(U[p]X) for p=(λ1,...,λm) depends on normalized moments of X of order 2m, successively filtered by the wavelets ψλk for 1≤k≤m.
The expected scattering transform is estimated by computing a windowed scattering transform of a realization X(x):
Since ∫ϕ2J(x)dx=1, it results that E(SJ[p]X)=E(U[p]X)=SX(p). So SJ[PJ]X is an unbiased estimator of {SX(p)}p∈PJ.
The autocovariance of a real stationary process X is denoted
Its Fourier transform RX(ω) is the power spectrum of X. The mean-square norm of SJ[PJ]X={SJ[p]X}p∈PJ is written
The following proposition proves that SJ[PJ]X and SX are nonexpansive and that SX∈l2(P∞). The wavelet ψ is assumed to satisfy the Littlewood-Paley condition (9).
If X and Y are finite second-order stationary processes then
Proof: We first show that the wavelet transform WJX={AJX,(W[λ]X)λ∈ΛJ} is unitary over stationary processes. Let us denote
Both AJX=X⋆ϕ2J and W[λ]X=X⋆ψλ are stationary. Since ∫ϕ2J(x)dx=1 and ∫ψλ(x)dx=0 it results that E(AJX)=E(X) and E(W[λ]X)=0. Since the power spectrum of AJX and W[λ]X is respectively RX(ω)∣ϕ^(2Jω)∣2 and RX(ω)∣ψ^λ(ω)∣2, we get
Since E(∣X∣2)=∫RX(ω)dω+E(X)2, the same proof as in Proposition 2.1 shows that the wavelet condition (9) implies that E(∥WJX∥2)=E(∣X∣2).
The propagator UJX={AJX,(∣W[λ]X∣)λ∈ΛJ} satisfies
and is thus nonexpansive on stationary processes. We verify as in (25) that
Since PJ=∪m=0+∞ΛJm, one can compute SJ[PJ]X by iteratively applying the nonexpansive operator UJ. The nonexpansive property (94) is derived from the fact that UJ is nonexpansive, as in Proposition 2.5.
Let us prove (95). Since SX(p)=E(SJ[p]X) and SY(p)=E(SJ[p]Y)
Letting J go to ∞ proves (95). The last inequality (96) is obtained by setting Y=0. □
If the wavelet satisfies the admissibility condition (30) and if X is stationary with E(∣X∣2)<∞ then
Proof: The proof of (97) is almost identical to the proof of (31) in Theorem 2.6, if we replace f by X, ∣f^(ω)∣2 by the power spectrum RX(ω) and ∥f∥2 by E(∣X∣2). We proved that E(∥WJX∥2)=E(∣X∣2) so we also have E(∥UJX∥2)=E(∣X∣2). In the derivations of Lemma 2.8, replacing fp=U[p]f by Xp=U[p]X, and ∣f^p(ω)∣2 by RXp(ω), proves that
The same density argument as in the proof of Theorem 2.6 proves that (98) also holds if E(∣X∣2)<∞ because RX(ω) is integrable.
Since E(∥UJX∥2)=E(∣X∣2) and UJU[ΛJm]X={SJ[ΛJm]X,U[ΛJm+1]X}, iterating m times on UJ proves as in (34) that
When m goes to ∞, (98) implies (97). □
A windowed scattering SJ[p]=U[p]X⋆ϕJ averages U[p]X over a domain whose size is proportional to 2J. If U[p]X is ergodic, it thus converges to SX(p)=E(U[p]X) when J goes to ∞. The windowed transformed scattering SJ[PJ]X is said to be a mean-square consistent estimator of SX if its total variance over all paths converges to zero:
Mean-square convergence implies convergence in probability and hence that SJ[PJ]X converges to SX with probability 1.
For a large class of ergodic processes X, including Gaussian processes, mean-square convergence is observed numerically, with E(∣SJ[PJ]X−SJX)∣2)≤C2−αJ for C>0 and α>0. When J increases, the global variance of SJ[PJ]X decreases despite the path subdivision into new paths because each modulus reduces the variance by removing random phase variations. The variance of SJ[p]X thus decreases when the path length increases, and it is concentrated over a small number of frequency-decreasing paths. For a Gaussian white noise and a moving average Gaussian process of unit variance, Figure 4 shows that logE(∥SJ[PJ]X−SX∥2), computed over all frequency-decreasing paths, decays linearly as a function J. For the correlated Gaussian process, the decay begins for 2J≥24, which is the correlation length of this process. Indeed, the averaging by ϕ2J effectively reduces the estimator variance when 2J is bigger than the correlation length.
If X is a Gaussian stationary process with ∥RX∥1<∞ then SJ[PJX] is a mean-square consistent estimator of SX.
The following corollary of Theorem 4.3 proves that mean-square consistency implies an expected scattering energy conservation.
For an admissible scattering wavelet which satisfies condition (30), SJ[PJ]X is mean-square consistent if and only if
and mean-square consistency implies that for all λ∈Λ∞
Proof: It results from Theorem 4.3 that E(∥SJ[PJ]X∥2)=E(∣X∣2). Since
and E(SJ[p]X)=SX(p), we derive that limJ→∞E(∥SJ[PJ]X−E(SJ[PJ]X)∥2)=0 if and only if ∥SX∥2=E(∣X∣2). Moreover, for all λ∈Λ∞, since U[p]U[λ]X=U[λ+p]X, applying (99) to U[λ]X instead of X proves (100). □
The expected scattering can be represented by a singular scattering spectrum in P∞. Similarly to Section 3.2, we associate to SX(p)=E(U[p]X) a function that is piecewise constant in P∞:
The following proposition proves that PJ converges to a singular measure, called a scattering power spectrum.
PJX(q) converges in the sense of distributions to a Radon measure in P∞, supported in P∞:
Letting J go to ∞ in (101) proves (102). □
If SJ[PJ]X is mean-square consistent then (100) implies that the scattering spectrum PX(q) is related to the Fourier power spectrum RX(ω) by
Although PX(q(ω)) and RX(ω) have the same integral over dyadic frequency intervals, they have very different distributions within each of these intervals. Indeed, (93) shows that if p is of length m then E(U[p]X) depends upon normalized moments of X of order 2m. It results that PX(q(ω)) depends upon arbitrarily high order moments of X where as RX(ω) only depends upon moments of order 2. Hence, PX(q) can discriminate different stationary processes having same Fourier power spectrum and thus same second-order moments.
Figure 5 gives the scattering power spectrum of a Gaussian white noise X2 and of a Bernoulli process X1 in dimension d=1, estimated from a realization sampled over N=104 integer points. Both processes have a constant Fourier power spectrum RXi(ω)=1 but very different scattering spectrum. Their scattering spectrum PXi(q(ω)) is estimated by PJXi(q(ω)) in (101) at the maximum scale 2J=N. It is a sum of spikes in Figure 5(b), which converges to a Radon measure supported in P∞ when increasing 2J=N. A Gaussian white noise X2 has a scattering spectrum mostly concentrated on paths q(ω)=(2j) of length 1. These scattering coefficients appear as large amplitude red spikes at dyadic positions, in the bottom graph of Figure 5(b). Their amplitude is proportional to SX2(2j)2∼2j. Other spikes in green, correspond to paths q(ω)=(λ1,λ2) of length two. They have a much smaller amplitude. Scattering coefficients for paths of length 3 and 4, in blue and violet, are so small that they are not visible. The top of Figure 5(b) shows the scattering spectrum PJX1(q(ω)) of a Bernouilli process X1. It has a maximum amplitude for paths q(ω) of length 1 (in red), but longer paths shown in green, blue and violet also produce large scattering coefficients, as opposed to a Gaussian white noise scattering. Scattering coefficients for paths p of length m depend upon the moments of X up to the order 2m. For m>1, large scattering coefficients indicate a strongly non-Gaussian behavior of high order moments.
2 Random Deformations
We now show that the scattering transform is nearly Lipschitz continuous to the action of random deformations. If τ is a random process with ∥∇τ∥∞=∣∇τ(x)∣<1 then x−τ(x) is a random diffeomorphism. If X(x) and τ(x) are independent stationary processes then the action of this random diffeomorphism on X(x) defines a randomly deformed process LτX(x)=X(x−τ(x)) which remains stationary.
The following theorem adapts the result of Theorem 2.12 by proving that the scattering distance produced by a random deformation is dominated by a first-order term proportional to E(∥∇τ∥∞2). Let us denote
where ΛJm is the set of paths p=(λk)k≤m of length m with ∣λk∣<2J.
There exists C such that for all independent stationary processes τ and X satisfying ∥∇τ∥∞≤1/2 with probability 1, if E(∥U[PJ]X∥1)<∞ then
Over the subset PJ,m of path in PJ of length strictly smaller than m
Proof: Similarly to the proof of Theorem 2.12, we decompose
Appendix H proves that E(∥[SJ[PJ],Lτ]X∥2)≤E(∥U[PJ]X∥1)2B(τ) with
Let Kτ be an integral operator with a kernel kτ(x,u) which depends upon a random process τ. If the following two conditions are satisfied
then for any stationary process Y independent of τ, E(∣KτY(x)∣2) does not depend upon x and
This result remains valid when replacing SJ[PJ] by SJ[PJ,m] and U[PJ] by U[PJ,m]. With the same argument as in the proof of (62), we verify that
Small stationary deformations of stationary processes result in small modifications of the scattering distance, which is important to characterize deformed stationary processes as in image textures . The following corollary proves that the expected scattering transform is almost Lipschitz continuous in the size of the stochastic deformation gradient ∇τ, up to a log term.
There exists C such that for all independent stationary processes τ and X satisfying ∥∇τ∥∞≤1/2 with probability 1, if E(∥U[P∞]X∥1)<∞ then
Proof: E(∥SJ[PJ]LτX−SJ[PJ]X∥2)≤∥E(SJ[PJ]LτX)−E(SJ[PJ]X)∥2, so letting J go to ∞ in (104) proves (110). □
Invariance to Actions of Compact Lie Groups
Let G be a compact Lie group and L2(G) be the space of measurable functions f(r) such that ∥f∥2=∫G∣f(r)∣2dr<∞, where dr is the Haar measure of G. The left action of g∈G on f∈L2(G) is defined by Lgf(r)=f(g−1r). This section introduces a scattering transform on L2(G), which is invariant to the action of G. It is obtained with a scattering propagator which cascades the modulus of wavelet transforms defined on L2(G).
and the scaling function performs an averaging on G:
The resulting wavelet transform of f∈L2(G) is
At the maximum scale 2L=1, since ϕ1(r)=(∫Gdg)−1=∣G∣−1 is constant, the operator A0 performs an integration on the group:
Wavelets are constructed to obtain a unitary operator
Since WL is unitary, we verify as in (26) that UL is nonexpansive and preserves the norm in L2(G).
Since U[PL] is obtained by cascading the nonexpansive operator UL, the same proof as in Proposition 2.5 shows that it is nonexpansive:
For any f∈L2(G) and g∈G
2 Combined Translation and Rotation Scattering
One can verify that SJ[PJ] is nonexpansive as in the case where G is a finite group. For an admissible scattering wavelet satisfying (30), Theorem 2.6 remains valid and ∥SJ[PJ]f∥=∥f∥.
The scattering SJ is covariant to rotations. Invariance to rotations in G is obtained by applying the scattering operator SL defined on L2(G) by (117). Any p=(λ1,...,λm)∈PJ with λ1=r2j1 can be written as a rotation p=rpˉ of a normalized path pˉ=(λˉ1,...,λˉm), where λˉk=r−1λk and hence where λˉ1=2j1 is a scaling without rotation. It results that
This combined scattering cascades wavelet transforms and hence convolutions along the spatial variable x and along the rotation r, which is factorized from each path. In d=2 dimensions then L2(SO(2))=L2[0,2π]. The wavelet tranform along rotations is implemented by circular convolutions along the rotation angle variable in [0,2π], with the periodic wavelets (116).
Since SL[PL] and SJ[PJ] are nonexpansive their cascade is also nonexpansive:
If SJ is computed with an admissible scattering wavelet then ∥SJ[PJ]f∥=∥f∥. In d=2 dimensions, if SL is computed with periodic wavelets derived in (116) from a one-dimensional admissible scattering wavelet, then the combined scattering preserves the norm:
Appendix A Proof of Lemma 2.8
The proof of (37) shows that the scattering energy propagates towards lower frequencies. It computes the average arrival log frequency of the scattering energy ∥U[p]f∥ for paths of length m, and shows that it increases when m increases. The arrival log frequency of p={λk=2jkrk}k≤m is the log frequency index log2∣λm∣=jm of the last path element.
Let us denote em=∥U[ΛJm]f∥2 and em=∥SJ[ΛJm]f∥2. The average arrival log frequency among paths of length m is
The following lemma shows that when m increases by 1 then am decreases by nearly α/2, where α is defined in (30).
We first show that (124) implies (37) and then prove this lemma. Summing over (124) gives
For m=1, p=2jr so a1e1=∑j>−J∑r∈G+j∥W[2jr]f∥2. Moreover, e0=∥f∥2, so
Inserting this in (125) for m=∞ proves (37).
Lemma A.1 is proved by calculating the evolution of am as m increases. We consider the advancement of a path p of length m−1 with two steps p+2jr+2lr′, and denote fp=U[p]f. The average arrival log frequency am can be written as the average arrival log frequency of ∥U[p+2jr]f∥2 over all 2jr and all p of length m−1:
After the second step, the average arrival log frequency of ∥U[p+2jr+2lr′]f∥2 overall p∈ΛJm−1, 2jr and 2lr′ is am+1:
Applied to each h=fp⋆ψ2jr in (126) this relations, together with
shows that I=amem−am+1em+1+Jem satisfies
A lower bound of I is calculated by dividing the sum on l for l≥j and l<j. In the j+J−1 term for l<j, the index l is replaced by j−1 and the convolution with ϕ2J is incorporated in the sum:
If f is real, then ∥f⋆ψ2jr∥=∥f⋆ψ−2jr∥. Multiplying (129) by ∣f^(ω)∣2 and integrating in ω proves (128). Inserting (128) in (127) gives
Applying Lemma 2.7 for h=ρ2lr and a frequency 2jrη proves that
and ρ^2lr,2j(ω)=ρ^(2−lr−1ω−2j−lη). It results that
Inserting Ψ^ defined in (29) by
with b(ω)=∑r∈GΨ^(r−1ω)∣ψ^(r−1ω)∣2. Let us add to I
Since ρ≥0, ∣ρ^(ω)∣≤ρ^(0)=1 and hence Ψ^(ω)≤1. The wavelet unitary property (9) together with Ψ^(ω)≤1 implies that
If α=inf1≤∣ω∣<2∑jb(2−jω) then ∑jb(2−jω)≥α for all ω=0. If the hypothesis (30) is satisfied and hence α>0 then
Inserting I=amem−am+1em+1+Jem proves that
Since UJ preserves the norm, em=em+1+em, indeed (25) proves that UJU[ΛJm]f={U[ΛJm+1]f,SJ[ΛJm]f}. Inserting em=em−em+1 and em−1=em−1−em in (130) gives
Appendix B Proof of Lemma 2.11
Lemma 2.11 as well as all other upper bounds on operator norms are computed with Schur’s lemma. For any operator Kf(x)=∫f(u)k(x,u)du, Schur’s lemma proves that
The operator norm of kJ=LτAJ−AJ is computed by applying Schur’s lemma on its kernel
A first-order Taylor expansion proves that
Since ∇ϕ2J(x)=2−dJ−J∇ϕ(2−Jx), it results that
The Jacobian of the change of variable v=x−tτ(x) is 1−t∇τ(x) whose determinant is larger than (1−∥∇τ∥∞)d≥2−d so
Schur’s lemma (131) applied to this upper bound and (134) proves the lemma result:
Appendix C Proof of (69)
by applying Schur’s lemma (131) on the kernel of kJ=LτAJ−AJ+τ⋅∇AJ:
Let Hf(x) the Hessian matrix of a function f at x and ∣Hf(x)∣ the sup matrix norm of this Hessian matrix. A Taylor expansion gives
Since ϕ2J(x)=2−dJϕ(2−Jx), Hϕ2J(x)=2−Jd−2JHϕ(2−Jx). With a change of variable, (136) gives
where ∥Hϕ∥1=∫∣Hϕ(u)∣du is bounded. Indeed all second-order derivatives of ϕ at u are O((1+∣u∣)−d−1).
The Jacobian of the change of variable v=x−(1−t)τ(x) is 1−(1−t)∇τ(x) whose determinant is larger than (1−∥∇τ∥∞)d so
The upper bounds (137) and (138) with Schur’s lemma (131) proves (135).
Appendix D Proof of Lemma 2.13
If A and B are two operators, we denote {A,B} the operator defined by {A,B}f={Af,Bf}. We introduce a wavelet modulus operator without averaging:
and UJ={AJ,VJ}. The propagator VJ creates all paths VJU[ΛJn]f=U[ΛJn+1]f for any n≥0. Since U[ΛJ0]=Id, it results that VJn=U[ΛJn]. Let PJ,m be the subset of PJ of paths p of length smaller than m. To verify (139), we shall prove that
where Kn={[AJ,L],SJ[PJ,n−1][VJ,L]} satisfies
and letting m tend to ∞ proves (139).
Property (141) is proved by first showing that
where Km={[AJ,L],SJ[PJ,m−1][VJ,L]}. Indeed, since VJn=U[ΛJn], we have AJVJn=SJ[ΛJn] and PJ,m=∪n=0m−1ΛJn yields SJ[PJ,m]={AJVJn}0≤n<m. It results that
A substitution of SJ[PJ,m−1]L in (143) by the expression derived by this same formula gives
Let us now prove (142) on Km={[AJ,L],SJ[PJ,m−1][VJ,L]}. Since SJ[PJ] is nonexpansive, its restriction SJ[PJ,m] is also nonexpansive. Given that UJ={AJ,VJ} we get
Appendix E Proof of Lemma 2.14
This section computes an upper bound of ∥[WJ,Lτ]∥ by considering
Since ∥[WJ,Lτ]∥=∥[WJ,Lτ]∗[WJ,Lτ]∥1/2,
To prove the upper bound (61) of Lemma 2.14, we compute an upper bound for each term on the right under the integral and the last term, which is done by the following lemma.
Suppose that h(x), as well as all its first and second-order derivatives have a decay in O((1+∣x∣)−d−2). Let Zjf=f⋆hj with hj(x)=2djh(2jx). There exists C>0 such that if ∥∇τ∥∞≤ then
The inequality (146) clearly remains valid if the summation is limited to −J instead of −∞ since [Zj,Lτ]∗[Zj,Lτ] is a positive operator. Inserting in (144) both (145) with h=ϕ and (146) with h(x)=ψ(r−1x) for each r∈G+, and replacing −∞ by −J proves the upper bound (61) of Lemma 2.14.
with ∥Lτ∥≤(1−∥∇τ∥∞)−d. Since Lτ−1f(x)=f(ξ(x)) with ξ(x−τ(x))=x, the kernel of Kj=Zj−LτZjLτ−1 is
The lemma is proved by computing upper bounds of ∥Kj∥ and ∥∑j=−∞+∞Kj∗Kj∥. The sum over j is divided in three parts
Then we verify that ∥Kj∥≤C∥∇τ∥∞ and hence that
The last term carries the singular part and we prove that
Choosing γ=max(log∥∇τ∥∞∥Δτ∥∞,1) yields
Inserting this result in (148) will prove the second lemma result (146) . In the proof, C is a generic constant which depends only on h but which evolves along the calculations.
This kernel has a similar form as the kernel (132) in Appendix B by τ(x) is replaced here by τ(x)−τ(u). The same proof shows that
Taking advantage of this decay, to prove (151), we decompose
The last sum ∑j=0∞Kj∗Kj carries the singular part of the operator, which is isolated and evaluated separately by decomposing Kj=Kj,1+Kj,2, with a first kernel
satisfying Kj,11=∫kj,1(x,u)du=0 if ∫h(x)dx=0. The second kernel is
The sum ∑j≥0Kj,1∗Kj,1 has a singular kernel along its diagonal, and its norm is evaluated separately with the upper bound
It implies that ∥Kj∥≤C∥∇τ∥∞. Inserting this inequality in (147) yields the first lemma result (145) and it proves (152). Equations (161) and (162) also prove that
If ∫h(x)dx=0 then thanks to the vanishing integrals of kj,1 we will prove that
Inserting (163) and (164) in (160) proves (153).
Let us now first prove the upper bound (162) on Kj,2. The kernel of Kj,2 is
A Taylor expansion of hj together with a Taylor expansion of τ(x) gives
For j≥0, we prove that ∥Kj,2∥ decays like 2−j. Observe that ∣det(1−∇τ(u))∣≤2d. Since ∇hj(u)=2j+dj∇h(2ju), the change of variable x′=2j(x−u) in (E) gives
Since ∣∇h(u)∣≤C(1+∣u∣)−d−2, with the change of variable x=x′/2 we get
For j≤0, we use a maximum error bound on the remainder α of the Taylor approximation (165):
which proves that ∫∣kj,2(x,u)∣dx≤C∥∇τ∥∞ and hence that
Similarly, we compute ∫∣kj,2(x,u)∣du with the change of variable u′=2j(x−u) which leads to the same bound (170). Schur’s lemma gives:
Let us now compute the upper bound (161) on Kj,1. Its kernel kj,1 in (158) can be written kj,1(x,u)=2djg(u,2j(x−u)) with
A first-order Taylor decomposition of h gives
Since det(1−∇τ(u))≥(1−∥∇τ∥∞)d we get (1−det(1−∇τ(u)))≤d∥∇τ∥∞. Moreover ∥∇τ∥∞≤1/2 and h(x) as well as its partial derivatives have a decay which is O((1+∣x∣)−d−2), so
so k_{j,1}(x,u)=O\Bigl{(}2^{dj}\,\|\nabla\tau\|_{\infty}\,(1+2^{j}|x-u|)^{-d-2}\Bigr{)}. Since
Schur’s lemma (131) proves that ∥Kj,1∥=O(∥∇τ∥∞) and hence (161).
Let us now prove (164) when ∫h(x)dx=0. The kernel of the self-adjoint operator Qj=Kj,1∗Kj,1 is:
The singular kernel kˉ=∑jkˉj of ∑jQj almost satisfies the hypotheses of the T(1) theorem of David, Journé and Semmes but not quite because it does not satisfy the decay condition ∣kˉ(y,z)−kˉ(y,z′)∣≤C∣z′−z∣α∣z−y∣−d−α for some α>0. We bound this operator with Cotlar’s lemma which proves that if Qj satisfies
Since Qj is self-adjoint, it is sufficient to bound ∥QlQj∥. The kernel of QlQj is computed from the kernel kˉj of Qj
An upper bound of ∥QlQj∥ is obtained with Schur’s lemma (131) applied to kˉl,j. Inserting (175) in (178) gives
The parameters j and l have symmetrical roles and we can thus suppose that j≥l.
Since ∫h(x)dx=0 it results from (172) that ∫g(u,v)dv=0 for all u. For v=(vn)n≤d, one can thus write g(u,v)=∂v1∂gˉ(u,v) and (174) implies that
In the integration by part, integrating 2djg(z,x′+2j(u−z)) brings out a term proportional to 2−j and differentiating g(u,x)g(u,x′)2dlg(y,x+2l(u−y)) brings out a term bounded by 2l. An upper bound of (179) is obtained by inserting (174,180, 181,182), which prove that there exists C such that
The same calculation proves the same bound on ∫∣kˉl,j(y,z)∣dz so Schur’s lemma (131) implies that
Applying Cotlar’s lemma (176) with β(j)=C2−∣j∣/2(∥∇τ∥∞+∥Hτ∥∞)2 proves that
Appendix F Proof of Lemma 3.6
It results from (85) that there exists ϵJ with limJ→∞ϵJ=0 such that
and ∑p∈ΩJf∥SJ[p]f∥2≤ϵJ∥f∥2/8. Since ∥SJ[PJ]f∥2=∥f∥2, we get
The set of all extensions of a p∈PJ into PJ+1 is defined in (39). It can be rewritten PJ+1p=PJ+1∩CJ(p), and (40) proves that
Iterating k times on this result yields
Applying it to f and h=μpδ with μp=∥SJ[p]f∥/∥SJ[p]δ∥ gives
Summing over p∈PJ and applying (184) proves that
If q∈CJ+k(p′) then SJ+k(q)=∥SJ+k[p′]f∥/∥SJ+k[p′]δ∥. But p′∈CJ(p) so q∈CJ(p) and hence SJ(q)=∥SJ[p]f∥/∥SJ[p]δ∥. Finally ∥SJ+k[p′]δ∥2=μ(CJ+k(p′)) so the sum can be rewritten as a path integral
Appendix G Proof of Lemma 4.8
Since X and τ are independent processes
Applying (186) thus proves the lemma result (185).
Since X is stationary E(X(u)X∗(u′))=AX(u−u′), and the lemma hypothesis supposes that E(kτ(x,u)kτ∗(x,u′))=kˉτ(x−u,x−u′). Since X and τ are independent, the change of variable v=x−u and v′=x−u′ gives
which proves that E(∣KτX(x)∣2) does not depend upon x. Similarly
Since ∫∫∣kˉτ(v,v′)∣∣v−v′∣dvdv′<∞ and AX(v−v′)≤AX(0)=E(∣X∣2), it results from (191) and (190) that
Lemma 4.8 is extended to sequences of operators Kτ={Kτ,n}n∈I with kernels {kτ,n}n∈I, as follow. Let us denote
If each average bilinear kernel is stationary
Appendix H Proof of Theorem 4.7
This appendix proves that E(∥[SJ[PJ],Lτ]X∥2)≤E(∥U[PJ]X∥1)2B(τ) with
and E(\|U[{\mathcal{P}}_{J}]X\|_{1})=\sum_{m=0}^{+\infty}\Bigl{(}\sum_{p\in{\Lambda}^{m}_{J}}E(|U[p]X|^{2})\Bigr{)}^{1/2}.
For this purpose, we shall first prove that if for any stationary process X
Since a modulus operator is nonexpansive and commutes with Lτ, with the same argument as in the proof of (57), we derive from (197) that
The proof of Proposition 4.2 also shows that UJ is nonexpansive for the mean square norm on processes. Since SJ[PJ] is obtained by iterating on UJ it results that
The proof of (196) is ended by verifying that
and by applying to Kτ=[WJ,Lτ]={[AJ,Lτ],[W[λ],Lτ]}λ∈ΛJ the extension (195) of Lemma 4.8. This extension proves that if the kernels of the wavelet commutator satisfy the conditions (193) and (194) then
To finish the proof we verify that the wavelet commutator kernels satisfy (193) and (194). If Zjf(x)=f⋆hj(x) with hj(x)=2djh(2jx) then the kernel of the integral commutator operator [Zj,Lτ]=ZjLτ−LτZj is
where β is defined by β(x)=x+τ(β(x)). The kernel of [AJ,Lτ] is kτ,J with h=ϕ, and the kernel of [W[λ],Lτ] for λ=2jr is kτ,j with h(x)=ψ(r−1x). Since τ and ∇τ are jointly stationary, the joint probability distribution of their values at x and u+τ(β(u)) only depends upon x−u. It results that E(kτ,j(x,u)kτ,j(x,u′))=kˉτ,j(x−u,x−u′) which proves the kernel stationarity (193) for wavelet commutators.
The second kernel hypothesis (194) is proved by showing that if ∣h(x)∣=O((1+∣x∣)−d−2) then
Since kˉτ,j(v,v′)=E(kτ,j(x,x−v)kτ,j(x,x−v′)), it is sufficient to prove that there exists C such that for all x, with probability 1
The change of variable w=2jv and w′=2−jv′ in (203) shows that I=∑j≥−J2−jIj with
Acknowledgement I would like to thank Joan Bruna, Mike Glinsky and Nir Soren for the many inspiring conversations in connection with image processing, physics and group theory.