REVIEW 2 cited by
Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical Data
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Efficient comparison of spherical probability distributions becomes important in fields such as computer vision, geosciences, and medicine. Sliced optimal transport distances, such as spherical and stereographic spherical sliced Wasserstein distances, have recently been developed to address this need. These methods reduce the computational burden of optimal transport by slicing hyperspheres into one-dimensional projections, i.e., lines or circles. Concurrently, linear optimal transport has been proposed to embed distributions into \( L^2 \) spaces, where the \( L^2 \) distance approximates the optimal transport distance, thereby simplifying comparisons across multiple distributions. In this work, we introduce the Linear Spherical Sliced Optimal Transport (LSSOT) framework, which utilizes slicing to embed spherical distributions into \( L^2 \) spaces while preserving their intrinsic geometry, offering a computationally efficient metric for spherical probability measures. We establish the metricity of LSSOT and demonstrate its superior computational efficiency in applications such as cortical surface registration, 3D point cloud interpolation via gradient flow, and shape embedding. Our results demonstrate the significant computational benefits and high accuracy of LSSOT in these applications.
Forward citations
Cited by 2 Pith papers
-
SOTAlign: Semi-Supervised Alignment of Unimodal Vision and Language Models via Optimal Transport
SOTAlign aligns frozen vision and language encoders with 10k pairs plus up to 1M unpaired samples, beating supervised baselines by 5-10 points on COCO retrieval and ImageNet classification.
-
Constrained Sliced Wasserstein Embedding
Adding SWGG dissimilarity constraints to sliced Wasserstein embedding, trained via primal-dual optimization with a softsort relaxation, improves pooling accuracy on image, point cloud, and protein-sequence benchmarks.
Discussion (0). Continue with ORCID to comment.