PubMed Health⌕ Search

Biomedical subjects

Dmitri Bitouk

Publications and source records attributed to Dmitri Bitouk.

2 recordsLinked to original sources

Smooth functional and structural maps on the neocortex via orthonormal bases of the Laplace-Beltrami operator.

Functional and structural maps, such as a curvature, cortical thickness, and functional magnetic resonance imaging (MRI) maps, indexed over the local coordinates of the cortical manifold play an important role in neuropsychiatric studies. Due to the highly convoluted nature of the cerebral cortex and image quality, these functions are generally uninterpretable without proper methods of association and smoothness onto the local coordinate system. In this paper, we generalized the spline smoothing problem (Wahba, 1990) from a sphere to any arbitrary two-dimensional (2-D) manifold with boundaries. We first seek a numerical solution to orthonormal basis functions of the Laplace-Beltrami (LB) operator with Neumann boundary conditions for a 2-D manifold M then solve the spline smoothing problem in a reproducing kernel Hilbert space (r.k.h.s.) of real-valued functions on manifold M with kernel constructed from the basis functions. The explicit discrete LB representation is derived using the finite element method calculated directly on the manifold coordinates so that finding discrete LB orthonormal basis functions is equivalent to solving an algebraic eigenvalue problem. And then smoothed functions in r.k.h.s can be represented as a linear combination of the basis functions. We demonstrate numerical solutions of spherical harmonics on a unit sphere and brain orthonormal basis functions on a planum temporale manifold. Then synthetic data is used to quantify the goodness of the smoothness compared with the ground truth and discuss how many basis functions should be incorporated in the smoothing. We present applications of our approach to smoothing sulcal mean curvature, cortical thickness, and functional statistical maps on submanifolds of the neocortex.

Algorithms↗

Clutter invariant ATR.

One of the central problems in Automated Target Recognition is to accommodate the infinite variety of clutter in real military environments. The principle focus of our paper is on the construction of metric spaces where the metric measures the distance between objects of interest invariant to the infinite variety of clutter. Such metrics are formulated using second-order random field models. Our results indicate that this approach significantly improves detection/classification rates of targets in clutter.

Algorithms↗