1.2NAApr 6, 2016
Transport between RGB Images Motivated by Dynamic Optimal TransportJan Henrik Fitschen, Friederike Laus, Gabriele Steidl
We propose two models for the interpolation between RGB images based on the dynamic optimal transport model of Benamou and Brenier [8]. While the application of dynamic optimal transport and its extensions to unbalanced transform were examined for gray-values images in various papers, this is the first attempt to generalize the idea to color images. The nontrivial task to incorporate color into the model is tackled by considering RGB images as three-dimensional arrays, where the transport in the RGB direction is performed in a periodic way. Following the approach of Papadakis et al. [35] for gray-value images we propose two discrete variational models, a constrained and a penalized one which can also handle unbalanced transport. We show that a minimizer of our discrete model exists, but it is not unique for some special initial/final images. For minimizing the resulting functionals we apply a primal-dual algorithm. One step of this algorithm requires the solution of a four-dimensional discretized Poisson equation with various boundary conditions in each dimension. For instance, for the penalized approach we have simultaneously zero, mirror and periodic boundary conditions. The solution can be computed efficiently using fast Sin-I, Cos-II and Fourier transforms. Numerical examples demonstrate the meaningfulness of our model.
1.2NAFeb 28, 2018
Strain Analysis by a Total Generalized Variation Regularized Optical Flow ModelFrank Balle, Tilmann Beck, Dietmar Eifler et al.
In this paper we deal with the important problem of estimating the local strain tensor from a sequence of micro-structural images realized during deformation tests of engineering materials. Since the strain tensor is defined via the Jacobian of the displacement field, we propose to compute the displacement field by a variational model which takes care of properties of the Jacobian of the displacement field. In particular we are interested in areas of high strain. The data term of our variational model relies on the brightness invariance property of the image sequence. As prior we choose the second order total generalized variation of the displacement field. This prior splits the Jacobian of the displacement field into a smooth and a non-smooth part. The latter reflects the material cracks. An additional constraint is incorporated to handle physical properties of the non-smooth part for tensile tests. We prove that the resulting convex model has a minimizer and show how a primal-dual method can be applied to find a minimizer. The corresponding algorithm has the advantage that the strain tensor is directly computed within the iteration process. Our algorithm is further equipped with a coarse-to-fine strategy to cope with larger displacements. Numerical examples with simulated and experimental data demonstrate the very good performance of our algorithm. In comparison to state-of-the-art engineering software for strain analysis our method can resolve local phenomena much better.
1.2NAMay 8, 2018
Morphing of Manifold-Valued Images inspired by Discrete Geodesics in Image SpacesSebastian Neumayer, Johannes Persch, Gabriele Steidl
This paper addresses the morphing of manifold-valued images based on the time discrete geodesic paths model of Berkels, Effland and Rumpf 2015. Although for our manifold-valued setting such an interpretation of the energy functional is not available so far, the model is interesting on its own. We prove the existence of a minimizing sequence within the set of $L^2(Ω,\mathcal{H})$ images having values in a finite dimensional Hadamard manifold $\mathcal{H}$ together with a minimizing sequence of admissible diffeomorphisms. To this end, we show that the continuous manifold-valued functions are dense in $L^2(Ω,\mathcal{H})$. We propose a space discrete model based on a finite difference approach on staggered grids, where we focus on the linearized elastic potential in the regularizing term. The numerical minimization alternates between i) the computation of a deformation sequence between given images via the parallel solution of certain registration problems for manifold-valued images, and ii) the computation of an image sequence with fixed first (template) and last (reference) frame based on a given sequence of deformations via the solution of a system of equations arising from the corresponding Euler-Lagrange equation. Numerical examples give a proof of the concept of our ideas.
T-FAKE: Synthesizing Thermal Images for Facial LandmarkingPhilipp Flotho, Moritz Piening, Anna Kukleva et al.
Facial analysis is a key component in a wide range of applications such as healthcare, autonomous driving, and entertainment. Despite the availability of various facial RGB datasets, the thermal modality, which plays a crucial role in life sciences, medicine, and biometrics, has been largely overlooked. To address this gap, we introduce the T-FAKE dataset, a new large-scale synthetic thermal dataset with sparse and dense landmarks. To facilitate the creation of the dataset, we propose a novel RGB2Thermal loss function, which enables the domain-adaptive transfer of RGB faces to thermal style. By utilizing the Wasserstein distance between thermal and RGB patches and the statistical analysis of clinical temperature distributions on faces, we ensure that the generated thermal images closely resemble real samples. Using RGB2Thermal style transfer based on our RGB2Thermal loss function, we create the large-scale synthetic thermal T-FAKE dataset with landmark and segmentation annotations. Leveraging our novel T-FAKE dataset, probabilistic landmark prediction, and label adaptation networks, we demonstrate significant improvements in landmark detection methods on thermal images across different landmark conventions. Our models show excellent performance with both sparse 70-point landmarks and dense 478-point landmark annotations. Moreover, our RGB2Thermal loss leads to notable results in terms of perceptual evaluation and temperature prediction.
4.3NAJul 26, 2018
Linkage between piecewise constant Mumford-Shah model and ROF model and its virtue in image segmentationXiaohao Cai, Raymond Chan, Carola-Bibiane Schonlieb et al.
The piecewise constant Mumford-Shah (PCMS) model and the Rudin-Osher-Fatemi (ROF) model are two important variational models in image segmentation and image restoration, respectively. In this paper, we explore a linkage between these models. We prove that for the two-phase segmentation problem a partial minimizer of the PCMS model can be obtained by thresholding the minimizer of the ROF model. A similar linkage is still valid for multiphase segmentation under specific assumptions. Thus it opens a new segmentation paradigm: image segmentation can be done via image restoration plus thresholding. This new paradigm, which circumvents the innate non-convex property of the PCMS model, therefore improves the segmentation performance in both efficiency (much faster than state-of-the-art methods based on PCMS model, particularly when the phase number is high) and effectiveness (producing segmentation results with better quality) due to the flexibility of the ROF model in tackling degraded images, such as noisy images, blurry images or images with information loss. As a by-product of the new paradigm, we derive a novel segmentation method, called thresholded-ROF (T-ROF) method, to illustrate the virtue of managing image segmentation through image restoration techniques. The convergence of the T-ROF method is proved, and elaborate experimental results and comparisons are presented.