-
-
-\subsection{Adaptive Embedding Rate}
-Two strategies have been developed in our scheme,
-depending on the embedding rate that is either \emph{adaptive} or \emph{fixed}.
-
-In the former the embedding rate depends on the number of edge pixels.
-The higher it is, the larger the message length that can be inserted is.
-Practically, a set of edge pixels is computed according to the
-Canny algorithm with an high threshold.
-The message length is thus defined to be half of this set cardinality.
-In this strategy, two methods are thus applied to extract bits that
-are modified. The first one is a direct application of the STC algorithm.
-This method is further referred to as \emph{adaptive+STC}.
-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.
-In our experiments and with the adaptive scheme,