Adaptive wavelet scheme for convection-diffusion equations

One of the most important part of adaptive wavelet methods is an efficient approximate multi- plication of stiffness matrices with vectors in wavelet coordinates. Although there are known algorithms to perform it in linear complexity, the application of them is relatively time con- suming and its implementation is very difficult. Therefore, it is necessary to develop a well- conditioned wavelet basis with respect to which both the mass and stiffness matrices are sparse in the sense that the number of nonzero elements in any column is bounded by a constant. Then, matrix-vector multiplication can be performed exactly with linear complexity. We present here a wavelet basis on the interval with respect to which both the mass and stiffness matrices corresponding to the one-dimensional Laplacian are sparse. Consequently, the stiffness matrix corresponding to the n-dimensional Laplacian in tensor product wavelet basis is also sparse. Moreover, the constructed basis has an excellent condition number. In this contribution, we shortly review this construction and show several numerical tests

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolving in time, such as spreading or propagation of waves on a network. The analysis of this type of data requires a new set of methods that fully takes into account the time and graph dimensions. We propose a novel class of wavelet frames named Dynamic Graph Wavelets, whose time-vertex evolution follows a dynamic process. We demonstrate that this set of functions can be combined with sparsity based approaches such as compressive sensing to reveal information on the dynamic processes occurring on a graph. Experiments on real seismological data show the efficiency of the technique, allowing to estimate the epicenter of earthquake events recorded by a seismic network

Three real-space discretization techniques in electronic structure calculations

A characteristic feature of the state-of-the-art of real-space methods in electronic structure calculations is the diversity of the techniques used in the discretization of the relevant partial differential equations. In this context, the main approaches include finite-difference methods, various types of finite-elements and wavelets. This paper reports on the results of several code development projects that approach problems related to the electronic structure using these three different discretization methods. We review the ideas behind these methods, give examples of their applications, and discuss their similarities and differences.Comment: 39 pages, 10 figures, accepted to a special issue of "physica status solidi (b) - basic solid state physics" devoted to the CECAM workshop "State of the art developments and perspectives of real-space electronic structure techniques in condensed matter and molecular physics". v2: Minor stylistic and typographical changes, partly inspired by referee comment

Geometric deep learning: going beyond Euclidean data

Many scientific fields study data with an underlying structure that is a non-Euclidean space. Some examples include social networks in computational social sciences, sensor networks in communications, functional networks in brain imaging, regulatory networks in genetics, and meshed surfaces in computer graphics. In many applications, such geometric data are large and complex (in the case of social networks, on the scale of billions), and are natural targets for machine learning techniques. In particular, we would like to use deep neural networks, which have recently proven to be powerful tools for a broad range of problems from computer vision, natural language processing, and audio analysis. However, these tools have been most successful on data with an underlying Euclidean or grid-like structure, and in cases where the invariances of these structures are built into networks used to model them. Geometric deep learning is an umbrella term for emerging techniques attempting to generalize (structured) deep neural models to non-Euclidean domains such as graphs and manifolds. The purpose of this paper is to overview different examples of geometric deep learning problems and present available solutions, key difficulties, applications, and future research directions in this nascent field

Adaptive Nonparametric Regression on Spin Fiber Bundles

The construction of adaptive nonparametric procedures by means of wavelet thresholding techniques is now a classical topic in modern mathematical statistics. In this paper, we extend this framework to the analysis of nonparametric regression on sections of spin fiber bundles defined on the sphere. This can be viewed as a regression problem where the function to be estimated takes as its values algebraic curves (for instance, ellipses) rather than scalars, as usual. The problem is motivated by many important astrophysical applications, concerning for instance the analysis of the weak gravitational lensing effect, i.e. the distortion effect of gravity on the images of distant galaxies. We propose a thresholding procedure based upon the (mixed) spin needlets construction recently advocated by Geller and Marinucci (2008,2010) and Geller et al. (2008,2009), and we investigate their rates of convergence and their adaptive properties over spin Besov balls.Comment: 40 page

Unified Heat Kernel Regression for Diffusion, Kernel Smoothing and Wavelets on Manifolds and Its Application to Mandible Growth Modeling in CT Images

We present a novel kernel regression framework for smoothing scalar surface data using the Laplace-Beltrami eigenfunctions. Starting with the heat kernel constructed from the eigenfunctions, we formulate a new bivariate kernel regression framework as a weighted eigenfunction expansion with the heat kernel as the weights. The new kernel regression is mathematically equivalent to isotropic heat diffusion, kernel smoothing and recently popular diffusion wavelets. Unlike many previous partial differential equation based approaches involving diffusion, our approach represents the solution of diffusion analytically, reducing numerical inaccuracy and slow convergence. The numerical implementation is validated on a unit sphere using spherical harmonics. As an illustration, we have applied the method in characterizing the localized growth pattern of mandible surfaces obtained in CT images from subjects between ages 0 and 20 years by regressing the length of displacement vectors with respect to the template surface.Comment: Accepted in Medical Image Analysi

Graph Spectral Image Processing

Recent advent of graph signal processing (GSP) has spurred intensive studies of signals that live naturally on irregular data kernels described by graphs (e.g., social networks, wireless sensor networks). Though a digital image contains pixels that reside on a regularly sampled 2D grid, if one can design an appropriate underlying graph connecting pixels with weights that reflect the image structure, then one can interpret the image (or image patch) as a signal on a graph, and apply GSP tools for processing and analysis of the signal in graph spectral domain. In this article, we overview recent graph spectral techniques in GSP specifically for image / video processing. The topics covered include image compression, image restoration, image filtering and image segmentation