A Second Order Multi-Stencil Fast Marching Method with a Non-Constant Local Cost Model

Computing thickness of irregularly-shaped thin walls using a locally semi-implicit scheme with extrapolation to solve the Laplace equation: Application to the right ventricle

Cardiac Magnetic Resonance (CMR) Imaging is currently considered the gold standard imaging modality in cardiology. However, it is accompanied by a tradeoff between spatial resolution and acquisition time. Providing accurate measures of thin walls relative to the image resolution may prove challenging. One such anatomical structure is the cardiac right ventricle. Methods for measuring thickness of wall-like anatomical structures often rely on the Laplace equation to provide point-to-point correspondences between both boundaries. This work presents limex, a novel method to solve the Laplace equation using ghost nodes and providing extrapolated values, which is tested on three different datasets: a mathematical phantom, a set of biventricular segmentations from CMR images of ten pigs and the database used at the RV Segmentation Challenge held at MICCAI'12. Thickness measurements using the proposed methodology are more accurate than state-of-the-art methods, especially with the coarsest image resolutions, yielding mean L1 norms of the error between 43.28% and 86.52% lower than the second-best methods on the different test datasets. It is also computationally affordable. Limex has outperformed other state-of-the-art methods in classifying RV myocardial segments by their thickness.

Wavefront Marching Methods: A Unified Algorithm to Solve Eikonal and Static Hamilton-Jacobi Equations

This paper presents a unified propagation method for dealing with both the classic Eikonal equation, where the motion direction does not affect the propagation, and the more general static Hamilton-Jacobi equations, where it does. While classic Fast Marching Method (FMM) techniques achieve the solution to the Eikonal equation with a O(M log M) (or O(M) assuming some modifications), solving the more general static Hamilton-Jacobi equation requires a higher complexity. The proposed framework maintains the O(M log M) complexity for both problems, while achieving higher accuracy than available state-of-the-art. The key idea behind the proposed method is the creation of 'mini wave-fronts', where the solution is interpolated to minimize the discretization error. Experimental results show how our algorithm can outperform the state-of-the-art both in precision and computational cost.