The second one randomly chooses the subset of pixels to modify by
applying the BBS PRNG again. This method is denoted \emph{adaptive+sample}.
Notice that the rate between
available bits and bit message length is always equal to 2.
This constraint is indeed induced by the fact that the efficiency
of the STC algorithm is unsatisfactory under that threshold.
The second one randomly chooses the subset of pixels to modify by
applying the BBS PRNG again. This method is denoted \emph{adaptive+sample}.
Notice that the rate between
available bits and bit message length is always equal to 2.
This constraint is indeed induced by the fact that the efficiency
of the STC algorithm is unsatisfactory under that threshold.