Depth Map Boundary Enhancement Using Random Walk

نویسندگان

  • Gyo-Yoon Lee
  • Yo-Sung Ho
چکیده

Depth information is essential for depth image-based rendering (DIBR), which is one of the rendering processes for the virtual view using a color image and its corresponding depth map. Although there are several depth estimation methods, more accurate depth estimation is still required. Since inaccurate depth information along object boundaries causes serious rendering errors, depth boundary information is very important. In this paper, we propose a new depth map filtering algorithm to solve the boundary mismatch problem. In order to preserve depth boundaries, we smooth depth values of the non-boundary region using the random walk probability. After calculating a similarity measure between the current pixel and its neighboring pixels using the random walk probability model, we have applied a weighted averaging filter based on the random walk probability. Finally, we have obtained a depth map with higher quality compared to other methods. Experimental results showed enhancement of depth boundaries.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Depth Map Up-Sampling Using Random Walk

For the high quality three-dimensional broadcasting, depth maps are important data. Although commercially available depth cameras capture highaccuracy depth maps in real time, their resolutions are much smaller than those of the corresponding color images due to technical limitations. In this paper, we propose the depth map up-sampling method using a high-resolution color image and a low-resolu...

متن کامل

Web-Site Boundary Detection Using Incremental RandomWalk Clustering

In this paper we describe a random walk clustering technique to address the Website Boundary Detection (WBD) problem. The technique is fully described and compared with alternative (breadth and depth first) approaches. The reported evaluation demonstrates that the random walk technique produces comparable or better results than those produced by these alternative techniques, while at the same t...

متن کامل

Random Walk Algorithms for Estimating Effective Properties of Digitized Porous Media

s — In this paper we describe a Monte Carlo method for permeability calculations in complex digitized porous structures. The relation between the permeability and the diffusion penetration depth is established. The corresponding Dirichlet boundary value problem is solved by random walk algorithms. The results of computational experiments for some random models of porous media confirm the log-no...

متن کامل

Uniform infinite planar quadrangulations with a boundary

We introduce and study the uniform infinite planar quadrangulation (UIPQ) with a boundary via an extension of the construction of [14]. We then relate this object to its simple boundary analog using a pruning procedure. This enables us to study the aperture of these maps, that is, the maximal distance between two points on the boundary, which in turn sheds new light on the geometry of the UIPQ....

متن کامل

Construct optimized overlay multicast via preferential random walk

Tree depth and load balancing are two main metrics in overlay multicast network. Optimizing the two metrics with lightweight overhead is important for live media streaming. This paper proposes one scheme to construct optimized overlay multicast with short tree depth and load balancing via short random walk. The key idea is the preferential random walk based on fitness function in which the tree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012