DOCSLIB.ORG

(12) Patent Application Publication (10) Pub. No.: US 2014/0286399 A1 VALIN Et Al

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
(12) Patent Application Publication (10) Pub. No.: US 2014/0286399 A1 VALIN Et Al US 20140286399A1 (19) United States (12) Patent Application Publication (10) Pub. No.: US 2014/0286399 A1 VALIN et al. (43) Pub. Date: Sep. 25, 2014 (54) PYRAMID VECTOR QUANTIZATION FOR Publication Classification VIDEO CODING (51) Int. C. (71) Applicants: Jean-Marc VALIN, Montreal (CA); H04N 9/5 (2006.01) Timothy B. TERRIBERRY, Mountain HO)4N 19/177 (2006.01) View, CA (US) H04N 9/36 (2006.01) H04N 9/24 (2006.01) (72) Inventors: Jean-Marc VALIN, Montreal (CA); (52) U.S. C. Timothy B. TERRIBERRY, Mountain CPC ..... H04N 19/00703 (2013.01); H04N 19/0009 View, CA (US) (2013.01); H04N 19/00284 (2013.01); H04N 19/00139 (2013.01) USPC - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 375/240.03 (21) Appl. No.: 14/187,081 (57) ABSTRACT An apparatus and corresponding method are provided for (22) Filed: Feb. 21, 2014 pyramid vector quantization of video data, including receiv ing the video data in the frequency domain; and pyramid vector quantizing at least one group of pictures (GOP) from Related U.S. Application Data the received video data in accordance with a potentially vary (60) Provisional application No. 61/767,338, filed on Feb. ing bandwidth, the GOP comprising key frames and predicted 21, 2013. frames. iOO Patent Application Publication Sep. 25, 2014 Sheet 1 of 6 US 2014/0286399 A1 PREDICTION / N Compute reflection plane Compute/code angle - - 140 code other dimensions FIG. 1 Patent Application Publication Sep. 25, 2014 Sheet 2 of 6 US 2014/0286399 A1 Patent Application Publication Sep. 25, 2014 Sheet 3 of 6 US 2014/0286399 A1 300 310 \ 312 8.01 bits (K=8) 8.92 bits (K=11) 10.00 bits (K=16) 11.05 bits (K=23) 12.00 bits (K=32) 318 320 322 324 FIG. 3 Patent Application Publication Sep. 25, 2014 Sheet 4 of 6 US 2014/0286399 A1 4. Fewer pulses needed . N is NE is c 3 N N N : Patent Application Publication Sep. 25, 2014 Sheet 5 of 6 US 2014/0286399 A1 % -- C r .. .93 Kaks 3 2. g s f s a. i. W ---, Cme - a Patent Application Publication Sep. 25, 2014 Sheet 6 of 6 US 2014/0286399 A1 {}}({}){ US 2014/0286399 A1 Sep. 25, 2014 PYRAMID VECTOR QUANTIZATION FOR varying number of quantized frequency bands or a corre VIDEO CODING spondingly varying number of quantized data bits. 0007. A further exemplary apparatus is provided, wherein CROSS-REFERENCE TO RELATED the one or more stored sequences of instructions further cause APPLICATIONS the processor to: receive an input; compute a prediction 0001. This application claims the benefit of U.S. Provi responsive to the input; compute a reflection plane responsive sional Patent Application 61/767,338 filed on Feb. 21, 2013 to the input and prediction; apply the reflection to the input entitled, “PYRAMID VECTOR QUANTIZATION FOR and prediction; compute an angle between the input and pre VIDEO CODING”, which is incorporated by reference diction; quantize the angle; and code the quantized angle. Yet herein in its entirety. a further exemplary apparatus is provided, wherein the one or more stored sequences of instructions further cause the pro cessor to: Split the received frequency-domain video data into BACKGROUND at least two frequency bands; and quantize an upper fre 0002 Coding systems and methods typically encode a quency band more coarsely than a lower frequency band. single audio stream and a single associated video stream for 0008. An exemplary apparatus for pyramid vector quanti streaming from a source to a destination. The combined band Zation to encode video data is provided, the apparatus includ width of the audio and video streams is the required channel ing an input terminal; a prediction unit in signal communica bandwidth between the source and destination. If this channel tion with the input terminal; a transform unit in signal bandwidth is reduced due to network congestion, for communication with the input terminal and the prediction example, conventional systems have limited means of unit; a pyramid vector quantization unit in signal communi adequately dealing with the reduction. In general, they may cation with the transform unit; an entropy coding unit in rely on low-pass quantization, which sacrifices energy detail signal communication with the quantization unit; an inverse for reduced bandwidth. quantization unit in signal communication with the quantiza 0003. Unfortunately, such systems and methods have tion unit; an inverse transform unit in signal communication drawbacks such as blurriness due to loss of energy detail, with the inverse quantization unit; a reference picture unit in activity masking overhead, and inefficient representation of signal communication with the inverse transform unit; a coefficients. Embodiments of the present disclosure address motion estimation unit in signal communication with each of these and other issues. the reference picture unit and the input terminal; and a motion compensation unit in signal communication with each of the SUMMARY reference picture unit and the motion estimation unit, wherein the motion compensation unit is in direct signal communica 0004. These and other drawbacks and disadvantages of the tion with the transform unit. Another exemplary apparatus is prior art are addressed by an apparatus and corresponding provided, wherein the pyramid vector quantization unit com method of pyramid vector quantization for video coding. An prises a band splitter. exemplary method of pyramid vector quantization for encod ing video data includes receiving the video data in a fre 0009. An exemplary computer program product is pro quency domain; pyramid vector quantizing at least one group vided, including a non-transitory computer-readable medium of pictures (GOP) from the received video data in accordance having a computer-readable program code embodied therein with a potentially varying bandwidth, the GOP comprising to be executed by one or more processors, the program code key frames and predicted frames; and quantizing the key including instructions to: receive video data in the frequency frames before the predicted frames to form at least one domain; pyramid vector quantize at least one group of pic stream, the at least one stream having a correspondingly tures from the received video data in accordance with a poten varying number of quantized frequency bands or a corre tially varying bandwidth, the GOP comprising key frames spondingly varying number of quantized data bits. and predicted frames; and quantize the key frames before the 0005. A further exemplary method includes receiving an predicted frames to form at least one stream, the at least one input; computing a prediction responsive to the input; com stream having a correspondingly varying number of quan puting a reflection plane responsive to the input and predic tized frequency bands or a correspondingly varying number tion; applying the reflection to the input and prediction; com of quantized data bits. puting an angle between the input and prediction; quantizing 0010. A further exemplary computer program product is the angle; and coding the quantized angle. Yet a further exem provided, wherein the program code includes further instruc plary method includes splitting the received frequency-do tions to: receive an input; compute a prediction responsive to main video data into at least two frequency bands; and quan the input; compute a reflection plane responsive to the input tizing an upper frequency band more coarsely than a lower and prediction; apply the reflection to the input and predic frequency band. tion; compute an angle between the input and prediction; 0006 An exemplary apparatus for pyramid vector quanti quantize the angle; and code the quantized angle. Yet another Zation to encode video data includes a processor, and one or exemplary computer program product is provided, wherein more stored sequences of instructions which, when executed the program code includes further instructions to: Split the by the processor, cause the processor to: receive the video received frequency-domain video data into at least two fre data in a frequency domain; pyramid vector quantize at least quency bands; and quantize an upper frequency band more one group of pictures from the received video data in accor coarsely than a lower frequency band. dance with a potentially varying bandwidth, the GOP com 0011. These and other aspects, features and advantages of prising key frames and predicted frames; and quantize the key the present disclosure will become apparent from the follow frames before the predicted frames to form at least one ing description of exemplary embodiments, which is to be stream, the at least one stream having a correspondingly read in connection with the accompanying drawings. US 2014/0286399 A1 Sep. 25, 2014 BRIEF DESCRIPTION OF THE DRAWINGS more uniform distribution, Such as in Opus. Other challenges 0012. The present disclosure teaches pyramid vector include the introduction of a quantization matrix and the quantization for video coding in accordance with the follow desire to represent the reference or motion predicted data ing exemplary figures, in which: perfectly by one of the codebook entries. For small (e.g., 4x4) 0013 FIG. 1 shows a flow diagram for a method of pyra blocks, all of the AC coefficients may be put into a single mid vector quantization in accordance with the principles of band. the present disclosure; 0026. In gain-shape quantization, vectors are represented as a magnitude multiplied by a unit-norm vector, i.e., as a 0014 FIG. 2 shows a system diagram for a video encoder radius plus a point on a hypersphere. Magnitude is coded with pyramid vector quantizer (PVO) in accordance with the separately, and the quantization resolution of the point on the principles of the present disclosure; hypersphere is adjusted based on the magnitude. There is a 0015 FIG.3 shows a comparative diagram of a codebook trade-off between the accuracy used to represent the amount for N=3 and different K in accordance with the principles of of texture versus the accuracy of the exact details.
Load more

Recommended publications
  • Ogg Audio Codec Download
    Ogg audio codec download click here to download To obtain the source code, please see the xiph download page. To get set up to listen to Ogg Vorbis music, begin by selecting your operating system above. Check out the latest royalty-free audio codec from Xiph. To obtain the source code, please see the xiph download page. Ogg Vorbis is Vorbis is everywhere! Download music Music sites Donate today. Get Set Up To Listen: Windows. Playback: These DirectShow filters will let you play your Ogg Vorbis files in Windows Media Player, and other OggDropXPd: A graphical encoder for Vorbis. Download Ogg Vorbis Ogg Vorbis is a lossy audio codec which allows you to create and play Ogg Vorbis files using the command-line. The following end-user download links are provided for convenience: The www.doorway.ru DirectShow filters support playing of files encoded with Vorbis, Speex, Ogg Codecs for Windows, version , ; project page - for other. Vorbis Banner Xiph Banner. In our effort to bring Ogg: Media container. This is our native format and the recommended container for all Xiph codecs. Easy, fast, no torrents, no waiting, no surveys, % free, working www.doorway.ru Free Download Ogg Vorbis ACM Codec - A new audio compression codec. Ogg Codecs is a set of encoders and deocoders for Ogg Vorbis, Speex, Theora and FLAC. Once installed you will be able to play Vorbis. Ogg Vorbis MSACM Codec was added to www.doorway.ru by Bjarne (). Type: Freeware. Updated: Audiotags: , 0x Used to play digital music, such as MP3, VQF, AAC, and other digital audio formats.
    [Show full text]
  • Opus, a Free, High-Quality Speech and Audio Codec
    Opus, a free, high-quality speech and audio codec Jean-Marc Valin, Koen Vos, Timothy B. Terriberry, Gregory Maxwell 29 January 2014 Xiph.Org & Mozilla What is Opus? ● New highly-flexible speech and audio codec – Works for most audio applications ● Completely free – Royalty-free licensing – Open-source implementation ● IETF RFC 6716 (Sep. 2012) Xiph.Org & Mozilla Why a New Audio Codec? http://xkcd.com/927/ http://imgs.xkcd.com/comics/standards.png Xiph.Org & Mozilla Why Should You Care? ● Best-in-class performance within a wide range of bitrates and applications ● Adaptability to varying network conditions ● Will be deployed as part of WebRTC ● No licensing costs ● No incompatible flavours Xiph.Org & Mozilla History ● Jan. 2007: SILK project started at Skype ● Nov. 2007: CELT project started ● Mar. 2009: Skype asks IETF to create a WG ● Feb. 2010: WG created ● Jul. 2010: First prototype of SILK+CELT codec ● Dec 2011: Opus surpasses Vorbis and AAC ● Sep. 2012: Opus becomes RFC 6716 ● Dec. 2013: Version 1.1 of libopus released Xiph.Org & Mozilla Applications and Standards (2010) Application Codec VoIP with PSTN AMR-NB Wideband VoIP/videoconference AMR-WB High-quality videoconference G.719 Low-bitrate music streaming HE-AAC High-quality music streaming AAC-LC Low-delay broadcast AAC-ELD Network music performance Xiph.Org & Mozilla Applications and Standards (2013) Application Codec VoIP with PSTN Opus Wideband VoIP/videoconference Opus High-quality videoconference Opus Low-bitrate music streaming Opus High-quality music streaming Opus Low-delay
    [Show full text]
  • Multi-Core Platforms for Audio and Multimedia Coding Algorithms in Telecommunications
    Antti Pakarinen Multi-core platforms for audio and multimedia coding algorithms in telecommunications School of Electrical Engineering Thesis submitted for examination for the degree of Master of Science in Technology. Kirkkonummi 14.9.2012 Thesis supervisor: Prof. Vesa V¨alim¨aki Thesis instructor: M.Sc. (Tech.) Jussi Pekonen Aalto University School of Electrical A! Engineering aalto university abstract of the school of electrical engineering master's thesis Author: Antti Pakarinen Title: Multi-core platforms for audio and multimedia coding algorithms in telecommunications Date: 14.9.2012 Language: English Number of pages: 9+63 Department of Signal processing and Acoustics Professorship: Acoustics and Audio Signal processing Code: S-89 Supervisor: Prof. Vesa V¨alim¨aki Instructor: M.Sc. (Tech.) Jussi Pekonen Multimedia coding algorithms used in telecommunications evolve constantly. Ben- efits and properties of two new hybrid audio codecs (USAC, Opus) were reviewed on a high level as a literature study. It was found that both have succeeded well in subjective sound quality measurements. Tilera TILEPro64-multicore platform and a related software library was evaluated in terms of performance in multimedia coding. The performance in video coding was found to increase with the number of processing cores up to a certain point. With the tested audio codecs, increasing the number of cores did not increase coding performance. Additionally, multicore products of Tilera, Texas Instruments and Freescale were compared. Develop- ment tools of all three vendors were found to have similiar features, despite the differences in hardware architectures. Keywords: Multimedia, audio, video, coding algorithms, multicore aalto-yliopisto diplomityon¨ sahk¨ otekniikan¨ korkeakoulu tiivistelma¨ Tekij¨a:Antti Pakarinen Ty¨onnimi: Moniydinsuorittimet audion ja multimedian koodausalgoritmeille tietoliikenteess¨a P¨aiv¨am¨a¨ar¨a:14.9.2012 Kieli: Englanti Sivum¨a¨ar¨a:9+63 Signaalink¨asittelynja akustiikan laitos Professuuri: Akustiikka ja ¨a¨anenk¨asittely Koodi: S-89 Valvoja: Prof.
    [Show full text]
  • The Daala Video Codec Project Next-Next Generation Video
    The Daala Video Codec Project Next-next Generation Video Timothy B. Terriberry Mozilla & The Xiph.Org Foundation ● Patents are no longer a problem for free software – We can all go home 2 Mozilla & The Xiph.Org Foundation ● Except... not quite 3 Mozilla & The Xiph.Org Foundation Carving out Exceptions in OIN (Table 0 contains one Xiph codec: FLAC) 4 Mozilla & The Xiph.Org Foundation Why This Matters ● Encumbered codecs are a billion dollar toll-tax on communications – Every cost from codecs is repeated a million fold in all multimedia software ● Codec licensing is anti-competitive – Licensing regimes are universally discriminatory – An excuse for proprietary software (Flash) ● Ignoring licensing creates risks that can show up at any time – A tax on success 5 Mozilla & The Xiph.Org Foundation The Royalty-Free Video Challenge ● Creating good codecs is hard – But we don’t need many – The best implementations of patented codecs are already free software ● Network effects decide – Where RF is established, non-free codecs see no adoption (JPEG, PNG, FLAC, …) ● RF is not enough – People care about different things – Must be better on all fronts 6 Mozilla & The Xiph.Org Foundation We Did This for Audio 7 Mozilla & The Xiph.Org Foundation The Daala Project ● Goal: Better than HEVC without infringing IPR ● Need a better strategy than “read a lot of patents” – People don’t believe you – Analysis is error-prone ● Try to stay far away from the line, but... ● One mistake can ruin years of development effort ● See: H.264 Baseline 8 Mozilla & The Xiph.Org
    [Show full text]
  • PVQ Applied Outside of Daala (IETF 97 Draft)
    PVQ Applied outside of Daala (IETF 97 Draft) Yushin Cho Mozilla Corporation November, 2016 Introduction ● Perceptual Vector Quantization (PVQ) – Proposed as a quantization and coefficient coding tool for NETVC – Originally developed for the Daala video codec – Does a gain-shape coding of transform coefficients ● The most distinguishing idea of PVQ is the way it references a predictor. – PVQ does not subtract the predictor from the input to produce a residual Mozilla Corporation 2 Integrating PVQ into AV1 ● Introduction of a transformed predictors both in encoder and decoder – Because PVQ references the predictor in the transform domain, instead of using a pixel-domain residual as in traditional scalar quantization ● Activity masking, the major benefit of PVQ, is not enabled yet – Encoding RDO is solely based on PSNR Mozilla Corporation 3 Traditional Architecture Input X residue Subtraction Transform T signal R predictor P + decoded X Inverse Inverse Scalar decoded R Transform Quantizer Quantizer Coefficient bitstream of Coder coded T(X) Mozilla Corporation 4 AV1 with PVQ Input X Transform T T(X) PVQ Quantizer PVQ Coefficient predictor P Transform T T(X) Coder PVQ Inverse Quantizer Inverse dequantized bitstream of decoded X Transform T(X) coded T(X) Mozilla Corporation 5 Coding Gain Change Metric AV1 --> AV1 with PVQ PSNR Y -0.17 PSNR-HVS 0.27 SSIM 0.93 MS-SSIM 0.14 CIEDE2000 -0.28 ● For the IETF test sequence set, "objective-1-fast". ● IETF and AOM for high latency encoding options are used. Mozilla Corporation 6 Speed ● Increase in total encoding time due to PVQ's search for best codepoint – PVQ's time complexity is close to O(n*n) for n coefficients, while scalar quantization has O(n) ● Compared to Daala, the search space for a RDO decision in AV1 is far larger – For the 1st frame of grandma_qcif (176x144) in intra frame mode, Daala calls PVQ 3843 times, while AV1 calls 632,520 times, that is ~165x.
    [Show full text]
  • Efficient Multi-Codec Support for OTT Services: HEVC/H.265 And/Or AV1?
    Efficient Multi-Codec Support for OTT Services: HEVC/H.265 and/or AV1? Christian Timmerer†,‡, Martin Smole‡, and Christopher Mueller‡ ‡Bitmovin Inc., †Alpen-Adria-Universität San Francisco, CA, USA and Klagenfurt, Austria, EU ‡{firstname.lastname}@bitmovin.com, †{firstname.lastname}@itec.aau.at Abstract – The success of HTTP adaptive streaming is un- multiple versions (e.g., different resolutions and bitrates) and disputed and technical standards begin to converge to com- each version is divided into predefined pieces of a few sec- mon formats reducing market fragmentation. However, other onds (typically 2-10s). A client first receives a manifest de- obstacles appear in form of multiple video codecs to be sup- scribing the available content on a server, and then, the client ported in the future, which calls for an efficient multi-codec requests pieces based on its context (e.g., observed available support for over-the-top services. In this paper, we review the bandwidth, buffer status, decoding capabilities). Thus, it is state of the art of HTTP adaptive streaming formats with re- able to adapt the media presentation in a dynamic, adaptive spect to new services and video codecs from a deployment way. perspective. Our findings reveal that multi-codec support is The existing different formats use slightly different ter- inevitable for a successful deployment of today's and future minology. Adopting DASH terminology, the versions are re- services and applications. ferred to as representations and pieces are called segments, which we will use henceforth. The major differences between INTRODUCTION these formats are shown in Table 1. We note a strong differ- entiation in the manifest format and it is expected that both Today's over-the-top (OTT) services account for more than MPEG's media presentation description (MPD) and HLS's 70 percent of the internet traffic and this number is expected playlist (m3u8) will coexist at least for some time.
    [Show full text]
  • LORE: a Loop Repository for the Evaluation of Compilers Zhi Chen∗, Zhangxiaowen Gong†, Justin Josef Szaday†, David C
    LORE: A Loop Repository for the Evaluation of Compilers Zhi Chen∗, Zhangxiaowen Gongy, Justin Josef Szadayy, David C. Wongz, David Padua y, Alexandru Nicolau ∗, Alexander V Veidenbaum ∗, Neftali Watkinson ∗, Zehra Sura x, Saeed Maleki{, Josep Torrellasy, Gerald DeJongy z Intel Corporation, x IBM Research, { Microsoft Research, ∗ University of California, Irvine, y University of Illinois at Urbana-Champaign, Email: ∗fzhic2, nicolau, alexv, [email protected], [email protected], yfgong15, szaday2, padua, torrella, [email protected], [email protected], {[email protected] Abstract—Although numerous loop optimization techniques successive versions, and the effectiveness of solo/compound have been designed and deployed in commercial compilers in transformations. While some of such data can be found in the the past, virtually no common experimental infrastructure nor literature, in many cases compiler studies are confined to a repository exists to help the compiler community evaluate the effectiveness of these techniques. few codes, which are not always widely available. In addition, This paper describes a repository, LORE, that maintains a there is little in the area of historical data that shows how much large number of C language for loop nests extracted from popu- progress compiler technology has made in terms of delivering lar benchmarks, libraries, and real applications. It also describes performance. the infrastructure that builds and maintains the repository. Each In this paper, we propose LORE, a repository of program loop nest in the repository has been compiled, transformed, executed, and measured independently. These loops cover a segments, their semantically equivalent transformed versions, variety of properties that can be used by the compiler community and performance measurements with various compilers.
    [Show full text]
  • AV1 Status Update
    AV1 Status update Rostislav Pehlivanov [email protected] 2017-02-05 What is AV1 Interoperable and open Optimized for the Internet Scalable to any modern device at any bandwidth Designed with a low computational footprint and optimized for hardware Capable of consistent, highest-quality, real-time video delivery Flexible for both commercial and non-commercial content, including user-generated content What is AV1 (decoded) Royalty free Open development Lots of companies who deal with video on the internet involved Will see adaption Lots of members own patents we can use to make the codec better Avoiding alien IP means we have to work around patents and possibly discover better ways than the old tried and true techniques Reference encoder Reference encoder based on libvpx Without VP8 support With some bugfixes Every tool added initially as an experiment after passing review After passing IP review it gets enabled by default and becomes part of the codec * After codec bitstream gets frozen experiments that didn't make it get removed * ** * - Hasn't happened yet ** - Won't happen until the end of the year A codec is only as good as its coding tools Currently there are over 50 experiments: emulate hardware, clpf, dering, var tx, rect tx, ref mv, dual filter, convolve round, ext tx, tx64x64, sub8x8 mc, ext intra, intra interp, filter intra, ext inter, compound segment, ext refs, global motion, new quant, supertx, ans, ec multisymbol, loop restoration, ext partition, ext partition types, unpoison partition ctx, ext tile, motion var, ncobmc, warped
    [Show full text]
  • Forcepoint DLP Supported File Formats and Size Limits
    Forcepoint DLP Supported File Formats and Size Limits Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 This article provides a list of the file formats that can be analyzed by Forcepoint DLP, file formats from which content and meta data can be extracted, and the file size limits for network, endpoint, and discovery functions. See: ● Supported File Formats ● File Size Limits © 2021 Forcepoint LLC Supported File Formats Supported File Formats and Size Limits | Forcepoint DLP | v8.8.1 The following tables lists the file formats supported by Forcepoint DLP. File formats are in alphabetical order by format group. ● Archive For mats, page 3 ● Backup Formats, page 7 ● Business Intelligence (BI) and Analysis Formats, page 8 ● Computer-Aided Design Formats, page 9 ● Cryptography Formats, page 12 ● Database Formats, page 14 ● Desktop publishing formats, page 16 ● eBook/Audio book formats, page 17 ● Executable formats, page 18 ● Font formats, page 20 ● Graphics formats - general, page 21 ● Graphics formats - vector graphics, page 26 ● Library formats, page 29 ● Log formats, page 30 ● Mail formats, page 31 ● Multimedia formats, page 32 ● Object formats, page 37 ● Presentation formats, page 38 ● Project management formats, page 40 ● Spreadsheet formats, page 41 ● Text and markup formats, page 43 ● Word processing formats, page 45 ● Miscellaneous formats, page 53 Supported file formats are added and updated frequently. Key to support tables Symbol Description Y The format is supported N The format is not supported P Partial metadata
    [Show full text]
  • RULING CODECS of VIDEO COMPRESSION and ITS FUTURE 1Dr.Manju.V.C, 2Apsara and 3Annapoorna
    International Journal of Application or Innovation in Engineering & Management (IJAIEM) Web Site: www.ijaiem.org Email: [email protected] Volume 8, Issue 7, July 2019 ISSN 2319 - 4847 RULING CODECS OF VIDEO COMPRESSION AND ITS FUTURE 1Dr.Manju.v.C, 2Apsara and 3Annapoorna 1Professor,KSIT 2Under-Gradute, Telecommunication Engineering, KSIT 3Under-Gradute, Telecommunication Engineering, KSIT Abstract Development of economical video codecs for low bitrate video transmission with higher compression potency has been a vigorous space of analysis over past years and varied techniques are projected to fulfill this need. Video Compression is a term accustomed outline a technique for reducing the information accustomed cipher digital video content. This reduction in knowledge interprets to edges like smaller storage needs and lower transmission information measure needs, for a clip of video content. In this paper, we survey different video codec standards and also discuss about the challenges in VP9 codec Keywords: Codecs, HEVC, VP9, AV1 1. INTRODUCTION Storing video requires a lot of storage space. To make this task manageable, video compression technology was developed to compress video, also known as a codec. Video coding techniques provide economic solutions to represent video data in a more compact and stout way so that the storage and transmission of video will be completed in less value in less cost in terms of bandwidth, size and power consumption. This technology (video compression) reduces redundancies in spatial and temporal directions. Spatial reduction physically reduces the size of the video data by selectively discarding up to a fourth or more of unneeded parts of the original data in a frame [1].
    [Show full text]
  • A Thesis Submitted to the Faculty of the DEPARTMENT
    Maqlaqsyalank Hemyeega Item Type text; Electronic Thesis Authors Dupris, Joseph James Publisher The University of Arizona. Rights Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. Download date 26/09/2021 11:41:53 Link to Item http://hdl.handle.net/10150/582372 MAQLAQSYALANK HEMYEEGA by Joseph James Dupris ____________________________ Copyright © Joseph James Dupris 2015 A Thesis Submitted to the Faculty of the DEPARTMENT OF LINGUISTICS In Partial Fulfillment of the Requirements For the Degree of MASTER OF ARTS In the Graduate College THE UNIVERSITY OF ARIZONA 2015 1 STATEMENT BY AUTHOR This thesis has been submitted in partial fulfillment of requirements for an advanced degree at the University of Arizona and is deposited in the University Library to be made available to borrowers under rules of the Library. Brief quotations from this thesis are allowable without special permission, provided that an accurate acknowledgement of the source is made. Requests for permission for extended quotation from or reproduction of this manuscript in whole or in part may be granted by the copyright holder. SIGNED: Joseph James Dupris APPROVAL BY THESIS DIRECTOR This thesis has been approved on the date shown below: Stacey Oberly Date Professor of Linguistics 2 ACKNOWLEDGEMENTS I want to thank my faculty adviser Stacey Oberly for her valued comments and continuing support. I would like to thank my family and friends who continue to enrich, nourish, house and encourage me each step of my journey.
    [Show full text]
  • Scape D10.1 Keeps V1.0
    Identification and selection of large‐scale migration tools and services Authors Rui Castro, Luís Faria (KEEP Solutions), Christoph Becker, Markus Hamm (Vienna University of Technology) June 2011 This work was partially supported by the SCAPE Project. The SCAPE project is co-funded by the European Union under FP7 ICT-2009.4.1 (Grant Agreement number 270137). This work is licensed under a CC-BY-SA International License Table of Contents 1 Introduction 1 1.1 Scope of this document 1 2 Related work 2 2.1 Preservation action tools 3 2.1.1 PLANETS 3 2.1.2 RODA 5 2.1.3 CRiB 6 2.2 Software quality models 6 2.2.1 ISO standard 25010 7 2.2.2 Decision criteria in digital preservation 7 3 Criteria for evaluating action tools 9 3.1 Functional suitability 10 3.2 Performance efficiency 11 3.3 Compatibility 11 3.4 Usability 11 3.5 Reliability 12 3.6 Security 12 3.7 Maintainability 13 3.8 Portability 13 4 Methodology 14 4.1 Analysis of requirements 14 4.2 Definition of the evaluation framework 14 4.3 Identification, evaluation and selection of action tools 14 5 Analysis of requirements 15 5.1 Requirements for the SCAPE platform 16 5.2 Requirements of the testbed scenarios 16 5.2.1 Scenario 1: Normalize document formats contained in the web archive 16 5.2.2 Scenario 2: Deep characterisation of huge media files 17 v 5.2.3 Scenario 3: Migrate digitised TIFFs to JPEG2000 17 5.2.4 Scenario 4: Migrate archive to new archiving system? 17 5.2.5 Scenario 5: RAW to NEXUS migration 18 6 Evaluation framework 18 6.1 Suitability for testbeds 19 6.2 Suitability for platform 19 6.3 Technical instalability 20 6.4 Legal constrains 20 6.5 Summary 20 7 Results 21 7.1 Identification of candidate tools 21 7.2 Evaluation and selection of tools 22 8 Conclusions 24 9 References 25 10 Appendix 28 10.1 List of identified action tools 28 vi 1 Introduction A preservation action is a concrete action, usually implemented by a software tool, that is performed on digital content in order to achieve some preservation goal.
    [Show full text]