No abstract uploaded!

The aim of this paper is to provide a fast and efficient procedure for (real-time) target identification in imaging based on matching on a dictionary of precomputed generalized polarization tensors (GPTs). The approach is based on some important properties of the GPTs and new invariants. A new shape representation is given and numerically tested in the presence of measurement noise. The stability and resolution of the proposed identification algorithm is numerically quantified. We compare the proposed GPT-based shape representation with a moment-based one.

In this paper we present an error estimate for the explicit Runge-Kutta discontinuous Galerkin method to solve a linear hyperbolic equation in one dimension with discontinuous but piecewise smooth initial data. The discontinuous finite element space is made up of piecewise polynomials of arbitrary degree $k\geq1$, and time is advanced by the third order explicit total variation diminishing Runge-Kutta method under the standard CFL temporal-spatial condition. The $L^2(\mathbb{R}\backslash\mathcal{R}_T)$-norm error at the final time $T$ is optimal in both space and time, where $\mathcal{R}_T$ is the pollution region due to the initial discontinuity with the width $\mathcal{O}(\sqrt{T\beta}h^{1/2}\log(1/h))$. Here $h$ is the maximum cell length and $\beta$ is the flowing speed. These results are independent of the time step and hold also for the semi-discrete discontinuous Galerkin method.

It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the "curse of dimensionality" in some degree. In this note, we first give the error estimate of hyperbolic cross (HC) approximations with generalized Hermite functions. The exponential convergence in both regular and optimized hyperbolic cross approximations has been shown. Moreover, the error estimate of Hermite spectral method to high-dimensional linear parabolic PDEs with HC approximations has been investigated in the properly weighted Korobov spaces. The numerical result verifies the exponential convergence of this approach.

We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods by using total variation regularization. We obtain rigorous convergence results and effective stopping criteria for the general procedure. The numerical results for denoising appear to give significant improvement over standard models, and preliminary results for deblurring/denoising are very encouraging.