Color Image Scrambling Technique Based on Transposition of Pixels between RGB Channels Using Knight’s Moving Rules and Digital Chaotic Map

Procedure 6

Transposing pixel color values on descrambling 𝐼₀𝑖,𝑗,𝑘,𝐼^𝑎₀𝑖,𝑗,𝑘,𝐼^𝑏₀(𝑖,𝑗,𝑘),𝑃_𝑦,𝑃_𝑧,𝑘.

Require:     𝑃_𝑦,𝑃_𝑧  % the random binary value which establish the transposing rule

       𝑘     % current working color channel

Ensure:    Pixel    % Temporary variable

Pixel=𝐼₀𝑖,𝑗,𝑘

switch   𝑃_𝑦,𝑃_𝑧,𝑘

  case  (0,0,1)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘+2;𝐼^𝑏₀𝑖,𝑗,𝑘+2=𝐼^𝑎₀𝑖,𝑗,𝑘+1;𝐼^𝑎₀𝑖,𝑗,𝑘+1=Pixel

  case   (0,1,1)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘+2;𝐼^𝑏₀𝑖,𝑗,𝑘+2=Pixel

  case   (1,0,1)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘+1;𝐼^𝑏₀𝑖,𝑗,𝑘+1=𝐼^𝑎₀𝑖,𝑗,𝑘+2;𝐼^𝑎₀𝑖,𝑗,𝑘+2=Pixel

  case   (1,1,1)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘+1;𝐼^𝑏₀𝑖,𝑗,𝑘+1=Pixel

  case   (0,0,2)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘−1;𝐼^𝑏₀𝑖,𝑗,𝑘−1=Pixel

  case   (0,1,2)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘+1;𝐼^𝑏₀𝑖,𝑗,𝑘+1=𝐼^𝑎₀𝑖,𝑗,𝑘−1;𝐼^𝑎₀𝑖,𝑗,𝑘−1=Pixel

  case   (1,0,2)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑎₀𝑖,𝑗,𝑘+1;𝐼^𝑎₀𝑖,𝑗,𝑘+1=Pixel

  case   (1,1,2)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘−1;𝐼^𝑏₀𝑖,𝑗,𝑘−1=𝐼^𝑎₀𝑖,𝑗,𝑘+1;𝐼^𝑎₀𝑖,𝑗,𝑘+1=Pixel

  case   (0,0,3)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘−2;𝐼^𝑏₀𝑖,𝑗,𝑘−2=𝐼^𝑎₀𝑖,𝑗,𝑘−1;𝐼^𝑎₀𝑖,𝑗,𝑘−1=Pixel

  case   (0,1,3)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘−1;𝐼^𝑏₀𝑖,𝑗,𝑘−1=𝐼^𝑎₀𝑖,𝑗,𝑘−2;𝐼^𝑎₀𝑖,𝑗,𝑘−2=Pixel

  case   (1,0,3)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑎₀𝑖,𝑗,𝑘−2;𝐼^𝑎₀𝑖,𝑗,𝑘−2=Pixel

  case   (1,1,3)

   𝐼₀𝑖,𝑗,𝑘=𝐼^𝑏₀𝑖,𝑗,𝑘−1;𝐼^𝑏₀𝑖,𝑗,𝑘−1=Pixel

end