Dependent quantization for scalable video coding

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 472
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Mun-Churl-
dc.contributor.advisor김문철-
dc.contributor.authorDanu Pranantha-
dc.date.accessioned2011-12-28T03:00:10Z-
dc.date.available2011-12-28T03:00:10Z-
dc.date.issued2007-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392795&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/54843-
dc.description학위논문(석사) - 한국정보통신대학교 : 공학부, 2007.2, [ ix, 63 p. ]-
dc.description.abstractQuantization in video coding plays an important role in controlling the bitrates of compressed video bitstreams. It has been used as an important control means to adjust the amount of bitstreams to allowed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG video coding to better maintain the quality of reconstructed frames for given constraints of target bitratess. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also between lower and higher scalability layers where the dependent quantization can be effectively applied. In this thesis, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bitratess with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization which is widely accepted in R-D (rate-distortion) optimization, and construct a trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity in searching such optimal paths in the trellis graph, we employ a pruning procedure using the monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental results show that the dependent quantization outperforms in terms of PSNR values and bitamounts the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the ...eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectScalable Video Coding-
dc.subjectLagrange Multiplier-
dc.subjectQuantization-
dc.subjectDependent Quantization-
dc.subjectTrellis Graph-
dc.titleDependent quantization for scalable video coding-
dc.typeThesis(Master)-
dc.identifier.CNRN392795/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020054632-
dc.contributor.localauthorKim, Mun-Churl-
dc.contributor.localauthor김문철-
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0