Abstract.
Purpose: Our goal is to propose a landmark- and contour-matching (LCM) registration method that uses both landmark information and approximate point correspondences to boost the similarity between image pairs with sparse landmark information.
Approach: A model for registering two-dimensional (2D) medical images with landmark information and contour-approximating landmarks was proposed. The model was also extended to accommodate the registration of three-dimensional (3D) cardiac images. We validated the LCM method on 2D hand x-rays and 3D porcine cardiac magnetic resonance images. The following metrics were used to assess the quality of specific aspects of the registered images: Dice similarity coefficient for the overall image overlap, target registration error for pointwise correspondence, and interior angle for local curvature.
Results: Target registrations were reduced from 27.12 to 0.01 mm post-LCM registration. Implementing the proposed algorithm also led to a 112% average improvement in image similarity in terms of Dice coefficients. In addition, interior angle measurements indicate that the proposed method preserved the local curvature at major reference landmarks and mitigated the appearance of deformities in the registered images.
Conclusions: The proposed method addressed several issues associated with purely landmark-based techniques, such as iterative closest point registration and thin plate spline interpolation. Furthermore, it provided accurate registration results even in the presence of landmark localization errors.
Keywords: image registration, landmark matching, contour matching, thin plate splines
1. Introduction
Image registration can generally be classified under two main categories: landmark-based and intensity-based. Intensity-based registration matches corresponding structures between images by minimizing a distance measure that quantifies voxel similarity over the entire image domain without the need for guiding landmarks.1 As such, these methods tend to be more robust but computationally expensive.
On the other hand, landmark-based registration can be viewed simply as either an interpolation or a data-fitting problem. However, defining landmarks in medical images can be prone to errors since the selection of landmarks highly depends on the ability of the physician to mentally integrate information from different images.2–5 In addition, some organs such as the heart only have few spatially accurate and repeatable anatomical landmarks and, hence, insufficient information to guide the transformations.6 Consequently, landmark information is typically used only to match the scaling and orientation as a pre-registration step, after which intensity information is utilized to further maximize the post-registration image overlap.
Several approaches combining landmark- and intensity-based registration have already been proposed. Eriksson and Astrom introduced in Ref. 7 an intensity-based approach that focused on minimizing the sum of squared differences while restricting the solution space to thin plate spline (TPS) mappings.8–10 In Ref. 11, the normalized gradient field similarity measure was employed together with the elastic regularizer. Similar restrictions were imposed on the solution space.
However, even with these hybrid landmark- and intensity-based techniques, minimizing the amount of misregistration can still be tricky. In our previous work,12 we tried to address several of the issues associated with processing medical data with sparse landmark information by proposing a method to automatically detect interest points and an intuitive partitioning of the contours in an image. This effectively reduced the need for an expert to manually delineate points of interest (POIs) and the possibility of introducing landmark localization errors.
In this paper, we present a model for intra-modality registration that builds on one of the most commonly used landmark-based methods—TPS13–16—by simultaneously using landmark and approximate contour information. Through a comprehensive assessment of the registration results, we demonstrate that the landmark- and contour-matching model (LCM) boosts image similarity and landmark-matching and preserves the local curvature at control points better than TPS and other landmark-based techniques even in the presence of landmark localization errors.
2. Background: Thin Plate Spline Registration
TPS are a spline-based class of interpolating functions widely used in medical imaging. Introduced by Duchon in Ref. 9, TPS interpolates over scattered data while minimizing the bending energy of a thin metal plate on point constraints.10 The idea of TPS was later used in point-based registration.
Let and be the reference and template images defined on an image domain and suppose that and are landmark pairs from and , respectively. The transformation that minimizes the bending energy of a TPS while simultaneously satisfying the landmark constraints minimizes following optimization problem:
(1) |
It has been shown that the unique solution of Eq. (1) can be represented by a linear combination of radial basis functions and an affine part.8–10,17 That is, for a -dimensional registration problem, is of the form
(2) |
where . In the presence of localization errors, it is possible to relax the interpolation condition in Eq. (1) by replacing the interpolation by approximation as follows:
(3) |
The parameter in the objective function above controls the smoothness of the minimizer and the mismatch of the data points. Note that setting yields the interpolation problem in Eq. (1).
3. Proposed Landmark and Contour-Matching Model
Let and be the reference and template images with exact (major) landmarks and , respectively. Given that and are ordered sets of sampling points that trace the contours of a region of interest present in and , we aim to solve the optimization problem
(4) |
in which is a TPS transformation [Eq. (2)]. In the LCM model [Eq. (4)],
-
a.
the first term denotes the sum of squared landmark distances,
-
b.
the second term denotes the contour matching term, where
-
c.
signifies the cosine of the angle between corresponding normalized (unit) secant vectors and formed by connecting consecutive contour-approximating points in the transformed template and reference images, and
-
d.every component of the contour-matching term is bounded. In particular, for ,
Minimizing the contour-matching term is equivalent to maximizing the similarity in the orientation of corresponding unit vectors without any constraints on scaling. Thus, solving the registration problem in Eq. (4) relaxes the interpolation conditions and balances the overlap of the exact landmarks and the overall similarity between the orientation of the image contours.
An example of the setup required in the proposed LCM model is shown in Fig. 1. An extension of the model is discussed in Sec. 4.3 to accommodate three-dimensional (3D) images.
Fig. 1.
LCM model requisites. (a) Image, (b) major landmarks, (c) exact landmarks (in pink), contour-approximating points (dark gray), and vectors (light gray). Here, the number of exact landmarks is and the number of contour-approximating points is .
4. Methods
4.1. Data
Hand x-rays from Refs. 17 to 19 were used to validate the proposed LCM registration method for two-dimensional (2D) images.
Eight explanted healthy porcine hearts were used for the 3D experiments. The hearts were placed in a Plexiglass phantom filled with Fluorinert to avoid susceptibility artifacts at air–tissue interface and scanned on a 1.5T GE Signa Excite using a high-resolution head coil, as described in a previous study.20 Specifically, here, we obtained the heart anatomy from T2-weighted images (3D FSE MR pulse sequence, , , , , to 12 cm) which were reconstructed and interpolated at spatial resolution.
4.2. Landmark Detection
Prior to registration, the landmark detection method proposed in our previous work12 was used to generate a discretization of the contours present in the hand images and in the sampling short-axis slices of the cardiac volumes.
We defined the POIs as points along the edges in an image where high curvature occurs. Since the curvature measures how sharply a curve bends,21 the task of locating the POIs was simplified by instead finding where the minimum interior angle occurs [see Fig. 2(a)].
Fig. 2.
Interest point detection using interior angles. (a) The points of high curvature (POIs) along the contour of the hand have narrower interior angles. (b), (c) Interior angles in endocardial segments. When a cross-section of the RV is present, the interest points are taken to be the RV cusps. In slices where only the elliptical contours of the epicardium and LV endocardium are present, the POIs are defined to be the ends of the major axis of the LV ellipse (vertices in red and green).
In hand x-ray images, the POIs were the fingertips and the cusps in between adjacent fingers. Meanwhile, the POI within an axial cardiac slice would depend on the presence (or absence) of a cross-section of the right ventricle (RV). If a cross-section of the RV was visible like in basal and mid-cavity slices, then the POIs were given by the RV insertion points. On the other hand, in apical slices where only the LV and epicardial contours were present, curvature was maximal at the ends of the major axis of the endocardial LV ellipse [see Figs. 2(b) and 2(c)].
Finally, a discretization of each arc connecting adjacent POIs was obtained by partitioning the ordered set of connected pixels into shorter arcs of equal length. For more details, we refer the reader to Ref. 12.
4.3. Registration
For the 2D experiments, no initial registration was used. Owing to the larger deformations involved in inter-subject 3D cardiac registration, an affine pre-registration using the three repeatable landmarks was performed prior to LCM to correct the scaling and orientation of the template image.
The constrained minimization problem in Eq. (4) was solved using Newton’s method to obtain the optimal transformation parameters. At every iteration, the distances between the transformed major template landmarks and their target locations were calculated. In addition, the vectors connecting adjacent contour-approximating landmarks were normalized, and the cosine of the interior angles formed by corresponding unit vector pairs in the reference and transformed template were calculated to measure the overall similarity between the orientation of the contours present in the two images.
The exact Hessian of both the LCM terms in Eq. (4) were used in the implementation of Newton’s method.
4.4. Validation
Iterative closest point (ICP)22–25 and TPS registration were performed to provide benchmarks for the LCM technique.
4.4.1. 2D LCM registration
In experiment 1a, we observed the effect of blindly performing TPS registration by using only 11 POIs as exact landmarks. Then, in experiment 1b, we observed whether using the same number of major landmarks as in experiment 1a but adding extra contour information to be used only in the contour-matching term lessens the occurrence of unnatural bending and improves the image overlap away from the exact landmarks.
In the second set of experiments, a landmark localization error was introduced to the major template landmarks to determine the accuracy of the registration methods in the presence of a landmark localization error.
Dice coefficients, target registration errors (TRE), and interior angles of the registered images resulting from the application of ICP and TPS were then compared against those of LCM-registered images. The use of these three measures of accuracy aims to provide a comprehensive assessment of the quality of the registered images.
The Dice coefficient describes the amount of overlap between the co-registered images, whereas TRE provides a more localized measure of how well the optimal transformation obtained from each method aligns the control points. In the 2D case, TRE was computed as the distance between the location of the transformed landmark with localization error from its correct location.
A robust image registration method not only provides good image overlaps but also preserves the shape (curvature) of the reference image. Recall that the central idea behind the landmark detection method discussed in Sec. 4.2 used interior angles to characterize the curvature at a point: a small interior angle signified a point of high curvature. For this reason, we calculated the difference in the interior angle measurement at each transformed template point where a localization error was introduced and its corresponding interior angle on the reference image. A smaller difference implied that the registration method closely captured the target local curvature.
4.4.2. 3D Analog of LCM registration for cardiac volumes
The proposed model was modified to accommodate the registration of the same set of 3D cardiac images used in Refs. 12 and 26.
Surface-approximating landmarks were detected prior to LCM registration. In every sampling slice, points along the free wall of the RV, the interventricular septum, and the left ventricular myocardium were chosen based on their location with respect to points of maximum curvature within the short-axis slice as discussed in Sec. 4.2 [see also Figs. 2(b) and 2(c)].
Note that connecting adjacent landmarks resulted to the formation of approximate myocardial contours that resembled the latitude and longitude of the Earth’s lower hemisphere [Fig. 3(a)]. This meant that each approximate landmark could be associated with two vectors: one parallel to the short axis of the heart (), and the other extending from the approximate landmark to its corresponding point in the next sampling slice (). Thus, given surface-approximating landmarks, we defined the 3D analog of the contour-matching term of the proposed LCM model [Eq. (4)] specifically for our cardiac dataset as
(5) |
Aside from calculating the improvement of image overlap in terms of Dice coefficients, we computed the average TRE with respect to the three repeatable cardiac landmarks, namely the left ventricular apex , and the two right ventriculo-septal junctions and [Figs. 3(b)–3(c)]. Similar to the 2D experiments, we compared the quality of LCM- versus ICP- and TPS-registered images.
Fig. 3.
Landmark and surface-matching (LCM) model requisites. (a) Details of the required setup for 3D LCM registration: heart with longitudinal and latitudinal vectors at each surface point. (b), (c) Actual LCM setup for two hearts in the dataset with latitudinal and longitudinal segments connecting adjacent surface points with the repeatable landmarks , , and .
5. Results
5.1. 2D LCM Registration
The results of the first set of experiments are displayed in Fig. 4(a). Imposing only a few hard constraints in TPS registration produced images where the fingers were slightly bent. exact landmarks were used in experiment 1.
Fig. 4.
Experiment 1. Comparison of TPS and LCM registration accuracy when no errors are present in the landmark data. (a) Results of experiment 1a, (b) results of experiment 1b. (c) LCM registration results. Pre-registration Dice = 0.64. (First column) Reference image with exact and contour-approximating landmarks, (second column) registered image, (third column) post-registration subtraction image , (fourth column) optimal transformation. Bending, ridges along the finger contours, and bone deformities are present in the TPS-registered images in (a) and (b). Notably, the LCM-registered image in (c) does not suffer from such deformities.
Next, 55 contour-approximating landmarks were used as exact landmarks in the TPS interpolation problem to determine whether an increase in the number of exact landmark correspondences results to an improvement in the registration accuracy. While the Dice similarity coefficient did increase, irregularities were present in the transformed images. Notice that the metacarpophalangeal joints of the middle and ring fingers were distorted by the registration transformation [Fig. 4(b)].
In contrast, LCM registration led to an improved Dice similarity coefficient compared to experiment 1a and a more visually accurate transformed template [Fig. 4(c)]. More specifically, there were no apparent deformities such as bent fingers and distorted bones in the LCM-registered images.
Exemplary results from experiment 2 are provided in Fig. 5. Each column in said figure corresponds to a set of experiments where a localization error was introduced to one of the 11 of the major landmarks. Displayed in the third and fifth rows are ICP registration results with different numbers of landmarks, while the fourth and sixth rows are the TPS results for the same landmark sets—this time treated as hard constraints. The last row shows LCM-registered images for each experiment.
Fig. 5.
ICP versus TPS versus LCM comparisons for experiment 2, where a localization error was introduced to . (a) Template image; (b) and (d) ICP-registered images, and (c) and (e) TPS-registered images with and exact landmarks, respectively; (f) LCM-registered images with , exact and contour-approximating landmarks. Direct application of ICP and TPS interpolation led to misregistrations. LCM mitigates the effect of the LM error.
ICP failed to sufficiently align the images. The optimal ICP transformation was significantly impacted by the introduction of a localization error to one of the major landmarks. Of the three methods, it yielded the lowest image overlaps and the largest TREs. This is not surprising due to the fact that ICP only provides rigid transformations, which are not suitable when the control points move locally.
The TREs associated with different configurations for experiment 2 (e.g., registration method used, location of major landmark error, number of contour-approximating points used, etc.) can be found in Table 1. Observe that while increasing the number of exact landmark-matching conditions for TPS sometimes led to smaller TREs, it did not necessarily guarantee a visually accurate transformed template as demonstrated in row 6 of Fig. 5.
Table 1.
TREs resulting from experiment 2, where a localization error was introduced to one of the major LMs .
Experiment 2 TREs | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Major landmark with error | ||||||||||||
Mean TRE | ||||||||||||
14.85 | 13.21 | 25.51 | 6.81 | 19.43 | 0.98 | 15.88 | 8.55 | 11.62 | 39.32 | 12.44 | 15.33 | |
13.39 | 11.21 | 8.51 | 11.56 | 9.27 | 7.15 | 5.85 | 6.07 | 5.87 | 10.03 | 13.64 | 9.32 | |
21.30 | 5.35 | 21.95 | 7.81 | 16.66 | 6.73 | 16.61 | 8.76 | 15.36 | 28.63 | 14.52 | 14.88 | |
4.18 | 3.97 | 5.12 | 5.59 | 7.13 | 2.80 | 3.84 | 4.70 | 2.01 | 3.72 | 3.98 | 4.28 | |
4.51 | 4.66 | 1.55 | 3.29 | 5.19 | 4.20 | 4.67 | 4.10 | 5.52 | 8.90 | 5.51 | 3.38 |
When analyzing the results of experiment 2 (with one landmark localization error), it is important to note that TPS registration, at its core, is just an interpolation technique. Therefore, blindly applying the technique would naturally result to misregistrations.
One way to quantify the amount of misregistration at every major landmark is by measuring the interior angle at the transformed major landmark and comparing it against the interior angle at its corresponding reference landmark (Fig. 6). A small difference in the angle measurements implies that the local radius of curvature at the reference landmark was induced by the registration method.
Fig. 6.
Interior angle (in yellow) as a measure of the local curvature. (a) Reference, (b) ICP-registered, (c) TPS-registered, and (d) LCM-registered images. A small difference in interior angles with respect to the reference indicates that the local radius of curvature at the major landmark was preserved by the registration method despite the presence of errors. The average post-registration differences in interior angle measurement were , , and .
The average post-registration differences in interior angle measurement from the three methods were , , and . These results indicated that our method preserved the local curvature at the major landmarks and mitigated the appearance of deformities in the transformed template better than the benchmarks did.
In summary, the proposed LCM method outperformed the ICP and TPS methods. It resulted in better post-registration Dice (PRD) image similarities, lower average TREs, and transformed images without abnormalities even in the presence of a landmark error.
5.2. 3D Analog of LCM Registration for Cardiac Volumes
We now present the results of the modified version of the LCM registration method specifically designed for 3D cardiac registration.
Exemplary results are shown in Figs. 7–8, along with cross-sections of the template, registered templates, and their corresponding difference images with respect to the reference image. Once again, rigid ICP transformations failed to properly register cardiac images from different subjects [Figs. 7(g) and 8(g)]. TPS-registered images manifested deformities similar to those observed in the 2D hands experiments. Such deformities were more noticeable when viewing short-axis slices of the registered images, whose edges exhibited ridges even when the original template edges were smooth [Figs. 7(h) and 8(h)]. In contrast, the registered images obtained through LCM registration [Figs. 7(i) and 8(i)] were free from such deformities and instead had smoother edges.
Fig. 7.
3D registration. (a)–(e) 3D view of the reference, template, ICP-, TPS-, and LCM-registered images, (f) short-axis slices of the template and pre-registration difference images, (g) short-axis slices of the ICP-transformed template and difference images with respect to the reference, (h) short-axis slices of the TPS-transformed template and difference images with respect to the reference, and (i) short-axis slices of the LCM-transformed template and difference images with respect to the reference, .
Fig. 8.
3D registration. (a)–(e) 3D view of the reference, template, ICP-, TPS-, and LCM-registered images, (f) short-axis slices of the template and pre-registration difference images, (g) short-axis slices of the ICP-transformed template and difference images with respect to the reference, (h) short-axis slices of the TPS-transformed template and difference images with respect to the reference, and (i) short-axis slices of the LCM-transformed template and difference images with respect to the reference, .
TREs were calculated and summarized in Table 2 to measure the performance of the 3D LCM model when coupled with the proposed setup. The average pre-registration TRE decreased from 27.12 to 0.01 mm after LCM registration. The maximum post-LCM TRE across all possible reference-template pairings was 0.0977 mm. We report a 112%-average improvement in Dice similarity coefficients after implementing the proposed method.
Table 2.
Comparison of PRD similarity and TREs. TREs are expressed in terms of the voxel locations of the three repeatable landmarks shown in Fig. 3. Mean improvement refers to the percentage change (in PRD/TRE) across all possible reference-template image pairings. For PRD, a higher mean improvement is better. It means that image overlap increased after registration. On the other hand, a smaller post-registration TRE implies a better alignment of the repeatable landmarks.
Post-3D cardiac registration Dice and TRE | ||||||
---|---|---|---|---|---|---|
PRD (higher is better) | Average post-reg. TRE (lower is better) | |||||
Mean | SD | Mean improvement | Mean | SD | Mean improvement | |
ICP | 0.54 | 0.22 | 0.22 | 23.46 | 13.29 | −0.10 |
TPS | 0.91 | 0.04 | 1.37 | 0 | 0 | −1.0 |
LCM | 0.83 | 0.08 | 1.12 | 0.01 | 0.01 | −0.87 |
6. Conclusions and Future Work
We proposed a new registration model that used contour-approximating landmarks to supplement missing edge information in between defined landmarks. We demonstrated that the model was able to circumvent drawbacks associated with the straightforward application of the ICP and TPS registration techniques.
The LCM method was shown to increase the PRD similarity between the reference and registered template by improving the image overlap away from major landmarks. Consequently, this reduced the appearance of the unnatural bending in image regions bordered by the data interpolation points (major landmark locations).
We then showed that naively increasing the number of interpolation conditions did not always guarantee a clinically accurate registration result. Doing so resulted in an ill-conditioned problem,27 made the ICP and TPS techniques computationally more expensive, and caused visual deformities in the transformed template. Meanwhile, solving the LCM registration problem given a small number of exact landmarks and supplementary approximate contour information provided accurate results.
The cardiac interest point and surface-approximating method proposed in Ref. 12, together with a 3D extension of the 2D LCM model, provided a complete framework for cardiac image registration that reduced the need to manually delineate anatomical landmarks and supplied a dense collection of reference-template point clouds to facilitate image alignment.
Interior angle measurements were also employed to assess the performance of the registration methods in terms of preserving the local curvature at landmarks with localization errors. We found that TPS failed this last test, while the proposed method induced interior angles that were closest to those in the reference image. This meant that it further mitigated the appearance of deformities in the registered images and captured the desired local curvature.
Overall, the LCM model increases the flexibility of the TPS approach especially when only a few repeatable landmarks can be defined, when defining too many landmarks leads to high oscillations in the registration transformations, or when the identification of exact landmarks is susceptible to human error.
We remark that our methods are currently limited to high-contrast medical images that can be easily segmented through intensity thresholding. Future work includes the improvement of the segmentation and classification steps (as in Refs. 28–30) to allow the proposed pipeline to accommodate the co-registration of ex-vivo and in-vivo cardiovascular MR images. For instance, such steps would be useful for computational applications employing predictive simulations that would require the registration of our previously developed high-resolution ex-vivo DTI-based cardiac fiber atlas26 to in-vivo MRI-based 3D heart models. In line with this, we also aim to make landmark detection and segmentation in 3D cardiac images more robust by including an LV chamber ellipsoid-fitting as a preprocessing step. This would allow the extension of the interest point detection method to accommodate cardiac volumes that were imaged with a significant tilt relative to the -axis.
Acknowledgments
This work was supported in part by an NSERC Discovery development grant for Dr. Mehran Ebrahimi, and a Canadian Institutes of Health Research (CIHR) project grant for Dr. Mihaela Pop. Mia Mojica was supported by an Ontario Trillium Scholarship (OTS).
Biographies
Mia Mojica is a data analyst at the Slaight Family Centre for Advanced MRI, Toronto Western Hospital. She received her MSc in applied mathematics from the University of the Philippines in 2013 and has recently received her PhD in modeling and computational science (Ontario Tech University). Her research interests lie in the intersection of numerical analysis, mathematical imaging, and its applications. Since 2009, she has been working on inverse problems in image reconstruction.
Mihaela Pop is currently a visiting scientist at Inria (France) and Sunnybrook Research Institute Toronto (Canada). She received her MSc and PhD degrees in medical biophysics from the University of Toronto. Her preclinical research is focused on identifying arrhythmia foci in infarcted hearts using high resolution cardiac MR imaging methods combined with electrophysiological modeling. She is co-founder and chair of the STACOM workshop and on the board of directors of FIMH (Functional Imaging and Modelling of Heart) forum.
Mehran Ebrahimi is an associate professor in the Faculty of Science at Ontario Tech University, Oshawa, Ontario, Canada. He received his PhD in applied mathematics from the University of Waterloo, Canada, in 2008. His research interest includes medical image analysis and inverse problems in imaging. His research is supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).
Disclosures
The authors have no conflicts of interest to disclose.
Contributor Information
Mia Mojica, Email: mia.mojica@ontariotechu.net.
Mihaela Pop, Email: Mihaela. Pop@utoronto.ca.
Mehran Ebrahimi, Email: mehran.ebrahimi@uoit.ca.
Data, Materials, and Code Availability
The code used to generate the results and figures is available in a Dropbox repository.
References
- 1.Fischer B., Modersitzki J., “Combining landmark and intensity driven registrations,” Proc. Appl. Math. Mech. 3(1), 32–35 (2003). 10.1002/pamm.200310309 [DOI] [Google Scholar]
- 2.Makela T., et al. , “A review of cardiac image registration methods,” IEEE Trans. Med. Imaging 21(9), 1011–1021 (2002). 10.1109/TMI.2002.804441 [DOI] [PubMed] [Google Scholar]
- 3.Maintz J. A., Viergever M. A., “An overview of medical image registration methods,” in Symp. Belgian Hosp. Phys. Assoc. (SBPH/BVZF), Citeseer, Vol. 12(V), p. 1–22 (1996). [Google Scholar]
- 4.Tang L., Hamarneh G., “Medical image registration: a review,” Med. Imaging: Technol. Appl. 1, 619–660 (2017). 10.1201/b15511-22 [DOI] [Google Scholar]
- 5.Fischer B., Modersitzki J., “Ill-posed medicine–an introduction to image registration,” Inverse Prob. 24(3), 034008 (2008). 10.1088/0266-5611/24/3/034008 [DOI] [Google Scholar]
- 6.Peyrat J.-M., et al. , “A computational framework for the statistical analysis of cardiac diffusion tensors: application to a small database of canine hearts,” IEEE Trans. Med. Imaging 26(11), 1500–1514 (2007). 10.1109/TMI.2007.907286 [DOI] [PubMed] [Google Scholar]
- 7.Eriksson A. P., Astrom K., “Bijective image registration using thin-plate splines,” in 18th Int. Conf. Pattern Recognit. (ICPR’06), IEEE, Vol. 3, pp. 798–801 (2006). 10.1109/ICPR.2006.323 [DOI] [Google Scholar]
- 8.Wahba G., Spline Models for Observational Data, Vol. 59, SIAM; (1990). [Google Scholar]
- 9.Duchon J., “Splines minimizing rotation-invariant semi-norms in Sobolev spaces,” in Constructive Theory of Functions of Several Variables, Lecture Notes in Mathematics, vol. 571, Schempp W., Zeller K., Eds., pp. 85–100, Springer, Berlin, Heidelberg: (1977). [Google Scholar]
- 10.Bookstein F. L., “Principal warps: thin-plate splines and the decomposition of deformations,” IEEE Trans. Pattern Anal. Mach. Intell. 11(6), 567–585 (1989). 10.1109/34.24792 [DOI] [Google Scholar]
- 11.Lange T., et al. , “3D ultrasound-CT registration of the liver using combined landmark-intensity information,” Int. J. Comput. Assist. Radiol. Surg. 4(1), 79–88 (2009). 10.1007/s11548-008-0270-1 [DOI] [PubMed] [Google Scholar]
- 12.Mojica M., Pop M., Ebrahimi M., “Automatic detection of landmarks for fast cardiac MR image registration,” Lect. Notes Comput. Sci. 12592, 87–96 (2021). 10.1007/978-3-030-68107-4_9 [DOI] [Google Scholar]
- 13.Donato G., Belongie S., “Approximate thin plate spline mappings,” in Eur. Conf. Comput. Vision, Springer, pp. 21–31 (2002). [Google Scholar]
- 14.Sibson R., Stone G., “Computation of thin-plate splines,” SIAM J. Sci. Stat. Comput. 12(6), 1304–1313 (1991). 10.1137/0912070 [DOI] [Google Scholar]
- 15.Lepot M., Aubin J.-B., Clemens F. H., “Interpolation in time series: an introductive overview of existing methods, their performance criteria and uncertainty assessment,” Water 9(10), 796 (2017). 10.3390/w9100796 [DOI] [Google Scholar]
- 16.Zhao J., Gong Y., “An improved non-rigid registration algorithm for SAR image based on thin plate spline,” Proc. SPIE 11373, 1137316 (2020). 10.1117/12.2557330 [DOI] [Google Scholar]
- 17.Modersitzki J., FAIR: Flexible Algorithms for Image Registration, Vol. 6, SIAM; (2009). [Google Scholar]
- 18.Amit Y., “A nonlinear variational problem for image matching,” SIAM J. Sci. Comput. 15(1), 207–224 (1994). 10.1137/0915014 [DOI] [Google Scholar]
- 19.Modersitzki J., Numerical Methods for Image Registration, Oxford University Press on Demand; (2004). [Google Scholar]
- 20.Pop M., et al. , “Quantification of fibrosis in infarcted swine hearts by ex vivo late gadolinium-enhancement and diffusion-weighted MRI methods,” Phys. Med. Biol. 58(15), 5009 (2013). 10.1088/0031-9155/58/15/5009 [DOI] [PubMed] [Google Scholar]
- 21.Anton H., et al. , Calculus: Early Transcendentals, Wiley, Hoboken, New Jersey: (2010). [Google Scholar]
- 22.Bergström P., Edlund O., “Robust registration of point sets using iteratively reweighted least squares,” Comput. Optim. Appl. 58(3), 543–561 (2014). 10.1007/s10589-014-9643-2 [DOI] [Google Scholar]
- 23.Bergström P., Edlund O., “Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach,” Numer. Algorithms 74(3), 755–779 (2017). 10.1007/s11075-016-0170-3 [DOI] [Google Scholar]
- 24.Wilm J., “Iterative closest point,” https://www.mathworks.com/matlabcentral/fileexchange/27804-iterative-closest-point.
- 25.Bergström P., Edlund O., “Robust registration of point sets using iteratively reweighted least squares,” Comput. Optim. Appl. 58, 543–561 (2014). 10.1007/s10589-014-9643-2 [DOI] [Google Scholar]
- 26.Mojica M., et al. , “Novel atlas of fiber directions built from ex-vivo diffusion tensor images of porcine hearts,” Comput. Methods Prog. Biomed. 187, 105200 (2020). 10.1016/j.cmpb.2019.105200 [DOI] [PubMed] [Google Scholar]
- 27.Mattes J., Fieres J., Eils R., “Shape-adapted motion model based on thin-plate splines and point clustering for point set registration,” Proc. SPIE 4684, 518–527 (2002). 10.1117/12.467194 [DOI] [Google Scholar]
- 28.Schaerer J., et al. , “A dynamic elastic model for segmentation and tracking of the heart in MR image sequences,” Med. Image Anal. 14(6), 738–749 (2010). 10.1016/j.media.2010.05.009 [DOI] [PubMed] [Google Scholar]
- 29.Dangi S., Linte C. A., Yaniv Z., “Cine cardiac MRI slice misalignment correction towards full 3D left ventricle segmentation,” Proc. SPIE 10576, 1057607 (2018). 10.1117/12.2294936 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 30.Upendra R. R., Simon R., Linte C. A., “Joint deep learning framework for image registration and segmentation of late gadolinium enhanced MRI and cine cardiac MRI,” Proc. SPIE 11598, 115980F (2021). 10.1117/12.2581386 [DOI] [PMC free article] [PubMed] [Google Scholar]