Error concealment by means of motion refinement and regularized bregman divergence

Authors:
Alessandra Martins Coelho;Vania V. Estrela;Felipe P. do Carmo;Sandro R. Fernandes
Affiliations:
Instituto Federal de Educacao, Ciencia e Tecnologia do Sudeste de Minas Gerais, (IF SEMG), Rio Pomba, MG, Brazil;Telecommunications Department, Universidade Federal Fluminense (UFF), Niterói, RJ, Brazil;Colégio Pedro II, Rio de Janeiro, RJ, Brazil;Instituto Federal de Educação, Ciência e Tecnologia do Sudeste de Minas Gerais, Juiz de Fora, MG, Brazil
Venue:
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Year:
2012

Citing 6
Cited 0

Information geometry of U-Boost and Bregman divergence

Neural Computation
An information theoretic analysis of maximum likelihood mixture estimation for exponential families

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations (Applied Mathematical Sciences)

Mathematical Problems in Image Processing: Partial Differential Equations and the Calculus of Variations (Applied Mathematical Sciences)
Error concealment by means of clustered blockwise PCA

PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
Optic flow goes stereo: a variational method for estimating discontinuity-preserving dense disparity maps

PR'05 Proceedings of the 27th DAGM conference on Pattern Recognition
Methods for choosing the regularization parameter and estimating the noise variance in image restoration and their relation

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work addresses the problem of error concealment in video transmission systems over noisy channels employing Bregman divergences along with regularization. Error concealment intends to improve the effects of disturbances at the reception due to bit-errors or cell loss in packet networks. Bregman regularization gives accurate answers after just some iterations with fast convergence, better accuracy and stability. This technique has an adaptive nature: the regularization functional is updated according to Bregman functions that change from iteration to iteration according to the nature of the neighborhood under study at iteration n. Numerical experiments show that high-quality regularization parameter estimates can be obtained. The convergence is sped up while turning the regularization parameter estimation less empiric, and more automatic.