Premium
Efficient bit‐plane coding scheme for fine granular scalable video coding
Author(s) -
Kim SeungHwan,
Ho YoSung
Publication year - 2006
Publication title -
international journal of imaging systems and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.359
H-Index - 47
eISSN - 1098-1098
pISSN - 0899-9457
DOI - 10.1002/ima.20073
Subject(s) - context adaptive binary arithmetic coding , computer science , coding (social sciences) , bit plane , tunstall coding , coding tree unit , context adaptive variable length coding , harmonic vector excitation coding , algorithmic efficiency , algorithm , scalability , binary number , mpeg 4 , arithmetic coding , variable length code , bit rate , theoretical computer science , decoding methods , data compression , mathematics , computer engineering , arithmetic , statistics , bit field , mechanical engineering , drilling , database , engineering
In this paper, we propose a new efficient bit‐plane coding method for fine granular scalable (FGS) video coding. The general structure of the proposed bit‐plane coding method is based on the traditional bit‐plane coding scheme in MPEG‐4 FGS. However, to enhance coding efficiency of bit‐plane encoding, we apply an efficient probability estimation scheme through employing the binary arithmetic coding. For probability estimation, various context models are designed to take advantage of the characteristics of each bit‐plane as well as the correlations of symbols among different bit‐planes. Experimental results show that the proposed FGS coding scheme provides better coding performance, compared to the well‐known FGS coding schemes in MPEG‐4 FGS and JSVM. © 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 16, 113–120, 2006.