minor reviews

022_ErrorResilience/RobustTransmissionReview.tex

@@ -253,7 +253,7 @@ In the decoder-side, an \ac{ec} method was later used to take advantage of such
 
 A network feedback mechanism was proposed in \cite{ErrorResilienceRPSFeb2009} to reduce error propagation at end-user decoders, by dynamically selecting the reference frame only among those correctly received.
 Figure~\ref{fig2:ReferencePictureSelection} shows an example of an error resilience transcoding scheme, where the original temporal predictions (represented by the solid arrows) are transcoded to use only correctly received frames as reference, i.e., prediction represented by the dashed arrow. This is done based on network feedback.
-\HIGHLIGHT{As this technique requires transcoding operations, the complexity increase with the \ac{gop} lengths, as reported in~\cite{ErrorResilienceRPSFeb2009}. Typically, the \ac{gop} length is defined taking into consideration the video application (i.e., maximum refresh period allowed) and not by the robust coding scheme.}
+\HIGHLIGHT{As this technique requires transcoding operations, the complexity increase with the \ac{gop} lengths, as reported in~\cite{ErrorResilienceRPSFeb2009}. Typically, the \ac{gop} length is defined by taking into consideration the video application (i.e., synchronisation, random-access or maximum refresh period allowed) and not by the robust coding scheme.}
 A more advanced scheme may be considered, where only the regions affected by mismatch predictions are processed in the compressed domain, and subsequently transcoded to limit the dependencies from lost frames.
 To achieve low complexity, \ac{mv} concatenation can be used, in order to obtain new inter-predictions for error-free frames \cite{MVConcatenationAug2011}.