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