{"title":"Motion-compensated video compression using variable length Huffman coding","authors":"K. Vidyavathi, R. S. Sabeenian","doi":"10.1109/MVIP.2012.6428765","DOIUrl":null,"url":null,"abstract":"This paper presents the video compression techniques used for the processing of image sequences which are based on time based video. The temporal redundancies among the images are used for efficient code motion. Here, a simple method to increase the accuracy of most interframe predictions is to account for the frame-to-frame motion of objects. Using an interframe predictor, the compression has been increased to 2.085. In linear predictive coding and variable length Huffman coding, the compression is loss less and due to the fact that the entropy of the resulting prediction residuals is lowers than the entropy of the frame.","PeriodicalId":170271,"journal":{"name":"2012 International Conference on Machine Vision and Image Processing (MVIP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Machine Vision and Image Processing (MVIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MVIP.2012.6428765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
This paper presents the video compression techniques used for the processing of image sequences which are based on time based video. The temporal redundancies among the images are used for efficient code motion. Here, a simple method to increase the accuracy of most interframe predictions is to account for the frame-to-frame motion of objects. Using an interframe predictor, the compression has been increased to 2.085. In linear predictive coding and variable length Huffman coding, the compression is loss less and due to the fact that the entropy of the resulting prediction residuals is lowers than the entropy of the frame.