Search results for " Computer Science"
showing 10 items of 3983 documents
LOCALIZATION OF HIPPOCAMPAL ATROPHY IN ALZHEIMER'S DISEASE
2011
International audience; The hippocampus presents the highest rate of atrophy in the early stage of Alzheimer's disease (AD), with more pronounced neuron loss reported in CA1 and subiculum. The aim of this study is to increase the discrimination power of hippocampal shape analysis between AD and normal controls (NC) by focusing on the subregions with atrophy associated with AD and describing the localized shape changes using statistical shape models (SSMs).
Primitives detection by a discrete and non linear approach : application to the detection and caracterization of interest points for 3D meshes
2010
This manuscript is dedicated to the detection and caracterization of interest points for 3D meshes. First of all, we show the limitations of the curvature measure on sharp edges, the measure usually used for the analysis of meshes. Then, we present a generalization of the SUSAN operator for meshes, named SUSAN-3D. The saliency measure proposed quantify the local variation of the surface and classify directly the analysed vertices in five classes: salient, crest, flat, valley and cavity. The meshes under consideration are manifolds and can be closed or non-closed, regulars or irregulars, dense or not and noised or not. The accuracy of the SUSAN-3D operator is compared to two curvature operat…
Large-scale genome-wide association studies on a GPU cluster using a CUDA-accelerated PGAS programming model
2015
[Abstract] Detecting epistasis, such as 2-SNP interactions, in genome-wide association studies (GWAS) is an important but time consuming operation. Consequently, GPUs have already been used to accelerate these studies, reducing the runtime for moderately-sized datasets to less than 1 hour. However, single-GPU approaches cannot perform large-scale GWAS in reasonable time. In this work we present multiEpistSearch, a tool to detect epistasis that works on GPU clusters. While CUDA is used for parallelization within each GPU, the workload distribution among GPUs is performed with Unified Parallel C++ (UPC++), a novel extension of C++ that follows the Partitioned Global Address Space (PGAS) model…
Extraction of Airways from CT (EXACT'09)
2012
Contains fulltext : 107854.pdf (Publisher’s version ) (Open Access) This paper describes a framework for establishing a reference airway tree segmentation, which was used to quantitatively evaluate fifteen different airway tree extraction algorithms in a standardized manner. Because of the sheer difficulty involved in manually constructing a complete reference standard from scratch, we propose to construct the reference using results from all algorithms that are to be evaluated. We start by subdividing each segmented airway tree into its individual branch segments. Each branch segment is then visually scored by trained observers to determine whether or not it is a correctly segmented part o…
Registration of arbitrary multi-view 3D acquisitions
2013
International audience; To register 3D meshes representing smooth surfaces we track the 3D digitization system using photogrammetric techniques and calibrations. We present an example by digitizing a 800 mm x 600 mm portion of a car door. To increase the tracking accuracy the 3D scanner is placed in a cubic frame of side 0.5 m covered with 78 targets. The target frame moves in a volume that is approximately 1100 mm x 850 mm x 900 mm, to digitize the area of interest. Using four cameras this target frame is tracked with of an accuracy of 0.03 mm spatially and 0.180 mrad angularly. A registration accuracy between 0.1 mm and 2 mm is reached. This method can be used for the registration of mesh…
The fixed angle scattering problem and wave equation inverse problems with two measurements
2019
We consider two formally determined inverse problems for the wave equation in more than one space dimension. Motivated by the fixed angle inverse scattering problem, we show that a compactly supported potential is uniquely determined by the far field pattern generated by plane waves coming from exactly two opposite directions. This implies that a reflection symmetric potential is uniquely determined by its fixed angle scattering data. We also prove a Lipschitz stability estimate for an associated problem. Motivated by the point source inverse problem in geophysics, we show that a compactly supported potential is uniquely determined from boundary measurements of the waves generated by exactl…
A sampling method for detecting buried objects using electromagnetic scattering
2005
We consider a simple (but fully three-dimensional) mathematical model for the electromagnetic exploration of buried, perfect electrically conducting objects within the soil underground. Moving an electric device parallel to the ground at constant height in order to generate a magnetic field, we measure the induced magnetic field within the device, and factor the underlying mathematics into a product of three operations which correspond to the primary excitation, some kind of reflection on the surface of the buried object(s) and the corresponding secondary excitation, respectively. Using this factorization we are able to give a justification of the so-called sampling method from inverse scat…
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Pre-emption in resource-constrained project scheduling
2008
Abstract The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly foc…
Justification and RCPSP: A technique that pays
2005
Abstract The objective of this paper is to show that justification is a simple technique that can be easily incorporated in diverse algorithms for the resource-constrained project scheduling problem––improving the quality of the schedules generated without generally requiring more computing time. The results of incorporating this technique in 22 different algorithms are shown. Fifteen of the new algorithms that use double justification outperform seven of the best heuristic algorithms that do not use justification. The tests have been performed on the standard test set j120 for the RCPSP generated using ProGen.