Skip to main content
. 2019 Jan 24;19(3):487. doi: 10.3390/s19030487
Algorithm 1: IP Marks embedding the algorithm
Input: (i) Position Pn (ii) Marks sequence W
Output: (i) Pseudo position Ln (ii) Constraint function HWxy
/*Marks sequence W={w0,w1,w2,,wn}, L means that P after the Marks sequence is embedded, the virtual position generated by the constraint HWxy*/
/* Cn represent unused resource sequence Cn*/
1: Single location information Pi selected from Cn;
2: Calculate HWxy by Constraint function HFab and Pi;
3: Calculate Single pseudo location information Li by Constraint function HWxy and Pi;
4: If LiCn then
5. Store location information Pi and Li;
6: Else if LiCn then
7: Delete the element Pi from the collection Pn;
8: End If
9: Store Pi in Pn;
10: For i:= 0 to n
11: Embed wi into Location Pi in Pn;
12: End For
13: Output Ln and HWxy;