File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

심재영

Sim, Jae-Young
Visual Information Processing Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Bit allocation algorithm with novel view synthesis distortion model for multiview video plus depth coding

Author(s)
Chung, Tae-YoungSim, Jae-YoungKim, Chang-Su
Issued Date
2014-08
DOI
10.1109/TIP.2014.2327801
URI
https://scholarworks.unist.ac.kr/handle/201301/5183
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84903289321
Citation
IEEE TRANSACTIONS ON IMAGE PROCESSING, v.23, no.8, pp.3254 - 3267
Abstract
An efficient bit allocation algorithm based on a novel view synthesis distortion model is proposed for the rate-distortion optimized coding of multiview video plus depth sequences in this paper. We decompose an input frame into nonedge blocks and edge blocks. For each nonedge block, we linearly approximate its texture and disparity values, and derive a view synthesis distortion model, which quantifies the impacts of the texture and depth distortions on the qualities of synthesized virtual views. On the other hand, for each edge block, we use its texture and disparity gradients for the distortion model. In addition, we formulate a bit-rate allocation problem in terms of the quantization parameters for texture and depth data. By solving the problem, we can optimally divide a limited bit budget between the texture and depth data, in order to maximize the qualities of synthesized virtual views, as well as those of encoded real views. Experimental results demonstrate that the proposed algorithm yields the average PSNR gains of 1.98 and 2.04 dB in two-view and three-view scenarios, respectively, as compared with a benchmark conventional algorithm.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
ISSN
1057-7149

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.