Vascular Tree Reconstruction by Minimizing A Physiological Functional Cost

. Author manuscript; available in PMC: 2011 Jul 11.

Published in final edited form as: Conf Comput Vis Pattern Recognit Workshops. 2010 Jun 13:178–185. doi: 10.1109/CVPRW.2010.5543593

Algorithm 2: Vascular tree reconstruction
begin
Initialize D⁽⁰⁾ by the Euclidean distance between any pair of vertices in *;
while f^c(D⁽^k⁾) – f^c(D⁽^k⁺¹⁾) > ε do
/*Optimize connections at vertices in each category, refer (5)	*/
for Category = 1 to 3 do
Update the tree by RMST(D⁽^k⁾);
Calculate { $g_{n}^{c}$ } for the current category;
Sort $g_{n}^{c}$ to select ^opt with first N^g greatest $g_{n}^{c}$ in the current category;
Update D⁽^k⁾ → D⁽^k⁺¹⁾ by (12);
^ = RMST(D(^final));
end