2.50
Hdl Handle:
http://hdl.handle.net/10547/292599
Title:
Efficient bit allocation for multiview image coding & view synthesis
Authors:
Cheung, Gene; Velisavljević, Vladan ( 0000-0001-9980-9368 )
Abstract:
In this paper, the authors address the problem of efficient bit allocation among texture and depth maps of multi-view images. We pose the following question: for chosen (1) coding tool to encode texture and depth maps at the encoder and (2) view synthesis tool to reconstruct uncoded views at the decoder, how to best select captured views for encoding and distribute available bits among texture and depth maps of selected coded views, such that visual distortion of a “metric” of reconstructed views is minimized. We show that using the monotonicity assumption, suboptimal solutions can be efficiently pruned from the feasible space during parameter search. Our experiments show that optimal selection of coded views and associated quantization levels for texture and depth maps can outperform a heuristic scheme using constant levels for all maps (commonly used in the standard implementations) by up to 2.0dB. Moreover, the complexity of our scheme can be reduced by up to 66% over full search without loss of optimality.
Citation:
Cheung, G. and Velisavljevic, V. (2010) 'Efficient bit allocation for multiview image coding & view synthesis', 17th IEEE International Conference on Image Processing (ICIP), Hong Kong, 26-29 September. Hong Kong: IEEE, pp.2613-2616.
Publisher:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date:
2010
URI:
http://hdl.handle.net/10547/292599
DOI:
10.1109/ICIP.2010.5651655
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5651655
Type:
Conference papers, meetings and proceedings
Language:
en
ISBN:
9781424479931
Appears in Collections:
Centre for Wireless Research (CWR)

Full metadata record

DC FieldValue Language
dc.contributor.authorCheung, Geneen_GB
dc.contributor.authorVelisavljević, Vladanen_GB
dc.date.accessioned2013-05-21T15:25:14Z-
dc.date.available2013-05-21T15:25:14Z-
dc.date.issued2010-
dc.identifier.citationCheung, G. and Velisavljevic, V. (2010) 'Efficient bit allocation for multiview image coding & view synthesis', 17th IEEE International Conference on Image Processing (ICIP), Hong Kong, 26-29 September. Hong Kong: IEEE, pp.2613-2616.en_GB
dc.identifier.isbn9781424479931-
dc.identifier.doi10.1109/ICIP.2010.5651655-
dc.identifier.urihttp://hdl.handle.net/10547/292599-
dc.description.abstractIn this paper, the authors address the problem of efficient bit allocation among texture and depth maps of multi-view images. We pose the following question: for chosen (1) coding tool to encode texture and depth maps at the encoder and (2) view synthesis tool to reconstruct uncoded views at the decoder, how to best select captured views for encoding and distribute available bits among texture and depth maps of selected coded views, such that visual distortion of a “metric” of reconstructed views is minimized. We show that using the monotonicity assumption, suboptimal solutions can be efficiently pruned from the feasible space during parameter search. Our experiments show that optimal selection of coded views and associated quantization levels for texture and depth maps can outperform a heuristic scheme using constant levels for all maps (commonly used in the standard implementations) by up to 2.0dB. Moreover, the complexity of our scheme can be reduced by up to 66% over full search without loss of optimality.en_GB
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5651655en_GB
dc.subjectimage codingen_GB
dc.subjectimage textureen_GB
dc.subjectrendering (computer graphics)en_GB
dc.titleEfficient bit allocation for multiview image coding & view synthesisen
dc.typeConference papers, meetings and proceedingsen
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.