CoChat

Predict brain MR image registration via sparse learning of appearance and transformation

Open access
Wang, Qian, Kim, Minjeong, Shi, Yonghong, Wu, Guorong, Shen, Dinggang · 2015 · Medical Image Analysis
Cited by 38

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

We propose a new approach to register the subject image with the template by leveraging a set of intermediate images that are pre-aligned to the template. We argue that, if points in the subject and the intermediate images share similar local appearances, they may have common correspondence in the template. In this way, we learn the sparse representation of a certain subject point to reveal several similar candidate points in the intermediate images. Each selected intermediate candidate can bridge the correspondence from the subject point to the template space, thus predicting the transformation associated with the subject point at the confidence level that relates to the learned sparse coefficient. Following this strategy, we first predict transformations at selected key points, and retain multiple predictions on each key point, instead of allowing only a single correspondence. Then, by utilizing all key points and their predictions with varying confidences, we adaptively reconstruct the dense transformation field that warps the subject to the template. We further embed the prediction-reconstruction protocol above into a multi-resolution hierarchy. In the final, we refine our estimated transformation field via existing registration method in effective manners. We apply our method to registering brain MR images, and conclude that the proposed framework is competent to improve registration performances substantially.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.media.2014.10.007

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Evaluation of 14 nonlinear deformation algorithms applied to human brain MRI registration

    Klein, A., Andersson, J., Ardekani, B. A., Ashburner, J., Avants, B., Chiang, M.-C., Christensen, G. E., Collins, D. L., Gee, J., Hellier, P., et al. (2009) · NeuroImage · doi:10.1016/j.neuroimage.2008.12.037 · Cited by 2,227 · cited 1×

    “The Dice ratio measures the overlap of the corresponding ROIs in the deformed subject and the template, as the higher measure typically implies that the two images are registered more accurately (Klein et al., 2009; Rohlfing, 2012).”
  • Deformable medical image registration: a survey

    Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587 · cited 2×

    “…image registration methods in the literature, most of them regard image registration as a typical optimization problem (Rueckert and Schnabel, 2011; Sotiras et al., 2013), which (1) is favour of higher image similarity between the template and the subject images, (2) imposes certain regularization…”
  • A new point matching algorithm for non-rigid registration

    Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560 · cited 3×

    “Abundant choices of RBF kernels are available, e.g., the thin plate splines (TPS) with polynomial decay in frequency domain (Bookstein, 1989; Chui and Rangarajan, 2003).”

Show all 3 references

Research works printed but not linked: 28

  1. Aljabar, P., Wolz, R., Rueckert, D., 2012. Manifold learning for medical image registration, segmentation, and classification. Machine Learning in Computer-Aided Diagnosis: Medical Imaging Intelligence and Analysis. IGI Global. · DOI
  2. Bookstein, 1989, Principal warps: thin-plate splines and the decomposition of deformations, IEEE Trans. Pattern Anal. Machine Intell., 11, 567, 10.1109/34.24792 · DOI · Paper page
  3. Chou, 2013, 2D/3d image registration using regression learning, Comput. Vis. Image Understand., 117, 1095, 10.1016/j.cviu.2013.02.009 · DOI · Paper page
  4. Drucker, H., Burges, C.J., Kaufman, L., Smola, A., Vapnik, V., 1997. Support vector regression machines. In: Advances in Neural Information Processing Systems, pp. 155–161.
  5. Floater, 1996, Multistep scattered data interpolation using compactly supported radial basis functions, J. Comp. Appl. Math., 73, 65, 10.1016/0377-0427(96)00035-0 · doi:10.1016/0377-0427(96)00035-0
  6. Genton, 2001, Classes of kernels for machine learning: a statistics perspective, J. Machine Learn. Res., 2, 299
  7. Girosi, 1995, Regularization theory and neural networks architectures, Neural Comput., 7, 219, 10.1162/neco.1995.7.2.219 · DOI · Paper page
  8. Hamm, 2010, Gram: a framework for geodesic registration on anatomical manifolds, Med. Image Anal., 14, 633, 10.1016/j.media.2010.06.001 · DOI
  9. Jenkinson, 2002, Improved optimization for the robust and accurate linear registration and motion correction of brain images, NeuroImage, 17, 825, 10.1006/nimg.2002.1132 · DOI · Paper page
  10. Jenkinson, 2001, A global optimisation method for robust affine registration of brain images, Med. Image Anal., 5, 143, 10.1016/S1361-8415(01)00036-6 · DOI · Paper page
  11. Jia, H., Wu, G., Wang, Q., Kim, M., Shen, D., 2011. itree: Fast and accurate image registration based on the combinative and incremental tree. In: 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, pp. 1243–1246. · doi:10.1109/isbi.2011.5872627
  12. Jia, 2010, Absorb: atlas building by self-organized registration and bundling, NeuroImage, 51, 1057, 10.1016/j.neuroimage.2010.03.010 · DOI
  13. Jia, 2012, Directed graph based image registration, Comput. Med. Imag. Graph., 36, 139, 10.1016/j.compmedimag.2011.09.001 · DOI
  14. Jia, 2012, Iterative multi-atlas-based multi-image segmentation with tree-based registration, NeuroImage, 59, 422, 10.1016/j.neuroimage.2011.07.036 · DOI
  15. Kim, 2012, A general fast registration framework by learning deformation-appearance correlation, IEEE Trans. Image Process., 21, 1823, 10.1109/TIP.2011.2170698 · DOI
  16. Munsell, 2012, Pre-organizing shape instances for landmark-based shape correspondence, Int. J. Comput. Vis., 97, 210, 10.1007/s11263-011-0477-4 · doi:10.1007/s11263-011-0477-4
  17. Myronenko, 2010, Point set registration: coherent point drift, IEEE Trans. Pattern Anal. Machine Intell., 32, 2262, 10.1109/TPAMI.2010.46 · DOI · Paper page
  18. Rohlfing, 2012, Image similarity and tissue overlaps as surrogates for image registration accuracy: widely used but unreliable, IEEE Trans. Med. Imag., 31, 153, 10.1109/TMI.2011.2163944 · DOI · Paper page
  19. Rohr, 2001, Landmark-based elastic registration using approximating thin-plate splines, IEEE Trans. Med. Imag., 20, 526, 10.1109/42.929618 · DOI · Paper page
  20. Shattuck, 2008, Construction of a 3d probabilistic atlas of human cortical structures, NeuroImage, 39, 1064, 10.1016/j.neuroimage.2007.09.031 · DOI · Paper page
  21. Shen, 2002, Hammer: hierarchical attribute matching mechanism for elastic registration, IEEE Trans. Med. Imag., 21, 1421, 10.1109/TMI.2002.803111 · DOI · Paper page
  22. Tang, 2009, Rabbit: rapid alignment of brains by building intermediate templates, NeuroImage, 47, 1277, 10.1016/j.neuroimage.2009.02.043 · DOI
  23. Vercauteren, 2009, Diffeomorphic demons: efficient non-parametric image registration, NeuroImage, 45, S61, 10.1016/j.neuroimage.2008.10.040 · DOI · Paper page
  24. Wang, 2010, Groupwise registration based on hierarchical image clustering and atlas synthesis, Hum. Brain Mapp., 31, 1128, 10.1002/hbm.20923 · DOI
  25. Wolz, 2010, Leap: learning embeddings for atlas propagation, NeuroImage, 49, 1316, 10.1016/j.neuroimage.2009.09.069 · DOI · Paper page
  26. Wright, 2010, Sparse representation for computer vision and pattern recognition, Proc. IEEE, 98, 1031, 10.1109/JPROC.2010.2044470 · DOI · Paper page
  27. Wu, 2010, Tps-hammer: improving {HAMMER} registration algorithm by soft correspondence matching and thin-plate splines based deformation interpolation, NeuroImage, 49, 2225, 10.1016/j.neuroimage.2009.10.065 · DOI
  28. Yap, 2010, F-timer: fast tensor image morphing for elastic registration, IEEE Trans. Med. Imag., 29, 1192, 10.1109/TMI.2010.2043680 · DOI

Cited by

Metadata

Authors
Wang, Q., Kim, M., Shi, Y., Wu, G., & Shen, D.
Venue
Medical Image Analysis
Publisher
Elsevier BV
Published
2015-02
Volume
20
Issue
1
Pages
61-75
ISSN
1361-8415 (ISSN-L)
OpenAlex
W2016650517
Cited by
38
References
3
FWCI
3.26
Type
journal article
Language
en
Open access
green
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Funders
  • National Institute of Health of United States (EB006733, EB008374, EB009634, AG041721, MH100217, AG042599)
  • National Natural Science Foundation of China (61401271, 61473190, 81471733)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.