  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.
