Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0805.3835

The Use of Labeled Cortical Distance Maps for Quantization and Analysis of Anatomical Morphometry of Brain Tissues

E. Ceyhan·M. Hosakere·T. Nishino·J. Alexopoulos·R. D. Todd·K. N. Botteron·M. I. Miller·J. T. Ratnanather
View original source ↗Read source document ↗Export metadata ↓

Abstract

Anatomical shape differences in cortical structures in the brain can be associated with various neuropsychiatric and neuro-developmental diseases or disorders. Labeled Cortical Distance Map (LCDM), can be a powerful tool to quantize such morphometric differences. In this article, we investigate various issues regarding the analysis of LCDM distances in relation to morphometry. The length of the LCDM distance vector provides the number of voxels (approximately a multiple of volume (in mm^3)); median, mode, range, and variance of LCDM distances are all suggestive of size, thickness, and shape differences. However these measures provide a crude summary based on LCDM distances which may convey much more information about the tissue in question. To utilize more of this information, we pool (merge) the LCDM distances from subjects in the same group or condition. The statistical methodology we employ require normality and within and between sample independence. We demonstrate that the violation of these assumptions have mild influence on the tests. We specify the types of alternatives the parametric and nonparametric tests are more sensitive for. We also show that the pooled LCDM distances provide powerful results for group differences in distribution, left-right morphometric asymmetry of the tissues, and variation of LCDM distances. As an illustrative example, we use gray matter (GM) tissue of ventral medial prefrontal cortices (VMPFCs) from subjects with major depressive disorder, subjects at high risk, and control subjects. We find significant evidence that VMPFCs of subjects with depressive disorders are different in shape compared to those of normal subjects.

Explore related subjects

stat.COstat.AP

Keep this discovery

BibTeXRIS

E. Ceyhan, M. Hosakere, T. Nishino, J. Alexopoulos, R. D. Todd, K. N. Botteron, M. I. Miller, J. T. Ratnanather. 2008-05-25. The Use of Labeled Cortical Distance Maps for Quantization and Analysis of Anatomical Morphometry of Brain Tissues. https://arxiv.org/abs/0805.3835

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗