Video concealment via matrix completion at high missing rates

Video error concealment is an important technique in video communication to recover corrupted parts when erroneously transmitting compressed sequences over network. In this work, we propose a novel error concealment scheme by grouping similar patches in the temporal domain to construct a low-rank matrix and recover the missing areas by the matrix completion technique. Different from most state-of-the-art algorithms which recover the lost blocks based on at least one clean frame (I-frame), the proposed algorithm can work for the most general case when all frames are violated. When having I-frames in the receiver, the proposed algorithm also achieves much higher PSNR compared with the Boundary Matching Algorithm (BMA) adopted in H.264.