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

  2. size(matching [][])←[size(TEST_FRAMES),2];

  3. for i = 1 to size (TEST_FRAMES) do

  4.   begin

  5.     for k = 1 to size(FEATURES_ACTIVITIES[]) to

  6.      begin

  7.       for l = 1 to size(FEATURES_ACTIVITIES[k][]) do

  8.        begin

  9.          if (compare(features(TEST_FRAMES[i]),FEATURES_ACTIVITIES[k,l]) = true) then

  10.            begin

  11.             for m = 1 to size(OBJECTS_FOR_ACTIVITIES[k][l][]) to

  12.              begin

  13.                 If objects(TEST_FRAMES[i]) = OBJECTS_FOR_

                      ACTIVITIES[k,l,m]) then

  14.                 begin

  15.                   matching[i][0] = k;

  16.                   matching[i][1] = l;

  17.                   send→ (k,l);

  18.                 end;

  19.              end;

  20.            end;

  21.          end;

  22.      end;

  23. send→ (matching[][])