Evidence map›Paper›PMID 34650324›Full record

ArticleSIAM journal on scientific computing : a publication of the Society for Industrial and Applied Mathematics2019

CLAIRE: A DISTRIBUTED-MEMORY SOLVER FOR CONSTRAINED LARGE DEFORMATION DIFFEOMORPHIC IMAGE REGISTRATION.

Andreas Mang, Amir Gholami, Christos Davatzikos, George Biros

Abstract read
In one paragraph

Article in SIAM journal on scientific computing : a publication of the Society for Industrial and Applied Mathematics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Fast GPU 3D diffeomorphic image registration.Journal of parallel and distributed computing · 2021
    Article
  5. Article
  6. Article
  7. Multi-Node Multi-GPU Diffeomorphic Image Registration for Large-Scale Imaging Problems.International Conference for High Performance Computing, Networking, Storage and Analysis : [proceedings]. SC (Conference : Supercomputing) · 2020
    Article
  8. Multiatlas Calibration of Biophysical Brain Tumor Growth Models with Mass Effect.Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention · 2020
    Article
  9. Article
  10. Review
  11. Article
  12. IMAGE-DRIVEN BIOPHYSICAL TUMOR GROWTH MODEL CALIBRATION.SIAM journal on scientific computing : a publication of the Society for Industrial and Applied Mathematics · 2020
    Article
  13. CLAIRE: A DISTRIBUTED-MEMORY SOLVER FOR CONSTRAINED LARGE DEFORMATION DIFFEOMORPHIC IMAGE REGISTRATION.SIAM journal on scientific computing : a publication of the Society for Industrial and Applied Mathematics · 2019
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Andreas MangDepartment of Mathematics, University of Houston, Houston, TX 77204-5008.
Amir GholamiDepartment of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720-1770.
Christos DavatzikosCenter for Biomedical Image Computing and Analytics, Department of Radiology, University of Pennsylvania, Philadelphia, PA 19104-2643.
George BirosOden Institute for Computational Engineering and Sciences, University of Texas at Austin, Austin, TX 78712-1229.

Funding

Statistical atlases of brain tumor MRI:do imaging phenotypes predict progression?R01NS042645 · NINDS · UNIVERSITY OF PENNSYLVANIA · PI DAVATZIKOS, CHRISTOS · 2002 to 2024
$8.7M
NINDS NIH HHS R01 NS042645
6 · The paper itself

Abstract

With this work we release CLAIRE, a distributed-memory implementation of an effective solver for constrained large deformation diifeomorphic image registration problems in three dimensions. We consider an optimal control formulation. We invert for a stationary velocity field that parameterizes the deformation map. Our solver is based on a globalized, preconditioned, inexact reduced space Gauss‒Newton‒Krylov scheme. We exploit state-of-the-art techniques in scientific computing to develop an eifective solver that scales to thousands of distributed memory nodes on high-end clusters. We present the formulation, discuss algorithmic features, describe the software package, and introduce an improved preconditioner for the reduced space Hessian to speed up the convergence of our solver. We test registration performance on synthetic and real data. We Demonstrate registration accuracy on several neuroimaging datasets. We compare the performance of our scheme against diiferent flavors of the Demons algorithm for diifeomorphic image registration. We study convergence of our preconditioner and our overall algorithm. We report scalability results on state-of-the-art supercomputing platforms. We Demonstrate that we can solve registration problems for clinically relevant data sizes in two to four minutes on a standard compute node with 20 cores, attaining excellent data fidelity. With the present work we achieve a speedup of (on average) 5× with a peak performance of up to 17× compared to our former work.

Indexed as

35Q9349J2065F0865K1068U1076D55diifeomorphic image registrationdistributed-memory algorithmKKT preconditionerLDDMMNewton–Krylov methodoptimal controlPDE-constrained optimization

Identifiers

PMID34650324
PMCPMC8513530

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.