SharpMean: Groupwise registration guided by sharp mean image and tree-based registration

Guorong Wu, Hongjun Jia, Qian Wang, Dinggang Shen

Research output: Contribution to journalArticle

82 Citations (Scopus)

Abstract

Groupwise registration has become more and more popular due to its attractiveness for unbiased analysis of population data. One of the most popular approaches for groupwise registration is to iteratively calculate the group mean image and then register all subject images towards the latest estimated group mean image. However, its performance might be undermined by the fuzzy mean image estimated in the very beginning of groupwise registration procedure, because all subject images are far from being well-aligned at that moment. In this paper, we first point out the significance of always keeping the group mean image sharp and clear throughout the entire groupwise registration procedure, which is intuitively important but has not been explored in the literature yet. To achieve this, we resort to developing the robust mean-image estimator by the adaptive weighting strategy, where the weights are adaptive across not only the individual subject images but also all spatial locations in the image domain. On the other hand, we notice that some subjects might have large anatomical variations from the group mean image, which challenges most of the state-of-the-art registration algorithms. To ensure good registration results in each iteration, we explore the manifold of subject images and build a minimal spanning tree (MST) with the group mean image as the root of the MST. Therefore, each subject image is only registered to its parent node often with similar shapes, and its overall transformation to the group mean image space is obtained by concatenating all deformations along the paths connecting itself to the root of the MST (the group mean image). As a result, all the subjects will be well aligned to the group mean image adaptively. Our method has been evaluated in both real and simulated datasets. In all experiments, our method outperforms the conventional algorithm which generally produces a fuzzy group mean image throughout the entire groupwise registration.

Original languageEnglish
Pages (from-to)1968-1981
Number of pages14
JournalNeuroImage
Volume56
Issue number4
DOIs
Publication statusPublished - 2011 Jun 15
Externally publishedYes

Fingerprint

Weights and Measures
Population
Datasets

Keywords

  • Groupwise registration
  • Sharp mean
  • Tree-based registration

ASJC Scopus subject areas

  • Cognitive Neuroscience
  • Neurology

Cite this

SharpMean : Groupwise registration guided by sharp mean image and tree-based registration. / Wu, Guorong; Jia, Hongjun; Wang, Qian; Shen, Dinggang.

In: NeuroImage, Vol. 56, No. 4, 15.06.2011, p. 1968-1981.

Research output: Contribution to journalArticle

Wu, Guorong ; Jia, Hongjun ; Wang, Qian ; Shen, Dinggang. / SharpMean : Groupwise registration guided by sharp mean image and tree-based registration. In: NeuroImage. 2011 ; Vol. 56, No. 4. pp. 1968-1981.
@article{ca6668182c574494ba6a21eac04278f1,
title = "SharpMean: Groupwise registration guided by sharp mean image and tree-based registration",
abstract = "Groupwise registration has become more and more popular due to its attractiveness for unbiased analysis of population data. One of the most popular approaches for groupwise registration is to iteratively calculate the group mean image and then register all subject images towards the latest estimated group mean image. However, its performance might be undermined by the fuzzy mean image estimated in the very beginning of groupwise registration procedure, because all subject images are far from being well-aligned at that moment. In this paper, we first point out the significance of always keeping the group mean image sharp and clear throughout the entire groupwise registration procedure, which is intuitively important but has not been explored in the literature yet. To achieve this, we resort to developing the robust mean-image estimator by the adaptive weighting strategy, where the weights are adaptive across not only the individual subject images but also all spatial locations in the image domain. On the other hand, we notice that some subjects might have large anatomical variations from the group mean image, which challenges most of the state-of-the-art registration algorithms. To ensure good registration results in each iteration, we explore the manifold of subject images and build a minimal spanning tree (MST) with the group mean image as the root of the MST. Therefore, each subject image is only registered to its parent node often with similar shapes, and its overall transformation to the group mean image space is obtained by concatenating all deformations along the paths connecting itself to the root of the MST (the group mean image). As a result, all the subjects will be well aligned to the group mean image adaptively. Our method has been evaluated in both real and simulated datasets. In all experiments, our method outperforms the conventional algorithm which generally produces a fuzzy group mean image throughout the entire groupwise registration.",
keywords = "Groupwise registration, Sharp mean, Tree-based registration",
author = "Guorong Wu and Hongjun Jia and Qian Wang and Dinggang Shen",
year = "2011",
month = "6",
day = "15",
doi = "10.1016/j.neuroimage.2011.03.050",
language = "English",
volume = "56",
pages = "1968--1981",
journal = "NeuroImage",
issn = "1053-8119",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - SharpMean

T2 - Groupwise registration guided by sharp mean image and tree-based registration

AU - Wu, Guorong

AU - Jia, Hongjun

AU - Wang, Qian

AU - Shen, Dinggang

PY - 2011/6/15

Y1 - 2011/6/15

N2 - Groupwise registration has become more and more popular due to its attractiveness for unbiased analysis of population data. One of the most popular approaches for groupwise registration is to iteratively calculate the group mean image and then register all subject images towards the latest estimated group mean image. However, its performance might be undermined by the fuzzy mean image estimated in the very beginning of groupwise registration procedure, because all subject images are far from being well-aligned at that moment. In this paper, we first point out the significance of always keeping the group mean image sharp and clear throughout the entire groupwise registration procedure, which is intuitively important but has not been explored in the literature yet. To achieve this, we resort to developing the robust mean-image estimator by the adaptive weighting strategy, where the weights are adaptive across not only the individual subject images but also all spatial locations in the image domain. On the other hand, we notice that some subjects might have large anatomical variations from the group mean image, which challenges most of the state-of-the-art registration algorithms. To ensure good registration results in each iteration, we explore the manifold of subject images and build a minimal spanning tree (MST) with the group mean image as the root of the MST. Therefore, each subject image is only registered to its parent node often with similar shapes, and its overall transformation to the group mean image space is obtained by concatenating all deformations along the paths connecting itself to the root of the MST (the group mean image). As a result, all the subjects will be well aligned to the group mean image adaptively. Our method has been evaluated in both real and simulated datasets. In all experiments, our method outperforms the conventional algorithm which generally produces a fuzzy group mean image throughout the entire groupwise registration.

AB - Groupwise registration has become more and more popular due to its attractiveness for unbiased analysis of population data. One of the most popular approaches for groupwise registration is to iteratively calculate the group mean image and then register all subject images towards the latest estimated group mean image. However, its performance might be undermined by the fuzzy mean image estimated in the very beginning of groupwise registration procedure, because all subject images are far from being well-aligned at that moment. In this paper, we first point out the significance of always keeping the group mean image sharp and clear throughout the entire groupwise registration procedure, which is intuitively important but has not been explored in the literature yet. To achieve this, we resort to developing the robust mean-image estimator by the adaptive weighting strategy, where the weights are adaptive across not only the individual subject images but also all spatial locations in the image domain. On the other hand, we notice that some subjects might have large anatomical variations from the group mean image, which challenges most of the state-of-the-art registration algorithms. To ensure good registration results in each iteration, we explore the manifold of subject images and build a minimal spanning tree (MST) with the group mean image as the root of the MST. Therefore, each subject image is only registered to its parent node often with similar shapes, and its overall transformation to the group mean image space is obtained by concatenating all deformations along the paths connecting itself to the root of the MST (the group mean image). As a result, all the subjects will be well aligned to the group mean image adaptively. Our method has been evaluated in both real and simulated datasets. In all experiments, our method outperforms the conventional algorithm which generally produces a fuzzy group mean image throughout the entire groupwise registration.

KW - Groupwise registration

KW - Sharp mean

KW - Tree-based registration

UR - http://www.scopus.com/inward/record.url?scp=79957521924&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957521924&partnerID=8YFLogxK

U2 - 10.1016/j.neuroimage.2011.03.050

DO - 10.1016/j.neuroimage.2011.03.050

M3 - Article

C2 - 21440646

AN - SCOPUS:79957521924

VL - 56

SP - 1968

EP - 1981

JO - NeuroImage

JF - NeuroImage

SN - 1053-8119

IS - 4

ER -