Table - PMC

Skip to main content

View full-text article in PMC

. 2020 Apr 29;20(9):2513. doi: 10.3390/s20092513

Algorithm 1 findLocationClusters.

Input:

{\vec{F}}_{k}^{l}, λ^{l}, (Δ_{1}^{h}, Δ_{2}^{h}, \dots Δ_{\hat{h}}^{h}), (Δ_{1}^{l}, Δ_{2}^{l}, \dots Δ_{m}^{l})

Output: ${\vec{c}}_{k}^{l}, {\hat{\vec{c}}}_{k}^{l}$

1:
${\vec{c}}_{k}^{l} \leftarrow \vec{0}$
2:
$c l u s t e r I D = 1$
3:
${\hat{o}}_{c l u s t e r I D}^{l} = c l u s t e r I D$
4:
for $i \leftarrow 1$ to m do
5:
$u p d a t e C l u s t e r = f a l s e$
6:
if $o_{i}^{l} = 0$ then
7:
for $j \leftarrow 1$ to m do
8:
for $a \leftarrow 1$ to $\hat{h}$ do
9:
compute $Y^{l} (i, j)$ as in Equation (6)
10:
if $(1 - Y^{l} (i, j) < 0.5 \land o_{j}^{l} = 0)$ then
11:
$o_{j}^{l} = c l u s t e r I D$ //assign i and j to the same cluster
12:
$u p d a t e C l u s t e r = t r u e$
13:
end if
14:
end for
15:
end for
16:
if $(u p d a t e C l u s t e r)$ then
17:
$c l u s t e r I D = c l u s t e r I D + 1$
18:
${\hat{o}}_{c l u s t e r I D}^{l} = c l u s t e r I D$
19:
end if
20:
end if
21:
end for