Boundary Noise Removal and Hole Filling Algorithm for Virtual Viewpoint Image Generation 


Vol. 37,  No. 8, pp. 679-688, Aug.  2012


PDF
  Abstract

In this paper, performance improved hole-filling algorithm including boundary noise removing pre-process which can be used for an arbitrary view synthesis with given two views is proposed. Boundary noise usually occurs because of the boundary mismatch between the reference image and depth map and common-hole is defined as the occluded region. These boundary noise and common-hole created while synthesizing a virtual view result in some defects and they are usually very difficult to be completely recovered by using only given two images as references. The spiral weighted average algorithm gives a clear boundary of each object by using depth information and the gradient searching algorithm is able to preserve details. In this paper, we combine these two algorithms by using a weighting factor α to reflect the strong point of each algorithm effectively in the virtual view synthesis process. The experimental results show that the proposed algorithm performs much better than conventional algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. S. Ko and J. Yoo, "Boundary Noise Removal and Hole Filling Algorithm for Virtual Viewpoint Image Generation," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 8, pp. 679-688, 2012. DOI: .

[ACM Style]

Min Soo Ko and Jisang Yoo. 2012. Boundary Noise Removal and Hole Filling Algorithm for Virtual Viewpoint Image Generation. The Journal of Korean Institute of Communications and Information Sciences, 37, 8, (2012), 679-688. DOI: .

[KICS Style]

Min Soo Ko and Jisang Yoo, "Boundary Noise Removal and Hole Filling Algorithm for Virtual Viewpoint Image Generation," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 8, pp. 679-688, 8. 2012.