Dense depth map estimation for multiple view coding

Ozkalayci, Burak
Alatan, Abdullah Aydın
In this paper the basics of a proposed method that handles the stereo and especially multiple view coding problem in a geometrical way, are explained. For this purpose, estimation of the depth maps of the multiple views, captured by fully calibrated cameras, are done. In depth map estimation problem Markov Random Field modelling is used to have a depth map in a desired smoothness and in an efficient coding fashion. The geometric structure which is acquired by the depth map estimation, is used to reconstruct the all camera views and the PSNR values of the reconstructed images are calculated for the coding aspects.


Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01)
We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Bici, M. Oguz; Akar, Gözde (2008-10-15)
In this paper, we propose a distributed 3D dynamic mesh coding system. The system is based on Slepian and Wolf's and Wyner and Ziv's information-theoretic results. Our system extends the ideas in distributed video coding to 3D dynamic meshes with constant connectivity. The connectivity of the sequence and key frames are encoded and decoded by a conventional static mesh coder. The Wyner-Ziv frames are encoded independent of key frames but decoded jointly with decoded key frames. The joint decoding is perform...
Distance-based discretization of parametric signal manifolds
Vural, Elif (2010-06-28)
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classification tasks. We propose in this paper a method for the discretization of signal manifolds given in a parametric form. We present an iterative algorithm for the selection of samples on the manifold that permits to minimize the average error in the manifold distance computation. Experimental results with image appearance manifolds d...
On lossless intra coding in HEVC with 3-tap filters
Alvar, Saeed Ranjbar; Kamışlı, Fatih (2016-09-01)
This paper presents a pixel-by-pixel spatial prediction method for lossless intra coding within High Efficiency Video Coding (HEVC). Previous pixel-by-pixel spatial prediction methods use only two neighboring pixels for prediction, based on the angular projection idea borrowed from block-based intra prediction in lossy coding, or are based on ad hoc methods applied in some intra modes. This paper explores a pixel-by-pixel prediction method which uses three neighboring pixels for prediction according to a tw...
Factor graph based linear minimum mean square error equalization for wireless communications /
Şen, Pınar; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2014)
In this work, we have studied on a reduced complexity factor graph based linear minimum mean square error (LMMSE) filter as an equalizer for different wireless communication problems. First, we introduce an efficient way of computing extrinsic bit log-likelihood ratio (LLR) values for the LMMSE estimation through the previously presented graph structure in the literature compatible with higher order alphabets. In addition, we propose to adapt this graph structure so that it has the ability of including the ...
Citation Formats
B. Ozkalayci and A. A. Alatan, “Dense depth map estimation for multiple view coding,” 2006, Accessed: 00, 2020. [Online]. Available: