The Wavelet Compressibility of Compound Poisson Processes
S. Aziznejad, J. Fageot
IEEE Transactions on Information Theory, vol. 68, no. 4, pp. 2752–2766, April 2022.
In this paper, we precisely quantify the wavelet compressibility of compound Poisson processes. To that end, we expand the given random process over the Haar wavelet basis and we analyse its asymptotic approximation properties. By only considering the nonzero wavelet coefficients up to a given scale, what we call the greedy approximation, we exploit the extreme sparsity of the wavelet expansion that derives from the piecewise-constant nature of compound Poisson processes. More precisely, we provide lower and upper bounds for the mean squared error of greedy approximation of compound Poisson processes. We are then able to deduce that the greedy approximation error has a sub-exponential and super-polynomial asymptotic behavior. Finally, we provide numerical experiments to highlight the remarkable ability of wavelet-based dictionaries in achieving highly compressible approximations of compound Poisson processes.
@ARTICLE(http://bigwww.epfl.ch/publications/aziznejad2201.html, AUTHOR="Aziznejad, S. and Fageot, J.", TITLE="The Wavelet Compressibility of Compound {P}oisson Processes", JOURNAL="{IEEE} Transactions on Information Theory", YEAR="2022", volume="68", number="4", pages="2752--2766", month="April", note="")