Search PubMed⌕ Search

Biomedical subjects

N Khaneja

Publications and source records attributed to N Khaneja.

2 recordsLinked to original sources

Curve matching on brain surfaces using Frenet distances.

This paper describes methods for diffeomorphic matching of curves on brain surfaces. Distances between curves are defined by Frenet representation via speed, curvature, and torsion. The curvematching algorithm is based on bipartite graph matching, with weights defined by the Frenet distance over diffeomorphic maps of one curve onto the other (Sedgewick [1983]: Algorithms). We follow Khaneja ([1996]: Statistics and Geometry of Cortical Features) and define fundus curves on the brain surfaces as extremal curvature lines generated using dynamic programming. Examples are shown for fundus curve matchings on macaque brain surfaces.

Algorithms↗

Statistical methods in computational anatomy.

This paper reviews recent developments by the Washington/Brown groups for the study of anatomical shape in the emerging new discipline of computational anatomy. Parametric representations of anatomical variation for computational anatomy are reviewed, restricted to the assumption of small deformations. The generation of covariance operators for probabilistic measures of anatomical variation on coordinatized submanifolds is formulated as an empirical procedure. Populations of brains are mapped to common coordinate systems, from which template coordinate systems are constructed which are closest to the population of anatomies in a minimum distance sense. Variation of several one-, two- and three-dimensional manifolds, i.e. sulci, surfaces and brain volumes are examined via Gaussian measures with mean and covariances estimated directly from maps of templates to targets. Methods are presented for estimating the covariances of vector fields from a family of empirically generated maps, posed as generalized spectrum estimation indexed over the submanifolds. Covariance estimation is made parametric, analogous to autoregressive modelling, by introducing small deformation linear operators for constraining the spectrum of the fields.

Algorithms↗