Rectification-Based View Interpolation and Extrapolation for Multiview Video Coding.

IEEE Trans. Circuits Syst. Video Techn 01/2011; 21:693-707.
Source: DBLP
Download full-text


Available from: Jie Liang, Mar 11, 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India An algorithm to detect depth discontinuities from a stereo pair of images is presented. The algorithm matches individual pixels in corresponding scanline pairs while allowing occluded pixels to remain unmatched, then propagates the information between scanlines by means of a fast postprocessor. The algorithm handles large untextured regions, uses a measure of pixel dissimilarity that is insensitive to image sampling, and prunes bad search nodes to increase the speed of dynamic programming. The computation is relatively fast, taking about 1.5 microseconds per pixel per disparity on a workstation. Approximate disparity mapsand precise depth discontinuities (along both horizontal and vertical boundaries) are shown for five stereo images containing textured, untextured, fronto-parallel, and slanted objects. 1 Introduction Cartoon artists have known the perceptual importance of depth discontinuities ...
    International Journal of Computer Vision 10/1997; DOI:10.1109/ICCV.1998.710850 · 3.53 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper describes a new algorithm for solving the stereo correspondence problem with a global 2-d optimization by transforming it into a maximum-flow problem in a graph. This transformation effectively removes explicit use of epipolar geometry, thus allowing direct use of multiple cameras with arbitrary geometries. The maximum-flow, solved both efficiently and globally, yields a minimum-cut that corresponds to a disparity surface for the whole image at once. This global and efficient approach to stereo analysis allows the reconstruction to proceed in an arbitrary volume of space and provides a more accurate and coherent depth map than the traditional stereo algorithms. In particular, smoothness is applied uniformly instead of only along epipolar lines, while the global optimality of the depth surface is guaranteed. Results show improved depth estimation as well as better handling of depth discontinuities. While the worst case running time is O(n1.5 d1.5 log(nd)), the observed average running time is O(n1.2 d1.3) for an image size of n pixels and depth resolution d.
    International Journal of Computer Vision 01/1999; 34:147-161. DOI:10.1023/A:1008192004934 · 3.53 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Neighboring views must be highly correlated in multiview video systems. We should therefore use various neighboring views to efficiently compress videos. There are many approaches to doing this. However, most of these treat pictures of other views in the same way as they treat pictures of the current view, i.e., pictures of other views are used as reference pictures (inter-view prediction). We introduce two approaches to improving compression efficiency in this paper. The first is by synthesizing pictures at a given time and a given position by using view interpolation and using them as reference pictures (view-interpolation prediction). In other words, we tried to compensate for geometry to obtain precise predictions. The second approach is to correct the luminance and chrominance of other views by using lookup tables to compensate for photoelectric variations in individual cameras. We implemented these ideas in H.264/AVC with inter-view prediction and confirmed that they worked well. The experimental results revealed that these ideas can reduce the number of generated bits by approximately 15% without loss of PSNR.
    IEEE Transactions on Circuits and Systems for Video Technology 12/2007; DOI:10.1109/TCSVT.2007.903802 · 2.26 Impact Factor