Related papers: The problem of optimal camouflaging
Execution monitoring is essential for robots to detect and respond to failures. Since it is impossible to enumerate all failures for a given task, we learn from successful executions of the task to detect visual anomalies during runtime.…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
We have established previously, in a lead-in study, that the spreading of liquids in particulate porous media at low saturation levels, characteristically less than 10% of the void space, has very distinctive features in comparison to that…
We develop an index theory for parabolic and collision solutions to the classical n-body problem and we prove sufficient conditions for the finiteness of the spectral index valid in a large class of trajectories ending with a total collapse…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
The Vlasov-Poisson systems of equations (VP) describes the evolution of a distribution of collisionless particles under the effect of a collective-field potential. VP is at the basis of the study of the gravitational instability of…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
This article belongs to the area of geometric tomography, which is the study of geometric properties of solids based on data about their sections and projections. We describe a new direction in geometric tomography where different…
The problem of imaging of a moving target is formulated as a Coefficient Inverse Problem for a hyperbolic equation with its coefficient depending on all three spatial variables and time. As the initial condition, the point source running…
A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…
In this work a simple problem on 2D optimal shape for body immersed in a viscous flow is analyzed. The body has geometrical constraints and its profile would be found in the class of cubics which satisfy those conditions. The optimal…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
When an optical beam propagates through a turbulent medium such as the atmosphere or ocean, the beam will become distorted. It is then natural to seek the best or optimal beam that is distorted least, under some metric such as intensity or…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
The mixed Christoffel-Minkowski problem asks for necessary and sufficient conditions for a Borel measure on the Euclidean unit sphere to be the mixed area measure of some convex bodies, one of which, appearing multiple times, is free and…
We investigate an inverse scattering problem for a thin inhomogeneous scatterer in R^m, m = 2,3, which we model as a m-1 dimensional open surface. The scatterer is referred to as a screen. The goal is to design target signatures that are…
We consider the problem of selecting an optimal mask for an image manifold, i.e., choosing a subset of the pixels of the image that preserves the manifold's geometric structure present in the original data. Such masking implements a form of…
In this paper we address the uncertainty issues involved in the low-level vision task of image segmentation. Researchers in computer vision have worked extensively on this problem, in which the goal is to partition (or segment) an image…
Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…
Imagine a polygon-shaped platform $P$ and only one static spotlight outside $P$; which direction should the spotlight face to light most of $P$? This problem occurs in maximising the visibility, as well as in limiting the uncertainty in…