+\subsection{Adaptive Embedding Rate}
+
+Two strategies have been developed in our scheme with respect to the rate of
+embedding which 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 is the message length that can be considered.
+Practically, a set of edge pixels is computed according to the
+Canny algorithm with high threshold.
+The message length is thus defined to be the half of this set cardinality.
+The rate between available bits and bit message length is then more than two.This constraint is indeed induced by the fact that the efficiency
+of the STC algorithm is unsatisfactory under that threshold.
+
+
+In the latter, the embedding rate is defined as a percentage between the
+number of the modified pixels and the length of the bit message.
+This is the classical approach adopted in steganography.
+Practically, the Canny algorithm generates a
+a set of edge pixels with threshold that is decreasing until its cardinality
+is sufficient. If the set cardinality is more than twice larger than the
+bit message length an STC step is again applied.
+Otherwise, pixels are randomly chosen from the set of pixels to build the
+subset with a given size. The BBS PRNG is again applied there.
+
+
+