. Author manuscript; available in PMC: 2010 May 1.

Published in final edited form as: Ann Biomed Eng. 2009 Mar 11;37(5):913–926. doi: 10.1007/s10439-009-9666-5

Algorithm 1.

Linear exhaustive search with linked patches

Match_max = –1

p1 = p(x, y₁)

p2 = p(x, y₂)

for all x_i ∈ search area do

y_1j = argmax_y{Match(p1, p(x_i, y)) | y ∈ search area}

y_2j = argmax_y{Match(p2, p(x_i, y)) | y ∈ search area}

Match_i = Match(p1, p(x_i, y_1j)) + Match(p2, p(x_i, y_2j))

if Match_i > Match_maxthen

Match_max = Match_i

x′ = x_i;

y_{1}^{'} = y_{1 j}

;

y_{2}^{'} = y_{2 j}

;

end if

end for

p 1^{'} = p (x^{'}, y_{1}^{'})

p 2^{'} = p (x^{'}, y_{2}^{'})