IDEAS home Printed from https://ideas.repec.org/a/igg/jsda00/v4y2015i2p42-55.html
   My bibliography  Save this article

An Efficient Block Mode Detection Algorithm for Scalable Video Coding using Probability Model

Author

Listed:
  • L. Balaji

    (Anna University, Chennai, India & Velammal Institute of Technology, Tamil Nadu, India)

  • K.K. Thyagharajan

    (RMD Engineering College, Tamil Nadu, India)

  • A. Dhanalakshmi

    (Panimalar Engineering College, Chennai, India)

Abstract

H.264 / AVC expansion is H.264 / SVC which is applicable in environments that demand video streaming. This paper delivers an algorithm to shorten computational complexity and extend coding efficiency by determining the mode speedily. In this writing, the authors talk a fast mode resolution algorithm with less complexity unlikely the traditional joint scalable video model (JSVM). Their algorithm end mode hunt by a probability model defined. This model is address for both intra-mode and inter-mode predictions of base layer and enhancement layers in a macro block (MB). The estimated rate distortion cost (RDC) for modes among layers is custom to determine the best mode of each MB. The experimental results show that the authors' algorithm realizes 26.9% of encoding time when compared with the JSVM reference software with smallest reduction in peak signal to noise ratio (PSNR).

Suggested Citation

  • L. Balaji & K.K. Thyagharajan & A. Dhanalakshmi, 2015. "An Efficient Block Mode Detection Algorithm for Scalable Video Coding using Probability Model," International Journal of System Dynamics Applications (IJSDA), IGI Global, vol. 4(2), pages 42-55, April.
    • Handle: RePEc:igg:jsda00:v:4:y:2015:i:2:p:42-55
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijsda.2015040103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsda00:v:4:y:2015:i:2:p:42-55. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.