Skip to main content
. 2022 Mar 17;22(6):2321. doi: 10.3390/s22062321
Algorithm A4: 1D & 2D Filtered Dataset Compression.
 Data: filtered_dataset, ascii_diccionary(customised), pair, char_diccionary
 Result: compressed_dataset
 compressed_dataset ← empty_array();
 nt ← number_of_rows();
 pair ← empty_array();
 char ← empty_array();
 for n in range(0,nt) do
   FD ← filtered_dataset[n];
   D ← ascii_diccionary;
   C ← char diccionary;
   for i in range(FD) do
     append FD[i] − FD[i + 1] to pair;
     if C.has_key(FD[i]) then
    append C[i] to compressed_dataset;
    if D.has_key(pair) then
     append D[pair] to compressed_dataset;
    else
     append pair to compressed_data;
   end.
   else
   echo “error message”
   end    
  end
 end