Title
Fast MRF-based hole filling for view synthesis
Abstract
Hole filling is one of the key issues in generating virtual view from video-plus-depth sequence by depth-image-based rendering. Hole filling method based on Markov random fields (MRF) is a practical way for view synthesis, but the traditional ones might introduce some foreground textures to the hole regions, and suffer from high computational complexity. In this letter, a fast MRF-based hole filli...
Year
DOI
Venue
2018
10.1109/LSP.2017.2720182
IEEE Signal Processing Letters
Keywords
Field
DocType
Visualization,Belief propagation,Hemorrhaging,Rendering (computer graphics),Markov processes,Computational complexity,Optimization
Random field,Markov process,Pattern recognition,Markov chain,View synthesis,Artificial intelligence,Rendering (computer graphics),Mathematics,Energy minimization,Belief propagation,Computational complexity theory
Journal
Volume
Issue
ISSN
25
1
1070-9908
Citations 
PageRank 
References 
1
0.35
15
Authors
3
Name
Order
Citations
PageRank
Luo Guibo1156.04
Zhu Yuesheng211239.21
Biao Guo371.47