Skip to main content
. Author manuscript; available in PMC: 2018 Sep 17.
Published in final edited form as: J Math Imaging Vis. 2017 Mar 23;59(2):187–210. doi: 10.1007/s10851-017-0726-4

Algorithm 2 An Entropy Regularised Approach [5, 16]

Input: discrete functions f = (f1,…,fn), g = (g1, …, gn), discrete measures μ=∑i=1npiδxi,ν=∑j=1nqjδxj, the parameter ε and a stopping condition.
1: Set r = 0, K=(exp(−c(xi,xj;f,g)ɛ))ij and u(0) = 𝕀 ∈ ℝn.
2: repeat
3:  Let r↦r+ 1, υ(r)=q_K⊺u(r−1)and u(r)=p_Ku(r) where p =(p1,…pn),q= (q1,…qn)
4: until Stopping condition has been reached
5: Set π = diag(u(r))𝒦diag(v (r)).
Output: An estimate π on the optimal plan for Sε where the accuracy is determined by the stopping condition.