An error-based recursive filling ordering for image error concealment

An error-based recursive filling ordering for image error concealment
复制标题

DOI:
10.1109/icip.2014.7025509
复制
发表时间:
2014-10
期刊:
2014 IEEE International Conference on Image Processing (ICIP)
影响因子:
--
通讯作者:
Ján Koloda;Jürgen Seiler;André Kaup;V. Sánchez;A. Peinado
Ján Koloda;Jürgen Seiler;André Kaup;V. Sánchez;A. Peinado
中科院分区:
其他
文献类型:
--
作者:
Ján Koloda;Jürgen Seiler;André Kaup;V. Sánchez;A. Peinado

文献摘要

被引文献

相似文献

许多图像错误隐藏(EC)算法可以通过将丢失区域划分为一组(子)块来重建丢失区域,这些块是由一组已知的上下文像素估计的。反过来,这些先前的像素可能是先前通过估计获得的。在这种情况下,丢失区域递归填充的顺序将明确地约束结果重建。本文提出了一种新的填充顺序,旨在提高递归应用于丢失区域的EC算法的性能。在确定充填顺序时,要考虑已埋块体的改造质量。被已知像素或高质量重建所包围的块被优先考虑。所提出的技术适用于广泛的EC算法,并在可忽略的额外计算负载下实现高达1dB (PSNR)的改进。
Many image error concealment (EC) algorithms can be employed to reconstruct a lost region by dividing it into a set of (sub)blocks which are estimated from a set of known context pixels. In turn, these former pixels may have been previously obtained by estimation. In this situation, the order in which the lost region is recursively filled will clearly condition the resulting reconstruction. This paper proposes a novel filling order aimed to improve the performance of EC algorithms that are applied recursively over the lost area. It takes into account the reconstruction quality of the already concealed blocks in order to determine the filling order. Blocks surrounded by known pixels or by high quality reconstructions are prioritized. The proposed technique is applicable to a wide range of EC algorithms and achieves an improvement of up to 1dB (in PSNR) with negligible additional computational load.