Related papers: Dynamic Discrete Tomography
Over nearly two decades, Differential Dynamic Microscopy (DDM) has become a standard technique for extracting dynamic correlation functions from time-lapse microscopy data, with applications spanning colloidal suspensions, polymer…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
The choice of data representation is a key factor in the success of deep learning in geometric tasks. For instance, DUSt3R recently introduced the concept of viewpoint-invariant point maps, generalizing depth prediction and showing that all…
Single cell responses are shaped by the geometry of signaling kinetic trajectories carved in a multidimensional space spanned by signaling protein abundances. It is however challenging to assay large number (>3) of signaling species in…
Methods to extract information from the tracking of mobile objects/particles have broad interest in biological and physical sciences. Techniques based on simple criteria of proximity in time-consecutive snapshots are useful to identify the…
A dynamical system with discrete time is studied by means of algebraic geometry. The system admits a reduction that is interpreted as a classical field theory in 2+1-dimensional wholly discrete space-time. The integrals of motion of a…
This review summarizes recent progress in investigating polymer systems by using Differential dynamic microscopy (DDM), a rapidly emerging approach that transforms a commercial microscope by combining real-space information with the…
This work recasts time-dependent optimal control problems governed by partial differential equations in a Dynamic Mode Decomposition with control framework. Indeed, since the numerical solution of such problems requires a lot of…
In this paper, we study the mathematical imaging problem of optical diffraction tomography (ODT) for the scenario of a microscopic rigid particle rotating in a trap created, for instance, by acoustic or optical forces. Under the influence…
Optical images of transparent three-dimensional objects can be different from a replica of the object's cross section in the image plane due to refraction at the surface or in the body of the object. Simulations of the object's image are…
Small target detection is inherently challenging due to the minimal size, lack of distinctive features, and the presence of complex backgrounds. Heavy noise further complicates the task by both obscuring and imitating the target appearance.…
Advanced algorithms are necessary to obtain faster-than-real-time dynamic simulations in a number of different physical problems that are characterized by widely disparate time scales. Recent advanced dynamic Monte Carlo algorithms that…
We present a novel approach for the reconstruction of dynamic geometric shapes using a single hand-held consumer-grade RGB-D sensor at real-time rates. Our method does not require a pre-defined shape template to start with and builds up the…
Particle methods are less computationally efficient than grid based numerical solution of the Navier Stokes equation. However, they have important advantages including rigorous mass conservation, momentum conservation and isotropy. In…
Infinite dimensional moment problems have a long history in diverse applied areas dealing with the analysis of complex systems but progress is hindered by the lack of a general understanding of the mathematical structure behind them.…
The Discrete Dislocation (DD) analysis and its computional modeling have been advanced significantly over the past decade. This progress has been further magnified by the idea to couple DD with continuum mechanics analysis in association…
A common sensing problem is to use a set of stationary tracking locations to monitor a collection of moving devices: Given $n$ objects that need to be tracked, each following its own trajectory, and $m$ stationary traffic control stations,…
The paper focuses on composite multistage decision making problems which are targeted to design a route/trajectory from an initial decision situation (origin) to goal (destination) decision situation(s). Automobile routing problem is…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the…