Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Raster graphics
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
====Compression==== {{main | Image compression}} High-resolution raster grids contain a large number of pixels, and thus consume a large amount of memory. This has led to multiple approaches to compressing the data volume into smaller files. The most common strategy is to look for patterns or trends in the pixel values, then store a parameterized form of the pattern instead of the original data. Common raster compression algorithms include [[run-length encoding]] (RLE), [[JPEG]], [[LZ77 and LZ78|LZ]] (the basis for [[Portable Network Graphics|PNG]] and [[Zip (file format)|ZIP]]), [[Lempel–Ziv–Welch]] (LZW) (the basis for [[GIF]]), and others. For example, Run length encoding looks for repeated values in the array, and replaces them with the value and the number of times it appears. Thus, the raster above would be represented as: {{aligned table|cols=12|col1header=y|class=wikitable|leftright=on | values | 1| 3| 0| 1|12| 8| 0| 1| 4| 3 |... | lengths| 1| 1| 2| 1| 1| 1| 1| 1| 1| 2 |... }} This technique is very efficient when there are large areas of identical values, such as a line drawing, but in a photograph where pixels are usually slightly different from their neighbors, the RLE file would be up to twice the size of the original. Some compression algorithms, such as RLE and LZW, are ''lossless'', where the original pixel values can be perfectly regenerated from the compressed data. Other algorithms, such as JPEG, are ''lossy'', because the parameterized patterns are only an approximation of the original pixel values, so the latter can only be estimated from the compressed data.
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Raster graphics
(section)
Add topic