• DocumentCode
    590282
  • Title

    Fast disparity estimation for 3DTV applications

  • Author

    Yu-Cheng Tseng ; Tian-Sheuan Chang

  • Author_Institution
    Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
  • fYear
    2012
  • fDate
    27-30 Nov. 2012
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    The depth estimation reference software (DERS) algorithm developed by the MPEG 3-D Video Coding could produce high-quality disparity maps for 3DTV applications but suffers from high computational complexity due to its complicated graph-cut optimization. Therefore, this paper proposed a new fast disparity estimation algorithm that could significantly reduce the computational complexity by the downsampled matching cost method. To address the temporal consistency in videos, this paper proposed the no-motion registration for the foreground copy artifact and the still-edge preservation for the flicker artifact. In addition, the occlusion problem is also solved in the proposed algorithm. The experimental results show that our algorithm could generate comparable disparity maps to the DERS algorithm, and only takes 10.8% of its execution time.
  • Keywords
    computational complexity; hidden feature removal; image matching; image registration; optimisation; stereo image processing; three-dimensional television; video coding; 3D TV; DERS; MPEG 3D video coding; computational complexity; depth estimation reference software; downsampled matching cost method; fast disparity estimation; flicker artifact; foreground copy artifact; graph-cut optimization; no-motion registration; occlusion problem; still-edge preservation; Belief propagation; Computational complexity; Density estimation robust algorithm; Estimation; Optimization; Software algorithms; Streaming media; Disparity estimation; stereoscopic video;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Visual Communications and Image Processing (VCIP), 2012 IEEE
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4673-4405-0
  • Electronic_ISBN
    978-1-4673-4406-7
  • Type

    conf

  • DOI
    10.1109/VCIP.2012.6410760
  • Filename
    6410760