This paper presents a method for identifying image loci that can be used as a basis for object segmentation and image registration. The focus is on 1D and 2D shape loci in 3D images. This method, called marching ridges, uses generalized height ridges, oriented medialness measures and a marching cubes like algorithm to extract optimal scale-orientation cores. This algorithm can can also be used ...

This paper presents a new numerical method for solving the population balance equation using the modi ed method of characteristics. Aggregation and break-up are neglected but the density function variations in the three-dimensional space and its dependence on the external elds are accounted for. The method is an interpretation of the Lagrangian approach. Based on a pre-speci ed grid, it follows...

Introduction: Neighborhood tractography offers the potential to improve the reliability and reproducibility of automated white matter pathway extraction and associated measurements of connectivity and tract integrity. Neighborhood tractography frameworks have been proposed for local tractography methods, particularly those based on streamline, or probabilistic streamline algorithms [1,2]. In th...

An innovative 3D multi-branch tubular structure and centerline extraction method is proposed in this paper. In contrast to classical minimal path techniques that can only detect a single curve between two pre-defined initial points, this method propagates outward from only one initial seed point to detect 3D multi-branch tubular surfaces and centerlines simultaneously. First, instead of only re...

The exploration and construction of maps in unknown environments is a challenge for robotics. The proposed method is facing this problem by combining effective techniques for planning, SLAM, and a new exploration approach based on the Voronoi Fast Marching method. The final goal of the exploration task is to build a map of the environment that previously the robot did not know. The exploration ...

This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or spurious edges, triple points or inhomogeneity of object features in the proximity of the actual interface. The proposed technique requires a reliable classification for a subset of the object interiors, which is prop...

We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation algorithms are known, some of them, such as the fast marching method, are not applicable to the video segmentation problem since the front being computed does not advance monotonically. We study narrow-banding, pyramidal...

The goal of this paper is to study some numerical approximations of particular Hamilton-Jacobi-Bellman equations in dimension 1 and with possibly discontinuous initial data. We investigate two anti-diffusive numerical schemes; the first one is based on the Ultra-Bee scheme, and the second one is based on the Fast Marching Method. We prove the convergence and derive L1-error estimates for both s...

We present a simple and robust method for computing skeletons for arbitrary planar objects and centerlines for 3D objects. We augment the Fast Marching Method (FMM) widely used in level set applications 11 by computing the paramterized boundary location every pixel came from during the boundary evolution. The resulting parameter field is then thresholded to produce the skeleton branches created...