Open AccessMultimedia Compression Techniques for Streaming
Author(s) -
P.Madhusudhana Rao,
Krishna Prakasha K*,
Vasundhara Acharya
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l3383.1081219
Subject(s) - computer science , multimedia , data compression , bandwidth (computing) , field (mathematics) , popularity , streaming algorithm , prime time , video streaming , live streaming , quality (philosophy) , real time computing , computer network , telecommunications , artificial intelligence , psychology , social psychology , mathematical analysis , philosophy , mathematics , epistemology , pure mathematics , upper and lower bounds
With the growing popularity of streaming content, streaming platforms have emerged that offer content in resolutions of 4k, 2k, HD etc. Some regions of the world face a terrible network reception. Delivering content and a pleasant viewing experience to the users of such locations becomes a challenge. audio/video streaming at available network speeds is just not feasible for people at those locations. The only way is to reduce the data footprint of the concerned audio/video without compromising the quality. For this purpose, there exists algorithms and techniques that attempt to realize the same. Fortunately, the field of compression is an active one when it comes to content delivering. With a lot of algorithms in the play, which one actually delivers content while putting less strain on the users' network bandwidth? This paper carries out an extensive analysis of present popular algorithms to come to the conclusion of the best algorithm for streaming data. Both audio and video compression are put under scrutiny and are compared on various aspects prime to delivery of data.