AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Computing Wasserstein-p Distance Between Images With Linear Cost

CVPR 2022 · Learning theory and algorithms › Optimal transport · approach: Wasserstein barycenters and GW · 7 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Restrict Sinkhorn iterations to a multi-scale estimated subsetM3S · DOT, grayscale image transportsolving time: 28.90 seconds for 512 × 512 images; other methods fail to converge within 1200 secondsHelped
Use restricted multi-scale sparse transport instead of a full dense couplingM3S · DOT, grayscale image transportmemory complexity: O(n2) -> linearHelped
Use restricted multi-scale sparse transport instead of full SinkhornM3S · DOT, grayscale image transporttime complexity: O(n2) -> linearHelped
Use M3S to approximate the unregularized transport solutionM3S · DOT, grayscale images, p values 1 to 2relative error: Table 1 reports relative errors from 0.0522 to 6.23 (10−4)Helped
Compute transport on the restricted subset across image scalesM3S · Color images up to 1920 × 1200image size supported: 1920 × 1200Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy