Skip to main content
Log in

Efficiency enhancement of K-multi constraints paths in hybrid video coder using information based quantization method

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Optimal coding of video data depends upon the content of the frame. In a video frame, static and motion area exist. It is necessary to handle the static and motion parts separately for the optimal video coding. Doing that task firstly it is necessary to separate out the motion activity and the static portion of the frame separately with the help of some frame partitioning technique. In this paper quadtree (QT) based frame partitioning strategy is used. In the case of quad partitioning strategy on the basis of the edge threshold value motion part is represented by the small size of the block and a static portion of the frame represented by the large size of the block. In this paper on the basis of this block-based information level, an information-based variable quantization method (IV-QM) is developed. In this method, the value of the quantization parameter is fixed on the basis of information level in the block. In our suggested method, the rate-distortion algorithm was determined and tested for a variety of video sequences both fast and slow motion. Therefore the output is the testing of these various sequences for the newly proposed technique was done because of the variable R–D behavior for a variety of test sequence. The purposed technique is represented in a way that during the improvement of the rate and distortion, the estimate does not violate the multi-constraints parameters. Results are validated with the two video sequences, Mother-daughter and Foreman having different motion activity and varying frame rate 10 and 5 fps. In case of slow motion Mother-daughter video frame at frame rate 5 fps total bit budget reduced 5615–3185 bits and complexity reduced 102.57–99.23 s with acceptable degradation in PSNR 30.14 dB to 29.25 and at frame rate 10 fps bit budget reduced 4071–1949 bits and complexity reduced 56.58–55.65 s with acceptable degradation in PSNR 30.48 dB to 29.58 using proposed algorithm. Same algorithm is verified at fast motion foreman video sequence at 5 fps and found that total bit budget reduced 10,778–9152 bits and complexity reduced 76.10–75.15 s with acceptable degradation in PSNR 30.15 dB to 29.19 and at frame rate 10 fps bit budget reduced 10,666 bits to 8741 bits and complexity reduced 67.34–54.65 s with acceptable degradation in PSNR 30.17 dB to 29.02 using proposed algorithm. When the performance parameters are compared, it is concluded that bits requirement and complexity is reduced while moving from the fixed quantization parameters to variable quantization parameter and some acceptable degradation in PSNR is comes into the picture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Birman R, Segal Y, Hadar O (2020) Overview of research in the field of video compression using deep neural networks. Multimed Tools Appl 79:11699–11722

    Article  Google Scholar 

  • Carlyle WM, Royset JO, Wood RK (2008) Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4):256–270

    Article  MathSciNet  Google Scholar 

  • Chan M, Yu Y, Constantinides A (1990) Variable size block matching motion compensation with applications to video coding. Proc Inst Electr Eng Pt I 137(4):205–212

    Google Scholar 

  • Choi K et al (2019) New video codec for high-quality video service and emerging applications. In: Data Compression Conference (DCC), Snowbird, UT, USA, pp 310–319, 2019

  • Deeverand A, Hemami SS (1998) “Dense motion field reduction for motion estimation. Signals Syst Comput 2:944–948

    Google Scholar 

  • Ding W, Liu B (1996) Rate control of mpeg video coding and recording by rate-quantization modeling. IEEE Trans Circ Syst Video Technol 6:12–20

    Article  Google Scholar 

  • Hanzo L, Tafazolli R (2007) A survey of QoS routing solutions for mobile ad hoc networks. IEEE Commun Surveys Tuts 9(2):50–70

    Article  Google Scholar 

  • Jelveh H, Nandi AK (1991) Improved variable size block matching motion compensation for video conferencing applications. In: Cappellini A, Constantinides A (eds) Digital signal processing. Springer-Verlag, Berlin, pp 391–396

    Google Scholar 

  • Joksch H (1966) The shortest route problem with constraints. J Math Anal Appl 14:191–197

    Article  MathSciNet  Google Scholar 

  • Karczewicz M, Ye Y, Chong I (2008) Rate-distortion optimized quantization. In: ITU-TQ6/16,Doc .VCEG-AH21, 2008

  • Korkmaz T, Krunz M (2001) Multi-constrained optimal path selection. In: Proc. INFOCOM 2001, vol. 2, Anchorage, AK, Apr. 2001, IEEE, pp. 834–43

  • Korkmaz T, Krunz M, Tragoudas S (2002) An efficient algorithm for finding a path subject to two additive constraints. Comput Commun J 25(3):225–238

    Article  Google Scholar 

  • Kuipers F, Mieghem PV, Korkmaz T, Krunz M (2002) An overview of constraint-based path selection algorithm for QoS routing. In: IEEE Comm. Mag., pp 50–55, 2002

  • LeGall D (1991) MPEG: a video compression standard for multimedia application. Commun ACM 34:46–58

    Article  Google Scholar 

  • Lin L-J, Ortega A (1990) Bit-rate control using piecewise approximated rate-distortion characteristics. IEEE Trans Circ Syst Video Technol 38:82–93

    Google Scholar 

  • Lin Y-C, Tai S-C (1997) Fast full-search block-matching algorithm for motion-compensated video compression. IEEE Trans Commun 45(5):527–531

    Article  Google Scholar 

  • Liu G, Ramakrishnan KG (2001) An algorithm for finding k-shortest paths subject to multiple constraints. Proc IEEE INFOCOM 2:743–749

    Google Scholar 

  • Liu G, Ramakrishnan R (2001) “A*prune: an algorithm for finding K shortest paths subject to multiple constraints. In: INFOCOM, 2001

  • Lu, Ouyang W, Xu D, Zhang X, Cai C, Gao Z (2019) DVC: an end-to-end deep video compression framework. In: The IEEE Conference on computer vision and pattern recognition (CVPR), pp 11006–11015, 2019

  • Mathew R, Taubman DD (2010) Quad-tree motion modeling with leaf merging. IEEE Trans Circ Syst Video Technol 20(10):1331–1345

    Article  Google Scholar 

  • Nguyen T, Schwarz H, Kirchhoffer H, Marpe D, Wiegand T (2010) Improved context modeling for coding quantized transform coefficients in video compression. In: Proc. Picture Coding Symposium (PCS), 2010

  • Niu C et al (2010) Moving object segmentation in the H.264 compressed domain. In: ACCV 2009, part II, LNCS 5995, pp 45–54, 2010. (fulltext59)

  • Salunkhe Y, Jagtap R, Karve H, Daund S (2018) Review of effective video compression techniques. IJEDR 6(2):1–6

    Google Scholar 

  • Shi N (2010) K constrained shortest path problem. IEEE Trans Autom Sci Eng 7(1):15–23

    Article  MathSciNet  Google Scholar 

  • Shukla R, Dragotti PL, Do MN, Vetterli M (2005) Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images. IEEE Trans Image Process 14(3):343–359

    Article  MathSciNet  Google Scholar 

  • Sullivan GJ, Baker RL (1994) Efficient quadtree coding of image and video. IEEE Trans Image Process 3(4):327–331

    Article  Google Scholar 

  • Vaisey DJ, Gersho A (1987) Variable block-size image coding. In: Proc. IEEE Int. Con$ Acoust. Speech Signal Processing (ICASSP), Apr. 1987, pp 25.1.1–25.1.4

  • Vetro A, Christopoulos C, Sun H (2003) Video transcoding architectures and techniques: an overview. IEEE Signal Process Mag 20(2):18–29

    Article  Google Scholar 

  • Wang H, Kwon Sg, Kok C-W (2007) Efficient predictive model of zero quantized DCT coefficients for fast video encoding. In: Image and vision computing Elsevier, 2007

  • Wiegand T, Girod B (2001) Lagrange multiplier selection in hybrid video coder control. In: Proc. Int. Conf. Image Processing, pp. 542–545, Thessaloniki, Greece, Oct. 2001

  • Wiegand T, Sullivan GJ, Bjontegaard G, Luthra A (2003a) Overview of the H.264/AVC video coding standard. IEEE Trans Circ Syst Video Technol 13(7):560–576

    Article  Google Scholar 

  • Wiegand T, Schwarz H, Joch A, Kossentini F, Sullivan GJ (2003b) Rate-constrained coder control and comparison of video coding standards. IEEE Trans Circ Syst Video Technol 13:688–703

    Article  Google Scholar 

  • Xu J-B, Po L-M, Cheung C-K (1999) Adaptive motion tracking block matching algorithms for video coding. IEEE Trans Circ Syst Video Technol 9(7):1025–1029

    Article  Google Scholar 

  • Zheng X, Yu H (2011) CE2: Huawei and Hisilicon Report on Flexible Motion Partitioning, document JCTVC-D297. In: 4th Meeting, Daegu, Korea, Jan. 2011

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Krishan Kumar or Amit Kant Pandit.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, K., Kumar, R., Mahajan, S. et al. Efficiency enhancement of K-multi constraints paths in hybrid video coder using information based quantization method. J Ambient Intell Human Comput (2021). https://doi.org/10.1007/s12652-020-02766-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12652-020-02766-6

Keywords

Navigation