From Capture–Recapture to No Recapture: Efficient SCAD Even After Software Updates

. 2025 Dec 24;26(1):118. doi: 10.3390/s26010118

Algorithm A2 Percent of cycles within the norm

1:
function CCWCycles:(dataset of convex center windows $W_{CCWs}$ , index of cycle i):
2:
$W_{CCWCycles} \leftarrow []$
3:
for all $w \in W_{CCWs}$ do
4:
$W_{CCWCycles} \leftarrow OBTAIN_CCW_FOR_CYCLE (w, i)$
5:
end for
6:
return $W_{CCWCycles}$
7:
end function
8:
function CycleDists:(baseline dataset X, set of signals to compare C, index of cycle i):
9:
$X_{CCWs} \leftarrow CCCWs (X)$
10:
$C_{CCWs} \leftarrow CCWs (C)$
11:
$X_{CCWCycles} \leftarrow$ CCWCycles(X_CCWs)
12:
$C_{CCWCycles} \leftarrow$ CCWCycles(C_CCWs)
13:
$C y c l e D i s t \leftarrow []$
14:
for all $c \in C_{CCWCycles}$ do
15:
$D \leftarrow []$
16:
for all $x \in X_{CCWCycles}$ do
17:
$D \leftarrow DISTANCE (x, c)$
18:
end for
19:
$C y c l e D i s t \leftarrow AVG (D)$
20:
end for
21:
return $C y c l e D i s t$
22:
end function
23:
function Fidelity_Cycle:(baseline dataset X, set of real signals R, set of synthetic signals S, index of cycle i):
24:
$R_{CycleDists} \leftarrow$ CycleDists(X, R, i)
25:
$S_{CycleDists} \leftarrow$ CycleDists(X, S, i)
26:
$m i n i m u m \leftarrow min (R_{CycleDists})$
27:
$m a x i m u m \leftarrow max (R_{CycleDists})$
28:
$a m o u n t \leftarrow |\{s \in S_{CycleDists} ∣ m i n i m u m \leq s \leq m a x i m u m\}|$
29:
return $a m o u n t / |S_{CycleDists}|$
30:
end function