A Patch-matched Hole Filling Algorithm for Multiview Synthesis and Its VLSI Implementation

Abstract

In this thesis a patch-matched hole filling algorithm for depth image-based rendering is proposed Instead of traditional smoothing depth approaches which reduce geometric distortion in virtual views the proposed algorithm used to deal with the alignment of texture image and depth map increases the correctness of hole filling In this algorithm the key is to search similar patches with adaptive window size in surrounding region to fill holes Also considering the information of depth map insures holes will be filled with the patches in background Compared to the methods of hole filling pixel-by-pixel and the methods of background extension the results of the proposed algorithm will be more natural In hardware architecture the algorithm is implemented in Altera DE3-260 FPGA The design of patch-matched hole filling algorithm requires 12 7 k logic elements 10 2 k registers and 2 39 Mb RAM This work is supported to 1080p (1920 × 1080) video in real time at maximum operating frequency 152 47 MHz

Date of Award	2015 Aug 12
Original language	English
Supervisor	Jar-Ferr Yang (Supervisor)