In image registration, inverse consistency measures the consistency of mappings between images produced by a registration algorithm. The inverse consistency error, introduced by Christiansen and Johnson in 2001, quantifies the distance between the composition of the mappings from each image to the other, produced by the registration procedure, and the identity function, and is used as a regularisation constraint in the loss function of many registration algorithms to enforce consistent mappings. Inverse consistency is necessary for good image registration but it is not sufficient, since a mapping can be perfectly consistent but not register the images at all.

Definition

Image registration is the process of establishing a common coordinate system between two images, and given two images

I 1 : Ω 1 → R I 2 : Ω 2 → R {\displaystyle {\begin{aligned}I_{1}:\Omega _{1}\to \mathbb {R} \\I_{2}:\Omega _{2}\to \mathbb {R} \end{aligned}}}

registering a source image I 1 {\displaystyle I_{1}} to a target image I 2 {\displaystyle I_{2}} consists of determining a transformation f 1 : Ω 2 → Ω 1 {\displaystyle f_{1}:\Omega _{2}\to \Omega _{1}} that maps points from the target space to the source space. An ideal registration algorithm should not be sensitive to which image in the pair is used as source or target, and the registration operator should be antisymmetric such that the mappings

f 1 : Ω 2 → Ω 1 f 2 : Ω 1 → Ω 2 {\displaystyle {\begin{aligned}f_{1}:\Omega _{2}\to \Omega _{1}\\f_{2}:\Omega _{1}\to \Omega _{2}\end{aligned}}}

produced when registering I 1 {\displaystyle I_{1}} to I 2 {\displaystyle I_{2}} and I 2 {\displaystyle I_{2}} to I 1 {\displaystyle I_{1}} respectively should be the inverse of each other, i.e. f 2 = f 1 − 1 {\displaystyle f_{2}=f_{1}^{-1}} and f 1 = f 2 − 1 {\displaystyle f_{1}=f_{2}^{-1}} or, equivalently, f 2 ∘ f 1 = id Ω 2 {\displaystyle f_{2}\circ f_{1}=\operatorname {id} _{\Omega _{2}}} and f 1 ∘ f 2 = id Ω 1 {\displaystyle f_{1}\circ f_{2}=\operatorname {id} _{\Omega _{1}}}, where ∘ {\displaystyle \circ } denotes the function composition operator.

Real algorithms are not perfect, and when swapping the role of source and target image in a registration problem the so obtained transformations are not the inverse of each other. Inverse consistency can be enforced by adding to the loss function of the registration a symmetric regularisation term that penalises inconsistent transformations

∫ Ω 2 ‖ f 2 ( f 1 ( x ) ) − x ‖ 2 d x + ∫ Ω 1 ‖ f 1 ( f 2 ( x ) ) − x ‖ 2 d x . {\displaystyle \int _{\Omega _{2}}\left\Vert f_{2}(f_{1}(x))-x\right\Vert ^{2}\mathrm {d} x+\int _{\Omega _{1}}\left\Vert f_{1}(f_{2}(x))-x\right\Vert ^{2}\mathrm {d} x.}

Inverse consistency can be used as a quality metric to evaluate image registration results. The inverse consistency error (I C E {\displaystyle ICE}) measures the distance between the composition of the two transforms and the identity function, and it can be formulated in terms of both average (I C E a {\displaystyle ICE_{a}}) or maximum (I C E m {\displaystyle ICE_{m}}) over a region of interest Ω {\displaystyle \Omega } of the image:

I C E a = 1 ∫ Ω d x ∫ Ω ‖ f 2 ( f 1 ( x ) ) − x ‖ d x I C E m = max x ∈ Ω ‖ f 2 ( f 1 ( x ) ) − x ‖ . {\displaystyle {\begin{aligned}ICE_{a}&={\frac {1}{\int _{\Omega }\mathrm {d} x}}\int _{\Omega }\left\Vert f_{2}(f_{1}(x))-x\right\Vert \mathrm {d} x\\ICE_{m}&=\max _{x\in \Omega }\left\Vert f_{2}(f_{1}(x))-x\right\Vert .\end{aligned}}}

While inverse consistency is a necessary property of good registration algorithms, inverse consistency error alone is not a sufficient metric to evaluate the quality of image registration results, since a perfectly consistent mapping, with no other constraint, may be not even close to correctly register a pair of images.

  • Arganda-Carreras, Ignacio; Sorzano, Carlos OS; Marabini, Roberto; Carazo, José María; Ortiz-de-Solorzano, Carlos; Kybic, Jan (2006). Consistent and elastic registration of histological sections using vector-spline regularization. International Workshop on Computer Vision Approaches to Medical Image Analysis. Springer. pp. 85–95.
  • Bhatia, Kanwal K.; Hajnal, Joseph V.; Puri, Basant K.; Edwards, A. David; Rueckert, Daniel (2004). Consistent groupwise non-rigid registration for atlas construction. IEEE International Symposium on Biomedical Imaging. IEEE. pp. 908–911.
  • Christensen, Gary E; Johnson, Hans J (2001). "Consistent image registration". IEEE Transactions on Medical Imaging. 20 (7). IEEE: 568–582. doi:. PMID .
  • Bender, Edward T.; Tomé, Wolfgang A. (2009). . Physics in Medicine & Biology. 54 (18): 5561–77. Bibcode:. doi:. PMC . PMID .
  • Leow, Alex; Huang, Sung-Cheng; Geng, Alex; Becker, James; Davis, Simon; Toga, Arthur; Thompson, Paul (2005). "Inverse consistent mapping in 3D deformable image registration: its construction and statistical properties". Biennial International Conference on Information Processing in Medical Imaging.
  • Beg, Mirza Faisal; Khan, Ali (2007). "Symmetric data attachment terms for large deformation image registration". IEEE Transactions on Medical Imaging. 26 (9): 1179–1189. doi:. PMID .
  • Johnson, Hans J.; Christensen, Gary E. (2002). "Consistent landmark and intensity-based image registration". IEEE Transactions on Medical Imaging. 21 (5): 450–461. doi:. PMID .
  • Rohlfing, Torsten (2012). . IEEE Transactions on Medical Imaging. 31 (2). IEEE: 153–163. doi:. PMC . PMID .

External links