Low bit-rate scalable video coding with 3-D set partitioning in hierarchical trees (3-D SPIHT)

Citation
Bj. Kim et al., Low bit-rate scalable video coding with 3-D set partitioning in hierarchical trees (3-D SPIHT), IEEE CIR SV, 10(8), 2000, pp. 1374-1387
Citations number
20
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY
ISSN journal
10518215 → ACNP
Volume
10
Issue
8
Year of publication
2000
Pages
1374 - 1387
Database
ISI
SICI code
1051-8215(200012)10:8<1374:LBSVCW>2.0.ZU;2-Y
Abstract
In this paper, we propose a low bit-rate embedded video coding scheme that utilizes a 3-D extension of the set partitioning in hierarchical trees (SPI HT) algorithm which has proved so successful in still image coding. Three-d imensional spatio-temporal orientation trees coupled with powerful SPIHT so rting and refinement renders 3-D SPIHT video coder so efficient that it pro vides comparable performance to H.263 objectively and subjectively when ope rated at the bit rates of 30 to 60 kbits/s with minimal system complexity, Extension to color-embedded video coding is accomplished without explicit b it allocation, and can be used for any color plane representation. In addit ion to being rate scalable, the proposed video coder allows multiresolution al scalability in encoding and decoding in both time and space from one bit stream. This added functionality along with many desirable attributes, suc h as full embeddedness for progressive transmission, precise rate control f or constant bit-rate traffic; and low complexity for possible software-only video applications, makes the proposed video coder an attractive candidate for multimedia applications.