Pith. sign in

REVIEW

Error concealment by means of motion refinement and regularized Bregman divergence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.03268 v1 pith:EXFUHZL7 submitted 2016-11-10 cs.CV

classification cs.CV
keywords regularizationbregmanconcealmenterroriterationaccordingconvergencenature
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools