Refine
Year of publication
Language
- English (1103) (remove)
Keywords
- optimal control (27)
- stability (14)
- integer programming (11)
- Stochastic programming (9)
- finite elements (9)
- mixed integer programming (9)
- Hamiltonian matrix (8)
- finite element method (8)
- model reduction (8)
- state constraints (8)
Recently, Khuller, Moss and Naor presented a greedy algorithm for the budgeted maximum coverage problem. In this note, we observe that this algorithm also approximates a special case of set-union knapsack problem within a constant factor. In the special case, an element is a member of less than a constant number of subsets. This guarantee naturally extends to densest k-subgraph problem on graphs of bounded degree.
Deformable surface models are often represented as triangular meshes in image segmentation applications. For a fast and easily regularized deformation onto the target object boundary, the vertices of the mesh are commonly moved along line segments (typically surface normals). However, in case of high mesh curvature, these lines may intersect with the target boundary at “non-corresponding” positions, or may not intersect at all. Consequently, certain deformations cannot be achieved. We propose omnidirectional displacements for deformable surfaces (ODDS) to overcome this limitation. ODDS allow each vertex to move not only along a line segment but within a surrounding sphere, and achieve globally optimal deformations subject to local regularization con-
straints. However, allowing a ball-shaped instead of a linear range of motion per vertex significantly increases runtime and memory. To alleviate this drawback, we propose a hybrid approach, fastODDS, with improved runtime and reduced memory requirements. Furthermore, fastODDS can also cope with simultaneous segmentation of multiple objects. We show the theoretical benefits of ODDS with experiments on synthetic data, and evaluate ODDS and fastODDS quantitatively on clinical image data of the mandible and the hip bones. There, we assess both the global segmentation accuracy as well as local accuracy in high curvature regions, such as the tip-shaped mandibular coronoid processes and the ridge-shaped acetabular rims of
the hip bones.
Genome-scale metabolic networks are useful tools for achieving a system-level understanding of metabolism. However, due to their large size, analysis of such networks may be difficult and algorithms can be very slow. Therefore, some authors have suggested to analyze subsystems instead of the original genome-scale models.
Flux coupling analysis (FCA) is a well-known method for detecting functionally related reactions in metabolic networks.
In this paper, we study how flux coupling relations may change if we analyze a subsystem instead of the original network. We show mathematically that a pair of fully, partially or directionally coupled reactions may be detected as uncoupled in certain subsystems. Interestingly, this behavior is the opposite of the flux coupling changes that may occur due to missing reactions, or equivalently, deletion of reactions.
Computational experiments suggest that the analysis of plastid (but not mitochondrial) subsystems may significantly influence the results of FCA. Therefore, the results of FCA for subsystems, especially plastid subsystems, should be interpreted with care.
We introduce an algorithm for
diffusion weighted magnetic resonance imaging data enhancement based on structural adaptive smoothing in both space and diffusion direction.
The method, called POAS, does not refer to a specific model for the data, like the diffusion tensor or higher order models.
It works by embedding the measurement space into a space with defined metric and group operations, in this case the Lie group of three-dimensional Euclidean motion SE(3).
Subsequently, pairwise comparisons of the values of the diffusion
weighted signal are used for adaptation.
The position-orientation adaptive smoothing preserves the edges of the observed fine and anisotropic structures.
The POAS-algorithm is designed to reduce noise directly in the diffusion weighted images and consequently also to reduce bias and
variability of quantities derived from the data for specific models.
We evaluate the algorithm on simulated and experimental data and demonstrate that it can be used to reduce the number of applied diffusion gradients and
hence acquisition time while achieving similar quality of data, or to improve the quality of data acquired in a clinically feasible scan time setting.
In recent years, substantial progress in shape analysis has been achieved through methods that use the spectra and eigenfunctions of discrete Laplace operators. In this work, we study spectra and eigenfunctions of discrete differential operators that can serve as an alternative to discrete Laplacians for applications in shape analysis. We construct such operators as the Hessians of surface energies or deformation energies. In particular, we design a quadratic energy such that, on the one hand, its Hessian equals the Laplace operator if the surface is a part of the Euclidean plane, and, on the other hand, the Hessian eigenfunctions are sensitive to the extrinsic curvature (e.g. sharp bends) on curved
surfaces. Furthermore, we consider eigenvibrations induced by deformation energies, and we derive a closed form representation for the Hessian (at the rest state of the energy) for a general class of deformation energies. Based on these spectra and eigenmodes, we derive two shape signatures. One that measures the similarity of points on a surface, and another that can be used to identify features of surfaces.
We present a unified computational framework for matching 3d geometric objects (points, lines, surfaces, volumes) of highly varying shape. Our approach is based on the Large Deformation Diffeomorphic Metric Mapping (LDDMM) method acting on $m$-currents. After stating an optimization algorithm in the function space of admissible morph generating velocity fields, two innovative aspects in this framework are presented: First, we spatially discretize the velocity field with conforming adaptive finite elements and discuss advantages of this new approach. Secondly, we directly compute the temporal evolution of discrete $m$-current attributes. Several numerical experiments demonstrate the effectiveness of this approach.
We derive and study a dynamical model for suspensions of negatively buoyant particles on an incline. Our theoretical model includes the settling/sedimentation due to gravity as well as the resuspension of particles induced by shear-induced migration, leading to disaggregation of the dense sediment layer. Out of the three different regimes observed in the experiments, we focus on the so-called settled case, where the particles settle out of the flow, and two distinct fronts, liquid and particle, form. Using an approach relying on asymptotics, we systematically connect our dynamic model with the previously developed equilibrium theory for particle-laden flows. We show that the resulting transport equations for the liquid and the particles are of hyperbolic type, and study the dilute limit, for which we derive the analytic solution. We also carry out a systematic experimental study of the settled regime, focusing on the motion of the liquid and the particle fronts. Finally, we carry out numerical simulations of our transport equations. We show that the model predictions for small to moderate values of the particle volume fraction and the inclination angle of the solid substrate agree well with the experimental data.
We investigate different dynamical regimes of neuronal network in the CA3 area of the hippocampus.
The proposed neuronal circuit includes two fast- and two slowly-spiking cells which are interconnected by means of dynamical synapses. On the individual level, each neuron is modeled by FitzHugh-Nagumo equations. Three basic rhythmic patterns are observed: gamma-rhythm in which the fast neurons are uniformly spiking, theta-rhythm in which the individual spikes are separated by quiet epochs, and theta/gamma rhythm with repeated patches of spikes. We analyze the influence of asymmetry of synaptic strengths on the synchronization in the network and demonstrate that
strong asymmetry reduces the variety of available dynamical states. The model network exhibits multistability; this results in occurrence of hysteresis in dependence on the conductances of individual connections. We show that switching between different rhythmic patterns in the network
depends on the degree of synchronization between the slow cells.
Traffic in communication networks fluctuates heavily over time. Thus, to avoid capacity bottlenecks,
operators highly overestimate the traffic volume during network planning. In this paper we consider
telecommunication network design under traffic uncertainty, adapting the robust optimization approach
of Bertsimas and Sim [21]. We present three different mathematical formulations for this problem, provide valid inequalities,
study the computational implications, and evaluate the realized robustness.
To enhance the performance of the mixed-integer programming solver we derive robust cutset inequalities generalizing their deterministic counterparts. Instead of a single cutset inequality for every
network cut, we derive multiple valid inequalities by exploiting the extra variables available in the robust formulations. We show that these inequalities define facets under certain conditions and that they
completely describe a projection of the robust cutset polyhedron if the cutset consists of a single edge.
For realistic networks and live traffic measurements we compare the formulations and report on the
speed up by the valid inequalities. We study the “price of robustness” and evaluate the approach by
analyzing the real network load. The results show that the robust optimization approach has the potential
to support network planners better than present methods.