42 research outputs found
Path planning methods for AUVs
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 75-81).From naval operations to ocean science missions, the importance of autonomous vehicles is increasing with the advances in underwater robotics technology. Due to the dynamic and intermittent underwater environment and the physical limitations of autonomous underwater vehicles, feasible and optimal path planning is crucial for autonomous underwater operations. The objective of this thesis is to develop and demonstrate an efficient underwater path planning algorithm based on the level set method. Specifically, the goal is to compute the paths of autonomous vehicles which minimize travel time in the presence of ocean currents. The approach is to either utilize or avoid any type of ocean flows, while allowing for currents that are much larger than the nominal vehicle speed and for three-dimensional currents which vary with time. Existing path planning methods for the fields of ocean science and robotics are first reviewed, and the advantages and disadvantages of each are discussed. The underpinnings of the level set and fast marching methods are then reviewed, including their new extension and application to underwater path planning. Finally, a new feasible and optimal time-dependent underwater path planning algorithm is derived and presented. In order to demonstrate the capabilities of the algorithm, a set of idealized test-cases of increasing complexity are first presented and discussed. A real three-dimensional path planning example, involving strong current conditions, is also illustrated. This example utilizes four-dimensional ocean flows from a realistic ocean prediction system which simulate the ocean response to the passage of a tropical storm in the Middle Atlantic Bight region.by Konuralp Yiğit.S.M
Recommended from our members
State of the Art of Level Set Methods in Segmentation and Registration of Medical Imaging Modalities
Segmentation of medical images is an important step in various applications such as visualization, quantitative analysis and image-guided surgery. Numerous segmentation methods have been developed in the past two decades for extraction of organ contours on medical images. Low-level segmentation methods, such as pixel-based clustering, region growing, and filter-based edge detection, require additional pre-processing and post-processing as well as considerable amounts of expert intervention or information of the objects of interest. Furthermore the subsequent analysis of segmented objects is hampered by the primitive, pixel or voxel level representations from those region-based segmentation. Deformable models, on the other hand, provide an explicit representation of the boundary and the shape of the object. They combine several desirable features such as inherent connectivity and smoothness, which counteract noise and boundary irregularities, as well as the ability to incorporate knowledge about the object of interest. However, parametric deformable models have two main limitations. First, in situations where the initial model and desired object boundary differ greatly in size and shape, the model must be re-parameterized dynamically to faithfully recover the object boundary. The second limitation is that it has difficulty dealing with topological adaptation such as splitting or merging model parts, a useful property for recovering either multiple objects or objects with unknown topology. This difficulty is caused by the fact that a new parameterization must be constructed whenever topology change occurs, which requires sophisticated schemes. Level set deformable models, also referred to as geometric deformable models, provide an elegant solution to address the primary limitations of parametric deformable models. These methods have drawn a great deal of attention since their introduction in 1988. Advantages of the contour implicit formulation of the deformable model over parametric formulation include: (1) no parameterization of the contour, (2) topological flexibility, (3) good numerical stability, (4) straightforward extension of the 2D formulation to n-D. Recent reviews on the subject include papers from Suri. In this chapter we give a general overview of the level set segmentation methods with emphasize on new frameworks recently introduced in the context of medical imaging problems. We then introduce novel approaches that aim at combining segmentation and registration in a level set formulation. Finally we review a selective set of clinical works with detailed validation of the level set methods for several clinical applications
Computerized Analysis of Magnetic Resonance Images to Study Cerebral Anatomy in Developing Neonates
The study of cerebral anatomy in developing neonates is of great importance for
the understanding of brain development during the early period of life. This
dissertation therefore focuses on three challenges in the modelling of cerebral
anatomy in neonates during brain development. The methods that have been
developed all use Magnetic Resonance Images (MRI) as source data.
To facilitate study of vascular development in the neonatal period, a set of image
analysis algorithms are developed to automatically extract and model cerebral
vessel trees. The whole process consists of cerebral vessel tracking from
automatically placed seed points, vessel tree generation, and vasculature
registration and matching. These algorithms have been tested on clinical Time-of-
Flight (TOF) MR angiographic datasets.
To facilitate study of the neonatal cortex a complete cerebral cortex segmentation
and reconstruction pipeline has been developed. Segmentation of the neonatal
cortex is not effectively done by existing algorithms designed for the adult brain
because the contrast between grey and white matter is reversed. This causes pixels
containing tissue mixtures to be incorrectly labelled by conventional methods. The
neonatal cortical segmentation method that has been developed is based on a novel
expectation-maximization (EM) method with explicit correction for mislabelled
partial volume voxels. Based on the resulting cortical segmentation, an implicit
surface evolution technique is adopted for the reconstruction of the cortex in
neonates. The performance of the method is investigated by performing a detailed
landmark study.
To facilitate study of cortical development, a cortical surface registration algorithm
for aligning the cortical surface is developed. The method first inflates extracted
cortical surfaces and then performs a non-rigid surface registration using free-form
deformations (FFDs) to remove residual alignment. Validation experiments using
data labelled by an expert observer demonstrate that the method can capture local
changes and follow the growth of specific sulcus
Variational methods for shape and image registrations.
Estimating and analysis of deformation, either rigid or non-rigid, is an active area of research in various medical imaging and computer vision applications. Its importance stems from the inherent inter- and intra-variability in biological and biomedical object shapes and from the dynamic nature of the scenes usually dealt with in computer vision research. For instance, quantifying the growth of a tumor, recognizing a person\u27s face, tracking a facial expression, or retrieving an object inside a data base require the estimation of some sort of motion or deformation undergone by the object of interest. To solve these problems, and other similar problems, registration comes into play. This is the process of bringing into correspondences two or more data sets. Depending on the application at hand, these data sets can be for instance gray scale/color images or objects\u27 outlines. In the latter case, one talks about shape registration while in the former case, one talks about image/volume registration. In some situations, the combinations of different types of data can be used complementarily to establish point correspondences. One of most important image analysis tools that greatly benefits from the process of registration, and which will be addressed in this dissertation, is the image segmentation. This process consists of localizing objects in images. Several challenges are encountered in image segmentation, including noise, gray scale inhomogeneities, and occlusions. To cope with such issues, the shape information is often incorporated as a statistical model into the segmentation process. Building such statistical models requires a good and accurate shape alignment approach. In addition, segmenting anatomical structures can be accurately solved through the registration of the input data set with a predefined anatomical atlas. Variational approaches for shape/image registration and segmentation have received huge interest in the past few years. Unlike traditional discrete approaches, the variational methods are based on continuous modelling of the input data through the use of Partial Differential Equations (PDE). This brings into benefit the extensive literature on theory and numerical methods proposed to solve PDEs. This dissertation addresses the registration problem from a variational point of view, with more focus on shape registration. First, a novel variational framework for global-to-local shape registration is proposed. The input shapes are implicitly represented through their signed distance maps. A new Sumof- Squared-Differences (SSD) criterion which measures the disparity between the implicit representations of the input shapes, is introduced to recover the global alignment parameters. This new criteria has the advantages over some existing ones in accurately handling scale variations. In addition, the proposed alignment model is less expensive computationally. Complementary to the global registration field, the local deformation field is explicitly established between the two globally aligned shapes, by minimizing a new energy functional. This functional incrementally and simultaneously updates the displacement field while keeping the corresponding implicit representation of the globally warped source shape as close to a signed distance function as possible. This is done under some regularization constraints that enforce the smoothness of the recovered deformations. The overall process leads to a set of coupled set of equations that are simultaneously solved through a gradient descent scheme. Several applications, where the developed tools play a major role, are addressed throughout this dissertation. For instance, some insight is given as to how one can solve the challenging problem of three dimensional face recognition in the presence of facial expressions. Statistical modelling of shapes will be presented as a way of benefiting from the proposed shape registration framework. Second, this dissertation will visit th
Path planning in time dependent flows using level set methods
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2012.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (p. 167-177).Autonomous underwater vehicles such as gliders have emerged as valuable scientific platforms due to their increasing uses in several oceanic applications, ranging from security, acoustic surveillance and military reconnaissance to collection of ocean data at specific locations for ocean prediction, monitoring and dynamics investigation. Gliders exhibit high levels of autonomy and are ideal for long range missions. As these gliders become more reliable and affordable, multi-vehicle coordination and sampling missions are expected to become very common in the near future. This endurance of gliders however, comes at an expense of being susceptible to typical coastal ocean currents. Due to the physical limitations of underwater vehicles and the highly dynamic nature of the coastal ocean, path planning to generate safe and fast vehicle trajectories becomes crucial for their successful operation. As a result, our motivation in this thesis is to develop a computationally efficient and rigorous methodology that can predict the time-optimal paths of underwater vehicles navigating in continuous, strong and dynamic ow-fields. The goal is to predict a sequence of steering directions so that vehicles can best utilize or avoid ow currents to minimize their travel time. In this thesis, we fist review existing path planning methods and discuss their advantages and drawbacks. Then, we discuss the theory of level set methods and their utility in solving front tracking problems. Then, we present a rigorous (partial differential equation based) methodology based on the level set method, which can compute time-optimal paths of swarms of underwater vehicles, obviating the need for any heuristic control based approaches. We state and prove a theorem, along with several corollaries, that forms the foundation of our approach for path planning. We show that our algorithm is computationally efficient - the computational cost grows linearly with the number of vehicles and geometrically with spatial directions. We illustrate the working and capabilities of our path planning algorithm by means of a number of applications. First, we validate our approach through simple benchmark applications, and later apply our methodology to more complex, realistic and numerically simulated ow-fields, which include eddies, jets, obstacles and forbidden regions. Finally, we extend our methodology to solve problems of coordinated motion of multiple vehicles in strong dynamic ow-fields. Here, coordination refers to maintenance of specific geometric patterns by the vehicles. The level-set based control scheme that we derive is shown to provide substantial advantages to a local control approach. Specifically, the illustrations show that the resulting coordinated vehicle motions can maintain specific patterns in dynamic flow fields with strong and complex spatial gradients.by Sri Venkata Tapovan Lolla.S.M
Cortical Surface Reconstruction from High-Resolution MR Brain Images
Reconstruction of the cerebral cortex from magnetic resonance (MR) images
is an important step in quantitative analysis of the human brain structure, for example, in sulcal morphometry and in studies of cortical thickness. Existing cortical reconstruction approaches are typically optimized for standard resolution (~1 mm) data and are not directly applicable to higher resolution images. A new PDE-based method is presented for the automated cortical reconstruction that is computationally efficient and scales well with grid resolution, and thus is particularly suitable for high-resolution MR images with submillimeter voxel size. The method uses a mathematical model of a field in an inhomogeneous dielectric. This field mapping, similarly to a Laplacian mapping, has nice laminar properties in the cortical layer, and helps to identify the unresolved boundaries between cortical banks in narrow sulci. The pial cortical surface is reconstructed by advection along the field gradient as a geometric deformable model constrained by topology-preserving level set approach. The method's performance is illustrated on exvivo images with 0.25–0.35 mm isotropic voxels. The method is further evaluated by cross-comparison with results of the FreeSurfer software on standard resolution data sets from the OASIS database featuring pairs of repeated scans for 20 healthy young subjects
Recommended from our members
Some free boundary problems in potential flow regime usinga based level set method
Recent advances in the field of fluid mechanics with moving fronts are linked to the use of Level Set Methods, a versatile mathematical technique to follow free boundaries which undergo topological changes. A challenging class of problems in this context are those related to the solution of a partial differential equation posed on a moving domain, in which the boundary condition for the PDE solver has to be obtained from a partial differential equation defined on the front. This is the case of potential flow models with moving boundaries. Moreover the fluid front will possibly be carrying some material substance which will diffuse in the front and be advected by the front velocity, as for example the use of surfactants to lower surface tension. We present a Level Set based methodology to embed this partial differential equations defined on the front in a complete Eulerian framework, fully avoiding the tracking of fluid particles and its known limitations. To show the advantages of this approach in the field of Fluid Mechanics we present in this work one particular application: the numerical approximation of a potential flow model to simulate the evolution and breaking of a solitary wave propagating over a slopping bottom and compare the level set based algorithm with previous front tracking models
Deformable meshes for shape recovery: models and applications
With the advance of scanning and imaging technology, more and more 3D objects become available. Among them, deformable objects have gained increasing interests. They include medical instances such as organs, a sequence of objects in motion, and objects of similar shapes where a meaningful correspondence can be established between each other. Thus, it requires tools to store, compare, and retrieve them. Many of these operations depend on successful shape recovery. Shape recovery is the task to retrieve an object from the environment where its geometry is hidden or implicitly known. As a simple and versatile tool, mesh is widely used in computer graphics for modelling and visualization. In particular, deformable meshes are meshes which can take the deformation of deformable objects. They extend the modelling ability of meshes. This dissertation focuses on using deformable meshes to approach the 3D shape recovery problem.
Several models are presented to solve the challenges for shape recovery under different circumstances. When the object is hidden in an image, a PDE deformable model is designed to extract its surface shape. The algorithm uses a mesh representation so that it can model any non-smooth surface with an arbitrary precision compared to a parametric model. It is more computational efficient than a level-set approach. When the explicit geometry of the object is known but is hidden in a bank of shapes, we simplify the deformation of the model to a graph matching procedure through a hierarchical surface abstraction approach. The framework is used for shape matching and retrieval. This idea is further extended to retain the explicit geometry during the abstraction. A novel motion abstraction framework for deformable meshes is devised based on clustering of local transformations and is successfully applied to 3D motion compression
Multiobjective and Level Set Methods for Reservoir Characterization and Optimization
Proper management of oil and gas reservoirs as dynamic systems reduces operational expenditures, alleviates uncertainty, and increases hydrocarbon recovery. In this dissertation, we focus on two issues in reservoir management: multiobjective integration and channelized reservoir calibration. Multiple objectives, including bottom-hole pressure (BHP), water cut, and 4-D seismic data, are utilized in model ranking, history matching, and production optimization. These objectives may conflict, as they represent characteristics coming from different measurements and sources, and, significantly, of varying scales. A traditional weighted-sum method may reduce the solution space, often leading to loss of key information for each objective. Thus, how to integrate multiple objectives effectively becomes critical in reservoir management. This dissertation presents a Pareto-based approach to characterize multiobjective and potentially conflicting features and to capture geologic uncertainty, preserving the original objective space and avoiding weights determination as in the weight-sum method. For channelized reservoirs, identification of the channel geometry and facies boundaries, as well as characterization of channel petrophysical properties are critical for performance predictions. Traditional history matching methods, however, are unable to preserve the channel geometry. We propose a level set based method, integrated with seismic constraint and coupled with the Grid Connectivity Transform (GCT) for channelized reservoirs calibration.
We first develop the Pareto-based model ranking (PBMR) to rank multiple realizations, taking into consideration seismic and production data. We demonstrate that this approach can be applied to select multiple competitive realizations compared with the weighted-sum method, and uncertainty range of each objective can be effectively addressed.
Next, we extend the Pareto-based framework to full-field history matching and production optimization of the Norne Field in the North Sea. A hierarchical history matching workflow including global and local updates helps to capture the large- and fine-scale heterogeneity. A two-step polymer flood optimization consisting of the streamline-based rate optimization and the Pareto-based polymer optimization is shown to be beneficial for reducing the impact of heterogeneity and increasing production improvement as well as NPV.
Finally, we propose a two-step history matching workflow for facies and property calibration of the channelized reservoirs, where the channel geometry is modeled using the level set method, and smaller scale heterogeneity is modeled using the GCT. Moreover, the seismic constraints incorporated into the level set improves facies model calibration