Table - PMC

Skip to main content

View full-text article in PMC

. 2020 Mar 23;20(6):1773. doi: 10.3390/s20061773

Algorithm 2 Detailed matching

Input: - Flexible template (T)
- Set of potentially matching contours (M)
- Set of starting points for each i ^th contour (S _i)
- Set of feature point combinations for m_i€M and s_ij€S_i (F_ij)
- Maximum acceptable error (err)
Output: - Identified contour (I)
- Starting point for this contour (P)
- Set of feature points for identified contour (FP)
v ← 0% reset variant number
for each m_i€M do
for each s_ij€S_i do
for each f_ijk€F_ij do
for each point pf_ijkl€f_ijk do
adjust parameters of l^th segment of template T
end for
r ← 0% reset contour point number
for each pf_ijkl€f_ijk do
n ← get number of points corresponding to l^th template segment
for q = 1..n do
r ← r + 1% increase contour point number
d_ijkr ← calculate distance between q^th point and the template
end for
end for
match ← false % auxiliary logical variable
mse_ijk ← calculate the mean squared error for d_ijkt where t = 1..r
if mse_ijk < err then
v ← v + 1
if v = 1 then
match ← true
else
if mse_ijk < min_err then
match ← true
end if
end if
if match then
min_err = mse_ijk % min_err is the smallest error until now
I ← m_i
P ← s_ij
FP ← F_ijk
end if
end if
end for
end for
end for