PNG (Portable Network Graphics) Specification Version

Total Page:16

File Type:pdf, Size:1020Kb

PNG (Portable Network Graphics) Specification Version PNG (Portable Network Graphics) Speci®cation Version 1.0 For list of authors, see Credits (Chapter 19). Status of this document This document has been reviewed by W3C members and other interested parties and has been endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material or cited as a normative reference from another document. W3C's role in making the Recommendation is to draw attention to the speci®cation and to promote its widespread deployment. This enhances the functionality and interoperability of the Web. A list of current W3C Recommendations and other technical documents can be found at http://www.w3.org/ pub/WWW/TR/. The Consortium staff have encouraged the development of PNG, as have Compuserve, Inc. Most of the work has been done by the PNG Development Group, [email protected]. The Consortium does not currently have plans to work on any future versions of PNG, though were the necessity to arise, and were an activity in that area to receive the support of Members, the Consortium could in principle support some future activity. Abstract This document describes PNG (Portable Network Graphics), an extensible ®le format for the lossless, portable, well-compressed storage of raster images. PNG provides a patent-free replacement for GIF and can also replace many common uses of TIFF. Indexed-color, grayscale, and truecolor images are supported, plus an optional alpha channel. Sample depths range from 1 to 16 bits. PNG is designed to work well in online viewing applications, such as the World Wide Web, so it is fully streamable with a progressive display option. PNG is robust, providing both full ®le integrity checking and simple detection of common transmission errors. Also, PNG can store gamma and chromaticity data for improved color matching on heterogeneous platforms. This speci®cation de®nes a proposed Internet Media Type image/png. 2 PNG (PORTABLE NETWORK GRAPHICS) SPECIFICATION Contents 1 Introduction 5 2 Data Representation 6 2.1 Integersandbyteorder.................................... 6 2.2 Colorvalues.......................................... 6 2.3 Image layout . ....................................... 7 2.4 Alphachannel......................................... 8 2.5 Filtering ............................................ 8 2.6 Interlaced data order ...................................... 9 2.7 Gammacorrection....................................... 10 2.8 Textstrings........................................... 10 3 File Structure 10 3.1 PNG®lesignature....................................... 10 3.2 Chunk layout . ....................................... 11 3.3 Chunk naming conventions .................................. 11 3.4 CRC algorithm . ....................................... 13 4 Chunk Speci®cations 14 4.1 Critical chunks . ....................................... 14 4.1.1 IHDR Imageheader.................................. 14 4.1.2 PLTE Palette..................................... 15 4.1.3 IDAT Imagedata................................... 16 4.1.4 IEND Imagetrailer.................................. 17 4.2 Ancillary chunks . ....................................... 17 4.2.1 bKGD Background color . ............................ 17 4.2.2 cHRM Primary chromaticities and white point . ................. 18 4.2.3 gAMA Imagegamma................................. 18 4.2.4 hIST Imagehistogram................................ 19 4.2.5 pHYs Physicalpixeldimensions........................... 19 4.2.6 sBIT Signi®cantbits................................. 20 4.2.7 tEXt Textualdata.................................. 20 4.2.8 tIME Imagelast-modi®cationtime......................... 22 4.2.9 tRNS Transparency.................................. 22 4.2.10 zTXt Compressedtextualdata............................ 23 4.3 Summary of standard chunks ................................. 24 4.4 Additional chunk types . .................................. 25 5 De¯ate/In¯ate Compression 25 PNG (PORTABLE NETWORK GRAPHICS) SPECIFICATION 3 6 Filter Algorithms 26 6.1 Filter types ........................................... 26 6.2 Filter type 0: None ....................................... 27 6.3 Filter type 1: Sub ....................................... 27 6.4 Filter type 2: Up . ....................................... 28 6.5 Filter type 3: Average . .................................. 29 6.6 Filter type 4: Paeth ...................................... 29 7 Chunk Ordering Rules 30 7.1 BehaviorofPNGeditors................................... 31 7.2 Ordering of ancillary chunks ................................. 31 7.3 Ordering of critical chunks .................................. 32 8 Miscellaneous Topics 32 8.1 Filenameextension...................................... 32 8.2 Internetmediatype...................................... 32 8.3 Macintosh ®le layout . .................................. 32 8.4 Multiple-image extension . .................................. 33 8.5 Security considerations . .................................. 33 9 Recommendations for Encoders 33 9.1 Sampledepthscaling..................................... 34 9.2 Encodergammahandling................................... 35 9.3 Encodercolorhandling.................................... 37 9.4 Alphachannelcreation.................................... 38 9.5 Suggested palettes ....................................... 38 9.6 Filter selection . ....................................... 39 9.7 Text chunk processing . .................................. 39 9.8 Use of private chunks . .................................. 40 9.9 Privatetypeandmethodcodes................................ 41 10 Recommendations for Decoders 41 10.1 Errorchecking......................................... 41 10.2 Pixeldimensions........................................ 42 10.3 Truecolorimagehandling................................... 42 10.4 Sampledepthrescaling.................................... 42 10.5 Decodergammahandling................................... 43 10.6 Decodercolorhandling.................................... 45 10.7 Background color ....................................... 46 10.8 Alphachannelprocessing................................... 46 10.9 Progressivedisplay...................................... 50 10.10 Suggested-palette and histogram usage ............................ 51 10.11 Text chunk processing . .................................. 52 4 PNG (PORTABLE NETWORK GRAPHICS) SPECIFICATION 11 Glossary 52 12 Appendix: Rationale 56 12.1 Whyanew®leformat?.................................... 56 12.2 Whythesefeatures?...................................... 56 12.3 Whynotthesefeatures?.................................... 57 12.4 WhynotuseformatX?.................................... 58 12.5 Byteorder........................................... 58 12.6 Interlacing........................................... 59 12.7 Whygamma?......................................... 59 12.8 Non-premultiplied alpha . .................................. 60 12.9 Filtering ............................................ 60 12.10Textstrings........................................... 61 12.11PNG®lesignature....................................... 61 12.12 Chunk layout . ....................................... 62 12.13 Chunk naming conventions .................................. 62 12.14Palettehistograms....................................... 63 13 Appendix: Gamma Tutorial 64 14 Appendix: Color Tutorial 70 15 Appendix: Sample CRC Code 74 16 Appendix: Online Resources 76 17 Appendix: Revision History 76 18 References 77 19 Credits 79 1. INTRODUCTION 5 1 Introduction The PNG format provides a portable, legally unencumbered, well-compressed, well-speci®ed standard for lossless bitmapped image ®les. Although the initial motivation for developing PNG was to replace GIF, the design provides some useful new features not available in GIF, with minimal cost to developers. GIF features retained in PNG include: Indexed-color images of up to 256 colors. Streamability: ®les can be read and written serially, thus allowing the ®le format to be used as a com- munications protocol for on-the-¯y generation and display of images. Progressive display: a suitably prepared image ®le can be displayed as it is received over a communi- cations link, yielding a low-resolution image very quickly followed by gradual improvement of detail. Transparency: portions of the image can be marked as transparent, creating the effect of a non- rectangular image. Ancillary information: textual comments and other data can be stored within the image ®le. Complete hardware and platform independence. Effective, 100% lossless compression. Important new features of PNG, not available in GIF, include: Truecolor images of up to 48 bits per pixel. Grayscale images of up to 16 bits per pixel. Full alpha channel (general transparency masks). Image gamma information, which supports automatic display of images with correct brightness/ contrast regardless of the machines used to originate and display the image. Reliable, straightforward detection of ®le corruption. Faster initial presentation in progressive display mode. PNG is designed to be: Simple and portable: developers should be able to implement PNG easily. Legally unencumbered: to the best knowledge of the PNG authors, no algorithms under legal challenge are used. (Some considerable effort has been spent to verify this.) Well compressed: both indexed-color and truecolor images are compressed as effectively as in any other widely used lossless format, and in most cases more effectively.
Recommended publications
  • Exploring the .BMP File Format
    Exploring the .BMP File Format Don Lancaster Synergetics, Box 809, Thatcher, AZ 85552 copyright c2003 as GuruGram #14 http://www.tinaja.com [email protected] (928) 428-4073 The .BMP image standard is used by Windows and elsewhere to represent graphics images in any of several different display and compression options. The .BMP advantages are that each pixel is usually independently available for any alteration or modification. And that repeated use does not normally degrade the image. Because lossy compression is not used. Its main disadvantage is that file sizes are usually horrendous compared to JPEG, fractal, GIF, or other lossy compression schemes. A comparison of popular image standards can be found here. I’ve long been using the .BMP format for my eBay and my other phototography, scanning, and post processing. I firmly believe that… All photography, scanning, and all image post-processing should always be done using .BMP or a similar non-lossy format. Only after all post-processing is complete should JPEG or another compressed distribution format be chosen. Some current examples of my .BMP work now do include the IMAGIMAG.PDF post-processing tutorial, the Bitmap Typewriterthat generates fully anti-aliased small fonts, the Aerial Photo Combiner, and similar utilities and tutorials found on our Fonts & Images, PostScript, and on our Acrobat library pages. A few projects of current interest involving .BMP files include true view camera swings and tilts for a digital camera, distortion correction, dodging & burning, preventing white punchthrough on knockouts, and emphasis vignetting. Mainly applied to uncompressed RGBX 24-bit color .BMP files.
    [Show full text]
  • Color Management
    Color Management hotoshop 5.0 was justifiably praised as a ground- breaking upgrade when it was released in the summer of 1998, although the changes made to the color P management setup were less well received in some quarters. This was because the revised system was perceived to be complex and unnecessary. Bruce Fraser once said of the Photoshop 5.0 color management system ‘it’s push-button simple, as long as you know which of the 60 or so buttons to push!’ Attitudes have changed since then (as has the interface) and it is fair to say that most people working today in the pre-press industry are now using ICC color profile managed workflows. The aim of this chapter is to introduce the basic concepts of color management before looking at the color management interface in Photoshop and the various color management settings. 1 Color management Adobe Photoshop CS6 for Photographers: www.photoshopforphotographers.com The need for color management An advertising agency art buyer was once invited to address a meeting of photographers. The chair, Mike Laye, suggested we could ask him anything we wanted, except ‘Would you like to see my book?’ And if he had already seen your book, we couldn’t ask him why he hadn’t called it back in again. And if he had called it in again we were not allowed to ask why we didn’t get the job. And finally, if we did get the job we were absolutely forbidden to ask why the color in the printed ad looked nothing like the original photograph! That in a nutshell is a problem which has bugged many of us throughout our working lives, and it is one which will be familiar to anyone who has ever experienced the difficulty of matching colors on a computer display with the original or a printed output.
    [Show full text]
  • Color Models
    Color Models Jian Huang CS456 Main Color Spaces • CIE XYZ, xyY • RGB, CMYK • HSV (Munsell, HSL, IHS) • Lab, UVW, YUV, YCrCb, Luv, Differences in Color Spaces • What is the use? For display, editing, computation, compression, …? • Several key (very often conflicting) features may be sought after: – Additive (RGB) or subtractive (CMYK) – Separation of luminance and chromaticity – Equal distance between colors are equally perceivable CIE Standard • CIE: International Commission on Illumination (Comission Internationale de l’Eclairage). • Human perception based standard (1931), established with color matching experiment • Standard observer: a composite of a group of 15 to 20 people CIE Experiment CIE Experiment Result • Three pure light source: R = 700 nm, G = 546 nm, B = 436 nm. CIE Color Space • 3 hypothetical light sources, X, Y, and Z, which yield positive matching curves • Y: roughly corresponds to luminous efficiency characteristic of human eye CIE Color Space CIE xyY Space • Irregular 3D volume shape is difficult to understand • Chromaticity diagram (the same color of the varying intensity, Y, should all end up at the same point) Color Gamut • The range of color representation of a display device RGB (monitors) • The de facto standard The RGB Cube • RGB color space is perceptually non-linear • RGB space is a subset of the colors human can perceive • Con: what is ‘bloody red’ in RGB? CMY(K): printing • Cyan, Magenta, Yellow (Black) – CMY(K) • A subtractive color model dye color absorbs reflects cyan red blue and green magenta green blue and red yellow blue red and green black all none RGB and CMY • Converting between RGB and CMY RGB and CMY HSV • This color model is based on polar coordinates, not Cartesian coordinates.
    [Show full text]
  • Free Lossless Image Format
    FREE LOSSLESS IMAGE FORMAT Jon Sneyers and Pieter Wuille [email protected] [email protected] Cloudinary Blockstream ICIP 2016, September 26th DON’T WE HAVE ENOUGH IMAGE FORMATS ALREADY? • JPEG, PNG, GIF, WebP, JPEG 2000, JPEG XR, JPEG-LS, JBIG(2), APNG, MNG, BPG, TIFF, BMP, TGA, PCX, PBM/PGM/PPM, PAM, … • Obligatory XKCD comic: YES, BUT… • There are many kinds of images: photographs, medical images, diagrams, plots, maps, line art, paintings, comics, logos, game graphics, textures, rendered scenes, scanned documents, screenshots, … EVERYTHING SUCKS AT SOMETHING • None of the existing formats works well on all kinds of images. • JPEG / JP2 / JXR is great for photographs, but… • PNG / GIF is great for line art, but… • WebP: basically two totally different formats • Lossy WebP: somewhat better than (moz)JPEG • Lossless WebP: somewhat better than PNG • They are both .webp, but you still have to pick the format GOAL: ONE FORMAT THAT COMPRESSES ALL IMAGES WELL EXPERIMENTAL RESULTS Corpus Lossless formats JPEG* (bit depth) FLIF FLIF* WebP BPG PNG PNG* JP2* JXR JLS 100% 90% interlaced PNGs, we used OptiPNG [21]. For BPG we used [4] 8 1.002 1.000 1.234 1.318 1.480 2.108 1.253 1.676 1.242 1.054 0.302 the options -m 9 -e jctvc; for WebP we used -m 6 -q [4] 16 1.017 1.000 / / 1.414 1.502 1.012 2.011 1.111 / / 100. For the other formats we used default lossless options. [5] 8 1.032 1.000 1.099 1.163 1.429 1.664 1.097 1.248 1.500 1.017 0.302� [6] 8 1.003 1.000 1.040 1.081 1.282 1.441 1.074 1.168 1.225 0.980 0.263 Figure 4 shows the results; see [22] for more details.
    [Show full text]
  • Thank You for Listening to My Presentation Gif
    Thank You For Listening To My Presentation Gif Derisible and alveolar Harris parades: which Marko is Noachian enough? Benny often interknit all-over when uxorilocal slangily.Jeremy disanoints frowningly and debugs her inventions. Defeated Sherwood usually scraping some outsides or undermine She needed to my presentation gifs to acknowledge the presenters try to share the voice actor: thanks in from anywhere online presentations. Lottie support integration with you for thanks for husband through the present, a person that lay behind him that feeling of. When my presentation gifs and presenting me and graphics let me or listen in the presenters and wife. It for my peers or are telling me wide and gif plays, presenters who took it have a random relevant titles to do not affiliated with. He had for you gif by: empty pen by taking the. The presentation for listening animated gifs for watching the body is an award ceremony speech reader is serious first arabesque, he climbed to. Make your organization fulfill its vastness, then find the bed to? Music streaming video or message a sample thank your take pride in via text and widescreen view my friends and many lovely pictures to think he killed them! Also you for presentation with quotes for the speech month club is back out of people meet again till it! From you listen to thank you a presentation and presenting? But i would not, bowing people of those values. Most memorable new life happened he used in twenty strokes for some unseen animal gifs that kind. So my presentation gifs image gifs with short but an! Life go on a meme or buy sound library to gif thank you for listening to my presentation visual design type some sort a pet proposal of.
    [Show full text]
  • Package 'Magick'
    Package ‘magick’ August 18, 2021 Type Package Title Advanced Graphics and Image-Processing in R Version 2.7.3 Description Bindings to 'ImageMagick': the most comprehensive open-source image processing library available. Supports many common formats (png, jpeg, tiff, pdf, etc) and manipulations (rotate, scale, crop, trim, flip, blur, etc). All operations are vectorized via the Magick++ STL meaning they operate either on a single frame or a series of frames for working with layers, collages, or animation. In RStudio images are automatically previewed when printed to the console, resulting in an interactive editing environment. The latest version of the package includes a native graphics device for creating in-memory graphics or drawing onto images using pixel coordinates. License MIT + file LICENSE URL https://docs.ropensci.org/magick/ (website) https://github.com/ropensci/magick (devel) BugReports https://github.com/ropensci/magick/issues SystemRequirements ImageMagick++: ImageMagick-c++-devel (rpm) or libmagick++-dev (deb) VignetteBuilder knitr Imports Rcpp (>= 0.12.12), magrittr, curl LinkingTo Rcpp Suggests av (>= 0.3), spelling, jsonlite, methods, knitr, rmarkdown, rsvg, webp, pdftools, ggplot2, gapminder, IRdisplay, tesseract (>= 2.0), gifski Encoding UTF-8 RoxygenNote 7.1.1 Language en-US NeedsCompilation yes Author Jeroen Ooms [aut, cre] (<https://orcid.org/0000-0002-4035-0289>) Maintainer Jeroen Ooms <[email protected]> 1 2 analysis Repository CRAN Date/Publication 2021-08-18 10:10:02 UTC R topics documented: analysis . .2 animation . .3 as_EBImage . .6 attributes . .7 autoviewer . .7 coder_info . .8 color . .9 composite . 12 defines . 14 device . 15 edges . 17 editing . 18 effects . 22 fx .............................................. 23 geometry . 24 image_ggplot .
    [Show full text]
  • Poisson Image Editing
    Poisson Image Editing Patrick Perez´ ∗ Michel Gangnet† Andrew Blake‡ Microsoft Research UK Abstract able effect. Conversely, the second-order variations extracted by the Laplacian operator are the most significant perceptually. Using generic interpolation machinery based on solving Poisson Secondly, a scalar function on a bounded domain is uniquely de- equations, a variety of novel tools are introduced for seamless edit- fined by its values on the boundary and its Laplacian in the interior. ing of image regions. The first set of tools permits the seamless The Poisson equation therefore has a unique solution and this leads importation of both opaque and transparent source image regions to a sound algorithm. into a destination region. The second set is based on similar math- So, given methods for crafting the Laplacian of an unknown ematical ideas and allows the user to modify the appearance of the function over some domain, and its boundary conditions, the Pois- image seamlessly, within a selected region. These changes can be son equation can be solved numerically to achieve seamless filling arranged to affect the texture, the illumination, and the color of ob- of that domain. This can be replicated independently in each of jects lying in the region, or to make tileable a rectangular selection. the channels of a color image. Solving the Poisson equation also CR Categories: I.3.3 [Computer Graphics]: Picture/Image has an alternative interpretation as a minimization problem: it com- Generation—Display algorithms; I.3.6 [Computer Graphics]: putes the function whose gradient is the closest, in the L2-norm, to Methodology and Techniques—Interaction techniques; I.4.3 [Im- some prescribed vector field — the guidance vector field — under age Processing and Computer Vision]: Enhancement—Filtering; given boundary conditions.
    [Show full text]
  • Digital Backgrounds Using GIMP
    Digital Backgrounds using GIMP GIMP is a free image editing program that rivals the functions of the basic versions of industry leaders such as Adobe Photoshop and Corel Paint Shop Pro. For information on which image editing program is best for your needs, please refer to our website, digital-photo- backgrounds.com in the FAQ section. This tutorial was created to teach you, step-by-step, how to remove a subject (person or item) from its original background and place it onto a Foto*Fun Digital Background. Upon completing this tutorial, you will have the skills to create realistic portraits plus photographic collages and other useful functions. If you have any difficulties with any particular step in the process, feel free to contact us anytime at digital-photo-backgrounds.com. How to read this tutorial It is recommended that you use your own image when following the instructions. However, one has been provided for you in the folder entitled "Tutorial Images". This tutorial uses screenshots to visually show you each step of the process. Each step will be numbered which refers to a number within the screenshot image to indicate the location of the function or tool being described in that particular step. Written instructions are first and refer to the following screenshot image. Keyboard shortcuts are shown after most of the described functions and are in parentheses as in the following example (ctrl+T); which would indicate that the "ctrl" key and the letter "T" key should be pressed at the same time. These are keyboard shortcuts and can be used in place of the described procedure; not in addition to the described procedure.
    [Show full text]
  • Indexed Color
    Indexed Color A browser may support only a certain number of specific colors, creating a palette from which to choose Figure 3.11 The Netscape color palette 1 QUIZ How many bits are needed to represent this palette? Show your work. 2 How to digitize a picture • Sample it → Represent it as a collection of individual dots called pixels • Quantize it → Represent each pixel as one of 224 possible colors (TrueColor) Resolution = The # of pixels used to represent a picture 3 Digitized Images and Graphics Whole picture Figure 3.12 A digitized picture composed of many individual pixels 4 Digitized Images and Graphics Magnified portion of the picture See the pixels? Hands-on: paste the high-res image from the previous slide in Paint, then choose ZOOM = 800 Figure 3.12 A digitized picture composed of many individual pixels 5 QUIZ: Images A low-res image has 200 rows and 300 columns of pixels. • What is the resolution? • If the pixels are represented in True-Color, what is the size of the file? • Same question in High-Color 6 Two types of image formats • Raster Graphics = Storage on a pixel-by-pixel basis • Vector Graphics = Storage in vector (i.e. mathematical) form 7 Raster Graphics GIF format • Each image is made up of only 256 colors (indexed color – similar to palette!) • But they can be a different 256 for each image! • Supports animation! Example • Optimal for line art PNG format (“ping” = Portable Network Graphics) Like GIF but achieves greater compression with wider range of color depth No animations 8 Bitmap format Contains the pixel color
    [Show full text]
  • '" )Timizing Images ) ~I
    k ' Anyone wlio linn IIVIII IIMd tliu Wub hns li kely 11H I11tl liy ulow lontlin g Wob sites. It's ', been fn1 11 the ft 1111 cl nlli{lll n1 mlllllll wh111 o th o fil o si of t/11 1 f /11tpli1 LII lt ill llliltl lltt 111t n huw fnst Sllll/ 111 111 11 I 1111 VIIIW 11 111 111 , Mllki l1(1 111't1 11 11 7 W11 1! 1/lllpliiL" 111 llll lllillnti lltlllllltll>ll. 1 l iitllllllllnl 111111 '" )timizing Images y, / l1111 11 11 11111' Lil'J C:ii') I1111 Vi llll ihllillnn l 111 1111 / 11 / ~il/ 11/ y 11111111 In l1 nlp Yll ll IIIIIMIIII IIII I/ 1 11111 I Optimizing JPEGs I 1 I Selective JPEG Optimization with Alpha Channels I l 11 tp111 11 1111 II 1111 111 I 1111 !11 11 1 IIIII nlllll I Optimizing GIFs I Choosing the Right Color Reduction Palette I lljllillll/11 111111 Ill II lillllljliiiX 111 111/r ll I lilnl illllli l 'lilltlllllllip (;~,:; 111 111 I Reducing Colors I Locking Colors I Selective G/F Optimization I illtnrlln lll ll" lllt l" "'ll" i ~IIIH i y C}l •; I Previewing Images in a Web Browser I llnt11tl. II 111 111/ M ullt.li 11 n tlttlmt, 1111111' I Optimizing G/Fs and JPEGs in lmageReady CS2 I IlVII filllll/11111, /111 t/11/l lh, }/ '/ CJ, lind ) If unlnmdtltl In yn tl, /hoy won't chap_ OJ 11111 bo lo1 ""'II· II yo 11'1 11 n pw nt oplimi1 PCS2Web HOT CD-ROM I ing Wol1 IJIIipluc;u, you'll bo impronml d by th o llllpOI'b optimiw ti on cupnbilitlos in ,,, Photoshop CS7 und lmng oRondy CS?.
    [Show full text]
  • The Effects of Learning Rate Schedules on Color Quantization
    THE EFFECTS OF LEARNING RATE SCHEDULES ON COLOR QUANTIZATION by Garrett Brown A thesis presented to the Department of Computer Science and the Graduate School of the University of Central Arkansas in partial fulfillment of the requirements for the degree of Master of Science in Computer Science Conway, Arkansas May 2020 ProQuest Number:27834147 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent on the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. ProQuest 27834147 Published by ProQuest LLC (2020). Copyright of the Dissertation is held by the Author. All Rights Reserved. This work is protected against unauthorized copying under Title 17, United States Code Microform Edition © ProQuest LLC. ProQuest LLC 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, MI 48106 - 1346 TO THE OFFICE OF GRADUATE STUDIES: The members of the Committee approve the thesis of Garrett Brown presented on March 31, 2020. M. Emre Celebi, Ph.D., Committee Chairperson Ahmad Patooghy, Ph.D. Mahmut Karakaya, Ph.D. PERMISSION Title The Effects of Learning Rate Schedules on Color Quantization Department Computer Science Degree Master of Science In presenting this thesis/dissertation in partial fulfillment of the requirements for a graduate degree from the University of Central Arkansas, I agree that the Library of this University shall make it freely available for inspections. I further agree that permission for extensive copying for scholarly purposes may be granted by the professor who supervised my thesis/dissertation work, or, in the professor’s absence, by the Chair of the Department or the Dean of the Graduate School.
    [Show full text]
  • Lossy Image Compression Based on Prediction Error and Vector Quantisation Mohamed Uvaze Ahamed Ayoobkhan* , Eswaran Chikkannan and Kannan Ramakrishnan
    Ayoobkhan et al. EURASIP Journal on Image and Video Processing (2017) 2017:35 EURASIP Journal on Image DOI 10.1186/s13640-017-0184-3 and Video Processing RESEARCH Open Access Lossy image compression based on prediction error and vector quantisation Mohamed Uvaze Ahamed Ayoobkhan* , Eswaran Chikkannan and Kannan Ramakrishnan Abstract Lossy image compression has been gaining importance in recent years due to the enormous increase in the volume of image data employed for Internet and other applications. In a lossy compression, it is essential to ensure that the compression process does not affect the quality of the image adversely. The performance of a lossy compression algorithm is evaluated based on two conflicting parameters, namely, compression ratio and image quality which is usually measured by PSNR values. In this paper, a new lossy compression method denoted as PE-VQ method is proposed which employs prediction error and vector quantization (VQ) concepts. An optimum codebook is generated by using a combination of two algorithms, namely, artificial bee colony and genetic algorithms. The performance of the proposed PE-VQ method is evaluated in terms of compression ratio (CR) and PSNR values using three different types of databases, namely, CLEF med 2009, Corel 1 k and standard images (Lena, Barbara etc.). Experiments are conducted for different codebook sizes and for different CR values. The results show that for a given CR, the proposed PE-VQ technique yields higher PSNR value compared to the existing algorithms. It is also shown that higher PSNR values can be obtained by applying VQ on prediction errors rather than on the original image pixels.
    [Show full text]