Biomedical Imaging Group
Logo EPFL
    • Splines Tutorials
    • Splines Art Gallery
    • Wavelets Tutorials
    • Image denoising
    • ERC project: FUN-SP
    • Sparse Processes - Book Preview
    • ERC project: GlobalBioIm
    • The colored revolution of bioimaging
    • Deconvolution
    • SMLM
    • One-World Seminars: Representer theorems
    • A Unifying Representer Theorem
Follow us on Twitter.
Join our Github.
Masquer le formulaire de recherche
Menu
BIOMEDICAL IMAGING GROUP (BIG)
Laboratoire d'imagerie biomédicale (LIB)
  1. School of Engineering STI
  2. Institute IEM
  3.  LIB
  4.  Pyramid Registration
  • Laboratory
    • Laboratory
    • Laboratory
    • People
    • Jobs and Trainees
    • News
    • Events
    • Seminars
    • Resources (intranet)
    • Twitter
  • Research
    • Research
    • Researchs
    • Research Topics
    • Talks, Tutorials, and Reviews
  • Publications
    • Publications
    • Publications
    • Database of Publications
    • Talks, Tutorials, and Reviews
    • EPFL Infoscience
  • Code
    • Code
    • Code
    • Demos
    • Download Algorithms
    • Github
  • Teaching
    • Teaching
    • Teaching
    • Courses
    • Student projects
  • Splines
    • Teaching
    • Teaching
    • Splines Tutorials
    • Splines Art Gallery
    • Wavelets Tutorials
    • Image denoising
  • Sparsity
    • Teaching
    • Teaching
    • ERC project: FUN-SP
    • Sparse Processes - Book Preview
  • Imaging
    • Teaching
    • Teaching
    • ERC project: GlobalBioIm
    • The colored revolution of bioimaging
    • Deconvolution
    • SMLM
  • Machine Learning
    • Teaching
    • Teaching
    • One-World Seminars: Representer theorems
    • A Unifying Representer Theorem

A Pyramid Approach to Subpixel Registration Based on Intensity

P. Thévenaz, U.E. Ruttimann, M. Unser

IEEE Transactions on Image Processing, vol. 7, no. 1, pp. 27-41, January 1998.


We present an automatic sub-pixel registration algorithm that minimizes the mean square difference of intensities between a reference and a test data set, which can be either tri-dimensional (3-D) volumes or bi-dimensional (2-D) images. It uses spline processing, is based on a coarse-to-fine strategy (pyramid approach), and performs minimization according to a new variation of the iterative Marquardt-Levenberg algorithm for non-linear least-square optimization (MLA). The geometric deformation model is a global 3-D affine transformation, which one may restrict to the case of rigid-body motion (isometric scale, rotation and translation). It may also include a parameter to adjust for image contrast differences. We obtain excellent results for the registration of intra-modality Positron Emission Tomography (PET) and functional Magnetic Resonance Imaging (fMRI) data. We conclude that the multi-resolution refinement strategy is more robust than a comparable single-scale method, being less likely to get trapped into a false local optimum. In addition, it is also faster.

Erratum

Some conventions used in the paper were not explicit. More importantly, the adherence to these untold conventions was not consistent throughout the paper, which lead to erroneous equations. The version below makes the conventions explicit and corrects the mistakes.

  • Equation (3) should become

    Qb,A,γ{ƒ}(x) = Cγ{AA{Tb{ƒ}}}(x)
    = Cγ{AA{ƒ(· + b)}}(x)
    = Cγ{ƒ(A · + b)}(x)
    = {eγ ƒ(A · + b)}(x)
    = eγ ƒ(A x + b)
  • Similarly, equation (11) should become

    Qb,κ,φ,ϑ,ψ,γ{ƒ}(x) = Cγ{Rφ,ϑ,ψ{Sκ{Tb{ƒ}}}}(x)
    = Cγ{Rφ,ϑ,ψ{Sκ{ƒ(· + b)}}}(x)
    = Cγ{Rφ,ϑ,ψ{ƒ(eκ · + b)}}(x)
    = Cγ{ƒ(eκ R(φ,ϑ,ψ) · + b)}(x)
    = {eγ ƒ(eκ R(φ,ϑ,ψ) · + b)}(x)
    = eγ ƒ(eκ R(φ,ϑ,ψ) x + b)
  • Then, Table I should be corrected as follows:

    Qp{Qq{ƒ}}QpTaAACa
    Qqo
    TbTa+bTA-1b{AA}Tb{Ca}
    ABAB{TBa}ABAAB{Ca}
    CbCb{Ta}Cb{AA}Ca+b
  • Table II should be corrected as follows:

    Qp{Qq{ƒ}}QpTaSκ′Rφ′,ϑ′,ψ′Ca
    Qqo
    TbTe-κ′b{Sκ′}
    Sκ″Sκ″{Teκ″a}Sκ′+κ″Sκ″{Rφ′,ϑ′,ψ′}Sκ″{Ca}
    Rφ″,ϑ″,ψ″Rφ″,ϑ″,ψ″{Sκ′}Rφ,ϑ,ψ
    CbCb{Sκ′}

    with Rφ,ϑ,ψ{ƒ}(x) = (Rφ′,ϑ′,ψ′ o Rφ″,ϑ″,ψ″){ƒ}(x) = ƒ(R(φ″,ϑ″,ψ″) R(φ′,ϑ′,ψ′) x).

  • Equation (21) should become ε2 = (e2γ ⁄ |det(A)|) ||CΔγ{AI+ΔA{TΔb{ƒT}}} - C-γ{AA-1{T-((I+ΔA)A)-1b{ƒR}}}||2.

  • Equation (22) should become ε2 = (e2(γ+Δγ) ⁄ |det((I+ΔA)A)|) ||ƒT - C-γ-Δγ{A((I+ΔA)A)-1{T-((I+ΔA)A)-1(b+Δb){ƒR}}}||2.

  • Equation (23) should become ε2 = ||Cγ+Δγ{A(I+ΔA)A{Tb+Δb{ƒT}}} - ƒR||2.

  • Equation (24) should become ε2 = e2γ-3κ ||CΔγ{RΔφ,Δϑ,Δψ{SΔκ{TΔb{ƒT}}}} - C-γ{R-1φ,ϑ,ψ{S-κ{T-(R(Δφ,Δϑ,Δψ)R(φ,ϑ,ψ))-1e-κ-Δκb{ƒR}}}}||2.

  • Equation (25) should become ε2 = e2(γ+Δγ)-3(κ+Δκ) ||ƒT - C-γ-Δγ{(Rφ,ϑ,ψoRΔφ,Δϑ,Δψ)-1{S-κ-Δκ{T-(R(Δφ,Δϑ,Δψ)R(φ,ϑ,ψ))-1e-κ-Δκ(b+Δb){ƒR}}}}||2.

  • Equation (26) should become ε2 = ||Cγ+Δγ{Rφ,ϑ,ψoRΔφ,Δϑ,Δψ{Sκ+Δκ{Tb+Δb{ƒT}}}} - ƒR||2.

  • Page 32, second column, last paragraph, line 10, replace (R-1Δφ,Δϑ,ΔψoR-1φ,ϑ,ψ) by (Rφ,ϑ,ψoRΔφ,Δϑ,Δψ)-1.

  • Equation (A.1) should become χ2(p) = (e2γ ⁄ |det(A)|) ∑i=1…N (CΔγ{AI+ΔA{TΔb{ƒT}}}(xi) - C-γ{AA-1{T-((I+ΔA)A)-1b{ƒR}}}(xi))2.

  • Finally, Equation (A.2) should become

    βk = -½ (∂χ2(p) ⁄ ∂Δpk)
    = (e-2γ ⁄ |det(A)|) ∑i=1…N (ƒT(xi) - C-γ{AA-1{T-((I+ΔA)A)-1b{ƒR}}}(xi)) (∂QΔp{ƒT}(xi) ⁄ ∂Δpk).

@ARTICLE(http://bigwww.epfl.ch/publications/thevenaz9801.html,
AUTHOR="Th{\'{e}}venaz, P. and Ruttimann, U.E. and Unser, M.",
TITLE="A Pyramid Approach to Subpixel Registration Based on
	Intensity",
JOURNAL="{IEEE} Transactions on Image Processing",
YEAR="1998",
volume="7",
number="1",
pages="27--41",
month="January",
note="")

© 1998 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
  • Laboratory
  • Research
  • Publications
    • Database of Publications
    • Talks, Tutorials, and Reviews
    • EPFL Infoscience
  • Code
  • Teaching
Logo EPFL, Ecole polytechnique fédérale de Lausanne
Emergencies: +41 21 693 3000 Services and resources Contact Map Webmaster email

Follow EPFL on social media

Follow us on Facebook. Follow us on Twitter. Follow us on Instagram. Follow us on Youtube. Follow us on LinkedIn.
Accessibility Disclaimer Privacy policy

© 2023 EPFL, all rights reserved