Skip to main content
NIHPA Author Manuscripts logoLink to NIHPA Author Manuscripts
. Author manuscript; available in PMC: 2026 Jul 31.
Published in final edited form as: IEEE Trans Med Imaging. 2026 Jul;45(7):3586–3597. doi: 10.1109/TMI.2026.3680352

A 3D Cross-modal Keypoint Descriptor for MR-US Matching and Registration

Daniil Morozov 1,2, Reuben Dorent 3, Nazim Haouchine 4
PMCID: PMC13422698  NIHMSID: NIHMS2195333  PMID: 41931430

Abstract

Intraoperative registration of real-time ultrasound (iUS) to preoperative Magnetic Resonance Imaging (MRI) remains an unsolved problem due to severe modality-specific differences in appearance, resolution, and field-of-view. To address this, we propose a novel 3D cross-modal keypoint descriptor for MRI–iUS matching and registration. Our approach employs a patient-specific matching-by-synthesis approach, generating synthetic iUS volumes from preoperative MRI. This enables supervised contrastive training to learn a shared descriptor space. A probabilistic keypoint detection strategy is then employed to identify anatomically salient and modality-consistent locations. During training, a curriculum-based triplet loss with dynamic hard negative mining is used to learn descriptors that are i) robust to iUS artifacts such as speckle noise and limited coverage, and ii) rotation-invariant. At inference, the method detects keypoints in MR and real iUS images and identifies sparse matches, which are then used to perform rigid registration. Our approach is evaluated using 3D MRI-iUS pairs from the ReMIND dataset. Experiments show that our approach outperforms state-of-the-art keypoint matching methods across 11 patients, with an average precision of 69.8%. For image registration, our method achieves a competitive mean Target Registration Error of 2.39 mm on the ReMIND2Reg benchmark. Compared to existing iUS–MR registration approaches, our framework is interpretable, requires no manual initialization, and shows robustness to iUS field-of-view variation. Code, data and model weights are available at https://github.com/morozovdd/CrossKEY.

Keywords: Cross-modality, 3D Keypoint Descriptor, MRI, Ultrasound, Matching and Registration

I. Introduction

Matching images across different modalities remains a fundamental challenge in medical imaging due to significant appearance differences between modalities [1]. This challenge underpins a variety of clinical and research applications, including content-based image retrieval [1], [2], slice-to-volume reconstruction [3], and deformable image registration [4]–[8].

In the context of image-guided surgery, registering images from complementary modalities enables the fusion of distinct anatomical and functional information, improving the intraoperative identification of critical structures and ultimately surgical outcomes [9]. A representative example is neurosurgery, where real-time intraoperative ultrasound (iUS) is commonly registered with preoperative Magnetic Resonance Imaging (MRI) to compensate for intraoperative brain shift and refine tumor localization [10], [11].

One strategy to bridge modality-specific appearance gaps is to abstract each image using keypoints [1], [4], [12], [13], segmentations [14], or latent representations [15], [16]. When appropriately leveraged, such abstractions can facilitate multimodal medical image registration. In this work, we focus on keypoint-based multimodal approaches, where correspondences are automatically established between a sparse set of salient keypoints detected from each image. Keypoints are particularly well-suited for scenarios involving partially observed or resected anatomy, such as in intraoperative imaging, and remain effective under non-rigid deformations [17], [18]. They also offer a key interpretability advantage, as matched keypoints can be directly visualized and assessed for anatomical plausibility [4], [17]. The field of multimodal keypoint matching has seen substantial investigation [1], with successful applications to medical imaging. Nonetheless, existing methods are often limited to 2D applications or to images where the intensity distributions across modalities remain relatively consistent. In contrast, aligning preoperative MRI with iUS images presents a particularly challenging scenario due to the large modality gap [19]. MRI and iUS differ not only in terms of information they capture (morphological versus echo-based), but also in resolution, acquisition, and noise characteristics [5]. While MRI produces high-resolution 3D volumes with strong soft-tissue contrast derived from pulse sequence parameters, iUS provides partial and noisy views formed through acoustic wave reflections, often with limited field-of-view (FoV). Bridging this gap requires not only handling large appearance gaps but also addressing 3D-specific challenges, including rotational and FoV variability.

Contributions.

We propose a novel cross-modal 3D keypoint descriptor specifically designed for matching preoperative MR and iUS volumes. Our main contributions are as follows:

  • A matching-by-synthesis strategy in which synthetic iUS images are generated from the patient’s own MR volume and used to train a cross-modality descriptor network.

  • A cross-modal keypoint detector in the form of saliency heatmaps, constructed by accumulating keypoint presence across synthetic iUS and MR volumes, followed by a probabilistic aggregation to estimate keypoint saliency and consistency across modalities.

  • A supervised contrastive framework with curriculum learning, enforcing robustness to iUS appearance variability, speckle noise, rotation, and FoV changes.

This work is a substantial extension of our conference paper [12]. Key improvements include: (1) an extension to fully 3D matching; (2) a novel contrastive learning formulation; and (3) expanded experimental validation, including ablation studies and quantitative evaluation on image registration. While individual components build on prior work, the primary novelty lies in a patient-specific, 3D matching-by-synthesis framework, in which the expected appearance of an intraoperative modality is synthesized from preoperative imaging to construct a cross-modal descriptor tailored to a single patient.

II. Related Works

Cross-modal keypoint matching can take various forms [1]. Some are designed for multi-spectral settings, such as matching near-infrared images with visible-light images [20]. Others focus on visible-to-infrared matching [21] or RGB-to-depth maps or satellite imagery [1]. Arguably, temporal variations [22], where the same scene is observed at different times of the day or year, can also be considered a type of multimodality when dealing with extreme cases. A further distinction can be made with medical imaging modalities due to the inherently dynamic and heterogeneous nature of tissue appearance [7], [23]. The visibility of anatomical structures such as parenchyma, tumors, bones, fluids, and vessels, as well as functionally relevant tissues such as gray matter, white matter, and fiber tracts, varies significantly across imaging modalities (e.g., MRI, CT, iUS, PET, fMRI, or SPECT), posing unique challenges for descriptor design used for matching that need to generalize beyond appearance and toward shared structural, functional or semantic information [15], [24].

Multimodal Matching of 2D Medical Images:

Methods addressing multimodal matching of medical images were initially developed for retinal imaging for fundus-FA or fundus-OCT registration. Early handcrafted descriptors like PIIFD [25] have since been outperformed by learning-based methods [26]–[28], offering enhanced robustness to intensity variations, rotation, and sparse annotations through end-to-end keypoint learning. In [29], an end-to-end self-supervised Siamese CNN was proposed for detecting and matching anatomical landmarks in pairs of 2D lower abdominal CT slices. The network jointly learns keypoint locations and descriptors, achieving high-density correspondences under intensity, affine, and elastic transformations. Diffusion-guided image registration leveraging features from off-the-shelf diffusion models was proposed in [17]. The model was pretrained on natural RGB images as a semantic similarity measure for deformable matching. Applied to both multimodal 2D Dual-energy X-ray to X-ray and monomodal MRI (2D slices) matching, their approach enables anatomically meaningful alignment even in cases of missing anatomy. Recently, we proposed a Siamese architecture based on a contrastive learning strategy [12] to learn to match 2D keypoints between preoperative MRI and iUS image. This 2D method showed robustness to speckle appearance changes. In parallel to keypoint descriptors, recent foundational models for multimodal matching have demonstrated impressive results in medical imaging. Approaches such as MINIMA [13] and MatchAnything [30], both based on Transformer architectures, leverage large-scale synthetic datasets to enable modality-invariant correspondence across a wide range of tasks, including intra-modality MRI (PD–T1, PD–T2, T1–T2), cross-modality structural and functional imaging (MRI–PET, CT–SPECT), and diverse modality pairs such as CT–MRI, PET–MRI, and fundus–OCT or fundus–FA, without requiring task-specific tuning. However, since most medical 2D images represent slices of 3D volumes rather than 2D projections of 3D scenes, these 2D keypoint methods are inherently limited as they assume that both images lie on the same anatomical plane in addition to not accounting for 3D deformations.

Keypoints Matching for 3D Images and Volumes:

Less attention has been given to three-dimensional data. Prior efforts to extend conventional 2D descriptors to 3D such as Harris [31], SIFT [32], SIFT-rank [33] and SURF [34] have highlighted unique challenges in 3D, where orientation, sampling, and viewpoint changes become more complex, increasing computational cost. More advanced approaches were therefore proposed, combining, for example, the Förstner operator with Normalized Gradient Fields (NGF) to detect and describe 3D keypoints in CT images [35], with successful use in registration. For CT matching, recent deep learning methods have shown that self-supervised training on synthetic 3D patch deformations [18] or affine transformations [36] significantly improves matching and registration performance. One of the first multimodal 3D descriptors, MIND [7], leverages patch-based self-similarity to enable deformable multimodal registration, originally for MRI–CT and more recently for MRI–iUS. Recently, KeyMorph [4], and its foundational variant BrainMorph [37], tackled varying MRI contrasts by learning anatomically semantic keypoints in an unsupervised manner and computing transformations in closed form, enabling robust and interpretable alignment. Evaluated on brain MRI with varying contrasts (T1, T2, and PD-weighted), the method improves performance under large misalignments and across various contrast pairs. 2D/3D keypoint-based methods have also been proposed for multimodal volume-to-image registration using learned, detector-free features. Notable examples include automatic registration of X-ray to CT images [38] and freehand iUS to preoperative MRI volumes [39]. These approaches eliminate the need for manual initialization typically required by optimization-based methods and are robust to limited or noisy training data, making them particularly suitable for intraoperative settings.

Most existing work on keypoint matching is complementary to image registration, while addressing a distinct subproblem. Keypoint matching aims to establish sparse but reliable correspondences, whereas image registration integrates these correspondences globally through optimization and regularization. In our framework, matching precision and spatial coverage directly influence downstream registration robustness, particularly in the presence of large cross-modal appearance changes. This motivates our focus on improving cross-modal correspondences as a prerequisite for reliable registration.

III. Methods

A. Problem Formulation, Challenges and Strategy

Problem formulation:

Our method detects, describes and predicts a partial assignment between two sets of keypoints extracted from a 3D pre-operative MR volume IMR∈RΩ and a 3D iUS volume IUS∈RΩ, where Ω denotes the spatial domain. Each keypoint i is composed of a 3D point position pi=(x,y,z)∈[0,1]3, normalized by the image size, and a descriptor di∈Rd that characterizes the local 3D information. Images IMR and IUS have N and M keypoints, independently detected. Given these two sets of keypoints, we seek a partial assignment matrix P∈{0,1}N×M between keypoints in IMR and IUS. Each keypoint can be matched at most once, as it originates from a unique 3D position, and some keypoints cannot have valid correspondences, due to occlusion or non-repeatability. The assignment matrix P is thus sparse.

Challenges:

Current methods typically require large amounts of paired training data with known correspondences to learn robust and generalizable keypoints. However, applying such general-purpose models out-of-the-box to new modalities or clinical scenarios, such as MR and iUS volumes, remains challenging, as their performance heavily depends on exposure to sufficient representative data during training. In particular, acquiring accurate 3D correspondences between MR and iUS volumes demands rare clinical expertise and is time-consuming, limiting the feasibility of building such large paired datasets. An alternative is to train deep keypoint detectors and descriptors on co-registered MR-iUS volume pairs. Yet, even when large-scale datasets are available, they often lack the precise MR-iUS co-registration necessary for accurate modeling, making this a persistent bottleneck.

A patient-specific, matching-by-synthesis strategy:

Instead of designing a general framework to build P, we propose to design a patient-specific approach for detecting, describing and matching keypoints between iUS and preoperative MR volumes. Patient-specific training has demonstrated superior performance over patient-agnostic approaches in cases where the preoperative image is informative and the intraoperative image can be reliably synthesized [40]–[42]. In our context, we propose to leverage synthetic iUS volumes generated from preoperative MRI to 1) identify keypoints that are salient and common across modalities; 2) describe the local information in a cross-modal manner using contrastive learning; and 3) match the most discriminative correspondences. At inference, our trained approach is used to identify a set of correspondences between preoperative MRI and real iUS images. Figure 2 illustrates our method.

Fig. 2: Method overview.

Fig. 2:

(a) Synthetic iUS volumes are generated from preoperative MRI using MMHVAE. (b) A cross-modal saliency map Pres is constructed by aggregating keypoint statistics from synthetic iUS and MRI, then modulated by a spatial prior Mw. (c) A Siamese network is trained with triplet loss on multi-modal patch pairs to produce cross-modal descriptors. (d) Descriptor matching is performed using nearest-neighbor search, followed by a partial assignment between sampled keypoints in MRI and iUS. Keypoints are sampled from the learned saliency distribution in MRI and uniformly in the real iUS.

B. Creating the Patient-Specific Training Set

Since iUS images cannot be acquired prior to brain surgery, we propose to construct a paired training set of preoperative MR and iUS volumes by synthesizing iUS from MR images. To this end, we leverage the recently proposed MMHVAE framework [16], a hierarchical variational auto-encoder designed for incomplete multimodal data, to generate realistic iUS from preoperative MRI. This framework is particularly well-suited to our task because 1) it can handle incomplete multi-parametric MR inputs, a frequent scenario in clinical settings, and 2) it enables the generation of synthetic iUS images with diverse appearances (e.g., varying texture and speckle patterns) by adjusting the scale parameter γ of the standard deviations within its hierarchical latent structure. Figure 3 provides qualitative comparisons between real and synthetic intraoperative ultrasound volumes, illustrating structural realism across modalities.

Fig. 3:

Fig. 3:

Synthetic US image generations for three different T2 MR images (One case per row) using MMHVAE [16]. The first column shows T2 MR; the middle columns show samples of synthetic US images generated using different combinations of T2, T1, and FLAIR with different speckles; the last column shows the ground truth US image.

To build a large and diverse dataset that encourages generalization to real US, we exploit both of these properties. Specifically, let us assume we have access to K preoperative MR sequences among T1, T2 and T2-FLAIR, we synthesize iUS for each of the 2K−1 combinations of MR sequences and for multiple values of the scale parameter γ∈{0.3,0.5,0.7,1}. This leads to the creation of a dataset of synthetic iUS images with different appearances denoted as 𝒟synUS:={IsynUS(k)}k=14×2K−1.

The MMHVAE synthesis module is trained once as a general model on patients distinct from those used for descriptor learning and registration, and is not retrained per patient. This separation enables cross-patient generalization at the synthesis level while preserving patient-specific optimization for matching.

C. Keypoint Detection and Sampling Strategy

We seek to identify keypoints that serve two complementary objectives: 1) sampling pairs of positive and negative correspondences between MR and iUS to train a deep cross-modal descriptor with effective patch-based augmentation, and 2) providing a spatial prior during inference to select informative keypoints in the pre-operative MR image. To fulfill these goals, keypoints must satisfy three main criteria: (i) be located in salient regions to ensure discriminativeness, (ii) be consistent across modalities for efficient cross-modal matching, and (iii) be spatially diverse to enhance training variability and avoid false negative pairs. To this end, we introduce a novel stochastic detection strategy based on a probabilistic cross-modal saliency map.

1). Initial independent detection:

We begin by detecting salient keypoints independently in the preoperative MR volume IMR and in the synthetic iUS dataset 𝒟synUS using SIFT3D [43], a volumetric extension of the classical SIFT algorithm. While SIFT3D is effective at detecting texture-rich regions, its sensitivity to modality-specific appearance, such as the differences between MR and iUS, result in poor consistency between cross-modal detections. This motivates the need for a joint keypoint detection strategy that accounts for saliency across modalities.

2). Constructing cross-modal saliency heatmaps:

We propose a cross-modal saliency heatmap by aggregating spatial statistics of SIFT3D keypoints across MR and synthetic iUS pairs. Specifically, for each synthetic iUS volume IsynUS(k)∈𝒟synUS, we compute a descriptor presence mask MsynUS(k)∈{0,1}Ω, where Mv,synUS(k)=1 if a SIFT3D keypoint is detected at voxel v, and 0 otherwise. We then construct a heatmap PUS by summing the presence masks over the full synthetic dataset, i.e. PUS=∑k=14×2K−1MsynUS(k); applying a Gaussian smoothing filter (σ=2) to PUS, then normalizing the resulting volume to the range [0, 1]. This heatmap highlights salient regions stable across synthetic iUS appearances.

To account for salient regions in pre-operative MRI, a heatmap PMR is similarly constructed by smoothing and normalizing the descriptor presence mask of IMR. We then fuse the modality-specific saliency maps into a joint saliency map Pcomb using a probabilistic OR operation: Pcomb=1−1−PMR1−PUS, increasing the likelihood of a voxel being considered discriminative if it is salient in at least one modality, and even more so when it is salient in both.

3). Applying a spatial prior:

To constrain sampling to clinically relevant regions and avoid off-field points in iUS, we apply a spatially-weighted FoV mask Mw. This mask is constructed by computing the Euclidean distance from each voxel to the center of mass of the iUS FoV, followed by Gaussian smoothing to emphasize central regions. The resulting residual saliency map is Pres=Pcomb⋅Mw

4). Sampling training keypoints:

During training, keypoints are randomly sampled from the residual saliency map Pres via a sequential rejection sampling procedure. The sampling procedure is designed to enforce spatial and FoV coverage constraints. Specifically, the goal is to obtain a set of N keypoints satisfying the following conditions: C1) For each keypoint i, at least 80% of the corresponding patch centered at pi lies within the iUS FoV; C2) The Euclidean distance between any pair of selected keypoints pi and pj (with i≠j) is at least 2mm, ensuring spatial diversity and preventing false negative correspondences (see Figure 2).

D. Cross-Modal 3D Feature Descriptor

To design the cross-modal 3D descriptor, we employ a contrastive learning approach based on a Siamese deep learning architecture that maps patches from the MRI or iUS domain, to a d-dimensional feature space. This shared feature space is designed to ensure that patches centered at corresponding anatomical locations in MRI and iUS produce similar descriptors and that feature descriptors are anatomically discriminative, to enable differentiation between distinct anatomical regions.

1). Patch extraction and feature descriptors:

Given a set of N keypoints, we extract cubic patches of size s3 centered at each location pi. Since the pre-operative MR and synthetic iUS volumes are spatially co-registered, positive training pairs viMR,viUS can be extracted, consisting of an anchor MR patch viMR and a corresponding iUS patch viUS from a randomly selected synthetic iUS volume. These patches are fed to a shared 3D ResNet-18 encoder Φ:Rs3→Rd, which produces L2-normalized feature descriptors diMR=ΦviMR and diUS=ΦviUS for the MR and iUS modalities, respectively.

To construct negative pairs viMR,vnUS, we leverage our keypoint sampling strategy, which promotes spatial diversity and limits spatial redundancy. Specifically, negative iUS patches are sampled at locations pi and pj, such that j≠i.

2). Hard negative mining strategy:

Different training losses, such as Binary Cross-Entropy (BCE), Noise-Contrastive Estimation (infoNCE), and triplet loss, can be used to learn cross-modal feature descriptors. We empirically chose a triplet loss that encourages negative pairs of descriptors diMR,dnUS to be distant from any positive pairs diMR,diUS by at least a certain margin value m and is defined as:

ℒtriplet=max0,diMR−diUS22−diMR−dnUS22+m (1)

A critical component of effective triplet loss training is the selection of informative negative examples. Without a hard negative mining strategy, training rapidly saturates, as many triplets contribute negligible gradient [44]. To address this, we propose a progressive hard negative mining scheme grounded in curriculum learning: at early stages of training, negatives are sampled from spatially distant regions, which are expected to be easier to be distinguished in the feature space. As training progresses and the model improves, the mining progressively shifts toward harder negatives, which corresponds to negative descriptors that are closer in feature space (See Figure 4).

Fig. 4:

Fig. 4:

Examples of MR-iUS patches showing high descriptor similarity for positive pairs (left) and low descriptor similarity (right) for negative pairs. The d-dimensional feature vectors were sorted according to the values of the MR descriptor dMR, highlighting the correlation between MR and iUS descriptors.

At each training step, for a given anchor descriptor diMR, we compute a selection score Si,j for all j≠i keypoints in the batch, as:

Si,j=1−λtminpi−pj2Dmax,1⏟spatialdistance−λtdiMR−diUS2⏟featuresimilarity, (2)

where λt∈[0,1] weights the normalized Euclidean distance bounded by Dmax=24mm and the feature similarity. The weight λt acts as a curriculum difficulty scheduler that progressively shifts the emphasis of negative mining from anatomically distant pairs (high spatial weight) to semantically similar pairs (high feature similarity). In practice, λt is defined at epoch t as: λt=min(t/T,1.0), where T is the number of warm-up epochs, which was set to 200 in our experiments. For each anchor i, the candidate negative j corresponds to the keypoint with the lowest score Si,j.

3). Encouraging rotation-invariance descriptors:

To encourage rotation invariance in the learned descriptors, we apply random 3D rotations to the MR anchor patches during training. Following a curriculum learning strategy similar to our hard negative mining scheme, the rotation angle is uniformly sampled from the range 0∘,θmax, where θmax increases linearly from 0° to 30° over the first 1000 training epochs. To avoid information loss during rotation, we initially extract patches at 1.5 times the target size s along each spatial dimension, and then center-crop them to obtain the final s3 voxel input.

4). Training details:

At each epoch, one synthetic iUS IsynUS(k) and 1024 keypoints are sampled using the strategy defined in Section III-C. We set the number of sampled candidate keypoints to N=1024, which we found to be a practical trade-off between spatial coverage and computational cost. Performance was stable around this value, with larger N increasing runtime without measurable accuracy gains. We extract patches of size s=32 around each keypoint in both preoperative IMR and synthetic iUS IsynUS(k). We use a batch size of N=256, leading to 4 iterations per epoch. Online negative mining is performed within the batch to construct hard triplets dynamically. The network is trained for 2000 epochs using AdamW with an initial learning rate of 10−3, weight decay of 2 × 10−3, and a cosine annealing schedule with a minimum learning rate of 10−6.

E. Keypoint Matching at Testing Time

At test time on a real iUS volume, we construct a sparse assignment matrix P∈{0,1}N×M using a nearest neighbor matching strategy followed by an ambiguity filtering step. Specifically, we sample N=1024 keypoints in the MR volume using the procedure described in Section III-C. Since no saliency map is available for the real iUS image, a uniform 3D grid of step size 4 mm within the FoV of the real iUS volume is used to define M keypoints. This allows for unbiased coverage of the visible anatomy while avoiding detecting modality-specific salient structures. For each MR keypoint i, we identify its best matching iUS keypoint j by comparing their descriptors diMR and djUS using the L2 norm. Lowe’s ratio test is used to filter out unreliable correspondences.

IV. Results

To assess our approach, we conducted comprehensive experiments on matching and registration between MRI and iUS in patients with brain tumors. We evaluate performance through: (i) paired image matching using standard paired evaluation metrics, (ii) an ablation study analyzing each novel component and a robustness analysis to rotation, and (iii) image registration aligning pre-operative MRI with post-resection iUS.

A. Dataset

We conducted our experiments using the Brain Resection Multimodal Imaging Database (ReMIND) [45], which contains pre-operative multi-parametric MRI and iUS images from 114 consecutive patients. For this study, we focused on the subset of 13 patients for whom complete pre-operative 3D MRI (T1, T2, and FLAIR) and pre-dural iUS were available. The iUS volumes were reconstructed from tracked 2D handheld probe acquisitions. All images were resampled to an isotropic resolution of 0.5 mm, zero-padded to an in-plane size of 192 × 192, and intensity-normalized to the [0, 1] range.

To evaluate cross-modal image matching, we constructed a paired dataset by co-registering pre-dural iUS volumes with pre-operative MRI following the protocol described in [16]. During method development, 2 cases were randomly selected for parameter tuning and prototyping. The finalized approach was then evaluated on the remaining 11 test cases. We recall that a separate model is trained for each case (patient-specific) and models are not trained for inter-patient generalization.

For the downstream registration task, we used the 4 validation cases from the ReMIND2Reg challenge 2024 [46], [47], which provide manually annotated paired landmarks as ground truth.

B. Image Matching

We evaluate the ability of our cross-modal matching approach to identify anatomically corresponding keypoints across modalities. Experiments are performed on the 11 test cases using their pre-operative T2-weighted MRI and real pre-dural iUS images, with ground-truth correspondences obtained using 3D co-registration [16].

1). Metrics:

A match is considered correct if it lies within a predefined spatial tolerance (2.5 mm) of the transformed ground-truth location. Keypoint matching performance is evaluated using 1) Precision, as the proportion of correctly matched pairs, 2) Matching Score, as the proportion of correct matches relative to the number of detected keypoints in the MR volume, and 3) the number of established Matched Points.

2). Comparison with Related Work:

We benchmarked our proposed feature descriptor (Ours) against eight competing approaches. Four 2D matching approaches: SuperPoint [48], ALIKED [49], and LoFTR [21] (as a proxy to the 2D/3D slice-to-volume search approach [39]) that we paired with the multimodal matcher MINIMA [13], and the patient-specific method by Rasheed et al. [12], that we will refer to as LM2DK; and four 3D descriptor approaches: SIFT3D [32], MIND [7], Förstner+NGF [35] and MedicalNet [50], a pre-trained CNN for medical imaging tasks (equivalent to ImageNet). All classical baselines (MIND, SIFT3D, Förstner+NGF) were evaluated using their standard formulations without retraining and paired with the same candidate sampling strategy to ensure a fair comparison.

Implementation details.

2D methods required adaptation for volumetric data. SuperPoint, ALIKED, and LoFTR, paired with MINIMA matcher, were applied slice-wise across the 3D volumes using their native detection mechanisms with matching performed on corresponding slices and aggregated metrics computed. Each competing method is therefore evaluated in its most favorable and commonly used setting. LM2DK was evaluated slice-wise (all vs all) using its original SuperPoint-based detector and KNN matcher.

For baseline 3D methods, we paired SIFT3D with our sampling-based detector, as its native keypoint detector failed to produce correspondences. Since MIND provides only a descriptor, we similarly used our sampling detector. For MedicalNet, we applied global average pool on the last layer of its pre-trained ResNet-18 architecture to obtain descriptors, and also used our sampling detector for keypoint detection. It is important to note that we evaluated SIFT3D as a keypoint detector for the 3D methods; however, it failed to produce any valid matches, motivating the use of dense sampling. We thus exclude it from Table I.

TABLE I:

Per-case performance across state-of-the-art methods. Metrics reported are Precision (P. %), Matching Score (MS %), and total matched points (MP). Matching Scores for 2D methods are not reported since they are detector-free.

Case SIFT3D
Förstner+NGF
MIND
MedicalNet
ALIKED
SuperPoint
LoFTR
LM2KD
Ours
P. MS MP P. MS MP P. MS MP P. MS MP P. MP P. MP P. MP P. MP P. MS MP

C1 48.0 3.19 68 1.3 0.04 152 0.8 0.08 99 0.7 0.05 73 10.5 2.5 k 77.5 271 33.0 4.2 k 46.5 172 64.5 5.78 92
C2 26.5 0.88 34 0.8 0.04 133 2.7 0.56 209 4.5 0.46 104 4.3 1.7 k 57.9 394 24.1 2.6 k 35.8 81 64.2 5.00 80
C3 47.4 0.98 21 0.5 0.02 190 2.3 0.54 238 1.1 0.06 60 6.7 2.4 k 93.3 2.7 k 54.4 5.1 k 62.9 35 66.3 3.60 55
C4 43.2 1.69 41 1.3 0.06 309 0.6 0.11 188 0.5 0.03 59 13.0 3.1 k 64.8 364 41.9 6.9 k 79.8 114 73.9 5.30 74
C5 48.3 1.42 30 0.4 0.02 241 1.2 0.32 279 0.8 0.04 55 4.7 2.8 k 79.5 809 53.7 5.5 k 63.4 112 66.7 6.50 100
C6 73.0 4.67 66 0.0 0.00 148 0.3 0.07 207 1.4 0.07 48 7.7 1.8 k 3.3 30 33.3 1.9 k 90.8 76 80.2 3.90 50
C7 46.4 2.35 52 0.0 0.00 145 0.1 0.03 215 0.3 0.02 62 4.1 1.5 k 29.0 62 46.0 4.9 k 66.7 72 58.4 2.30 40
C8 57.3 1.90 34 0.0 0.00 195 2.1 0.39 188 1.0 0.06 59 7.5 3.0 k 72.3 376 57.6 3.5 k 58.8 160 73.7 5.90 81
C9 68.2 5.18 78 2.0 0.12 150 0.5 0.11 226 2.6 0.17 66 5.0 1.2 k 45.6 228 35.4 3.1 k 56.0 25 72.1 6.40 90
C10 55.2 2.40 45 0.0 0.00 184 0.5 0.10 216 1.0 0.08 76 9.3 1.8 k 55.9 152 34.3 4.1 k 15.9 63 74.9 3.50 47
C11 27.5 0.44 17 0.0 0.00 198 0.9 0.31 356 0.9 0.06 70 5.4 2.0 k 2.4 125 39.9 3.2 k 46.2 106 73.0 6.20 87

Mean 49.2 2.28 44 0.6 0.03 186 1.1 0.24 220 1.3 0.10 66 7.1 2.2 k 52.9 502 41.2 4.1 k 56.6 92 69.8 4.90 72
SD 14.4 1.52 20 0.7 0.04 52 0.9 0.19 63 1.2 0.13 15 2.9 643 30.2 764 10.6 1.4 k 20.5 46 6.3 1.40 21

Due to the stochastic nature of our detection strategy, we repeated this evaluation protocol 10 times per subject and averaged the results across all subjects. For detector-based methods, the Lowe’s ratio threshold parameter l was optimized via grid search to maximize precision while ensuring a minimum of 40 matched points. This led to the selection of l=0.75 for Ours, l=0.8 for LM2DK and MedicalNet, and l=0.9 for MIND, SIFT3D and Förstner+NGF.

Results.

As shown in Table I and Figure 5, our method consistently outperforms all baselines across precision and matching score. It achieves a matching precision of 69.8%, a matching score of 4.90%, and an average of 72 correct correspondences, demonstrating both high discriminative ability and robustness to cross-modal variations. In contrast, traditional 3D methods like SIFT3D, MIND, and Förstner+NGF offer limited cross-modal utility, even when paired with our detector. MedicalNet shows particularly poor performance with only 1.3% precision. Among 2D approaches, LM2DK performs best with relatively high precision (56.6%) but much lower matching coverage, while ALIKED, SuperPoint, and LoFTR paired with MINIMA show moderate performance but cannot match the robustness of our specialized 3D approach. Run times are reported in Table II.

Fig. 5:

Fig. 5:

Qualitative matching results across three cases (columns). Rows 1–5 show results on slices from the 5 best-performing methods. Green lines indicate correct matches; red dots denote mismatches. Last row shows volume rendering with matching using our descriptor.

TABLE II:

Training and inference runtime characteristics of evaluated descriptors. For methods without learning, training time is not applicable (N/A). Inference times are reported per image (2D) or per volume (3D).

Method Training Time Inference Time

SIFT3D N/A ~5000 ms / volume
Förstner+NGF N/A ~300 ms / volume
MIND N/A ~500 ms / volume
MedicalNet Pretrained ~190 ms / volume
ALIKED Pretrained ~10 ms / image
SuperPoint Pretrained ~15 ms / image
LoFTR Pretrained ~50 ms / image
LM2KD ~2 h / patient ~10 ms / image
Ours ~5 h / patient < 1000 ms / volume

We qualitatively assessed sensitivity to key hyperparameters, including the triplet margin and curriculum schedule, and observed stable convergence across a reasonable range of values, indicating that the reported matching performance is not driven by sensitive parameter tuning.

3). Ablation Study:

We conduct a comprehensive ablation study to systematically evaluate four key design choices in our method: 1) synthetic training MR sequences, 2) keypoint detection and sampling strategy; 3) contrastive optimization objective; and 4) rotation invariance strategy. All components are evaluated on the keypoint matching task, with results summarized in Table III and Figure 6. Our baseline configuration employs all synthetic modalities (T2, T1, and FLAIR), curriculum triplet loss, curriculum rotational augmentation, and stochastic keypoint detection.

TABLE III:

Ablation Study

Configurations Prec. (%) MSc. (%) MP

Synth. Modalities
T2 T1 FLAIR
• o o 68.47 ± 10.42 1.26 ± 0.26 18.94 ± 3.30
• o • 68.86 ± 5.94 3.68 ± 0.57 54.67 ± 6.20
• • o 69.86 ± 6.49 3.59 ± 0.57 51.94 ± 6.62
• • • 69.79 ± 4.94 4.92 ± 0.62 72.32 ± 7.92

Optimization Loss
 BCE 8.64 ± 1.00 4.20 ± 0.53 503.07 ± 18.31
 InfoNCE 60.39 ± 4.67 6.18 ± 0.70 104.13 ± 8.78
 Triplet 69.79 ± 4.94 4.92 ± 0.62 72.32 ± 7.92

Point Detection
 Deterministic 30.40 3.11 105.55
 Stochastic 69.79 ± 4.94 4.92 ± 0.62 72.32 ± 7.92
Fig. 6:

Fig. 6:

Rotation invariance analysis across increasing rotation angles. Our curriculum-based model maintains higher matching quality under increasing rotational misalignment.

Impact of variation in iUS synthesis.

We investigate the contribution of exploiting different MR-derived synthetic US image by training from various combinations of T2, T1, and FLAIR sequences. T2 serves as the base modality in all configurations since it corresponds to our target MR sequence. Results in Table III show the benefits of incorporating additional MR sequences during the synthesis of synthetic US images to increase the diversity of the iUS data. While individual addition of T1 or FLAIR improves performance over T2 only training, combining all three modalities yields optimal results, with the average number of matches increasing substantially from 18.9 to 72.3. This suggests that each modality contributes complementary anatomical information that enhances descriptor discriminability.

Stochastic vs deterministic detection.

We compare deterministic and stochastic keypoint sampling strategies. In the deterministic setting, a fixed set of SIFT3D keypoints is pre-selected from the pre-operative MRI (IMR) and the synthetic dataset 𝒟synUS. In contrast, the stochastic approach dynamically samples keypoints during training. As reported in Table III, stochastic sampling significantly increases model performance, particularly in precision (69.79% vs. 30.40%). This result suggests the benefit of exposing the model to a broader range of spatial contexts and more varied negative examples during training.

Hard negative mining strategy.

To evaluate the effectiveness of our hard negative mining strategy combined with the triplet loss, we compared it against BCE and InfoNCE. As shown in Table III, BCE yields the poorest performance, with a low precision of 8.6%, indicating limited discriminative capability. InfoNCE achieves a higher matching score (6.2%) but at the cost of reduced precision (60.4%), suggesting it is overly permissive in accepting matches. In contrast, our curriculum-based triplet loss offers the best trade-off across all metrics, attaining the highest precision (60.4%), a correct matching score (4.9%), and a sufficient number of correct matches (72.3), demonstrating its robustness in learning both discriminative and spatially meaningful representations.

Curriculum rotation augmentation.

Finally, we evaluate the model’s robustness to rotations by comparing three training strategies: no rotational augmentation, full rotational augmentation (i.e., random rotations applied from the beginning) and our curriculum rotational augmentation. To assess rotation invariance, we test performance under 10 systematically increasing orientation discrepancies, ranging from 0° to 30° in 3° increments, applied around 5 randomly sampled 3D axes. As shown in Figure 6, the no-rotation baseline drops in performance as rotation increases, highlighting its inability to generalize to unseen orientations. The full-rotation model demonstrates more consistent performance across rotation angles but underperforms overall, suggesting that early exposure to high rotational variability may limit the capacity of the model to extract semantically meaningful features. In contrast, our curriculum-based approach obtains high performance up to moderate rotation angles (< 20°), with a gradual decline thereafter, demonstrating a more effective trade-off between robustness and discriminative capacity.

C. Image Registration

We tested our method on the task of registering preoperative MR and post-resection iUS volumes using the publicly available ReMIND2Reg dataset, part of the Learn2Reg 2024 challenge. This dataset contains cases with large tissue deformation and topological changes due to tumor resection, and includes manually annotated ground-truth landmarks in both modalities, enabling quantitative assessment via Target Registration Error (TRE).

1). Keypoint-based iterative registration:

Our pipeline performs registration over three rigid alignment iterations. In each iteration, keypoint correspondences between the fixed MR volume and the current state of the moving iUS volume are computed using our descriptor. These sparse matches are then used to estimate a rigid transformation via RANSAC, configured with a maximum of 4000 iterations and a 5.0 mm inlier threshold. The resulting transform is composed with previous transformations, and the original moving iUS image is resampled accordingly for the next iteration. The final output is the cumulative rigid transformation across all iterations.

2). Competing registration methods:

We compare our method against top submissions from the ReMIND2Reg 2024 challenge’s leaderboard: 1) the VROC (Variational Registration on Crack) approach by Madesta et al., employs a two-stage rigid registration pipeline with conventional iterative optimization, using Gaussian-smoothed inputs, masking, and intensity thresholding, and sequentially optimizes NCC and NGF metrics; 2) the next-gen-nn by Wang et al., an unsupervised method using a multilevel correlation balanced optimization strategy based on a MIND-SSC based feature extractor; 3) Topological Higher-Order MRF by Li et al., a deformable registration framework based on a topological higher-order MRF with a multiscale optimization performed using a multi-resolution Quadratic Pseudo-Boolean Optimization strategy; and; Coarse-to-Fine Registration with Style Transfer by Wang et al., that employs a coarse-to-fine strategy using 3D CycleGAN for unpaired imaging style transfer to convert iUS images into synthetic T1-style MR images to create a more unified signal distribution across modalities before registration followed by a NiftyReg registration.

3). Results:

The results for 4 cases from the validation dataset are presented in Table IV, and ranked by their mean TREs (corresponding to the leaderboard rank).

TABLE IV:

Results of registration methods on the Re- MIND2Reg validation set.

Rank Method Mean TRE (mm)

1 VROC 1.903 ± 0.582
2 next-gen-nn 1.969 ± 0.459
* Ours (Rigid, Keypoint-Based) 2.385 ± 0.397
3 Coarse-to-Fine w/ Style Transfer 2.419 ± 0.669
4 Topological Higher-Order MRF 3.680 ± 0.620

An interesting results is next-gen-nn that shows that MIND performs poorly when used as a standalone local descriptor for direct matching without spatial regularization or global optimization, particularly under large displacements. In contrast, its strong performance within variational registration frameworks reflects fundamentally different usage.

Our approach achieves a mean TRE of 2.385 ± 0.397 mm, placing third in the challenge leaderboard. Despite using only a rigid transformation model and relying exclusively on sparse keypoint correspondences, our method demonstrates competitive performance relative to several learning-based and deformable strategies. We emphasize that rigid registration was chosen for robustness to outliers and large appearance changes in iUS. Extending the framework to non-rigid registration is an important direction for future work.

To qualitatively assess the registration accuracy, we visualize landmark alignments after applying our method in Figure 8 with four representative cases showing overlaid MR and iUS volumes. Our method achieves visually coherent registration even in challenging scenarios involving significant tissue deformation and modality-specific artifacts. The iUS FoV aligns well with the corresponding anatomical regions in the MRI, and the landmark correspondences show consistent spatial relationships. The registration quality is particularly evident in cases where complex anatomical structures, such as ventricular boundaries and tissue interfaces, maintain their expected spatial relationships after transformation.

Fig. 8:

Fig. 8:

Qualitative results of MR-iUS registration showing T2-weighted MR (grayscale) and the overlaid iUS (color wash, e.g., red), with MR landmarks (e.g., blue dots) and iUS landmarks (e.g., yellow crosses) indicating TREs. Our method shows good alignment of anatomical structures and small TREs between the landmarks.

The results demonstrate the potential of our keypoint-based registration framework, offering a robust and accurate solution without the need for complex optimization strategies or manual initialization, and providing clear visual cues for the registration process through matched keypoints.

Figure 7 qualitatively compares US images before and after tumor resection, demonstrating the substantial anatomical and appearance changes in intraoperative US. Despite these changes, the proposed matching-by-synthesis strategy maintains accurate alignment.

Fig. 7:

Fig. 7:

Illustrative example of one dataset from left to right: Preoperative T2-weighted MR; Intraoperative US prior to dural opening; Intraoperative US post dural opening; Intraoperative US prior to iMRI. Post-resection US images present important challenges for registration algorithms due to large tissue deformation and topological changes (Courtesy of [45]).

We presented a novel, fully 3D, rotation-invariant and cross-modal keypoint descriptor specifically designed for the task of MRI–to–iUS volume matching. Our method bridges two highly distinct modalities and goes beyond contrast-agnostic or monomodal approaches. To the best of our knowledge, this is the first keypoint descriptor tailored to this domain. Our method consistently outperforms existing state-of-the-art descriptors and matching techniques, and achieves registration accuracy on par with leading methods from recent benchmark challenges. In addition to accuracy, our approach offers key advantages in terms of usability and interpretability. Matched and mismatched keypoints can be directly visualized, allowing clinicians to assess anatomical plausibility and registration confidence. Furthermore, our registration pipeline does not require manual initialization, which is commonly necessary in optimization-based methods and presents a major barrier to clinical adoption.

Beyond quantitative accuracy, our results highlight the importance of explicitly separating the roles of matching and registration in cross-modal alignment. While registration methods can often compensate for weak local similarity through global optimization and regularization, their performance ultimately depends on the availability of reliable and well-distributed correspondences. Our findings demonstrate that improving correspondence quality and spatial coverage at the matching stage leads to more robust downstream registration, particularly under large cross-modal appearance changes and post-resection anatomical variability.

Our approach has a few limitations. A fundamental design choice of this work is its patient-specific formulation. Consequently, we do not evaluate inter-patient generalization for matching or registration, as the objective is not to learn a population-level descriptor but rather to optimize correspondences for a given patient using their own preoperative imaging. This choice is consistent with prior evidence showing that patient-specific models can outperform patient-agnostic ones in deformable registration and segmentation tasks, particularly in the presence of large anatomical and appearance variability.

Second, the patient-specific training strategy, while improving accuracy, requires approximately five hours of training. However, since preoperative MRI is routinely acquired well in advance of surgery, this offline training time is clinically acceptable. Moreover, recent findings suggest that given a pretrained model, rapid fine-tuning on a new patient’s preoperative images can retain high performance while reducing training time substantially [40].

Third, our synthesis-based training leverages a fixed FoV prior to generate synthetic US images. This raises concerns about potential performance degradation when the iUS FoV during surgery deviates from the simulated training FoV. To investigate this, we conducted an experiment using two cases with three distinct iUS FoVs per case. As shown in Figure 9, the model demonstrates high repeatability and consistency across varying FoVs, while maintaining precision and accuracy. Keypoints detected in the original FoV were reliably recovered in the other FoVs, and a large fraction of matched keypoints were consistent across all three views. This suggests that the learned descriptor generalizes well beyond the synthetic training conditions and remains robust under practical variations in iUS coverage.

Fig. 9:

Fig. 9:

Evaluation of descriptor robustness across varying iUS FoVs. Despite changes in FoV, keypoint matching remained consistent and repeated, with good precision and accuracy, indicating generalization beyond training conditions.

Importantly, robustness in this work is assessed through clinically realistic sources of variability, including substantial pre- and post-resection anatomical changes and variations in iUS FoVs, rather than through cross-dataset evaluation. Existing iUS datasets do not provide paired preoperative MRI and pre-dural US required for this setting, and thus do not allow evaluation under the same conditions. We therefore view the presented experiments as a more clinically relevant assessment of robustness for the targeted application.

Finally, while we tested our method using rigid registration on resected, non-rigid tissue, keypoint-based methods are inherently compatible with non-rigid registration pipelines. They can be integrated as sparse constraints within biomechanical models or B-spline frameworks [51]. Moreover, they are well-suited to accommodate topological changes such as tumor resection, where matched keypoints can inform tissue stress estimation and guide MRI updates. Future work will explore these extensions, as well as downstream tasks including slice-to-volume registration for freehand ultrasound reconstruction and segmentation propagation through keypoint-guided interactive editing.

Fig. 1:

Fig. 1:

3D cross-modal keypoint matching between MR and iUS volumes. Bottom: Matched local patches around a keypoint pair from MR and iUS images with corresponding descriptor curves showing strong similarity agreement.

Acknowledgments

This work was supported by the National Institutes of Health (R01EB032387, R01EB034223, and K25EB035166). R.D. received a Marie Skłodowska-Curie grant No 101154248 (project: SafeREG). The research leading to these results has received funding from the French government under management of Agence Nationale de la Recherche as part of the “France 2030” program (reference ANR-23-IACL-0008, PRAIRIE-PSAI) and as part of the ”Investissements d’avenir” program (reference ANR-19-P3IA-0001, PRAIRIE 3IA Institute; and reference ANR-10-IAIHU-06).

Contributor Information

Daniil Morozov, Harvard Medical School and Brigham and Women’s Hospital, Boston, MA, USA.; Technical University of Munich, Germany

Reuben Dorent, Inria and Sorbonne Université, Institut du Cerveau - Paris Brain Institute - ICM, CNRS, Inserm, AP-HP, Hôpital de la Pitié Salpêtrière, F-75013, Paris, France.

Nazim Haouchine, Harvard Medical School and Brigham and Women’s Hospital, Boston, MA, USA..

References

  • [1].Jiang X, Ma J, Xiao G, Shao Z, and Guo X, “A review of multimodal image matching: Methods and applications,” Information Fusion, vol. 73, pp. 22–71, 2021. [Google Scholar]
  • [2].Kumar A, Kim J, Cai W, Fulham M, and Feng D, “Content-based medical image retrieval: a survey of applications to multidimensional and multimodality data,” Journal of digital imaging, vol. 26, pp. 1025–1039, 2013. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [3].Ferrante E and Paragios N, “Slice-to-volume medical image registration: A survey,” Medical image analysis, vol. 39, pp. 101–123, 2017. [DOI] [PubMed] [Google Scholar]
  • [4].Evan MY, Wang AQ, Dalca AV, and Sabuncu MR, “Keymorph: Robust multi-modal affine registration via unsupervised keypoint detection,” in Medical imaging with deep learning, 2021. [Google Scholar]
  • [5].Machado I, Toews M, Luo J, Unadkat P, Essayed W, George E, Teodoro P, Carvalho H, Martins J, Golland P, Pieper S, Frisken S, Golby A, and III W, “Non-rigid registration of 3d ultrasound for neurosurgery using automatic feature detection and matching,” International Journal of Computer Assisted Radiology and Surgery, vol. 13, 06 2018. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [6].Luo J, Toews M, Machado I, Frisken S, Zhang M, Preiswerk F, Sedghi A, Ding H, Pieper S, Golland P, Golby A, Sugiyama M, and Wells III WM, “A feature-driven active framework for ultrasound-based brain shift compensation,” in MICCAI 2018, 2018, pp. 30–38. [Google Scholar]
  • [7].Heinrich MP, Jenkinson M, Bhushan M, Matin T, Gleeson FV, Brady M, and Schnabel JA, “Mind: Modality independent neighbourhood descriptor for multi-modal deformable registration,” Medical image analysis, vol. 16, no. 7, pp. 1423–1435, 2012. [DOI] [PubMed] [Google Scholar]
  • [8].Joutard S, Dorent R, Ourselin S, Vercauteren T, and Modat M, “Driving points prediction for abdominal probabilistic registration,” in International Workshop on Machine Learning in Medical Imaging. Springer, 2022, pp. 288–297. [Google Scholar]
  • [9].Assis T, Galvin CP, Castillo JP, Haouchine N, Kersten-Oertel M, Gao Z, Crispin-Ortuzar M, Price SJ, Santarius T, Ou Y et al. , “A systematic review on data-driven brain deformation modeling for image-guided neurosurgery,” arXiv preprint arXiv:2602.10155, 2026. [DOI] [PubMed] [Google Scholar]
  • [10].Gonzalez-Darder JM, State of the Art of the Craniotomy in the Early Twenty-First Century and Future Development. Cham: Springer International Publishing, 2019, pp. 421–427. [Google Scholar]
  • [11].Geshvadi M, Dorent R, Galvin C, Rigolo L, Haouchine N, Kapur T, Pieper S, Vangel M, Wells W, Golby A et al. , “Optimizing registration uncertainty visualization to support intraoperative decision-making during brain tumor resection,” International journal of computer assisted radiology and surgery, vol. 20, no. 8, pp. 1749–1757, 2025. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [12].Rasheed H, Dorent R, Fehrentz M, Kapur T, Wells III WM, Golby A, Frisken S, Schnabel JA, and Haouchine N, “Learning to match 2d keypoints across preoperative mr and intraoperative ultrasound,” in International Workshop on Advances in Simplifying Medical Ultrasound. Springer, 2024, pp. 78–87. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [13].Ren J, Jiang X, Li Z, Liang D, Zhou X, and Bai X, “Minima: Modality invariant image matching,” in Proceedings of the Computer Vision and Pattern Recognition Conference, 2025, pp. 23059–23068. [Google Scholar]
  • [14].Demir B and Niethammer M, “Multimodal image registration guided by few segmentations from one modality,” in Medical Imaging with Deep Learning, 2024. [Google Scholar]
  • [15].Dey N, Billot B, Wong HE, Wang CJ, Ren M, Grant PE, Dalca AV, and Golland P, “Learning general-purpose biomedical volume representations using randomized synthesis,” 2024. [PMC free article] [PubMed] [Google Scholar]
  • [16].Dorent R, Haouchine N, Golby A, Frisken S, Kapur T, and Wells W, “Unified cross-modal medical image synthesis with hierarchical mixture of product-of-experts,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 48, no. 2, pp. 1641–1656, 2026. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [17].Tursynbek N, Greer H, Demir B, and Niethammer M, “Guiding registration with emergent similarity from pre-trained diffusion models,” arXiv preprint arXiv:2506.02419, 2025. [Google Scholar]
  • [18].Grewal M, Wiersma J, Westerveld H, Bosman PA, and Alderliesten T, “Automatic landmark correspondence detection in medical images with an application to deformable image registration,” Journal of Medical Imaging, vol. 10, no. 1, pp. 014007–014007, 2023. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [19].Wu M and Goodman N, “Multimodal Generative Models for Scalable Weakly-Supervised Learning,” NeurIPS, vol. 31, 2018. [Google Scholar]
  • [20].Baruch EB and Keller Y, “Joint detection and matching of feature points in multimodal images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 44, no. 10, pp. 6585–6593, 2021. [DOI] [PubMed] [Google Scholar]
  • [21].Tuzcuoğlu Ö, Köksal A, Sofu B, Kalkan S, and Alatan AA, “Xoftr: Cross-modal feature matching transformer,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024, pp. 4275–4286. [Google Scholar]
  • [22].Verdie Y, Yi K, Fua P, and Lepetit V, “Tilde: A temporally invariant learned detector,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2015, pp. 5279–5288. [Google Scholar]
  • [23].Juvekar P, Dorent R, Kögl F, Torio E, Barr C, Rigolo L, Galvin C, Jowkar N, Kazi A, Haouchine N et al. , “Remind: The brain resection multimodal imaging database,” Scientific data, vol. 11, no. 1, p. 494, 2024. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [24].Dorent R, Haouchine N, Kogl F, Joutard S, Juvekar P, Torio E, Golby AJ, Ourselin S, Frisken S, Vercauteren T et al. , “Unified brain mr-ultrasound synthesis using multi-modal hierarchical representations,” in MICCAI. Springer, 2023, pp. 448–458. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [25].Chen J, Tian J, Lee N, Zheng J, Smith RT, and Laine AF, “A partial intensity invariant feature descriptor for multimodal retinal image registration,” IEEE Transactions on Biomedical Engineering, vol. 57, no. 7, pp. 1707–1718, 2010. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [26].Lee JA, Liu P, Cheng J, and Fu H, “A deep step pattern representation for multimodal retinal image registration,” in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2019, pp. 5077–5086. [Google Scholar]
  • [27].Liu J, Li X, Wei Q, Xu J, and Ding D, “Semi-supervised keypoint detector and descriptor for retinal image matching,” in European Conference on Computer Vision. Springer, 2022, pp. 593–609. [Google Scholar]
  • [28].Santarossa M, Kilic A, von der Burchard C, Schmarje L, Zelenka C, Reinhold S, Koch R, and Roider J, “Medregnet: Unsupervised multimodal retinal-image registration with gans and ranking loss,” in Medical Imaging 2022: Image Processing, vol. 12032. SPIE, 2022, pp. 321–333. [Google Scholar]
  • [29].Grewal M, Deist TM, Wiersma J, Bosman PA, and Alderliesten T, “An end-to-end deep learning approach for landmark detection and matching in medical images,” in Medical Imaging 2020: Image Processing, vol. 11313. SPIE, 2020, pp. 548–557. [Google Scholar]
  • [30].He X, Yu H, Peng S, Tan D, Shen Z, Bao H, and Zhou X, “Matchanything: Universal cross-modality image matching with large-scale pre-training,” 2025. [DOI] [PubMed] [Google Scholar]
  • [31].Sipiran I and Bustos B, “Harris 3d: a robust extension of the harris operator for interest point detection on 3d meshes,” The Visual Computer, vol. 27, pp. 963–976, 2011. [Google Scholar]
  • [32].Rister B, Horowitz MA, and Rubin DL, “Volumetric image registration from invariant keypoints,” IEEE Transactions on Image Processing, vol. 26, no. 10, pp. 4900–4910, 2017. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [33].Chauvin L, Kumar K, Wachinger C, Vangel M, de Guise J, Desrosiers C, Wells W, Toews M, Initiative ADN et al. , “Neuroimage signature from salient keypoints is highly specific to individuals and shared by close relatives,” NeuroImage, vol. 204, p. 116208, 2020. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [34].Agier R, Valette S, Fanton L, Croisille P, and Prost R, “Hubless 3d medical image bundle registration,” in VISAPP 2016 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, vol. 3, 2016, pp. 265–272. [Google Scholar]
  • [35].Rühaak J, Polzin T, Heldmann S, Simpson IJ, Handels H, Modersitzki J, and Heinrich MP, “Estimation of large motion in lung ct by integrating regularized keypoint correspondences into dense deformable registration,” IEEE transactions on medical imaging, vol. 36, no. 8, pp. 1746–1757, 2017. [DOI] [PubMed] [Google Scholar]
  • [36].Loiseau-Witon N, Kéchichian R, Valette S, Bailly P, and Magnin IE, “Learning 3d medical image keypoint descriptors with the triplet loss,” International Journal of Computer Assisted Radiology and Surgery, vol. 17, pp. 141–146, 2022. [DOI] [PubMed] [Google Scholar]
  • [37].Wang AQ, Saluja R, Kim H, He X, Dalca A, and Sabuncu MR, “Brainmorph: A foundational keypoint model for robust and flexible brain mri registration,” arXiv preprint arXiv:2405.14019, 2024. [Google Scholar]
  • [38].Esteban J, Grimm M, Unberath M, Zahnd G, and Navab N, “Towards fully automatic x-ray to ct registration,” in Medical Image Computing and Computer Assisted Intervention–MICCAI 2019: 22nd International Conference, Shenzhen, China, October 13–17, 2019, Proceedings, Part VI 22. Springer, 2019, pp. 631–639. [Google Scholar]
  • [39].Markova V, Ronchetti M, Wein W, Zettinig O, and Prevost R, “Global multi-modal 2d/3d registration via local descriptors learning,” in MICCAI. Springer, 2022, pp. 269–279. [Google Scholar]
  • [40].Gopalakrishnan V, Dey N, Chlorogiannis D-D, Abumoussa A, Larson AM, Orbach DB, Frisken S, and Golland P, “Rapid patient-specific neural networks for intraoperative x-ray to volume registration,” 2025. [DOI] [PubMed] [Google Scholar]
  • [41].Fehrentz M, Azampour MF, Dorent R, Rasheed H, Galvin C, Golby A, Wells WM, Frisken S, Navab N, and Haouchine N, “Intraoperative registration by cross-modal inverse neural rendering,” in MICCAI. Springer, 2024, pp. 317–327. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [42].Dorent R, Torio E, Haouchine N, Galvin C, Frisken S, Golby A, Kapur T, and Wells WM, “Patient-specific real-time segmentation in trackerless brain ultrasound,” in MICCAI. Springer, 2024, pp. 477–487. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [43].Rister B, Horowitz MA, and Rubin DL, “Volumetric Image Registration From Invariant Keypoints,” vol. 26, no. 10, pp. 4900–4910. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [44].Hermans A, Beyer L, and Leibe B, “In defense of the triplet loss for person re-identification,” arXiv preprint arXiv:1703.07737, 2017. [Google Scholar]
  • [45].Juvekar P, Dorent R, Kögl F, Torio E, Barr C, Rigolo L, Galvin C, Jowkar N, Kazi A, Haouchine N et al. , “Remind: The brain resection multimodal imaging database,” Scientific Data, vol. 11, no. 1, p. 494, 2024. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • [46].Dorent R, Kapur T, Wells S, Golby A, Heyer W, Chen J, Liu Y, Heinrich M, Walter A, Lindblad J, Slodaje N, Paul-Gilloteaux P, Hansen L, Domart M-C, Collinson L, and Jones M, “Learn2reg 2024,” Zenodo 10.5281/zenodo.10991880, Apr. 2024. [DOI] [Google Scholar]
  • [47].Dorent R, Rigolo L, Galvin CP, Chen J, Heinrich MP, Carass A, Colliot O, Wassermann D, Golby A, Kapur T et al. , “The brain resection multimodal image registration (remind2reg) 2025 challenge,” arXiv preprint arXiv:2508.09649, 2025. [Google Scholar]
  • [48].DeTone D, Malisiewicz T, and Rabinovich A, “Superpoint: Self-supervised interest point detection and description,” in Proceedings of the IEEE conference on computer vision and pattern recognition workshops, 2018, pp. 224–236. [Google Scholar]
  • [49].Zhao X, Wu X, Chen W, Chen PC, Xu Q, and Li Z, “Aliked: A lighter keypoint and descriptor extraction network via deformable transformation,” IEEE Transactions on Instrumentation and Measurement, vol. 72, pp. 1–16, 2023.37323850 [Google Scholar]
  • [50].Alzubaidi L, Santamaría J, Manoufali M, Mohammed B, Fadhel MA, Zhang J, Al-Timemy AH, Al-Shamma O, and Duan Y, “Mednet: pre-trained convolutional neural network model for the medical imaging tasks,” arXiv preprint arXiv:2110.06512, 2021. [Google Scholar]
  • [51].Haouchine N, Juvekar P, Nercessian M, Wells III WM, Golby A, and Frisken S, “Pose estimation and non-rigid registration for augmented reality during neurosurgery,” IEEE Transactions on Biomedical Engineering, vol. 69, no. 4, pp. 1310–1317, 2022. [DOI] [PMC free article] [PubMed] [Google Scholar]

RESOURCES