Searcharxiv⌕ Search

arXiv subjects

Herwig Wendt

Publications and source records attributed to Herwig Wendt.

31 records · Page 2Linked to original sources

Finite resolution effects in p-leader multifractal analysis

Multifractal analysis has become a standard signal processing tool,for which a promising new formulation, the p-leader multifractal formalism, has recently been proposed. It relies on novel multiscale quantities, the p-leaders, defined as local l^p norms of sets of wavelet coefficients located at infinitely many fine scales. Computing such infinite sums from actual finite-resolution data requires truncations to the finest available scale, which results in biased p-leaders and thus in inaccurate estimates of multifractal properties. A systematic study of such finite-resolution effects leads to conjecture an explicit and universal closed-form correction that permits an accurate estimation of scaling exponents. This conjecture is formulated from the theoretical study of a particular class of models for multifractal processes, the wavelet-based cascades. The relevance and generality of the proposed conjecture is assessed by numerical simulations conducted over a large variety of multifractal processes. Finally, the relevance of the proposed corrected estimators is demonstrated on the analysis of heart rate variability data.

math.NA↗

Scaling in Internet Traffic: a 14 year and 3 day longitudinal study, with multiscale analyses and random projections

In the mid-90's, it was shown that the statistics of aggregated time series from Internet traffic departed from those of traditional short range dependent models, and were instead characterized by asymptotic self-similarity. Following this seminal contribution, over the years, many studies have investigated the existence and form of scaling in Internet traffic. This contribution aims first at presenting a methodology, combining multiscale analysis (wavelet and wavelet leaders) and random projections (or sketches), permitting a precise, efficient and robust characterization of scaling which is capable of seeing through non-stationary anomalies. Second, we apply the methodology to a data set spanning an unusually long period: 14 years, from the MAWI traffic archive, thereby allowing an in-depth longitudinal analysis of the form, nature and evolutions of scaling in Internet traffic, as well as network mechanisms producing them. We also study a separate 3-day long trace to obtain complementary insight into intra-day behavior. We find that a biscaling (two ranges of independent scaling phenomena) regime is systematically observed: long-range dependence over the large scales, and multifractal-like scaling over the fine scales. We quantify the actual scaling ranges precisely, verify to high accuracy the expected relationship between the long range dependent parameter and the heavy tail parameter of the flow size distribution, and relate fine scale multifractal scaling to typical IP packet inter-arrival and to round-trip time distributions.

cs.NI↗

Bayesian selection for the l2-Potts model regularization parameter: 1D piecewise constant signal denoising

Piecewise constant denoising can be solved either by deterministic optimization approaches, based on the Potts model, or by stochastic Bayesian procedures. The former lead to low computational time but require the selection of a regularization parameter, whose value significantly impacts the achieved solution, and whose automated selection remains an involved and challenging problem. Conversely, fully Bayesian formalisms encapsulate the regularization parameter selection into hierarchical models, at the price of high computational costs. This contribution proposes an operational strategy that combines hierarchical Bayesian and Potts model formulations, with the double aim of automatically tuning the regularization parameter and of maintaining computational effciency. The proposed procedure relies on formally connecting a Bayesian framework to a l2-Potts functional. Behaviors and performance for the proposed piecewise constant denoising and regularization parameter tuning techniques are studied qualitatively and assessed quantitatively, and shown to compare favorably against those of a fully Bayesian hierarchical procedure, both in accuracy and in computational load.

cs.LG↗

Multivariate Hadamard self-similarity: testing fractal connectivity

While scale invariance is commonly observed in each component of real world multivariate signals, it is also often the case that the inter-component correlation structure is not fractally connected, i.e., its scaling behavior is not determined by that of the individual components. To model this situation in a versatile manner, we introduce a class of multivariate Gaussian stochastic processes called Hadamard fractional Brownian motion (HfBm). Its theoretical study sheds light on the issues raised by the joint requirement of entry-wise scaling and departures from fractal connectivity. An asymptotically normal wavelet-based estimator for its scaling parameter, called the Hurst matrix, is proposed, as well as asymptotically valid confidence intervals. The latter are accompanied by original finite sample procedures for computing confidence intervals and testing fractal connectivity from one single and finite size observation. Monte Carlo simulation studies are used to assess the estimation performance as a function of the (finite) sample size, and to quantify the impact of omitting wavelet cross-correlation terms. The simulation studies are shown to validate the use of approximate confidence intervals, together with the significance level and power of the fractal connectivity test. The test performance and properties are further studied as functions of the HfBm parameters.

math.ST↗

p-exponent and p-leaders, Part II: Multifractal Analysis. Relations to Detrended Fluctuation Analysis

Multifractal analysis studies signals, functions, images or fields via the fluctuations of their local regularity along time or space, which capture crucial features of their temporal/spatial dynamics. It has become a standard signal and image processing tool and is commonly used in numerous applications of different natures. In its common formulation, it relies on the Hölder exponent as a measure of local regularity, which is by nature restricted to positive values and can hence be used for locally bounded functions only. In this contribution, it is proposed to replace the Hölder exponent with a collection of novel exponents for measuring local regularity, the $p$-exponents. One of the major virtues of $p$-exponents is that they can potentially take negative values. The corresponding wavelet-based multiscale quantities, the $p$-leaders, are constructed and shown to permit the definition of a new multifractal formalism, yielding an accurate practical estimation of the multifractal properties of real-world data. Moreover, theoretical and practical connections to and comparisons against another multifractal formalism, referred to as multifractal detrended fluctuation analysis, are achieved. The performance of the proposed $p$-leader multifractal formalism is studied and compared to previous formalisms using synthetic multifractal signals and images, illustrating its theoretical and practical benefits. The present contribution is complemented by a companion article studying in depth the theoretical properties of $p$-exponents and the rich classification of local singularities it permits.

math.CA↗

p-exponent and p-leaders, Part I: Negative pointwise regularity

Multifractal analysis aims to characterize signals, functions, images or fields, via the fluctuations of their local regularity along time or space, hence capturing crucial features of their temporal/spatial dynamics. Multifractal analysis is becoming a standard tool in signal and image processing, and is nowadays widely used in numerous applications of different natures. Its common formulation relies on the measure of local regularity via the Hölder exponent, by nature restricted to positive values, and thus to locally bounded functions or signals. It is here proposed to base the quantification of local regularity on $p$-exponents, a novel local regularity measure potentially taking negative values. First, the theoretical properties of $p$-exponents are studied in detail. Second, wavelet-based multiscale quantities, the $p$-leaders, are constructed and shown to permit accurate practical estimation of $p$-exponents. Exploiting the potential dependence with $p$, it is also shown how the collection of $p$-exponents enriches the classification of locally singular behaviors in functions, signals or images. The present contribution is complemented by a companion article developing the $p$-leader based multifractal formalism associated to $p$-exponents.

math.CA↗

Combining local regularity estimation and total variation optimization for scale-free texture segmentation

Texture segmentation constitutes a standard image processing task, crucial to many applications. The present contribution focuses on the particular subset of scale-free textures and its originality resides in the combination of three key ingredients: First, texture characterization relies on the concept of local regularity ; Second, estimation of local regularity is based on new multiscale quantities referred to as wavelet leaders ; Third, segmentation from local regularity faces a fundamental bias variance trade-off: In nature, local regularity estimation shows high variability that impairs the detection of changes, while a posteriori smoothing of regularity estimates precludes from locating correctly changes. Instead, the present contribution proposes several variational problem formulations based on total variation and proximal resolutions that effectively circumvent this trade-off. Estimation and segmentation performance for the proposed procedures are quantified and compared on synthetic as well as on real-world textures.

cs.CV↗

Multiscale reverse-time-migration-type imaging using the dyadic parabolic decomposition of phase space

We develop a representation of reverse-time migration in terms of Fourier integral operators the canonical relations of which are graphs. Through the dyadic parabolic decomposition of phase space, we obtain the solution of the wave equation with a boundary source and homogeneous initial conditions using wave packets. On this basis, we develop a numerical procedure for the reverse time continuation from the boundary of scattering data and for RTM migration. The algorithms are derived from those we recently developed for the discrete approximate evaluation of the action of Fourier integral operators and inherit from their conceptual and numerical properties.

math.NA↗

Multifractal analysis based on p-exponents and lacunarity exponents

Many examples of signals and images cannot be modeled by locally bounded functions, so that the standard multifractal analysis, based on the Hölder exponent, is not feasible. We present a multifractal analysis based on another quantity, the p-exponent, which can take arbitrarily large negative values. We investigate some mathematical properties of this exponent, and show how it allows us to model the idea of "lacunarity" of a singularity at a point. We finally adapt the wavelet based multifractal analysis in this setting, and we give applications to a simple mathematical model of multifractal processes: Lacunary wavelet series.

math.FA↗

Bayesian estimation of the multifractality parameter for image texture using a Whittle approximation

Texture characterization is a central element in many image processing applications. Multifractal analysis is a useful signal and image processing tool, yet, the accurate estimation of multifractal parameters for image texture remains a challenge. This is due in the main to the fact that current estimation procedures consist of performing linear regressions across frequency scales of the two-dimensional (2D) dyadic wavelet transform, for which only a few such scales are computable for images. The strongly non-Gaussian nature of multifractal processes, combined with their complicated dependence structure, makes it difficult to develop suitable models for parameter estimation. Here, we propose a Bayesian procedure that addresses the difficulties in the estimation of the multifractality parameter. The originality of the procedure is threefold: The construction of a generic semi-parametric statistical model for the logarithm of wavelet leaders; the formulation of Bayesian estimators that are associated with this model and the set of parameter values admitted by multifractal theory; the exploitation of a suitable Whittle approximation within the Bayesian model which enables the otherwise infeasible evaluation of the posterior distribution associated with the model. Performance is assessed numerically for several 2D multifractal processes, for several image sizes and a large range of process parameters. The procedure yields significant benefits over current benchmark estimators in terms of estimation performance and ability to discriminate between the two most commonly used classes of multifractal process models. The gains in performance are particularly pronounced for small image sizes, notably enabling for the first time the analysis of image patches as small as 64x64 pixels.

physics.data-an↗

Frequency estimation based on Hankel matrices and the alternating direction method of multipliers

We develop a parametric high-resolution method for the estimation of the frequency nodes of linear combinations of complex exponentials with exponential damping. We use Kronecker's theorem to formulate the associated nonlinear least squares problem as an optimization problem in the space of vectors generating Hankel matrices of fixed rank. Approximate solutions to this problem are obtained by using the alternating direction method of multipliers. Finally, we extract the frequency estimates from the con-eigenvectors of the solution Hankel matrix. The resulting algorithm is simple, easy to implement and can be applied to data with equally spaced samples with approximation weights, which for instance allows cases of missing data samples. By means of numerical simulations, we analyze and illustrate the excellent performance of the method, attaining the Cramér-Rao bound.

math.NA↗

Multi-scale discrete approximations of Fourier integral operators associated with canonical transformations and caustics

We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation of the action of such operators on data in the presence of caustics. The procedure consists in the construction of a universal operator representation through the introduction of locally singularity-resolving diffeomorphisms, enabling the application of wave packet driven computation, and in the construction of the associated pseudo-differential joint-partition of unity on the canonical graphs. We apply the method to a parametrix of the wave equation in the vicinity of a cusp singularity.

math.NA↗

Irregularities and Scaling in Signal and Image Processing: Multifractal Analysis

B. Mandelbrot gave a new birth to the notions of scale invariance, selfsimilarity and non-integer dimensions, gathering them as the founding corner-stones used to build up fractal geometry. The first purpose of the present contribution is to review and relate together these key notions, explore their interplay and show that they are different facets of a same intuition. Second, it will explain how these notions lead to the derivation of the mathematical tools underlying multifractal analysis. Third, it will reformulate these theoretical tools into a wavelet framework, hence enabling their better theoretical understanding as well as their efficient practical implementation. B. Mandelbrot used his concept of fractal geometry to analyze real-world applications of very different natures. As a tribute to his work, applications of various origins, and where multifractal analysis proved fruitful, are revisited to illustrate the theoretical developments proposed here.

math.FA↗