are in $O(2Tn)$.
Finally, thresholding with hysteresis is in $O(n^2)$.
The overall complexity is thus in $O((5^3+4T+1)n^2)$.
-To summarize, for the embedding map construction, the complexity of Hugo is
-dramatically larger than our scheme.
+
+
+
+
We are then left to express the complexity of the STC algorithm.
According to~\cite{DBLP:journals/tifs/FillerJF11}, it is
matrix. Its complexity is thus negligible compared with the embedding map
construction.
+To summarize, for the embedding map construction, the complexity of Hugo, WOW
+and UNIWARD are dramatically larger than the one of our scheme:
+STABYLO is in $O(n^2)$
+whereas HUGO is in $O(n^2\ln(n)$, and WOW and UNIWARD are in $O(n^4\ln(n))$.
+Thanks to these complexity results, we claim that STABYLO is lightweight.
+
-Thanks to these complexity results, we claim that STABYLO is lightweight.
