Papers › Fast alignment of heterogeneous images in sliced Wasserstein distance

Fast alignment of heterogeneous images in sliced Wasserstein distance

17 Mar 2025arXiv:2503.13756archive 2025-07-28

Yunpeng Shi, Amit Singer, Eric J. Verbeke

Many applications of computer vision rely on the alignment of similar but non-identical images. We present a fast algorithm for aligning heterogeneous images based on optimal transport. Our approach combines the speed of fast Fourier methods with the robustness of sliced probability metrics and allows us to efficiently compute the alignment between two L ×L images using the sliced 2-Wasserstein distance in O(L² logL) operations. We show that our method is robust to translations, rotations and deformations in the images.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections