Motion adaptive video coding scheme for time-varying network.
Saved in:
| Title: | Motion adaptive video coding scheme for time-varying network. |
|---|---|
| Authors: | Bhuyan, M. K.1, Chakraborty, B. K.1 |
| Source: | International Journal of Communication Systems. 3/25/2015, Vol. 28 Issue 5, p873-888. 16p. |
| Subjects: | Adaptive codes, Video coding, Time-varying networks, Algorithms, Streaming video & television, Bandwidths, Buffer storage (Computer science) |
| Abstract: | Adaptive video coding algorithms can encode a video stream dynamically on the basis of the amount of bandwidth available in a network. In this paper, a novel approach for adaptive video coding based on look-up tables has been proposed. On the basis of the network conditions, the proposed codec estimates quantization parameter (QP) and also the spatial resolution for a group of pictures from the look-up table. Then, QP for each frame is estimated on the basis of the motion content in each frame. More motion leads to more burden of bits while encoding the motion vectors. Also, quantization noise is less prominent in high-motioned frames than frames possessing low motion information because of the temporal masking phenomenon of the human eyes. So, the main trick of the proposed scheme is to assign higher QP to the frames having higher motion than those having less motion. This method also reduces the requirement of excess bits for encoding of motion vectors having higher motion content. Additionally, QP is adjusted on the basis of the buffer availability in order to avoid bit loss error. Experimental results show the efficacy of the proposed codec. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Communication Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Adaptive video coding algorithms can encode a video stream dynamically on the basis of the amount of bandwidth available in a network. In this paper, a novel approach for adaptive video coding based on look-up tables has been proposed. On the basis of the network conditions, the proposed codec estimates quantization parameter (QP) and also the spatial resolution for a group of pictures from the look-up table. Then, QP for each frame is estimated on the basis of the motion content in each frame. More motion leads to more burden of bits while encoding the motion vectors. Also, quantization noise is less prominent in high-motioned frames than frames possessing low motion information because of the temporal masking phenomenon of the human eyes. So, the main trick of the proposed scheme is to assign higher QP to the frames having higher motion than those having less motion. This method also reduces the requirement of excess bits for encoding of motion vectors having higher motion content. Additionally, QP is adjusted on the basis of the buffer availability in order to avoid bit loss error. Experimental results show the efficacy of the proposed codec. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10745351 |
| DOI: | 10.1002/dac.2712 |
