Rename files and folders
This commit is contained in:
1 parent
4aea167b89
commit
61dd330c24
20 files changed
+114
-145
No files matched your search
@@ -1,8 +1,5 @@
|
||||
% Figure folders
|
||||
|
||||
\newcommand{\HEVCRobustnessEvaluation}{./031_ErrorResilienceEvaluation/QualityEvaluation}
|
||||
\newcommand{\DynamicTMVP}{031_ErrorResilienceEvaluation/DynamicTmvp}
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% CHAPTER
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
@@ -16,8 +13,8 @@
|
||||
\section{Introduction}
|
||||
|
||||
The use of \ac{hevc} in different type of application and video services over networks that are prone to errors and packet losses, requires mechanisms to minimise the effect of such probabilistic events. This chapter starts by presenting an evaluation study about the error resilience of \ac{hevc} in Section~\ref{Section3:ErrorResilienceEvaluation}, with the aim of defining the weak elements of coded streams and the level of error robustness under different transmission loss conditions. The evaluation study covers different coding configuration to evaluate the individual impact of some new coding tools introduced in this standard, e.g., increased partition size, intra-refreshing, slice partitioning and advanced motion vector prediction.
|
||||
|
||||
Then, in Section~\ref{Section3:DynamicMVRefreshHEVC}, based on the results of the simulation study, a novel method to increase the error robustness of the \ac{mv} coding is presented and compared to existing techniques.
|
||||
|
||||
Then, in Section~\ref{Section3:DynamicMVRefreshHEVC}, based on the results of the simulation study, a novel method to increase the error robustness of the \ac{mv} coding is presented and compared to existing techniques.
|
||||
The proposed method introduces refresh points in the motion prediction used in the \ac{hevc}, which significantly reduces the impact of mismatch \ac{mv} predictions.
|
||||
Finally, Section~\ref{Section3:Summary} concludes the chapter.
|
||||
|
||||
@@ -45,7 +42,7 @@ This is the main focus of the study presented in this section.
|
||||
|
||||
There are some studies presented in the past regarding the error robustness of the \ac{hevc} standard, which are worth to be mentioned as they provide relevant insights for the research carried out in this work. In~\cite{StudyHEVCErrorsDez2012,HEVCWireless_2016} the coding efficiency and error robustness of the \ac{hevc} are evaluated and compared against the \ac{h264}. Experimental results confirm that \ac{hevc} has reduced error robustness despite its increased coding efficiency.
|
||||
A subjective evaluation study is presented in~\cite{SubjectiveEvalSep2013,QoEHEVCMay2014} revealing that packet loss ratios higher than $3\%$ have significant effect on the perceived video quality.
|
||||
The vulnerability of \ac{mv} prediction is investigated and its impact on the error robustness is evaluated in \cite{DynamicTMVP2011}.
|
||||
The vulnerability of \ac{mv} prediction is investigated and its impact on the error robustness is evaluated in \cite{DynamicTMVP2011}.
|
||||
Moreover, in the same study, a method to introduce \ac{mv} refresh points is proposed, achieving average \ac{psnr} gains of approximately 3~dB.
|
||||
Summarising, the decrease in error robustness is mostly due to the strong data dependencies imposed by the highly complex prediction modes of \ac{hevc}. Since these are selected according to a rate distortion optimisation criterion that assumes error-free transmission, the decoder faces different problems whenever errors or data loss occur in the transmission network \cite{ROPE2007}.
|
||||
|
||||
@@ -68,7 +65,7 @@ Considering a test sequence with $N$ frames $f(t)$ the pixel values (Luma compon
|
||||
\begin{itemize}
|
||||
\item {\ac{si}} based on Sobel filter. Each video frame is firstly filtered, then the standard deviation ($std$) of the pixel values is computed. Finally, the maximum value over time ($\maxop_{t\in [1..N]}$), is chosen to represent the \ac{si} metric. This process can be represented by the following equation:
|
||||
\begin{equation}
|
||||
% SI = max_{time}\Big\{ std \big( Sobel\left(f_t\right) \big) \Big\}.
|
||||
% SI = max_{time}\Big\{ std \big( Sobel\left(f_t\right) \big) \Big\}.
|
||||
SI = \maxop_{t\in [1..N]} \Big\{ std \big( sobel\left(f\left(t\right)\right) \big) \Big\}.
|
||||
\end{equation}
|
||||
\item {\ac{ti}} based upon the motion difference, which is given by the difference between the pixel values at the same spatial location but in consecutive time instances. \ac{ti} is computed as the maximum displacement over time of the standard deviation over space. Larger displacements in adjacent frames will result in higher values of \ac{ti}. This process can be represented by the following:
|
||||
@@ -77,7 +74,7 @@ Considering a test sequence with $N$ frames $f(t)$ the pixel values (Luma compon
|
||||
TI = \maxop_{t\in [2..N]} \Big\{ std \big( f\left(t\right) - f\left(t-1\right) \big) \Big\}.
|
||||
\end{equation}
|
||||
\end{itemize}
|
||||
The values of \ac{si} and \ac{ti} calculated for the test sequences are shown in the Table~\ref{TableTestSequences} (second column).
|
||||
The values of \ac{si} and \ac{ti} calculated for the test sequences are shown in the Table~\ref{TableTestSequences} (second column).
|
||||
The percentage of inter-coded blocks and the bitrates are also shown in the table and explained below.
|
||||
|
||||
\input{031_ErrorResilienceEvaluation/TablesSequences.tex}
|
||||
@@ -107,7 +104,7 @@ Moreover, the ratio of inter-coded \acs{cu} of each coded sequence using the def
|
||||
|
||||
To simulate the lossy transmission environment, each frame is divided into several slices and each slice encoded and packetized into one \ac{nal} unit, which are then transmitted as the payload of independent packets.
|
||||
In these simulations a whole packet is lost whenever an error occurs, originating a lost slice.
|
||||
\HIGHLIGHT{Random packet loss was simulated using a two-state Markov model, derived from the classical Gilbert-Elliot \cite{GilbertModel_1960, ElliotModel_1963}, which can be used to describe error patterns in real time video applications~\cite{GilbertElliotModelPlr_2008}. In this study a simplified version of the Gilbert-Elliot model was used by only defining the loss probability without control over burst loss events.
|
||||
\HIGHLIGHT{Random packet loss was simulated using a two-state Markov model, derived from the classical Gilbert-Elliot \cite{GilbertModel_1960, ElliotModel_1963}, which can be used to describe error patterns in real time video applications~\cite{GilbertElliotModelPlr_2008}. In this study a simplified version of the Gilbert-Elliot model was used by only defining the loss probability without control over burst loss events.
|
||||
The application of this model results in loss patterns with approximately the same average burst loss as the ones provided in \cite{JCTVCLossSim_2012}.
|
||||
For each test condition, 50 runs were performed and the average \ac{psnr} was measured. Four different \acs{plr} are used resulting in the characteristics presented in Table~\ref{TAB3:LossPatterns}.}
|
||||
The remaining configurations have been kept at their default values, as given in the common test conditions~\cite{HEVCCommonTests2012}.
|
||||
@@ -130,11 +127,11 @@ In the first set of experiments the impact of the maximum \ac{cu} size in the de
|
||||
Table~\ref{Table3:Quality_BlockSize} shows the average \ac{psnr} (dB) obtained for the three test conditions and for three different packet loss ratios. Results for the error-free scenario shows a consistent quality increase as the maximum \ac{cu} size increases,
|
||||
% up to a maximum of 1.41~dB for the Tennis sequence
|
||||
when comparing the maximum \ac{cu} size of $64\times64$ with $16\times16$.
|
||||
This confirms the principle used by the \ac{hevc} standard, whereby larger coding units lead to higher coding efficiency.
|
||||
For the Tennis sequence, which has the highest \ac{ti} parameter (see Table~\ref{TableTestSequences}), a maximum of 1.41~dB is achieved.
|
||||
Moreover, it is also noticeable that sequences with higher amount of inter-coded blocks take less advantage of the larger \acs{cu}.
|
||||
This confirms the principle used by the \ac{hevc} standard, whereby larger coding units lead to higher coding efficiency.
|
||||
For the Tennis sequence, which has the highest \ac{ti} parameter (see Table~\ref{TableTestSequences}), a maximum of 1.41~dB is achieved.
|
||||
Moreover, it is also noticeable that sequences with higher amount of inter-coded blocks take less advantage of the larger \acs{cu}.
|
||||
This is noticeable in the results of the BQSquare sequence (i.e., highest ratio of inter-coded blocks and lowest quality gain in the error-free case).
|
||||
Overall, comparing the results for the error-free and data loss cases, it is noticeable that similar quality gains are obtained, mostly due to the superior coding efficiency of larger \acs{cu}.
|
||||
Overall, comparing the results for the error-free and data loss cases, it is noticeable that similar quality gains are obtained, mostly due to the superior coding efficiency of larger \acs{cu}.
|
||||
In most cases the quality gains slightly decrease for increasing \acs{plr}.
|
||||
Therefore, one may conclude that the error robustness of \ac{hevc} streams is not affected by limiting the maximum \ac{cu} size.
|
||||
|
||||
@@ -144,8 +141,8 @@ Therefore, one may conclude that the error robustness of \ac{hevc} streams is no
|
||||
% \resizebox{\columnwidth}{!}{
|
||||
\begin{tabular}{y{.45\columnwidth}y{.45\columnwidth}}
|
||||
\small
|
||||
\includegraphics[width=\FIGSIZE]{\HEVCRobustnessEvaluation/Bask_Partitions_16.png} &
|
||||
\includegraphics[width=\FIGSIZE]{\HEVCRobustnessEvaluation/Bask_Partitions_64.png} \\
|
||||
\includegraphics[width=\FIGSIZE]{./031_ErrorResilienceEvaluation/QualityEvaluation/Bask_Partitions_16.png} &
|
||||
\includegraphics[width=\FIGSIZE]{./031_ErrorResilienceEvaluation/QualityEvaluation/Bask_Partitions_64.png} \\
|
||||
(a) $16\times16$ & (b) $64\times64$ \\
|
||||
\end{tabular}
|
||||
% }
|
||||
@@ -154,7 +151,7 @@ Therefore, one may conclude that the error robustness of \ac{hevc} streams is no
|
||||
\end{figure}
|
||||
|
||||
Figure~\ref{Figure3:BlockPartitionBask} illustrates an example of the frame partitions for a region of the Basketball Drill sequence for two cases: (i) maximum \ac{cu} size of $64\times64$ and (ii) maximum \ac{cu} size of $16\times16$.
|
||||
As shown, in the moving regions, e.g., moving player, the partitions obtained for both cases have a similar pattern, mainly composed of \acs{cu} with small size. Larger \acs{cu} are only used in the floor, which has a lower spatial complexity and suffers small changes between frames, therefore, easier to compress with $64\times64$ \acs{cu}.
|
||||
As shown, in the moving regions, e.g., moving player, the partitions obtained for both cases have a similar pattern, mainly composed of \acs{cu} with small size. Larger \acs{cu} are only used in the floor, which has a lower spatial complexity and suffers small changes between frames, therefore, easier to compress with $64\times64$ \acs{cu}.
|
||||
Moreover, those regions can be more accurately recovered, by using neighbouring information correctly decoded (spatial and temporal), thus not incurring in severe error propagation.
|
||||
Therefore, the overall error robustness is not affected by reducing the maximum \ac{cu} size. One may conclude that the use of larger coding units is able to improve the overall \ac{hevc} efficiency in error-free and error prone communications.
|
||||
|
||||
@@ -178,14 +175,14 @@ This allows the decoder to recover from frame/slice loss and continue error-free
|
||||
Figure~\ref{Figure3:QualityvsIntra} shows the average decoded video quality (\ac{psnr}) for different distances of intra frames, covering \acs{plr} between 3\% and 5\%.
|
||||
Results in the figure indicate that as the distance between intra frames increases, the decoded video quality significantly decreases.
|
||||
The quality decreasing is especially noticeable for intra periods higher than 32 frames, indicating that temporal distances greater than approximately one second are not suitable for video streaming under error-prone conditions.
|
||||
When a high temporal distance between intra frames is used, the quality decreasing is more noticeable in the People On Street and BQSquare sequences, which have higher spatial complexity (see values for \ac{si}), leading to a reduction of 13 dB and 14 dB, respectively.
|
||||
When a high temporal distance between intra frames is used, the quality decreasing is more noticeable in the People On Street and BQSquare sequences, which have higher spatial complexity (see values for \ac{si}), leading to a reduction of 13 dB and 14 dB, respectively.
|
||||
As spatial complexity increases, the prediction residue energy also increases, which leads to more erroneous information in case of data loss, reducing the video quality under errors.
|
||||
|
||||
One should also note from the results of Figure~\ref{Figure3:QualityvsIntra} that, using a small distance between intra frames is not always more efficient.
|
||||
Since intra frames require higher amount of bits, the overall coding efficiency is reduced, resulting in lower overall quality in case of data loss, when comparing with other cases.
|
||||
This is clearly noticeable for the Four People sequence, where replacing the intra period from 8 to 16 frames leads to a quality increase of 1 dB for 5\% of \ac{plr}.
|
||||
For the remaining sequences it can be concluded that using sixteen frames (not higher than half a second) between refresh points (i.e., intra frames) yields an acceptable efficiency under errors.
|
||||
This provides a good trade-off between compression efficiency and error robustness in case of data loss.
|
||||
For the remaining sequences it can be concluded that using sixteen frames (not higher than half a second) between refresh points (i.e., intra frames) yields an acceptable efficiency under errors.
|
||||
This provides a good trade-off between compression efficiency and error robustness in case of data loss.
|
||||
For this reason for the remaining experimental evaluation an \ac{idr} of 16 frame will be used.
|
||||
|
||||
|
||||
@@ -207,16 +204,16 @@ Figure~\ref{Figure3:SlicePartitioning} shows the average \ac{psnr} for four diff
|
||||
The first three modes are characterised by a different amount of bytes per slice (B/S), namely 1200, 2400 and 4800 bytes. In these cases each frame has a variable number of slices.
|
||||
The last mode uses a single slice per frame (referred to as \textit{SS}), corresponding to the case where slice partitioning is disabled.
|
||||
The results shown in Figure~\ref{Figure3:SlicePartitioning} reveal a clear impact of the slice partitioning mode on the error robustness of \ac{hevc}, as the quality degradation for increasing \ac{plr} changes significantly for each mode.
|
||||
Comparing the cases with fixed amount of bytes per slice, it is clearly noticeable that a higher amount of bytes also corresponds to a higher quality degradation.
|
||||
Comparing the cases with fixed amount of bytes per slice, it is clearly noticeable that a higher amount of bytes also corresponds to a higher quality degradation.
|
||||
This is true for the results of most test sequences shown in Figure~\ref{Figure3:SlicePartitioning}.
|
||||
Although the use of smaller slices increases the overhead required for slice headers, the superior error robustness achieved with 1200 B/S is able to overcome the inherent degradation on coding efficiency.
|
||||
This is due to the lack of refresh points within a frame, resulting in errors that affect larger regions of the frame, which are propagated to the subsequent inter predicted frames.
|
||||
|
||||
The results for of \textit{SS} (slice partitioning disabled) reveals that this approach also leads to lower error robustness when comparing with those cases where the frames are divided into multiple slices.
|
||||
The results for of \textit{SS} (slice partitioning disabled) reveals that this approach also leads to lower error robustness when comparing with those cases where the frames are divided into multiple slices.
|
||||
Although higher coding efficiency is achieved in this mode, the lower error robustness leads to an overall poor performance under frame or slice loss conditions.
|
||||
It is worthwhile to notice that the results for Kendo sequence do not follow the main trend.
|
||||
This can be explained by the low bitrate required to compress the video signal, which is the lowest when compared with the other test sequences (see Table~\ref{TableTestSequences}).
|
||||
Therefore, most of the inter-coded frames can be transmitted using a single slice, even with 1200 bytes per slice, resulting in a similar partitioning for all tested modes, and thus similar error robustness.
|
||||
It is worthwhile to notice that the results for Kendo sequence do not follow the main trend.
|
||||
This can be explained by the low bitrate required to compress the video signal, which is the lowest when compared with the other test sequences (see Table~\ref{TableTestSequences}).
|
||||
Therefore, most of the inter-coded frames can be transmitted using a single slice, even with 1200 bytes per slice, resulting in a similar partitioning for all tested modes, and thus similar error robustness.
|
||||
In this case, the higher coding efficiency achieved by the \textit{SS} case also leads to higher quality in case of errors.
|
||||
|
||||
|
||||
@@ -272,7 +269,7 @@ Moreover, the slice partitioning mode used only 1200 bytes per slice, which intr
|
||||
\begin{figure}[!t]
|
||||
\centering
|
||||
\renewcommand{\FIGSIZE}{0.76\textwidth}
|
||||
% \includegraphics[width=\FIGSIZE,page=2]{\HEVCRobustnessEvaluation/PSNRvsFrameSingleFrameTMVP}
|
||||
% \includegraphics[width=\FIGSIZE,page=2]{./031_ErrorResilienceEvaluation/QualityEvaluation/PSNRvsFrameSingleFrameTMVP}
|
||||
\input{./031_ErrorResilienceEvaluation/QualityEvaluation/PSNRvsFrameSingleFrameTMVP}
|
||||
\caption{Error propagation for Kendo sequence when Frame~\#6 is lost for the \ac{ld} configuration using different TMVP configurations.}
|
||||
\label{Figure3:PSNRvsFrameErrorFreeConc}
|
||||
@@ -281,9 +278,9 @@ Moreover, the slice partitioning mode used only 1200 bytes per slice, which intr
|
||||
|
||||
The second set of experiments aimed to find the influence of losing temporal motion predictors on the error resilience of \ac{hevc}.
|
||||
In order to perform this test, a single frame loss in enforced, and the error propagation is evaluated for two configurations: (i) with the temporal \ac{mv} candidate enabled and (ii) disabled.
|
||||
Figure~\ref{Figure3:PSNRvsFrameErrorFreeConc} illustrates the error propagation, when a single frame is lost. For this particular experiment an intra-refreshing period of 32 frames was used to evaluate the impact on long error propagation periods. This is commonly used in quality evaluation of erroneous video decoding and follows the reference conditions~\cite{HEVCCommonTests2012}.
|
||||
Figure~\ref{Figure3:PSNRvsFrameErrorFreeConc} illustrates the error propagation, when a single frame is lost. For this particular experiment an intra-refreshing period of 32 frames was used to evaluate the impact on long error propagation periods. This is commonly used in quality evaluation of erroneous video decoding and follows the reference conditions~\cite{HEVCCommonTests2012}.
|
||||
The results show that when the \ac{tmvp} mode is enabled, the loss of Frame \#6 leads to significant reduction in the reconstruction quality of the subsequent frames.
|
||||
On the contrary, when the temporal \ac{mv} candidate is disabled, the motion information on subsequent frames is not affected by the loss of a single frame and significantly higher quality is obtained.
|
||||
On the contrary, when the temporal \ac{mv} candidate is disabled, the motion information on subsequent frames is not affected by the loss of a single frame and significantly higher quality is obtained.
|
||||
This is the effect of breaking the temporal dependencies between \acs{mv}, which prevents erroneous \acs{mv} to propagate throughout the set of dependent frames.
|
||||
|
||||
\begin{table}[!t]
|
||||
@@ -338,7 +335,7 @@ The objective is to increase the number of \acs{mv} that can be independently de
|
||||
The proposed method also overcomes the limitation of the method presented in \cite{DynamicTMVP2011}, which breaks the motion information dependencies between frames.
|
||||
Instead of disabling the temporal motion candidates at the frame level, the proposed method aims to remove the dependencies at the \ac{cu} level.
|
||||
To achieve this goal, the temporal dependency of all \ac{mv} candidates is firstly analysed for each block, in order to select the suitable candidates to be used as predictors for the current \ac{mv}.
|
||||
Based on the analysis of the temporal dependency, some temporal candidates are marked as unsuitable predictors of the current \ac{mv}, and for this reason they are not selected for \ac{mv} prediction.
|
||||
Based on the analysis of the temporal dependency, some temporal candidates are marked as unsuitable predictors of the current \ac{mv}, and for this reason they are not selected for \ac{mv} prediction.
|
||||
In the proposed approach, a temporal \ac{mv} candidate is marked as unsuitable, based on the following criteria:
|
||||
\begin{enumerate}
|
||||
\item if it is encoded based on another temporal \ac{mv} candidate from a previously encoded frame;
|
||||
@@ -347,7 +344,7 @@ In the proposed approach, a temporal \ac{mv} candidate is marked as unsuitable,
|
||||
|
||||
\begin{figure}[t]
|
||||
\centering
|
||||
% \includegraphics[width=0.6\columnwidth]{\DynamicTMVP/DynamicTMVP}
|
||||
% \includegraphics[width=0.6\columnwidth]{./031_ErrorResilienceEvaluation/DynamicTmvp/DynamicTMVP}
|
||||
\input{./031_ErrorResilienceEvaluation/DynamicTmvp/DynamicTMVP.tikz}
|
||||
\caption{Proposed approach to constrain the temporal \ac{mv} dependencies (arrow point to the MV predictor).}
|
||||
\label{ProposedDynamicMethod}
|
||||
@@ -356,8 +353,8 @@ In the proposed approach, a temporal \ac{mv} candidate is marked as unsuitable,
|
||||
|
||||
Figure~\ref{ProposedDynamicMethod} can be used to explain the proposed method, illustrating different blocks and different \ac{mv} dependencies represented with arrows. Note that the squares illustrate a generic block size; the representation of the temporal dependencies is simplified, and in some cases may not correspond to the exact co-located block in the previous frame. In frame $f_{t-1}$ there are several \acs{mv} encoded using spatial predictions and one \ac{mv} encoded using a temporal prediction (arrow pointing to $f_{t-2}$). In frame $f_{t}$, the \ac{mv} corresponding to the block (1) may use the temporal \ac{mv} candidate, since the co-located block in $f_{t-1}$ is not temporally dependent.
|
||||
However, in the proposed scheme the \ac{mv} prediction identified with the arrow (2) is not allowed, which prevents the propagation of temporal dependencies.
|
||||
Moreover, the block corresponding to the arrow (3) cannot use the temporal \ac{mv} candidate since it already depends on a \ac{mv} that was previously encoded using the temporal candidate. The proposed method reduces the temporal dependencies of the \glspl{mv} at the block level, providing improved error robustness to the encoded streams.
|
||||
Using this approach, the dependencies are selectively removed, improving the error recovery accuracy, without fully disabling the temporal \gls{mv} candidates for a given frame.
|
||||
Moreover, the block corresponding to the arrow (3) cannot use the temporal \ac{mv} candidate since it already depends on a \ac{mv} that was previously encoded using the temporal candidate. The proposed method reduces the temporal dependencies of the \glspl{mv} at the block level, providing improved error robustness to the encoded streams.
|
||||
Using this approach, the dependencies are selectively removed, improving the error recovery accuracy, without fully disabling the temporal \gls{mv} candidates for a given frame.
|
||||
Therefore, coding efficiency is not significantly penalised.
|
||||
|
||||
|
||||
@@ -398,7 +395,7 @@ Secondly, further simulations were performed to evaluate the effectiveness of th
|
||||
%As in previous experiments, each coded frame is transmitted in one packet.
|
||||
Table~\ref{Table3:AverageStdPSNR} illustrates the average standard deviation of the PSNR, for three of the test sequences.
|
||||
The results show that increasing the \ac{plr} leads to higher quality variations, thus the impact of errors in the subjective quality experience is higher.
|
||||
However, reducing the temporal dependencies of the \acs{mv} using the proposed method decreases such quality variations, achieving the lowest variation value for all tested scenarios.
|
||||
However, reducing the temporal dependencies of the \acs{mv} using the proposed method decreases such quality variations, achieving the lowest variation value for all tested scenarios.
|
||||
The proposed method is able to reduce the quality variations up to 0.94 dB for Kendo sequence (3$\%$ of packet loss) compared to the~\TIDR~method.
|
||||
Therefore, since the proposed method achieves the lowest \ac{psnr} standard deviation, one may conclude that it is able to reduce the video quality variations leading to a better visual quality.
|
||||
|
||||
@@ -410,7 +407,7 @@ Therefore, since the proposed method achieves the lowest \ac{psnr} standard dev
|
||||
\input{031_ErrorResilienceEvaluation/DynamicTmvp/TableDynamicTMVPPSNR.tex}
|
||||
\end{table}
|
||||
|
||||
Table~\ref{Table3:AverageResultsProposed} shows the Bjontegaard's average \ac{psnr} increase \cite{BJResults2001}.
|
||||
Table~\ref{Table3:AverageResultsProposed} shows the Bjontegaard's average \ac{psnr} increase \cite{BJResults2001}.
|
||||
The results are obtained taking the standard \ac{hevc} encoder as reference.
|
||||
% The results are obtained taking as reference the standard \ac{hevc} encoder, in order to evaluate the quality difference when temporal \ac{mv} candidates are disabled in both error free and under error-prone conditions.
|
||||
The results presented in Table~\ref{Table3:AverageResultsProposed} show that the proposed method presents practically the same rate-distortion performance when compared to the \TIDR method.
|
||||
|
||||
Reference in new issue
Block a user