A Transportation Lp Distance for Signal Analysis
Not on the map. Why?
Abstract (arXiv)
Transport based distances, such as the Wasserstein distance and earth mover's distance, have been shown to be an effective tool in signal and image analysis. The success of transport based distances is in part due to their Lagrangian nature which allows it to capture the important variations in many signal classes. However these distances require the signal to be nonnegative and normalized. Furthermore, the signals are considered as measures and compared by redistributing (transporting) them, which does not directly take into account the signal intensity. Here we study a transport-based distance, called the TLp distance, that combines Lagrangian and intensity modelling and is directly applicable to general, non-positive and multi-channelled signals. The framework allows the application of existing numerical methods. We give an overview of the basic properties of this distance and applications to classification, with multi-channelled, non-positive one and two-dimensional signals, and color transfer.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Sep 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 4; 2023: 1; 2024: 0; 2025: 2.
11 papers.
- 2022Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networkscited by 14
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
- 2021Approximate Bayesian Computation with Path Signaturescited by 12
- 2021The Signed Cumulative Distribution Transform for 1-D Signal Analysis and Classificationcited by 9
- 2022Averaging Spatio-temporal Signals using Optimal Transport and Soft Alignmentscited by 2
- 2021Multiview Sensing With Unknown Permutations: An Optimal Transport Approachcited by 1
- 2022Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learningcited by 1
- 2022Immiscible Color Flows in Optimal Transport Networks for Image Classificationcited by 0
- 2023Convolve and Conquer: Data Comparison with Wiener Filterscited by 0
- 2025Metric Similarity and Manifold Learning of Circular Dichroism Spectra of Proteinscited by 0
- 2025Quantifying the noise sensitivity of the Wasserstein metric for imagescited by 0
- 2025Quantifying the noise sensitivity of the Wasserstein metric for images1 Oct 2025
- 2025Metric Similarity and Manifold Learning of Circular Dichroism Spectra of Proteins27 Apr 2025
- 2023Convolve and Conquer: Data Comparison with Wiener Filters11 Nov 2023
- 2022Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networks13 Oct 2022
- 2022Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learning3 Jul 2022
- 2022Immiscible Color Flows in Optimal Transport Networks for Image Classification4 May 2022
- 2022Averaging Spatio-temporal Signals using Optimal Transport and Soft Alignments11 Mar 2022
- 2021Approximate Bayesian Computation with Path Signatures23 Jun 2021
- 2021The Signed Cumulative Distribution Transform for 1-D Signal Analysis and Classification3 Jun 2021
- 2021Multiview Sensing With Unknown Permutations: An Optimal Transport Approach12 Mar 2021
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution10 Mar 2021