• DocumentCode
    2088555
  • Title

    Determining efficient bit stream extraction paths in H.264/AVC scalable video coding

  • Author

    Lee, Dongeun ; Lee, Yonghee ; Lee, Heejung ; Lee, Jonghun ; Shin, Heonshik

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., Seoul
  • fYear
    2008
  • fDate
    26-29 Oct. 2008
  • Firstpage
    2233
  • Lastpage
    2237
  • Abstract
    The scalable video coding (SVC) amendment of H.264/AVC offers three scalability dimensions: spatial, temporal, and quality scalabilities. Since these three dimensions can be easily combined, a single SVC bit stream has various extraction points, providing many sub-streams. When a specific bit rate is given, finding an optimal extraction point among various extraction points is a difficult problem due to the difference in the metric of each scalability dimension. We develop a method to efficiently transform three scalability dimensions into utility functions and propose an algorithm to find an efficient extraction path by using the points of inflection. Experimental results show that our approach can find a better extraction path as compared to the Joint Scalable Video Model (JSVM) basic extractor. Moreover, using the determined extraction path for an SVC bit stream is less complex owing to its monotonically increasing property.
  • Keywords
    video coding; video streaming; H.264/AVC scalable video coding; bit stream extraction paths; joint scalable video model basic extractor; optimal extraction point; scalability dimensions; single SVC bit stream; utility functions; Automatic voltage control; Bandwidth; Bit rate; Decoding; Rate-distortion; Scalability; Static VAr compensators; Streaming media; Testing; Video coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2008 42nd Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • ISSN
    1058-6393
  • Print_ISBN
    978-1-4244-2940-0
  • Electronic_ISBN
    1058-6393
  • Type

    conf

  • DOI
    10.1109/ACSSC.2008.5074833
  • Filename
    5074833