This was particularly apparent for those in the MI group who showed a larger increase in meaning recall after prompting (M=0.55, SD=0.45) than BPC (M=0.40, SD=0.41) (interaction term 0.14, 0.00 to 0.28, p=0.04).
Transmission range of node is adjusted based on R j Table 2 BPC algorithm BPC algorithm - Annulus number is set to i when bi-1≤ R ≤ b i (b k for k = 1,..., i is obtained from Equation (5)) - Nodes in annulus 1 transmit data directly.
For the capacity of Outguess is around 0.3 bpc, it is not shown in the figure.
For payload of 0.25 bpc, both methods show 0.2961 and 0.3353 of the error probability.
The PSNR of Outguess is not higher than 32.86 db at 0.3 bpc (bit per nonzero AC coefficient) but of our method is higher than 37 db even at 0.72 bpc.
For higher payloads around 0.15 and 0.2 bpc, the proposed methods show much better performance compared to the MME.
For payloads up to 0.1 bpc, both methods have detectability close to 50%, meaning that the steganalysis cannot distinguish the unmodified images from the modified.
As a representative example, Figure 6 plots distribution of the (2,1 th quantized AC components for cover image "Lena" and its corresponding stego image with an embedding rate of 0.46 bpc.
Even though the proposed method requires to use the same BCH-based scheme (for 0.17 and 0.2 bpc), the efficiency of data hiding is still high because the proposed two-scheme embedding has a lower ratio k1k2 compared to the original BCH-based scheme.
This region maps to the loop 3b-3c regiof of DDB1 BPC, which is somewhat variable, and in fact has an extra loop in animal DDB1s.
