804 research outputs found
A Primal-Dual Method for Optimal Control and Trajectory Generation in High-Dimensional Systems
Presented is a method for efficient computation of the Hamilton-Jacobi (HJ)
equation for time-optimal control problems using the generalized Hopf formula.
Typically, numerical methods to solve the HJ equation rely on a discrete grid
of the solution space and exhibit exponential scaling with dimension. The
generalized Hopf formula avoids the use of grids and numerical gradients by
formulating an unconstrained convex optimization problem. The solution at each
point is completely independent, and allows a massively parallel implementation
if solutions at multiple points are desired. This work presents a primal-dual
method for efficient numeric solution and presents how the resulting optimal
trajectory can be generated directly from the solution of the Hopf formula,
without further optimization. Examples presented have execution times on the
order of milliseconds and experiments show computation scales approximately
polynomial in dimension with very small high-order coefficients.Comment: Updated references and funding sources. To appear in the proceedings
of the 2018 IEEE Conference on Control Technology and Application
A Rotating-Grid Upwind Fast Sweeping Scheme for a Class of Hamilton-Jacobi Equations
We present a fast sweeping method for a class of Hamilton-Jacobi equations
that arise from time-independent problems in optimal control theory. The basic
method in two dimensions uses a four point stencil and is extremely simple to
implement. We test our basic method against Eikonal equations in different
norms, and then suggest a general method for rotating the grid and using
additional approximations to the derivatives in different directions in order
to more accurately capture characteristic flow. We display the utility of our
method by applying it to relevant problems from engineering
Finsler Active Contours
©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TPAMI.2007.70713In this paper, we propose an image segmentation technique based on augmenting the conformal (or geodesic) active contour framework with directional information. In the isotropic case, the euclidean metric is locally multiplied by a scalar conformal factor based on image information such that the weighted length of curves lying on points of interest (typically edges) is small. The conformal factor that is chosen depends only upon position and is in this sense isotropic. Although directional information has been studied previously for other segmentation frameworks, here, we show that if one desires to add directionality in the conformal active contour framework, then one gets a well-defined minimization problem in the case that the factor defines a Finsler metric. Optimal curves may be obtained using the calculus of variations or dynamic programming-based schemes. Finally, we demonstrate the technique by extracting roads from aerial imagery, blood vessels from medical angiograms, and neural tracts from diffusion-weighted magnetic resonance imagery
Recommended from our members
Algorithms for Optimal Paths of One, Many, and an Infinite Number of Agents
In this dissertation, we provide efficient algorithms for modeling the behavior of a single agent, multiple agents, and a continuum of agents. For a single agent, we combine the modeling framework of optimal control with advances in optimization splitting in order to efficiently find optimal paths for problems in very high-dimensions, thus providing alleviation from the curse of dimensionality. For a multiple, but finite, number of agents, we take the framework of multi-agent reinforcement learning and utilize imitation learning in order to decentralize a centralized expert, thus obtaining optimal multi-agents that act in a decentralized fashion. For a continuum of agents, we take the framework of mean-field games and use two neural networks, which we train in an alternating scheme, in order to efficiently find optimal paths for high-dimensional and stochastic problems. These tools cover a wide variety of use-cases that can be immediately deployed for practical applications
Analysis and approximation of some Shape-from-Shading models for non-Lambertian surfaces
The reconstruction of a 3D object or a scene is a classical inverse problem
in Computer Vision. In the case of a single image this is called the
Shape-from-Shading (SfS) problem and it is known to be ill-posed even in a
simplified version like the vertical light source case. A huge number of works
deals with the orthographic SfS problem based on the Lambertian reflectance
model, the most common and simplest model which leads to an eikonal type
equation when the light source is on the vertical axis. In this paper we want
to study non-Lambertian models since they are more realistic and suitable
whenever one has to deal with different kind of surfaces, rough or specular. We
will present a unified mathematical formulation of some popular orthographic
non-Lambertian models, considering vertical and oblique light directions as
well as different viewer positions. These models lead to more complex
stationary nonlinear partial differential equations of Hamilton-Jacobi type
which can be regarded as the generalization of the classical eikonal equation
corresponding to the Lambertian case. However, all the equations corresponding
to the models considered here (Oren-Nayar and Phong) have a similar structure
so we can look for weak solutions to this class in the viscosity solution
framework. Via this unified approach, we are able to develop a semi-Lagrangian
approximation scheme for the Oren-Nayar and the Phong model and to prove a
general convergence result. Numerical simulations on synthetic and real images
will illustrate the effectiveness of this approach and the main features of the
scheme, also comparing the results with previous results in the literature.Comment: Accepted version to Journal of Mathematical Imaging and Vision, 57
page
- …