Personal tools
You are here: Home Cool Science
Document Actions

Cool Science

by Tom Asaki last modified 2008-09-30 18:16

GMT

Geometric Measure Theory

Geometric analysis provides insights into the precise nature of sets, measures and functions. These can be exploited for creation of novel algorithms for the analysis and modeling of data. Our current work in this area includes shape statistics, exact minimizers for image analysis functionals, image signatures for robust metrics, shape priors for fine tuning image segmentation, and null-Riemannian geometry for selective metrics.

Derivative-Free and Mixed-Variable Optimization

Optimization problems seek some optimal set of variables that serve as a description of some situation, data, or object. Optimality is measured by a so-called objective function on the variables that is designed to achieve a minimum (or maximum) value for the best possible description. Many algorithms use derivative information on the objective function to achieve efficient convergence to the optimum. We focus on the development and use optimization methods that do not use derivatives. These methods are important for several reasons. Derivatives may be unavailable as is the case for black box and computer code objectives. Derivatives may be unreliable due to stochastic noise. Derivatives may be difficult to compute such as for objectives defined only in complex non-cartesian geometries. Derivatives may be undefined such as for variables that are discrete (integer, date, grid location, etc.), categorical (color, material, table entry, etc.), or mixed.

optimization

Metrics

Metrics

Many data science challenges require rigorously defensible comparisons between similar data types. Examples include object recognition, image reconstruction, validation of simulations using experiments, and quantification of uncertainty in many settings. Understanding how to build desirable properties into the metrics used to quantify these comparisons often requires substantial mathematical insight.

Regularization

Regularization and Dimension Reduction

In any data driven problem such as image denoising, statistical inference from data, or validation of scientific predictions we must use prior information and the simplicity implicit in the problem domain to turn data into conclusions. An example is the use of the knowledge of band-limiting to turn a measured time series back into the continuous signal from which the measurements came using only the measurements. Another example is the use of knowledge that image information is contained in the edges to suggest the use of total variation (TV) regularization in denoising applications. A final example is the exploitation of the fact that high dimensional data often actually lies on low dimensional submanifolds in the high-dimensional data spaces.

De-noised

Signal Processing

Low dimensional time series arise in many ways. For example, many engineering systems are tracked and controlled using scalar time series from transducers measuring pressure, temperature, pH, concentrations of chemical components, speeds and velocities at various physical locations, etc. Tasks such as detection of an event signature in a flood of noise, prediction of future signal behavior, signal compression, or inference of the signal between measurements (interpolation) all require insight into the structure of the structure of these times series and the domain from which they come.

Though the bulk of our work deals with higher dimensional signals (images, for example) we have expertise and an interest in low dimensional signal processing. Examples of past projects include detection of aliasing in measured signals and validation of simulations through metrics designed for the comparison of scalar time series.

Signal Processing