Efficient Localization of Discontinuities in Complex Computational Simulations

Surrogate models for computational simulations are input-output approximations that allow computationally intensive analyses, such as uncertainty propagation and inference, to be performed efficiently. When a simulation output does not depend smoothly on its inputs, the error and convergence rate of many approximation methods deteriorate substantially. This paper details a method for efficiently localizing discontinuities in the input parameter domain, so that the model output can be approximated as a piecewise smooth function. The approach comprises an initialization phase, which uses polynomial annihilation to assign function values to different regions and thus seed an automated labeling procedure, followed by a refinement phase that adaptively updates a kernel support vector machine representation of the separating surface via active learning. The overall approach avoids structured grids and exploits any available simplicity in the geometry of the separating surface, thus reducing the number of model evaluations required to localize the discontinuity. The method is illustrated on examples of up to eleven dimensions, including algebraic models and ODE/PDE systems, and demonstrates improved scaling and efficiency over other discontinuity localization approaches

Automated parameters for troubled-cell indicators using outlier detection

In Vuik and Ryan (2014) we studied the use of troubled-cell indicators for discontinuity detection in nonlinear hyperbolic partial differential equations and introduced a new multiwavelet technique to detect troubled cells. We found that these methods perform well as long as a suitable, problem-dependent parameter is chosen. This parameter is used in a threshold which decides whether or not to detect an element as a troubled cell. Until now, these parameters could not be chosen automatically. The choice of the parameter has impact on the approximation: it determines the strictness of the troubled-cell indicator. An inappropriate choice of the parameter will result in detection (and limiting) of too few or too many elements. The optimal parameter is chosen such that the minimal number of troubled cells is detected and the resulting approximation is free of spurious oscillations. In this paper we will see that for each troubled-cell indicator the sudden increase or decrease of the indicator value with respect to the neighboring values is important for detection. Indication basically reduces to detecting the outliers of a vector (one dimension) or matrix (two dimensions). This is done using Tukey's boxplot approach to detect which coefficients in a vector are straying far beyond others (Tukey, 1977). We provide an algorithm that can be applied to various troubled-cell indication variables. Using this technique the problem-dependent parameter that the original indicator requires is no longer necessary as the parameter will be chosen automatically

Level Set Methods for Stochastic Discontinuity Detection in Nonlinear Problems

Stochastic physical problems governed by nonlinear conservation laws are challenging due to solution discontinuities in stochastic and physical space. In this paper, we present a level set method to track discontinuities in stochastic space by solving a Hamilton-Jacobi equation. By introducing a speed function that vanishes at discontinuities, the iso-zero of the level set problem coincide with the discontinuities of the conservation law. The level set problem is solved on a sequence of successively finer grids in stochastic space. The method is adaptive in the sense that costly evaluations of the conservation law of interest are only performed in the vicinity of the discontinuities during the refinement stage. In regions of stochastic space where the solution is smooth, a surrogate method replaces expensive evaluations of the conservation law. The proposed method is tested in conjunction with different sets of localized orthogonal basis functions on simplex elements, as well as frames based on piecewise polynomials conforming to the level set function. The performance of the proposed method is compared to existing adaptive multi-element generalized polynomial chaos methods

Identification of body fat tissues in MRI data

In recent years non-invasive medical diagnostic techniques have been used widely in medical investigations. Among the various imaging modalities available, Magnetic Resonance Imaging is very attractive as it produces multi-slice images where the contrast between various types of body tissues such as muscle, ligaments and fat is well defined. The aim of this paper is to describe the implementation of an unsupervised image analysis algorithm able to identify the body fat tissues from a sequence of MR images encoded in DICOM format. The developed algorithm consists of three main steps. The first step pre-processes the MR images in order to reduce the level of noise. The second step extracts the image areas representing fat tissues by using an unsupervised clustering algorithm. Finally, image refinements are applied to reclassify the pixels adjacent to the initial fat estimate and to eliminate outliers. The experimental data indicates that the proposed implementation returns accurate results and furthermore is robust to noise and to greyscale in-homogeneity