Healthcare Technology Innovation Centre logo HTIC · IIT Madras
MICCAI 2026

Total Knee Arthroplasty · Landmark Localisation

SurfMark3D: Surface-Based Graph Convolution for Distal Femoral Landmark Localisation

Dharshan B.*, Pranav Hyagreev*, Vivek Maik†, Suhail Ansari T. A., Manojkumar Lakshmanan, Mohanasankar Sivaprakasam

Healthcare Technology Innovation Centre, IIT Madras, India  ·  * Equal contribution   † Corresponding author

Paper  — link coming soon Code Dataset

ABSTRACT

Accurate localisation of anatomical landmarks on the distal femur is a critical prerequisite for surgical planning in image-based Total Knee Arthroplasty (TKA). Manual annotation is time-consuming and prone to variability, which can lead to inconsistent implant sizing. Existing classical and deep learning methods remain limited by latency, computational cost, and modality dependence. We operate on segmented 3D surface point clouds and formulate distal femoral landmark localisation as a heatmap regression task that predicts dense probability fields, with ground-truth heatmaps constructed as Euclidean Gaussians using learnable landmark-specific sigmas. We introduce a hybrid graph-convolution backbone that combines Low-Rank Adaptive Graph Convolution (LR-AGConv) for local feature extraction and Bi-level Routing Point Attention (BRPA) for efficient global semantic modelling. The network is trained using Adaptive Wing loss and PointSTAR — a novel point-cloud adaptation of Self-adaptive Ambiguity Reduction (STAR) loss — with uncertainty-based multi-task weighting. We curate and release a clinically validated dataset of 550 distal femurs derived from the ShapeMed Knee study with expert landmark annotations. The proposed method consistently outperforms state-of-the-art baselines, achieving a Mean Euclidean Error of 1.24 ± 0.84 mm across all 11 anatomical landmarks.

0
Mean Euclidean Error, 11 landmarks
0
Expert-annotated distal femurs
0
Clinical inference Latency
Overall architecture of the proposed SurfMark3D framework, showing the point-cloud input, LR-AGConv and BRPA backbone, and predicted per-landmark heatmaps.
Fig. 1 — Overall architecture: point-cloud input, the hybrid LR-AGConv / BRPA backbone, and predicted heatmaps for all 11 distal femoral landmarks.

A hybrid block for local geometry and global context

The six-layer backbone keeps full spatial resolution throughout. Stages 1–3 run the hybrid block below, pairing local graph convolution with routed global attention; stages 4–6 use LR-AGConv alone, isolating the fine surface detail that precise localisation depends on.

Hybrid block diagram: local geometry branch with AdaptConv and PairNorm combined with a global context branch using DenseXCPE, BRPA, and an MLP, fused into the block output.
Fig. 2a — Hybrid block. A local-geometry branch (AdaptConv → PairNorm) and a global-context branch (DenseXCPE → BRPA → MLP) are fused with the raw and downsampled residuals to form the block output.
BRPA block diagram: serialized point patches projected to queries, keys and values, routed via TopkRouter to gather the top-k relevant patches, then scaled and attended via scaled dot-product attention.
Fig. 2b — BRPA block. Serialized patches are projected to Q/K/V; a TopkRouter selects the k most relevant regions per query patch, which are gathered, scaled, and attended before scattering back to the full resolution.

What each Components is doing

LR-AGConv

Input features are compressed through a linear bottleneck before dynamic, low-rank kernels are synthesised per edge from the local feature graph. Aggregating in this reduced space avoids materialising large intermediate tensors, cutting peak training memory by 43.1% (40.4 GB → 23.0 GB) versus dense AGConv, without a drop in accuracy.

BRPA

Points are serialised along a Hilbert curve and grouped into regions. A TopkRouter compares pooled region-level queries and keys to restrict fine-grained attention to only the top-k most relevant regions, cutting attention cost from quadratic to roughly linear in the number of points.

AWing Loss

The primary heatmap regression objective. Adaptive Wing loss reshapes the penalty near the ground-truth peak so foreground pixels are weighted more heavily than the (much larger) background, which stabilises Gaussian heatmap regression.

PointSTAR

A 3D, surface-aware reformulation of STAR loss. Predicted covariance is projected onto the local tangent plane and decomposed to separate normal from tangential uncertainty, letting the model tolerate ambiguity along anisotropic ridges (e.g. FLTA) while still penalising error perpendicular to the surface.

Learnable σ

Each of the 11 landmarks gets its own learnable Gaussian spread rather than a fixed isotropic value, letting sharply localised landmarks and diffusely defined ones (like the trochlear ridge) converge on different heatmap shapes.

Uncertainty weighting

A two-level homoscedastic uncertainty scheme balances per-landmark AWing terms against each other, and separately balances the combined AWing objective against PointSTAR — so neither loss family dominates gradient updates by accident.

RESULTS

Evaluated on a held-out clinical test set against inter- and intra-annotator variability of 1.24±1.05 mm and 1.18±0.90 mm, the full model reaches an MEE of 1.24 ± 0.84 mm — matching expert-level annotator agreement — while requiring only 1 GB of VRAM and ~1.7 s median inference latency per scan.

ConfigurationMEE ± SD (mm)Med.SDR@1.0SDR@2.0SDR@4.0
Base (LR-AGConv)1.28 ± 0.901.0646.983.698.0
Base + BRPA1.27 ± 0.891.0847.585.798.7
Base + PointSTAR1.26 ± 0.841.0746.886.398.5
w/o Learnable σ1.28 ± 0.921.0846.884.097.9
Ours (full model)1.24 ± 0.841.0548.985.698.7
Bar chart of Success Detection Rate at 1, 1.5, 2 and 4 millimetre thresholds, with a line plot of Mean Absolute Error, for all 11 distal femoral landmarks.
Fig. 3 — Landmark-wise SDR (bars, at 1/1.5/2/4 mm thresholds) and MAE ± SD (dashed line) for the full model. Error is highest for FMCD and lowest for the Notch.

BRPA visibly smooths PointSTAR's convergence and, together with the learnable landmark-specific sigmas, lets the full model reach a stable optimum in around 60 epochs rather than the 100+ epochs needed without PointSTAR.

Three stacked convergence plots: AWing validation loss, PointSTAR validation loss, and mean learnable sigma value over training epochs, compared across four model variants.
Fig. 4 — Loss and sigma convergence across the four ablation variants (V1–V4). PointSTAR accelerates convergence of both the AWing loss and the learnable heatmap spreads.