Permutation-Based Low-Complexity Alternate Coding in Multi-View H.264/AVC
|
| Toronto, ON, Canada July 09-July 12 |
Daniel Socek, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA. dsocek@fau.edu
Dubravko Culibrk, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA. dculibrk@fau.edu
Hari Kalva, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA. hari@cse.fau.edu
Oge Marques, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA. oge@cse.fau.edu
Borko Furht, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, USA. borko@cse.fau.edu
Low bitrates enabled by the H.264/AVC standard come at the cost of significant decoding complexity. The problem is exacerbated when multi-view video coding (MVC), presently being standardized by the MPEG committee, is considered. Increasing the number of reference views will improve the prediction but also increase the encoding and decoding complexity. In this paper we present an alternative to transform coding and arithmetic coding used to code motion compensation residuals in H.264/AVC. Proposed approach is sorting permutation based, resulting in significantly decreased decoding complexity. We evaluate the efficiency of the coding and present initial results obtained for some sequences in published literature.
Citation:
Daniel Socek, Dubravko Culibrk, Hari Kalva, Oge Marques, Borko Furht, "Permutation-Based Low-Complexity Alternate Coding in Multi-View H.264/AVC," icme, pp.2141-2144, 2006 IEEE International Conference on Multimedia and Expo, 2006
Usage of this product signifies your acceptance of the
Terms of Use.
|
|
|
|
|
|
|
|
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb