the cover pixel selection (Sect.~\ref{sub:edge}),
the adaptive payload considerations (Sect.~\ref{sub:adaptive}),
and how the distortion has been minimized (Sect.~\ref{sub:stc}).
-The message extraction is then presented (Sect.~\ref{sub:extract}) while a running example ends this section (Sect.~\ref{sub:xpl}).
+The message extraction is then presented (Sect.~\ref{sub:extract}) while a running example ends this section.
The flowcharts given in Fig.~\ref{fig:sch}
\subsection{Security considerations}\label{sub:bbs}
+To provide a self-contained article without any bias, we shor\-tly
+present the selected encryption process.
Among the methods of message encryption/decryption
(see~\cite{DBLP:journals/ejisec/FontaineG07} for a survey)
we implement the asymmetric
In this article, in the Adaptive strategy
we consider that all the edge pixels that
have been selected by this algorithm have the same
-distortion cost \textit{i.e.} $\rho_X$ is always 1 for these bits.
+distortion cost, \textit{i.e.}, $\rho_X$ is always 1 for these bits.
In the Fixed strategy, since pixels that are detected to be edge
-with small values of $T$ (e.g. when $T=3$)
+with small values of $T$ (e.g., when $T=3$)
are more accurate than these with higher values of $T$,
we give to STC the following distortion map of the corresponding bits
$$
\rho_X= \left\{
\begin{array}{l}
-1 \textrm{ if an edge for $T=3$} \\
-10 \textrm{ if an edge for $T=5$} \\
-100 \textrm{ if an edge for $T=7$}
+1 \textrm{ if an edge for $T=3$,} \\
+10 \textrm{ if an edge for $T=5$,} \\
+100 \textrm{ if an edge for $T=7$.}
\end{array}
\right.
-$$.
+$$
