A Geometric Method for Automatic Extraction of Sulcal Fundi

Sulcal fundi are 3-D curves that lie in the depths of the cerebral cortex and, in addition to their intrinsic value in brain research, are often used as landmarks for downstream computations in brain imaging. In this paper, we present a geometric algorithm that automatically extracts the sulcal fundi from magnetic resonance images and represents them as spline curves lying on the extracted triangular mesh representing the cortical surface. The input to our algorithm is a triangular mesh representation of an extracted cortical surface as computed by one of several available software packages for performing automated and semi-automated cortical surface extraction. Given this input we first compute a geometric depth measure for each triangle on the cortical surface mesh, and based on this information we extract sulcal regions by checking for connected regions exceeding a depth threshold. We then identify endpoints of each region and delineate the fundus by thinning the connected region while keeping the endpoints fixed. The curves, thus, defined are regularized using weighted splines on the surface mesh to yield high-quality representations of the sulcal fundi. We present the geometric framework and validate it with real data from human brains. Comparisons with expert-labeled sulcal fundi are part of this validation process

[1]  Pierre Hellier,et al.  Coupling dense and landmark-based approaches for nonrigid registration , 2003, IEEE Transactions on Medical Imaging.

[2]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[3]  D. Louis Collins,et al.  Automated extraction and variability analysis of sulcal neuroanatomy , 1999, IEEE Transactions on Medical Imaging.

[4]  J. Mazziotta,et al.  Age‐related morphology trends of cortical sulci , 2005, Human brain mapping.

[5]  Stanley Osher,et al.  Fast Sweeping Algorithms for a Class of Hamilton-Jacobi Equations , 2003, SIAM J. Numer. Anal..

[6]  Y. Samson,et al.  "Sulcal root" generic model: a hypothesis to overcome the variability of the human cortex folding patterns. , 2005, Neurologia medico-chirurgica.

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[9]  Jonas Larsson,et al.  Imaging vision : Functional mapping of intermediate visual processes in man , 2001 .

[10]  H. Pottmann,et al.  Energy-minimizing splines in manifolds , 2004, SIGGRAPH 2004.

[11]  Michael I. Miller,et al.  Dynamic Programming Generation of Curves on Brain Surfaces , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  D. Louis Collins,et al.  Non-linear Cerebral Registration with Sulcal Constraints , 1998, MICCAI.

[13]  M. Miller,et al.  Landmark Matching via Large Deformation Diffeomorphisms on the Sphere , 2004 .

[14]  F. Mémoli,et al.  Implicit brain imaging , 2004, NeuroImage.

[15]  Paul M. Thompson,et al.  A surface-based technique for warping three-dimensional images of the brain , 1996, IEEE Trans. Medical Imaging.

[16]  Markus H. Gross,et al.  Signed distance transform using graphics hardware , 2003, IEEE Visualization, 2003. VIS 2003..

[17]  S. Mauch.  A Fast Algorithm for Computing the Closest Point and Distance Transform , 2000 .

[18]  Stephen M Smith,et al.  Fast robust automated brain extraction , 2002, Human brain mapping.

[19]  Lok Ming Lui,et al.  Automatic landmark tracking applied to optimize brain conformal mapping , 2006, 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, 2006..

[20]  Kiralee M. Hayashi,et al.  Mapping cortical change in Alzheimer's disease, brain development, and schizophrenia , 2004, NeuroImage.

[21]  David Levin,et al.  The approximation power of moving least-squares , 1998, Math. Comput..

[22]  Arthur W. Toga,et al.  Impact of acquisition protocols and processing streams on tissue segmentation of T1 weighted MR images , 2006, NeuroImage.

[23]  E. Duchesnay,et al.  A framework to study the cortical folding patterns , 2004, NeuroImage.

[24]  Jerry L Prince,et al.  Automated Sulcal Segmentation Using Watersheds on the Cortical Surface , 2002, NeuroImage.

[25]  Anders M. Dale,et al.  Cortical Surface-Based Analysis I. Segmentation and Surface Reconstruction , 1999, NeuroImage.

[26]  A. Toga,et al.  A SURFACE-BASED TECHNIQUE FOR WARPING 3-DIMENSIONAL IMAGES OF THE BRAIN , 2000 .

[27]  Xiao Han,et al.  Statistical Study on Cortical Sulci of Human Brains , 2001, IPMI.

[28]  Christos Davatzikos,et al.  Hierarchical Matching of Cortical Features for Deformable Brain Image Registration , 1999, IPMI.

[29]  Jerry L. Prince,et al.  An automated method for finding curves of sulcal fundi on human cortical surfaces , 2004, 2004 2nd IEEE International Symposium on Biomedical Imaging: Nano to Macro (IEEE Cat No. 04EX821).

[30]  Stanley Osher,et al.  Fast Sweeping Methods for Static Hamilton-Jacobi Equations , 2004, SIAM J. Numer. Anal..

[31]  Guillermo Sapiro,et al.  A geometric method for automatic extraction of sulcal fundi , 2006, 3rd IEEE International Symposium on Biomedical Imaging: Nano to Macro, 2006..

[32]  Xiao Han,et al.  CRUISE: Cortical reconstruction using implicit surface evolution , 2004, NeuroImage.

[33]  Gabriele Lohmann,et al.  Extracting line representations of sulcal and gyral patterns in MR images of the human brain , 1998, IEEE Transactions on Medical Imaging.

[34]  A Bartesaghi,et al.  A system for the generation of curves on 3D brain images , 2001, Human brain mapping.

[35]  Isabelle Bloch,et al.  A primal sketch of the cortex mean curvature: a morphogenesis based approach to study the variability of the folding patterns , 2003, IEEE Transactions on Medical Imaging.

[36]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[37]  Michel Desvignes,et al.  3D curves tracking and its application to cortical sulci detection , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).