Algorithm 1: Translation process of the colors belonging to the set V

Inputs: The sets $V$, ${\Phi }_V$, $C{L}_D$; Output: The set $V_{rec}$

Set ${\left|{\Phi }_V\right|}_0=\left|{\Phi }_V\right|$ and ${\left|C{L}_D\right|}_0=\left|C{L}_D\right|$

While$\left|{\Phi }_V\right|>0$and$\left|C{L}_D\right|>0$do

1.Apply Equation (13) to estimate the $v_{\ast }\in {\Phi }_V$ with the highest rank.  2.Apply Equation (14) to identify the confusion line $L_{\ast }\in C{L}_D$, which is closer to $v_{\ast }$.  3.Apply Equation (15) to translate the color $v_{\ast }$ to its projection point $v_{\ast ,tr}$ lying on $L_{\ast }$.  4.Apply Equation (16) to update the set ${\Phi }_V$  5.Apply Equation (17) to update the set $C{L}_D$

End While

6.Apply Equation (18) to recolor the elements of $V$ and form the recolored set $V_{rec}$ in Equation (19)