<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Ongoing Research Projects on Emory Scientific Computing Group</title>
    <link>https://www.math.emory.edu/site/codes/research/</link>
    <description>Recent content in Ongoing Research Projects on Emory Scientific Computing Group</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 21 Nov 2017 09:59:16 -0400</lastBuildDate>
    <atom:link href="https://www.math.emory.edu/site/codes/research/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A Flexible Optimal Control Framework for Efficient Training of Deep Neural Networks</title>
      <link>https://www.math.emory.edu/site/codes/research/deeplearning/</link>
      <pubDate>Mon, 30 Jan 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/deeplearning/</guid>
      <description>&lt;p&gt;This project develops a new mathematical framework for deep learning based on the interpretation of certain deep neural networks as nonlinear time-dependent differential equations. This interpretation offers a new way to analyze the successes and failures of deep learning. Advances in deep learning will be made by adapting the wide array of tools available for related optimal control problems, including numerical optimization, partial and ordinary differential equations, inverse problems theory, and parallel processing, to the deep learning problem. Using these currently untapped resources provides rigorous new ways to design and train very deep neural networks that generalize well.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Novel methods for computational hemodynamics</title>
      <link>https://www.math.emory.edu/site/codes/research/comphemo/</link>
      <pubDate>Tue, 21 Nov 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/comphemo/</guid>
      <description>&lt;p&gt;The incompressible Navier-Stokes equations are the basic mathematical model for the simulation of blood flow in arteries. Even if well-known and investigated since a long time, these equations still represent a numerical challenge for their saddle-point structure, the non linear nature. In medical applications, efficiency is a priority together with reliability. All these aspects require the set up of appropriate preconditioners, specific solution methods and, more in general, approaches that could take advantage from particular features of the problem at hand. In addition, we should consider (i) the presence of possible turbulent dynamics and their appropriate numerical modeling; (ii) the lack of data that systematically affects the clinical scenarios (defective problems, image legacy problem). The former is currently solved by Large Eddie Simulation (LES) approaches, specifically based on deconvolution filters. The latter calls for specific methods for the identification of the (arbitrary) missing conditions with low impact on the final solutions. Also, the presence of numerical instabilities induced by backflows is a critical issues in computational hemodynamics. Among the possible solution methods, we also include the Hierarchical Model Reduction technique, a numerical approach for incompressible flow in pipes, where finite elements or isogeometric analysis for the axial direction of the pipe are coupled with spectral methods for a rapid simulation of the transversal dynamics.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Efficient Algorithms for PDE-Parameter Estimation</title>
      <link>https://www.math.emory.edu/site/codes/research/pdeco/</link>
      <pubDate>Tue, 12 Sep 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/pdeco/</guid>
      <description>&lt;p&gt;This project develops efficient numerical methods for solving big data parameter estimation problems that involve partial differential equations (PDEs). Parameter estimation problems of this kind impose key challenges in many scientific disciplines, e.g., in medical imaging, geophysical imaging, and deep learning. The inverse problem can be formulated as an optimization problem with constraints that are given by the PDEs. The unknowns are parameters of the PDEs (e.g., physical properties of the object to be measured). The objective is to minimize the misfit between PDE simulations and measured data plus some regularization term.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Algorithms for Inverse Problems that Exploit Kronecker Product and Tensor Structures</title>
      <link>https://www.math.emory.edu/site/codes/research/kronprodinverseprobl/</link>
      <pubDate>Mon, 11 Sep 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/kronprodinverseprobl/</guid>
      <description>&lt;p&gt;The aim of this project is to develop efficient singular value&#xA;decomposition (SVD) approximation methods for&#xA;large-scale matrices that arise in discrete ill-posed inverse problems.&#xA;The approach will exploit inherent Kronecker&#xA;product and tensor structures, and will be the basis for a&#xA;computational platform for the efficient solution of large-scale&#xA;ill-posed problems.  Efficient approaches to solve Kronecker product&#xA;and tensor structured SVD updating problems will be developed.&#xA;Iterative methods that can incorporate regularization, sparse and&#xA;low-rank constraints on the solution will also be considered.  The SVD&#xA;approximations and updating methods developed in this project can be&#xA;used as tools to obtain approximate solutions of ill-posed inverse&#xA;problems, as preconditioners to accelerate iterative solvers, or as&#xA;tools to build solution methods for nonlinear problems.  By developing&#xA;a computational platform, based on SVD approximations, the work&#xA;developed in this proposal will have a broad scientific impact for&#xA;applications where it is necessary to compute solutions of large-scale&#xA;ill-posed inverse problems, including astronomy, cosmology,&#xA;geophysics, microscopy, and medical imaging.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Data Assimilation and Parameter identification in electrophysiology</title>
      <link>https://www.math.emory.edu/site/codes/research/electrophys/</link>
      <pubDate>Tue, 21 Nov 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/electrophys/</guid>
      <description>&lt;p&gt;Data Assimilation is the ensemble of methods for merging data and numerical simulations when solving a specific problem. It can be pursued in different ways and for addressing different problems, from prediction to parameter identification. In this project, we specifically address the variational estimation of the conductivity parameters of the Bidomain equations. These are partial differential equations for the potential propagation in the cardiac tissue. The conductivity tensor is a critical set pf parameters with a major impact on the numerical solution. Their accurate knowledge is hard to obtain in practice. Moving from measurements of the potential on the surface of the tissue, it is possible to obtain a reliable estimate to be used in more complex problems like the optimal placement of cardiac leads. We pursue a variational approach, i.e. the minimization of the mismatch between data and simulations, constrained by the Bidomain equations or their simplified version, the Mondomain equation. As the computational costs are quite high, we need reduced models to pursue the estimation in short timelines. We work currently with approaches like Proper Orthogonal Decomposition and Proper General Decomposition.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Numerical Methods for Multispectral Tomographic Image Reconstruction</title>
      <link>https://www.math.emory.edu/site/codes/research/multispectomo/</link>
      <pubDate>Sun, 10 Sep 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/multispectomo/</guid>
      <description>&lt;p&gt;Breast cancer is the most prevalent non-skin cancer in women in the&#xA;US.  Although mammography is currently the most common test for the&#xA;early detection and diagnosis of breast cancer, its two-dimensional&#xA;nature introduces various limitations in its capabilities for advanced&#xA;imaging. Over the last decade, the introduction of digital imaging&#xA;technology has resulted in the development of new tomographic and&#xA;pseudo-tomographic methods for imaging the breast.&lt;/p&gt;&#xA;&lt;p&gt;Digital tomographic image reconstruction uses multiple x-ray&#xA;projections obtained along a range of different incident angles to&#xA;reconstruct a 3D representation of an object. For example, computed&#xA;tomography (CT) generally refers to the situation when a full set of&#xA;angles are used (e.g., 360 degrees) while tomosynthesis refers to the&#xA;case when only a limited (e.g., 30 degrees) angular range is used. In&#xA;either case, most existing reconstruction algorithms assume that the&#xA;x-ray source is monoenergetic. This results in a simplified linear&#xA;forward model, which is easy to solve but can result in artifacts in&#xA;the reconstructed images. It has been shown that these artifacts can&#xA;be reduced by using a more accurate polyenergetic assumption for the&#xA;x-ray source, but the polyenergetic model requires solving a&#xA;large-scale nonlinear inverse problem.  In addition to reducing&#xA;artifacts, a full polyenergetic model can be used to extract&#xA;additional information about the materials of the object; that is, to&#xA;provide a mechanism for quantitative imaging.  Similar mathematical&#xA;models arise when using multispectral detectors.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Bayesian Approaches for Strain Identification from Culture-Independent Samples</title>
      <link>https://www.math.emory.edu/site/codes/research/strainrecon/</link>
      <pubDate>Wed, 27 Sep 2017 09:59:16 -0400</pubDate>
      <guid>https://www.math.emory.edu/site/codes/research/strainrecon/</guid>
      <description>&lt;p&gt;We develop new mathematical approaches, algorithms and systems for identifying pathogen strains using whole genome multilocus sequence typing (wgMLST) data in mixed samples. Strain identification is an underdetermined inverse problem when the samples are not cultured, i.e., contain multiple strains at unknown proportions. Therefore, we encode prior knowledge on both the strains and their proportion in a Bayesian framework. Our approaches use mixed-integer optimization to identify the most likely strains and Monte-Carlo sampling to quantify the uncertainty associated with those estimates. Motivating applications of our algorithms include the identification of &lt;em&gt;P. falciparum&lt;/em&gt; (malaria) and &lt;em&gt;E.coli&lt;/em&gt; (foodborne illness) strains to improve visibility and monitoring for public health officials.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
