Deep and superficial amygdala nuclei projections revealed in vivo by probabilistic tractography

Copyright © 2011 Society for Neuroscience and the authors. The The Journal of Neuroscience uses a Creative Commons Attribution-NonCommercial-ShareAlike licence: http://creativecommons.org/licenses/by-nc-sa/4.0/.Despite a homogenous macroscopic appearance on magnetic resonance images, subregions of the amygdala express distinct functional profiles as well as corresponding differences in connectivity. In particular, histological analysis shows stronger connections for superficial (i.e., centromedial and cortical), compared with deep (i.e., basolateral and other), amygdala nuclei to lateral orbitofrontal cortex and stronger connections of deep compared with superficial, nuclei to polymodal areas in the temporal pole. Here, we use diffusion weighted imaging with probabilistic tractography to investigate these connections in humans. We use a data-driven approach to segment the amygdala into two subregions using k-means clustering. The identified subregions are spatially contiguous and their location corresponds to deep and superficial nuclear groups. Quantification of the connection strength between these amygdala clusters and individual target regions corresponds to qualitative histological findings in non-human primates, indicating such findings can be extrapolated to humans. We propose that connectivity profiles provide a potentially powerful approach for in vivo amygdala parcellation and can serve as a guide in studies that exploit functional and anatomical neuroimaging.The Wellcome Trust, a Max Planck Research Award and Swiss National Science Foundation

Static 3D Triangle Mesh Compression Overview

3D triangle meshes are extremely used to model discrete surfaces, and almost always represented with two tables: one for geometry and another for connectivity. While the raw size of a triangle mesh is of around 200 bits per vertex, by coding cleverly (and separately) those two distinct kinds of information it is possible to achieve compression ratios of 15:1 or more. Different techniques must be used depending on whether single-rate vs. progressive bitstreams are sought; and, in the latter case, on whether or not hierarchically nested meshes are desirable during reconstructio

Verification of partitions of 2d and 3d objects

We consider the problems of deciding whether a given collection of polygons (polyhedra resp.) forms (i) a partition or (ii) a cell complex decomposition of a given polygon (polyhedron resp.). We describe simple O(n log n)-time and O(n)-space algorithms for these problems, where n is the total description size of the input. If, in the input, vertices are referenced by means of indices to an array of distinct vertices, then our cell complex decomposition verification algorithms run in O(n) time

Billion-atom Synchronous Parallel Kinetic Monte Carlo Simulations of Critical 3D Ising Systems

An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation synchronously by recourse to null events that keep all processors time clocks current in a global sense. Boundary conflicts are rigorously solved by adopting a chessboard decomposition into non-interacting sublattices. We find that the bias introduced by the spatial correlations attendant to the sublattice decomposition is within the standard deviation of the serial method, which confirms the statistical validity of the method. We have assessed the parallel efficiency of the method and find that our algorithm scales consistently with problem size and sublattice partition. We apply the method to the calculation of scale-dependent critical exponents in billion-atom 3D Ising systems, with very good agreement with state-of-the-art multispin simulations