Skip to main content
. 2020 Apr 30;20(9):2571. doi: 10.3390/s20092571
Algorithm 1—Pseudocode:

  1. initialisation;

  2. k, l←0;

  3. size (ACTIVITIES [][])←[k,l];

  4.  for i = 1 to size(FRM) do

  5.    begin

  6.       if (compare (FRAME[i], REF_FRAME_START_STOP) = true then

  7.        begin

  8.         inc(k);

  9.         l←0;

  10.        end

  11.       else

  12.        begin

  13.         inc(l);

  14.         size (ACTIVITIES [] []) ← [k,l];

  15.         ACTIVITIES[k][l] = FRAME[i];

  16.        end;

  17.    end;

  18. send→(ACTIVITIES [][]);