PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration

Leonard Siegert, Paul Fischer, Mattias P. Heinrich, Christian F. Baumgartner
7/15/2024
cs.CVeess.IV

No official code found. Best implementation: leonardsiegert/PULPo (5 stars, PyTorch, last commit 2025-08-07).

Abstract

Deformable image registration is fundamental to many medical imaging applications. Registration is an inherently ambiguous task often admitting many viable solutions. While neural network-based registration techniques enable fast and accurate registration, the majority of existing approaches are not able to estimate uncertainty. Here, we present PULPo, a method for probabilistic deformable registration capable of uncertainty quantification. PULPo probabilistically models the distribution of deformation fields on different hierarchical levels combining them using Laplacian pyramids. This allows our method to model global as well as local aspects of the deformation field. We evaluate our method on two widely used neuroimaging datasets and find that it achieves high registration performance as well as substantially better calibrated uncertainty quantification compared to the current state-of-the-art.

View on arXivView PDF

Code Implementations(1)

PyTorch

Probabilistic deformable medical image registration capable of uncertainty quantification using a hierarchical variational autoencoder (VAE) architecture. Published at MICCAI 2024 conference.

50Python, Jupyter NotebookMar 19, 20241 years ago
deep-learningdeformable-registrationimage-registrationmedical-imagingmiccai+8 more

Similar Papers

Cite this paper

@article{siegert2024pulpo,
  title  = {PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration},
  author = {Leonard Siegert and Paul Fischer and Mattias P. Heinrich and Christian F. Baumgartner},
  year   = {2024},
  eprint = {2407.10567},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.10567v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.10567.svg)](https://codeofpaper.com/paper/2407.10567)

Discussion