AN EFFICIENT HOLE FILLING FOR DEPTH IMAGE BASED RENDERING

Date

2013-07-19

Author

Cigla, Cevahir
Alatan, Abdullah Aydın

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

114
views

0
downloads

An efficient hole filling algorithm is presented providing texture compilation for invisible pixels during depth image based rendering (DIBR). Some pixels cannot be assigned to proper texture values due to occluding foreground object; thus, compilation is required to obtain visually pleasing virtual views from a set of reference views. The proposed algorithm exploits reliable texture transition from visible pixels to the holes among horizontal and vertical directions. Transition is performed by successive weighted summation (SWS) based on color and depth similarities between the neighboring pixels, producing adaptively weighted and connected aggregation. Depending on local depth variation, assignment of proper texture to the hole pixels is achieved by combining horizontal and vertical information. According to the experimental results, proposed approach yields visually pleasing compilation of occluded regions with drastically decreased number of operations per pixel.

Subject Keywords

Hole filling, Weighted aggregation, Texture transition, Depth prior

URI

https://hdl.handle.net/11511/55065

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

IMPROVED PREDICTION FOR LAYERED PREDICTIVE ANIMATED MESH COMPRESSION Bici, M. Oguz; Akar, Gözde (2010-09-29) In this paper, we deal with layered predictive compression of animated meshes represented by series of 3D static meshes with same connectivity. We propose two schemes to improve the prediction. First improvement is using weighted spatial prediction rather than averaging neighbor vertices. The second improvement is a novel predictor based on rotation angle of incident triangles in current and previous frames. The experimental results show that around 6- 10 % bitrate reduction can be achieved by replacing the...
An efficient recursive edge-aware filter Cigla, Cevahir; Alatan, Abdullah Aydın (2014-10-01) In this study, an efficient edge-aware filtering methodology, namely permeability filter, that exploits recursive updates among horizontal and vertical axes, is extended for common image filtering applications, including denoising, segmentation and depth upscaling. Besides, an 8-neighbor update methodology, that is applicable for all type of recursive filters, is proposed extending orthogonally generated supporting regions into multi-directional support. This extension provides fine smoothing, especially at...
A NOVEL SHADOW RESTORATION ALGORITHM BASED ON ATMOSPHERIC EFFECTS FOR AERIAL IMAGES Aytekin, Caglar; Alatan, Abdullah Aydın (2010-09-29) In aerial images, the performance of the segmentation and object recognition algorithms could suffer due to shadows in the scene. This effort describes a novel shadow restoration algorithm based on atmospheric effects and characteristics of sun light for aerial images. Firstly, shadow regions are detected exploiting the Rayleigh scattering phenomena and the well-known fact related to the low illumination intensity in the shadow regions. After detection, shadow restoration is achieved by first restoring part...
A Partition Based Method for Spectrum-Preserving Mesh Simplification Yazgan, Misranur; Sahillioğlu, Yusuf; Department of Computer Engineering (2022-8-29) When the complexity of a mesh starts introducing high computational costs, mesh simplification methods come into the picture, to reduce the number of elements utilized to represent the mesh. Majority of the simplification methods focus on preserving the appearance of the mesh, ignoring the spectral properties of the differential operators derived from the mesh. The spectrum of the Laplace-Beltrami operator is essential for a large subset of applications in geometry processing. Coarsening a mesh without cons...
A new multiobjective simulated annealing algorithm Tekinalp, Ozan (Springer Science and Business Media LLC, 2007-09-01) A new multiobjective simulated annealing algorithm for continuous optimization problems is presented. The algorithm has an adaptive cooling schedule and uses a population of fitness functions to accurately generate the Pareto front. Whenever an improvement with a fitness function is encountered, the trial point is accepted, and the temperature parameters associated with the improving fitness functions are cooled. Beside well known linear fitness functions, special elliptic and ellipsoidal fitness functions,...

Citation Formats

C. Cigla and A. A. Alatan, “AN EFFICIENT HOLE FILLING FOR DEPTH IMAGE BASED RENDERING,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55065.