<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://silentmovie.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://silentmovie.github.io/" rel="alternate" type="text/html" /><updated>2026-04-28T18:20:54+00:00</updated><id>https://silentmovie.github.io/feed.xml</id><title type="html">Bohan Zhou</title><subtitle>Visiting Assistant Professor at UCSB.
</subtitle><entry><title type="html">Distance between positive measures</title><link href="https://silentmovie.github.io/2025/11/05/WOP.html" rel="alternate" type="text/html" title="Distance between positive measures" /><published>2025-11-05T00:00:00+00:00</published><updated>2025-11-05T00:00:00+00:00</updated><id>https://silentmovie.github.io/2025/11/05/Distance%20between%20positive%20measures</id><content type="html" xml:base="https://silentmovie.github.io/2025/11/05/WOP.html"><![CDATA[<h5><span style="color:#00703C">Understand the Back-and-Forth method Deeper </span></h5>
<!--end_excerpt-->

<p>In the undergraduate independent study on Optimal Transport theory, Shirley and Wenxuan explore the back-and-forth method [<a href="https://back-and-forth.netlify.app">1</a>] in greater depth, with the goal of extending it to more versatile applications.</p>

<p>They implemented the method entirely in Python [<a href="https://inarihimeko.github.io/BFOT/intro.html">2</a>], handling both 1D and 2D datasets, and visualized some key steps in this algorithm, particularly the Jacobian computations related with the pushforward map. Moreover, a recent proposed metric (WOP distance [<a href="https://arxiv.org/pdf/2303.02183">3</a>]) between positive measures integrates naturally into this framework. They also developed a numerical solver for computing this metric.</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="https://back-and-forth.netlify.app">Jacobs and Leger, The Back-and-Forth Method, 2020.</a></li>
  <li><a href="https://inarihimeko.github.io/BFOT/intro.html">Bao, Xu and Zhou, BFOT python package, 2025.</a></li>
  <li><a href="https://arxiv.org/pdf/2303.02183">Leblanc, Le Gouic, Liandrat and Tournus, Extending the Wasserstein metric to positive measures, 2023</a></li>
</ol>]]></content><author><name>Bohan, Shirley and Wenxuan</name></author><category term="mentoring post" /><summary type="html"><![CDATA[Understand the Back-and-Forth method Deeper]]></summary></entry><entry><title type="html">Wasserstein barycenter via “mmot”</title><link href="https://silentmovie.github.io/2022/11/05/Shape-Interpolation.html" rel="alternate" type="text/html" title="Wasserstein barycenter via “mmot”" /><published>2022-11-05T00:00:00+00:00</published><updated>2022-11-05T00:00:00+00:00</updated><id>https://silentmovie.github.io/2022/11/05/Wasserstein%20Barycenter%20via%20%22MMOT%22</id><content type="html" xml:base="https://silentmovie.github.io/2022/11/05/Shape-Interpolation.html"><![CDATA[<h5><span style="color:grey">Use Multi-marginal optimal transport to compute exact Wasserstein barycenter</span></h5>
<!--end_excerpt-->

<div><img class="img-fluid" src="/assets/images/posts/barycenter-comp.png" alt="Wasserstein Barycenter" /></div>

<p>A barycenter-type problem asks the following: given a set of objects $(\mu_i)_{i=1}^m$,  we are looking for another object in the same space (or more formally, within the same category), that is close as possible to all of them with respect to a chosen metric or divergence.</p>

<p>\begin{equation}
\label{eq:bary}
\mu= \textrm{argmin}\sum_{i=1}^m \lambda_i \textrm{dis}(\mu_i,\mu).
\end{equation}</p>

<p>Depending on the metric, the barycenter contains “averaged” information from input objects.</p>

<p>In our problem, we are particularly interested in the space of probability measures equipped with the Wasserstein distance, which was introduced by Agueh and Carlier [<a href="http://doi.org/10.1137/100805741">1</a>].</p>

<p>\begin{equation}
\label{eq:Wass_bary}
\mu= \textrm{argmin}\sum_{i=1}^m \frac{\lambda_i}{2} W_2^2(\mu_i,\mu).
\end{equation}</p>

<p>They showed it is equivalent to the MMOT under the cost 
\begin{equation}
c(x_1,\ldots,x_m)=\sum_{i&lt;j}\frac{\lambda_i \lambda_j}{2} |x_i-x_j|^2.
\end{equation}</p>

<p>Out method [<a href="https://arxiv.org/abs/2208.03025">2</a>] provides an exact and efficient way to solve the dual problem to the MMOT problem, 
\(\begin{eqnarray}
&amp;\sup&amp; \sum_{i=1}^m \int f_i(x_i) \mathrm{d}\mu_i;\\
&amp;\textrm{s.t.}&amp; \sum_{i=1}^m f_i(x_i)\leqslant c(x_1,\ldots,x_m).
\end{eqnarray}\)
and the dual variables $(f_i)$, as one of outputs, can induce the Wasserstein barycenter by
\begin{equation}
\label{eq:pushforward}
\mu= (\textrm{id} - \frac{\nabla f_i}{\lambda_i})_{\sharp} \mu_i.
\end{equation}</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="http://doi.org/10.1137/100805741">Agueh and Carlier, Barycenter in the Wasserstein space, 2011.</a></li>
  <li><a href="https://arxiv.org/abs/2208.03025">Zhou and Parno, Efficient and Exact Multimarginal Optimal Transport with Pairwise Costs, 2022.</a></li>
</ol>]]></content><author><name>Bohan</name></author><category term="Research" /><summary type="html"><![CDATA[Use Multi-marginal optimal transport to compute exact Wasserstein barycenter]]></summary></entry><entry><title type="html">Sea ice dynamics prediction</title><link href="https://silentmovie.github.io/2022/10/17/Robertson-Channel.html" rel="alternate" type="text/html" title="Sea ice dynamics prediction" /><published>2022-10-17T00:00:00+00:00</published><updated>2022-10-17T00:00:00+00:00</updated><id>https://silentmovie.github.io/2022/10/17/Sea%20Ice%20Dynamics%20Prediction</id><content type="html" xml:base="https://silentmovie.github.io/2022/10/17/Robertson-Channel.html"><![CDATA[<h5><span style="color:grey">Use Multi-marginal Optimal Transport for Sea Ice Dynamics Prediction</span></h5>
<!--end_excerpt-->

<p><img class="img-fluid" src="/assets/images/posts/Bohan_icefloe.gif" alt="Robertson Channel" /></p>

<p>Joint with M. Parno [<a href="https://arxiv.org/abs/2208.03025">1</a>], we develop a multi-marginal optimal transport (MMOT) framework for constructing <strong>continuous representations of discrete-in-time data</strong>. One natural application is in <strong>predicting the sea ice dynamics</strong>. Given a sequence of observations (the “marginals” in the MMOT framework) recorded at different time points, our method produces a continuous-time interpolation that captures the evolving motion of sea ice. This provides a solution to one stage in the <a href="https://simda-muri.github.io/challenges/source/descriptions/problem2.html">Lagrangian Observation Mapping Challenges</a>. The accompanying Python package and documentation are available in [<a href="https://simda-muri.github.io/mmot/">2</a>].</p>

<p>Using the SAR data (collected every 6 days) from <a href="https://asf.alaska.edu">Alaska Satellite Facility</a> on the Robertson Channel (thanks to our group member J. Park at Dartmouth), the animation demonstrates predicted sea ice motion at two-day intervals. Remarkably, even finer temporal predictions can be generated within minutes on a standard personal computer.</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="https://arxiv.org/abs/2208.03025">Zhou and Parno, Efficient and Exact Multimarginal Optimal Transport with Pairwise Costs, 2022.</a></li>
  <li><a href="https://simda-muri.github.io/mmot/">Parno and Zhou, MMOT2D python package, 2022.</a></li>
</ol>]]></content><author><name>Bohan</name></author><category term="Research" /><summary type="html"><![CDATA[Use Multi-marginal Optimal Transport for Sea Ice Dynamics Prediction]]></summary></entry><entry><title type="html">Interpolation of data distribution</title><link href="https://silentmovie.github.io/2022/05/30/Understand-interpolation.html" rel="alternate" type="text/html" title="Interpolation of data distribution" /><published>2022-05-30T00:00:00+00:00</published><updated>2022-05-30T00:00:00+00:00</updated><id>https://silentmovie.github.io/2022/05/30/Interpolation%20of%20data%20distribution</id><content type="html" xml:base="https://silentmovie.github.io/2022/05/30/Understand-interpolation.html"><![CDATA[<h5><span style="color:#00703C">Interpolate between Point Clouds in the Wasserstein space</span></h5>
<!--end_excerpt-->
<div class="row">
	<div class="column">
	<img class="img-fluid" src="/assets/images/posts/Wass-dough.gif" alt="Wasserstein dough" />
	</div>
		<div class="column">
	<img class="img-fluid" src="/assets/images/posts/Wass-rotation.gif" alt="Wasserstein rotation" />
	</div>
</div>

<p>Tyler, an undergraduate at Dartmouth College, set out to truly grasp the concept of <strong>Wasserstein interpolation</strong>. Although this idea is far from new, it remains a fascinating and subtle phenomenon.</p>

<p>Given two measures $\mu_1$ and $\mu_2$, one may define the Wasserstein interpolation through either a given optimal transport map $T$:</p>

<p>\begin{equation}
\label{eq:Wass_int_map}
\mu_t = ((1-t)x+tT(x))_{\sharp}\mu_1;
\end{equation}</p>

<p>or a given optimal transport plan $P$:</p>

<p>\begin{equation}
\label{eq:Wass_int_plan}
\mu_t = ((1-t)x+ty)_{\sharp} P.
\end{equation}</p>

<p>As the animations above illustrate, it can behave in surprisingly unstable ways, at least in numerical experiments.</p>

<p>Consider two pairs of point clouds — blue at time 0 and red at time 1. In the top figure, the two clouds meet at a perfect right angle (90°), while in the bottom figure, the angle is slightly perturbed to 84.55°. Despite the small geometric difference, their Wasserstein interpolations diverge dramatically: the left one deforms smoothly, like kneading soft dough, whereas the right one almost performs a rigid rotation — more like a spinning baguette than a loaf being reshaped.</p>

<p>This contrast reveals both the beauty and the complexity of the Wasserstein interpolation. Optimal transport theory provides a partial explanation, yet a full understanding remains elusive — especially when we aim for predictable and controllable interpolations in practical applications.</p>

<p>Our current implementation owes much to Prof. Peyré’s excellent open-source experiments [<a href="https://www.numerical-tours.com/python/">1</a>], particularly his formulation of optimal transport via linear programming. Moving forward, we plan to experiment with faster modern solvers [<a href="https://back-and-forth.netlify.app">2</a>] and explore more general multi-marginal OT (MMOT) frameworks [<a href="https://simda-muri.github.io/mmot/">3</a>] to push these ideas further.</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="https://www.numerical-tours.com/python/">Peyre, Numerical Tours.</a></li>
  <li><a href="https://back-and-forth.netlify.app">Jacobs and Leger, The Back-and-Forth Method, 2020.</a></li>
  <li><a href="https://simda-muri.github.io/mmot/">Parno and Zhou, MMOT2D python package, 2022.</a></li>
</ol>]]></content><author><name>Bohan and Tyler</name></author><category term="mentoring post" /><summary type="html"><![CDATA[Interpolate between Point Clouds in the Wasserstein space]]></summary></entry><entry><title type="html">Ice motion</title><link href="https://silentmovie.github.io/2020/08/31/Sea-Ice-Dynamics-via-regularized-optimal-transport.html" rel="alternate" type="text/html" title="Ice motion" /><published>2020-08-31T00:00:00+00:00</published><updated>2020-08-31T00:00:00+00:00</updated><id>https://silentmovie.github.io/2020/08/31/Ice%20Motion</id><content type="html" xml:base="https://silentmovie.github.io/2020/08/31/Sea-Ice-Dynamics-via-regularized-optimal-transport.html"><![CDATA[<h5><span style="color:#F58025">Measure Ice Motion with Regularized Optimal Transport</span></h5>

<p><img class="img-fluid" src="/assets/images/posts/parno-GRL2019.png" alt="OT" /></p>

<p>In [<a href="https://agupubs.onlinelibrary.wiley.com/doi/abs/10.1029/2019GL083037">1</a>], the authors introduced an innovative approach to <strong>estimating ice motion</strong> from satellite imagery through the lens of optimal transport. The key idea is to view each image as a probability distribution and to compute an efficient, regularized optimal transport map that minimizes the “distance” between images captured on consecutive days. From this optimal transformation, one can infer displacement fields, velocities, and even strain patterns in the ice flow.</p>

<p>While elegant and computationally tractable, this framework has two main limitations. First, it is restricted to <em>two marginals</em>, meaning it can only compare images pairwise in time. Second, the entropic regularization that enables fast computation also introduces <em>blurring artifacts</em>, which can obscure fine-scale motion features.</p>

<p>These limitations motivated our project, which aims to develop an <strong>exact, multi-marginal optimal transport (MMOT)</strong>, which is capable of handling multiple time steps simultaneously while preserving sharper and more physically meaningful motion estimates.</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="https://agupubs.onlinelibrary.wiley.com/doi/abs/10.1029/2019GL083037">Parno et al., Remote measurement of sea ice dynamics with regularized optimal transport, 2019</a></li>
</ol>]]></content><author><name>Bohan</name></author><category term="learning post" /><summary type="html"><![CDATA[Measure Ice Motion with Regularized Optimal Transport]]></summary></entry><entry><title type="html">Fluid mixing</title><link href="https://silentmovie.github.io/2020/07/20/RT.html" rel="alternate" type="text/html" title="Fluid mixing" /><published>2020-07-20T00:00:00+00:00</published><updated>2020-07-20T00:00:00+00:00</updated><id>https://silentmovie.github.io/2020/07/20/Fluid%20Mixing</id><content type="html" xml:base="https://silentmovie.github.io/2020/07/20/RT.html"><![CDATA[<h5><span style="color:grey">Mixing under Rayleigh-Taylor instability</span></h5>
<!--end_excerpt-->

<div class="row">
<img class="img-fluid" src="/assets/images/posts/zmodel.mov" alt="Zmodel" />
</div>

<p>This project continues the line of research initiated in [<a href="https://epubs.siam.org/doi/pdf/10.1137/16M1083463?casa_token=0dRxZ_jt06AAAAAA:T2Bgm0RnBw64UHFZygEuj4gScaPw01fnfWQU0APePKiajut4Bui_B03K4PeqUFfZ85MaITV9ow">1</a>], where the authors derived an asymptotic model for the motion of <strong>multiphase incompressible Euler flows</strong> in two dimensions, subject to <strong>Rayleigh–Taylor (RT) instability</strong> and capable of describing <strong>turn-over phenomena</strong>.</p>

<p>The Matlab simulations in [<a href="https://github.com/silentmovie/RTmodel">2</a>] visualize the <strong>mixing process</strong> driven by RT instability — even in immiscible fluids where no diffusion is present. For a detailed discussion on how to quantify the degree of mixing without diffusion, see [<a href="https://simda-muri.github.io/mmot/">3</a>].</p>

<p>In the movie, the top panel simulates the “rocket rig” experiment (mixing of an NaI solution and pentane accelerated by rocket motors). It performs ensemble averaging over multiple runs. The second panel shows the occupied density within the zoom-in window, averaged across all realizations. The third panel tracks the evolution of mixedness in terms of $\dot{H}^{-1}$ norm. The fourth panel illustrates the influence of artificial viscosity on the dynamics.</p>

<p>Please refer to [<a href="https://arxiv.org/abs/2201.04538">4</a>] for the recent refinement and development.</p>

<hr />
<h5 id="references">References:</h5>

<ol>
  <li><a href="https://epubs.siam.org/doi/pdf/10.1137/16M1083463?casa_token=0dRxZ_jt06AAAAAA:T2Bgm0RnBw64UHFZygEuj4gScaPw01fnfWQU0APePKiajut4Bui_B03K4PeqUFfZ85MaITV9ow">Granero-Belinchon and Shkoller, A model for Rayleigh-Taylor mixing and interface turn-over, 2017.</a></li>
  <li><a href="https://github.com/silentmovie/RTmodel">Zhou, RTmodel, 2020.</a></li>
  <li><a href="https://iopscience.iop.org/article/10.1088/0951-7715/25/2/R1/pdf?casa_token=kxRedMFYm1QAAAAA:jtsmOCS0mceHwfRLlOsfEvV5YVVmZj-HNqMCKgyXhoac7HOUkUaKnyfEQlOruM9SJ1dL54_R1Q">Thiffeault, Using multiscale norms to quantify mixing and transport, 2011.</a></li>
  <li><a href="https://arxiv.org/abs/2201.04538">Pandya and Shkoller, 3D interface models for Rayleigh-Taylor Problems, 2022.</a></li>
</ol>]]></content><author><name>Bohan</name></author><category term="Research" /><summary type="html"><![CDATA[Mixing under Rayleigh-Taylor instability]]></summary></entry></feed>