Yep I'm been playing with the BSP-OT solver and it is quite fast. The following interpolation is done on 300k samples and only takes a few seconds (but can only find permutations). Generating the GIF/animation is slower than solving the problem.
Video
Rémi Flamary
BSP-OT is now available in POT main branch! github.com/PythonOT/POT
(👏 @baptiste-genest.bsky.social )
POT : Python Optimal Transport. Contribute to PythonOT/POT development by creating an account on GitHub.
This is a very impressive method and it is coming shortly to the Python Optimal Transport toolbox! Thanks to the authors who contribute to open source toolboxes making them better. github.com/PythonOT/POT...
Initial fork and PR. (wip)
Types of changes
Original paper
Motivation and context / Related issue
How has this been tested (if it applies)
PR checklist
I have read the CONTRIBUTING documen...
#RésultatScientifique 🔎 | Des chercheurs du #LIRIS proposent une méthode plus rapide et plus précise en transport optimal discret. Une avancée qui ouvre de nouvelles perspectives.
➡️ www.ins2i.cnrs.fr/fr/cnrsinfo/...
🤝 @cnrs-rhoneauvergne.bsky.social
Des chercheurs du Laboratoire d'informatique en images et systèmes d'information
