Curve-skeleton extraction using iterative least squares optimization

A Simple and Stable Centeredness Measure for 3D Curve Skeleton Extraction

Existing methods for extracting 3D curve skeletons mostly suffer from the difficulty of finding the center points of 3D shapes and tedious manual adjustments of the thresholds for pruning spurious branches due to the influence of shape boundary perturbations. In this article, we present a method based on medial surfaces of 3D shapes for the convenient and fast extraction of high-quality curve skeletons. Our main contribution is a simple and stable centeredness measure. It is based on simulating fire propagation via the scheme of inside-out evolution from the interior to the boundary, differentiating it from existing methods that use the scheme of outside-in evolution from the boundary to the interior. Thus, our measure is much more localized, and it can be implemented with a high degree of parallelism. In addition, we propose measures to effectively suppress the influence of details to obtain a stable measurement, and employ minimum set covers to optimize the center points to generate compact skeletons, which enables spurious branches to be effectively excluded without the tedious work of manually adjusting thresholds. Our experiments show the superiority of our method over existing methods, including its convenient generation of clean, compact and centered curve skeletons while running much faster than state-of-the-art methods.

BOTNet: Deep Learning-Based Bearings-Only Tracking Using Multiple Passive Sensors

Bearings-only target tracking is commonly used in many fields, like air or sea traffic monitoring, tracking a member in a formation, and military applications. When tracking with synchronous passive multisensor systems, each sensor provides a line-of-sight measurement. They are plugged into an iterative least squares algorithm to estimate the unknown target position vector. Instead of using iterative least squares, this paper presents a deep-learning based framework for the bearing-only target tracking process, applicable for any bearings-only target tracking task. As a data-driven method, the proposed deep-learning framework offers several advantages over the traditional iterative least squares. To demonstrate the proposed approach, a scenario of tracking an autonomous underwater vehicle approaching an underwater docking station is considered. There, several passive sensors are mounted near a docking station to enable accurate localization of an approaching autonomous underwater vehicle. Simulation results show the proposed framework obtains better accuracy compared to the iterative least squares algorithm.

Laplacian Flow Dynamics on Geometric Graphs for Anatomical Modeling of Cerebrovascular Networks

Generating computational anatomical models of cerebrovascular networks is vital for improving clinical practice and understanding brain oxygen transport. This is achieved by extracting graph-based representations based on pre-mapping of vascular structures. Recent graphing methods can provide smooth vessels trajectories and well-connected vascular topology. However, they require water-tight surface meshes as inputs. Furthermore, adding vessels radii information on their graph compartments restricts their alignment along vascular centerlines. Here, we propose a novel graphing scheme that works with relaxed input requirements and intrinsically captures vessel radii information. The proposed approach is based on deforming geometric graphs constructed within vascular boundaries. Under a laplacian optimization framework, we assign affinity weights on the initial geometry that drives its iterative contraction toward vessels centerlines. We present a mechanism to decimate graph structure at each run and a convergence criterion to stop the process. A refinement technique is then introduced to obtain final vascular models. Our implementation is available on https://github.com/Damseh/VascularGraph. We benchmarked our results with that obtained using other efficient and state-of-the-art graphing schemes, validating on both synthetic and real angiograms acquired with different imaging modalities. The experiments indicate that the proposed scheme produces the lowest geometric and topological error rates on various angiograms. Furthermore, it surpasses other techniques in providing representative models that capture all anatomical aspects of vascular structures.

Planar Visualization of Treelike Structures

We present a novel method to create planar visualizations of treelike structures (e.g., blood vessels and airway trees) where the shape of the object is well preserved, allowing for easy recognition by users familiar with the structures. Based on the extracted skeleton within the treelike object, a radial planar embedding is first obtained such that there are no self-intersections of the skeleton which would have resulted in occlusions in the final view. An optimization procedure which adjusts the angular positions of the skeleton nodes is then used to reconstruct the shape as closely as possible to the original, according to a specified view plane, which thus preserves the global geometric context of the object. Using this shape recovered embedded skeleton, the object surface is then flattened to the plane without occlusions using harmonic mapping. The boundary of the mesh is adjusted during the flattening step to account for regions where the mesh is stretched over concavities. This parameterized surface can then be used either as a map for guidance during endoluminal navigation or directly for interrogation and decision making. Depth cues are provided with a grayscale border to aid in shape understanding. Examples are presented using bronchial trees, cranial and lower limb blood vessels, and upper aorta datasets, and the results are evaluated quantitatively and with a user study.

Context preserving maps of tubular structures

When visualizing tubular 3D structures, external representations are often used for guidance and display, and such views in 2D can often contain occlusions. Virtual dissection methods have been proposed where the entire 3D structure can be mapped to the 2D plane, though these will lose context by straightening curved sections. We present a new method of creating maps of 3D tubular structures that yield a succinct view while preserving the overall geometric structure. Given a dominant view plane for the structure, its curve skeleton is first projected to a 2D skeleton. This 2D skeleton is adjusted to account for distortions in length, modified to remove intersections, and optimized to preserve the shape of the original 3D skeleton. Based on this shaped 2D skeleton, a boundary for the map of the object is obtained based on a slicing path through the structure and the radius around the skeleton. The sliced structure is conformally mapped to a rectangle and then deformed via harmonic mapping to match the boundary placement. This flattened map preserves the general geometric context of a 3D object in a 2D display, and rendering of this flattened map can be accomplished using volumetric ray casting. We have evaluated our method on real datasets of human colon models.

Frankenrigs: building character rigs from multiple sources

We present a new rigging and skinning method which uses a database of partial rigs extracted from a set of source characters. Given a target mesh and a set of joint locations, our system can automatically scan through the database to find the best-fitting body parts, tailor them to match the target mesh, and transfer their skinning information onto the new character. For the cases where our automatic procedure fails, we provide an intuitive set of tools to fix the problems. When used fully automatically, the system can generate results of much higher quality than a standard smooth bind, and with some user interaction, it can create rigs approaching the quality of artist-created manual rigs in a small fraction of the time.

Template-based 3D model fitting using dual-domain relaxation

We introduce a template fitting method for 3D surface meshes. A given template mesh is deformed to closely approximate the input 3D geometry. The connectivity of the deformed template model is automatically adjusted to facilitate the geometric fitting and to ascertain high quality of the mesh elements. The template fitting process utilizes a specially tailored Laplacian processing framework, where in the first, coarse fitting stage we approximate the input geometry with a linearized biharmonic surface (a variant of LS-mesh), and then the fine geometric detail is fitted further using iterative Laplacian editing with reliable correspondence constraints and a local surface flattening mechanism to avoid foldovers. The latter step is performed in the dual mesh domain, which is shown to encourage near-equilateral mesh elements and significantly reduces the occurrence of triangle foldovers, a well-known problem in mesh fitting. To experimentally evaluate our approach, we compare our method with relevant state-of-the-art techniques and confirm significant improvements of results. In addition, we demonstrate the usefulness of our approach to the application of consistent surface parameterization (also known as cross-parameterization).

LOCAL ORTHOGONAL CUTTING METHOD FOR COMPUTING MEDIAL CURVES AND ITS BIOMEDICAL APPLICATIONS

Medial curves have a wide range of applications in geometric modeling and analysis (such as shape matching) and biomedical engineering (such as morphometry and computer assisted surgery). The computation of medial curves poses significant challenges, both in terms of theoretical analysis and practical efficiency and reliability. In this paper, we propose a definition and analysis of medial curves and also describe an efficient and robust method called local orthogonal cutting (LOC) for computing medial curves. Our approach is based on three key concepts: a local orthogonal decomposition of objects into substructures, a differential geometry concept called the interior center of curvature (ICC), and integrated stability and consistency tests. These concepts lend themselves to robust numerical techniques and result in an algorithm that is efficient and noise resistant. We illustrate the effectiveness and robustness of our approach with some highly complex, large-scale, noisy biomedical geometries derived from medical images, including lung airways and blood vessels. We also present comparisons of our method with some existing methods.