Skip to main content
. 2020 Feb 6;20(3):875. doi: 10.3390/s20030875
Algorithm 1 Geometric invariance check
Input: KS, KT, t.
Output: KS_out, KT_out.
  • 1.

    KS_out = [], KT_out = []

  • 2.

    n = Size(KS);

  • 3.

    C = ComputeCardinality(n);

  • 4.

    [GS, GT] = RandomSelection(KS, KT, C);

  • 5.

    For each item i of GS do

  • 6.

    CLLS = ComputeCLL(GS[i]); CLLT = ComputeCLL(GT[i]);

  • 7.

    Count = 0;

  • 8.

    For each item j of CLLS do

  • 9.

      If (min(CLLS[j].Length, CLLT[j].Length)max(CLLS[j].Length, CLLT[j].Length)t) then

  • 10.

       Count = Count + 1;

  • 11.

      End If

  • 12.

      If (Count == C) then

  • 13.

       Insert GS[i] in KS_out; Insert GT[i] in KT_out;

  • 14.

      End If

  • 15.

    End For

  • 16.

    End For

  • 17.

    ReturnKS_out, KT_out.