Algorithm 2: IP Marks matching algorithm

Input: (i) Pseudo Position $L_n$ (ii) Marks sequence $W^{\prime }$ Output: (i) Current design $L_n^{\prime }$ /*Marks sequence $W\prime =\{w{\prime }_0,w{\prime }_1,w{\prime }_2,\dots ,w{\prime }_n\}$, Current design $L_n^{\prime }$ means that the location of the information for embedding the Marks */ /*Compare the size of $L_n$ and $W^{\prime }$*/ 1: gets($L_n$); gets($W^{\prime }$); /*Traversing each element of the collection $L_n$ and the collection $W^{\prime }$*/ 2: for (i=0; $L\left[i\right]$!=’\0’&&$W^{\prime }\left[i\right]$!=’\0’; i++); 3: if ($L[i]\ne W\prime [i]$) 4: break; 5: else if $L\left[i\right]=W^{\prime }\left[i\right]$ 6: Embed $W^{\prime }\left[i\right]$ into Location $L\left[i\right]$ in $L_n$; 7: Store $L\left[i\right]$ in $L_n^{\prime }$; 8: End If 9: End For 10: Output $L_n^{\prime }$;