Searcharxiv⌕ Search

arXiv subjects

Ronny Bergmann

Publications and source records attributed to Ronny Bergmann.

41 records · Page 3Linked to original sources

Inpainting of Cyclic Data using First and Second Order Differences

Cyclic data arise in various image and signal processing applications such as interferometric synthetic aperture radar, electroencephalogram data analysis, and color image restoration in HSV or LCh spaces. In this paper we introduce a variational inpainting model for cyclic data which utilizes our definition of absolute cyclic second order differences. Based on analytical expressions for the proximal mappings of these differences we propose a cyclic proximal point algorithm (CPPA) for minimizing the corresponding functional. We choose appropriate cycles to implement this algorithm in an efficient way. We further introduce a simple strategy to initialize the unknown inpainting region. Numerical results both for synthetic and real-world data demonstrate the performance of our algorithm.

math.NA↗

Multivariate periodic wavelets of de la Vallée Poussin type

In this paper we present a general approach to multivariate periodic wavelets generated by scaling functions of de la Vallée Poussin type. These scaling functions and their corresponding wavelets are determined by their Fourier coefficients, which are sample values of a function, that can be chosen arbitrarily smooth, even with different smoothness in each direction. This construction generalizes the one-dimensional de la Vallée Poussin means to the multivariate case and enables the construction of wavelet systems, where the set of dilation matrices for the two-scale relation of two spaces of the multiresolution analysis may contain shear and rotation matrices. It further enables the functions contained in each of the function spaces from the corresponding series of scaling spaces to have a certain direction or set of directions as their focus, which is illustrated by detecting jumps of certain directional derivatives of higher order.

math.FA↗

Second Order Differences of Cyclic Data and Applications in Variational Denoising

In many image and signal processing applications, as interferometric synthetic aperture radar (SAR), electroencephalogram (EEG) data analysis or color image restoration in HSV or LCh spaces the data has its range on the one-dimensional sphere $\mathbb S^1$. Although the minimization of total variation (TV) regularized functionals is among the most popular methods for edge-preserving image restoration such methods were only very recently applied to cyclic structures. However, as for Euclidean data, TV regularized variational methods suffer from the so called staircasing effect. This effect can be avoided by involving higher order derivatives into the functional. This is the first paper which uses higher order differences of cyclic data in regularization terms of energy functionals for image restoration. We introduce absolute higher order differences for $\mathbb S^1$-valued data in a sound way which is independent of the chosen representation system on the circle. Our absolute cyclic first order difference is just the geodesic distance between points. Similar to the geodesic distances the absolute cyclic second order differences have only values in [0,π]. We update the cyclic variational TV approach by our new cyclic second order differences. To minimize the corresponding functional we apply a cyclic proximal point method which was recently successfully proposed for Hadamard manifolds. Choosing appropriate cycles this algorithm can be implemented in an efficient way. The main steps require the evaluation of proximal mappings of our cyclic differences for which we provide analytical expressions. Under certain conditions we prove the convergence of our algorithm. Various numerical examples with artificial as well as real-world data demonstrate the advantageous performance of our algorithm.

math.NA↗

Multivariate Anisotropic Interpolation on the Torus

We investigate the error of periodic interpolation, when sampling a function on an arbitrary pattern on the torus. We generalize the periodic Strang-Fix conditions to an anisotropic setting and provide an upper bound for the error of interpolation. These conditions and the investigation of the error especially take different levels of smoothness along certain directions into account.

math.FA↗

The fast Fourier Transform and fast Wavelet Transform for Patterns on the Torus

We introduce a fast Fourier transform on regular d-dimensional lattices. We investigate properties of congruence class representants, i.e. their ordering, to classify directions and derive a Cooley-Tukey-Algorithm. Despite the fast Fourier techniques itself, there is also the advantage of this transform to be parallelized efficiently, yielding faster versions than the one-dimensional Fourier transform. These properties of the lattice can further be used to perform a fast multivariate wavelet decomposition, where the wavelets are given as trigonometric polynomials. Furthermore the preferred directions of the decomposition itself can be characterised.

math.NA↗