Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 57 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 104 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Unbalanced optimal transport for stochastic particle tracking (2407.04583v1)

Published 5 Jul 2024 in physics.data-an and physics.flu-dyn

Abstract: Non-invasive flow measurement techniques, such as particle tracking velocimetry, resolve 3D velocity fields by pairing tracer particle positions in successive time steps. These trajectories are crucial for evaluating physical quantities like vorticity, shear stress, pressure, and coherent structures. Traditional approaches deterministically reconstruct particle positions and extract particle tracks using tracking algorithms. However, reliable track estimation is challenging due to measurement noise caused by high particle density, particle image overlap, and falsely reconstructed 3D particle positions. To overcome this challenge, probabilistic approaches quantify the epistemic uncertainty in particle positions, typically using a Gaussian probability distribution. However, the standard deterministic tracking algorithms relying on nearest-neighbor search do not directly extend to the probabilistic setting. Moreover, such algorithms do not necessarily find globally consistent solutions robust to reconstruction errors. This paper aims to develop a globally consistent nearest-neighborhood algorithm that robustly extracts stochastic particle tracks from the reconstructed Gaussian particle distributions in all frames. Our tracking algorithm relies on the unbalanced optimal transport theory in the metric space of Gaussian measures. Specifically, we optimize a binary transport plan for efficiently moving the Gaussian distributions of reconstructed particle positions between time frames. We achieve this by computing the partial Wasserstein distance in the metric space of Gaussian measures. Our tracking algorithm is robust to position reconstruction errors since it automatically detects the number of particles that should be matched through hyperparameter optimization. Finally, we validate our method using an in vitro flow experiment using a 3D-printed cerebral aneurysm.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.