Multi-Target PIR Indoor Localization and Tracking System with Artificial Intelligence

. 2022 Dec 2;22(23):9450. doi: 10.3390/s22239450

Algorithm 1: Model Performance Evaluation

Input: Denote

c e l l_{n}^{i}

as the predicted cell number of the target

i

in data n

.
Output: Denote

s c o r e^{i}

as model evaluation score with the target

i

i

: the target index

c

: the cell index

n

: the index of data samples

K

: the cell index set of actual target presence and neighboring cells

K^{'}

: the number of neighboring cells (i.e.,

K^{'} = K - \{i\}

)

1:
▶ Initialize:
2:
$s c o r e_{t r u e}^{i}, s c o r e_{d e v i a t i o n}^{i}, s c o r e^{i} \leftarrow 0$
3:
${s c o r e}_{t r u e} \leftarrow \frac{1}{I}$ ▷ Maximum target number $I$ .
4:
${s c o r e}_{d e v i a t i o n} \leftarrow \frac{1}{2 \times I}$ ▷ The evaluation scores.
5:
$n \leftarrow 0$
6:
▶ Start:
7:
While $n$ < the number of data records for model prediction
8:
▶ Initial Sequence (target $i$ in location $c e l l_{n}^{i} (c)$ )
9:
for $0 < I$
10:
for $0 < |K|$ $(i . e ., the cardinality of the set K$ )
11:
if $c e l l_{n}^{i}$ is equal to $s o l u t i o n_{n}^{i}$
12:
$s c o r e_{t r u e}^{i} \leftarrow s c o r e_{t r u e}^{i} + {s c o r e}_{t r u e}$
13:
else if $c e l l_{n}^{i}$ is equal to $o t h e r_{n_{c}}^{i}$
14:
$s c o r e_{d e v i a t i o n}^{i} \leftarrow s c o r e_{d e v i a t i o n}^{i} + {s c o r e}_{d e v i a t i o n}$
15:
else
16:
$s c o r e_{d e v i a t i o n}^{i} \leftarrow s c o r e_{d e v i a t i o n}^{i}$
17:
end if
18:
end for
19:
end for
20:
▶ Permutation Invariant (target $i$ in location $c e l l_{n}^{j} (c)$ )
21:
▷ c $\in K$ and $\in K' (= K - \{c\})$
22:
for $\forall j \in K'$
23:
if $s c o r e_{t r u e}^{j}$ and $s c o r e_{d e v i a t i o n}^{j}$ do not increase
24:
for $0 < |K| (i . e ., the cardinality of the set K)$
25:
if $c e l l_{n}^{j}$ is equal to $s o l u t i o n_{n}^{j}$
26:
$s c o r e_{t r u e}^{j} \leftarrow s c o r e_{t r u e}^{j} + {s c o r e}_{t r u e}$
27:
else if $c e l l_{n}^{j}$ is equal to $o t h e r_{n_{c}}^{j}$
28:
$s c o r e_{d e v i a t i o n}^{j} \leftarrow s c o r e_{d e v i a t i o n}^{j} + {s c o r e}_{d e v i a t i o n}$
29:
else
30:
$s c o r e_{d e v i a t i o n}^{j} \leftarrow s c o r e_{d e v i a t i o n}^{j}$
31:
end if
32:
end for
33:
end if
34:
end for
35:
$n \leftarrow n + 1$
36:
end while

“▶” is the comment of main step and “▷” is the comment of note.