A Novel Boundary Matching Algorithm for Video Temporal Error Concealment
Seyed Mojtaba Marvasti-Zadeh, Hossein Ghanei-Yakhdan, Shohreh Kasaei

TL;DR
This paper introduces an efficient boundary matching algorithm for video error concealment that improves the quality of reconstructed frames by accurately estimating damaged motion vectors with minimal additional computational cost.
Contribution
The paper presents a novel boundary matching algorithm that adaptively selects matching criteria for damaged macro blocks, enhancing video error concealment performance.
Findings
PSNR increased by about 4.7 dB in some frames
Improved subjective quality of reconstructed videos
No significant increase in computational cost
Abstract
With the fast growth of communication networks, the video data transmission from these networks is extremely vulnerable. Error concealment is a technique to estimate the damaged data by employing the correctly received data at the decoder. In this paper, an efficient boundary matching algorithm for estimating damaged motion vectors (MVs) is proposed. The proposed algorithm performs error concealment for each damaged macro block (MB) according to the list of identified priority of each frame. It then uses a classic boundary matching criterion or the proposed boundary matching criterion adaptively to identify matching distortion in each boundary of candidate MB. Finally, the candidate MV with minimum distortion is selected as an MV of damaged MB and the list of priorities is updated. Experimental results show that the proposed algorithm improves both objective and subjective qualities of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
