Search

Predictive models can be used on high-dimensional brain images to decode cognitive states or diagnosis/prognosis of a clinical condition/evolution. Spatial regularization through structured sparsity offers new perspectives in this context and reduces the risk of overfitting the model while providing interpretable neuroimaging signatures by forcing the solution to adhere to domain-specific constraints. Total variation (TV) is a promising candidate for structured penalization: it enforces spatial smoothness of the solution while segmenting predictive regions from the background. We consider the problem of minimizing the sum of a smooth convex loss, a non-smooth convex penalty (whose proximal operator is known) and a wide range of possible complex, non-smooth convex structured penalties such as TV or overlapping group Lasso. Existing solvers are either limited in the functions they can minimize or in their practical capacity to scale to high-dimensional imaging data. Nesterov’s smoothing technique can be used to minimize a large number of non-smooth convex structured penalties. However, reasonable precision requires a small smoothing parameter, which slows down the convergence speed to unacceptable levels. To benefit from the versatility of Nesterov’s smoothing technique, we propose a first order continuation algorithm, CONESTA, which automatically generates a sequence of decreasing smoothing parameters. The generated sequence maintains the optimal convergence speed toward any globally desired precision. Our main contributions are: gap to probe the current distance to the global optimum in order to adapt the smoothing parameter and the To propose an expression of the duality convergence speed. This expression is applicable to many penalties and can be used with other solvers than CONESTA. We also propose an expression for the particular smoothing parameter that minimizes the number of iterations required to reach a given precision. Furthermore, we provide a convergence proof and its rate, which is an improvement over classical proximal gradient smoothing methods. We demonstrate on both simulated and high-dimensional structural neuroimaging data that CONESTA significantly outperforms many state-of-the-art solvers in regard to convergence speed and precision. [ABSTRACT FROM AUTHOR]

Principal component analysis (PCA) is an exploratory tool widely used in data analysis to uncover the dominant patterns of variability within a population. Despite its ability to represent a data set in a low-dimensional space, PCA’s interpretability remains limited. Indeed, the components produced by PCA are often noisy or exhibit no visually meaningful patterns. Furthermore, the fact that the components are usually non-sparse may also impede interpretation, unless arbitrary thresholding is applied. However, in neuroimaging, it is essential to uncover clinically interpretable phenotypic markers that would account for the main variability in the brain images of a population. Recently, some alternatives to the standard PCA approach, such as sparse PCA (SPCA), have been proposed, their aim being to limit the density of the components. Nonetheless, sparsity alone does not entirely solve the interpretability problem in neuroimaging, since it may yield scattered and unstable components. We hypothesized that the incorporation of prior information regarding the structure of the data may lead to improved relevance and interpretability of brain patterns. We therefore present a simple extension of the popular PCA framework that adds structured sparsity penalties on the loading vectors in order to identify the few stable regions in the brain images that capture most of the variability. Such structured sparsity can be obtained by combining, e.g., \ell 1 and total variation (TV) penalties, where the TV regularization encodes information on the underlying structure of the data. This paper presents the structured SPCA (denoted SPCA-TV) optimization framework and its resolution. We demonstrate SPCA-TV’s effectiveness and versatility on three different data sets. It can be applied to any kind of structured data, such as, e.g., N -dimensional array images or meshes of cortical surfaces. The gains of SPCA-TV over unstructured approaches (such as SPCA and ElasticNet PCA) or structured approach (such as GraphNet PCA) are significant, since SPCA-TV reveals the variability within a data set in the form of intelligible brain patterns that are easier to interpret and more stable across different samples. [ABSTRACT FROM PUBLISHER]

Positron emission tomography (PET) is a useful tool for pharmacokinetics studies in rodents during the preclinical phase of drug and tracer development. However, rodent organs are small as compared to the scanner's intrinsic resolution and are affected by physiological movements. We present a new method for the segmentation of rodent whole-body PET images that takes these two difficulties into account by estimating the pharmacokinetics far from organ borders. The segmentation method proved efficient on whole-body numerical rat phantom simulations, including 3-14 organs, together with physiological movements (heart beating, breathing, and bladder filling). The method was resistant to spillover and physiological movements, while other methods failed to obtain a correct segmentation. The radioactivity concentrations calculated with this method also showed an excel- lent correlation with the manual delineation of organs in a large set of preclinical images. In addition, it was faster, detected more organs, and extracted organs' mean time activity curves with a better confidence on the measure than manual delineation. [ABSTRACT FROM AUTHOR]

We describe here a classification system based on automatically identified cortical sulci. Multivariate recognition methods are required for the detection of complex brain patterns with a spatial distribution. However, such methods may face the well-known issue of the curse of dimensionality—the risk of overfitting the training dataset in high-dimensional space. We overcame this problem, using a classifier pipeline with one- or two-stage of descriptor selection based on machine-learning methods, followed by a support vector machine classifier or linear discriminant analysis. We compared alternative designs of the pipeline on two different datasets built from the same database corresponding to 151 brains. The first dataset dealt with cortex asymmetry and the second dealt with the effect of the subject's sex. Our system successfully (98%) distinguished between the left and right hemispheres on the basis of sulcal shape (size, depth, etc.). The sex of the subject could be determined with a success rate of 85%. These results highlight the attractiveness of multivariate recognition models combined with appropriate descriptor selection. The sulci selected by the pipeline are consistent with previous whole-brain studies on sex effects and hemispheric asymmetries. [ABSTRACT FROM AUTHOR]