Graphics Interchange Format

A rotating globe in GIF format. Posterization is noticeable in the blue gradient areas due to the restricted palette.
Filename extension	.gif
Internet media type	image/gif
Type code	GIF GIFf
Uniform Type Identifier	com.compuserve.gif
Magic number	GIF87a/GIF89a
Developed by	CompuServe
Type of format	Raster graphics image format

The Graphics Interchange Format (GIF; /ˈdʒɪf/ or /ˈɡɪf/) is a bitmap image format that was introduced by CompuServe in 1987 and has since come into widespread usage on the World Wide Web due to its wide support and portability. The format supports up to 8 bits per pixel thus allowing a single image to reference a palette of up to 256 distinct colors. The colors are chosen from the 24-bit RGB color space. It also supports animations and allows a separate palette of 256 colors for each frame. The color limitation makes the GIF format unsuitable for reproducing color photographs and other images with continuous color, but it is well-suited for simpler images such as graphics or logos with solid areas of color.

GIF images are compressed using the Lempel-Ziv-Welch (LZW) lossless data compression technique to reduce the file size without degrading the visual quality. This compression technique was patented in 1985. Controversy over the licensing agreement between the patent holder, Unisys, and CompuServe in 1994 spurred the development of the Portable Network Graphics (PNG) standard; since then all the relevant patents have expired.

History[link]

CompuServe introduced the GIF format in 1987 to provide a color image format for their file downloading areas, replacing their earlier run-length encoding (RLE) format, which was black and white only. GIF became popular because it used LZW data compression, which was more efficient than the run-length encoding that formats such as PCX and MacPaint used, and fairly large images could therefore be downloaded in a reasonably short time, even with very slow modems.

The original version of the GIF format was called 87a. In 1989, CompuServe devised an enhanced version, called 89a,^[1] which added support for animation delays (multiple images in a stream were already supported in 87a), transparent background colors, and storage of application-specific metadata. The 89a specification also supports incorporating text labels as text (not embedding them in the graphical data), but as there is little control over display fonts, this feature is not widely used. The two versions can be distinguished by looking at the first six bytes of the file (the "magic number" or "signature"), which, when interpreted as ASCII, read "GIF87a" and "GIF89a", respectively.

GIF was one of the first two image formats commonly used on Web sites, the other being the black and white XBM.^{[citation needed]}

The feature of storing multiple images in one file, accompanied by control data, is used extensively on the Web to produce simple animations. The optional interlacing feature, which stores image scan lines out of order in such a fashion that even a partially downloaded image was somewhat recognizable, also helped GIF's popularity,^{[citation needed]} as a user could abort the download if it was not what was required.

Pronunciation[link]

The creators of the format pronounced GIF with a soft "G" /ˈdʒɪf/ as in "gin". An alternative pronunciation uses a hard "G" /ˈɡɪf/ as in "graphics", reflecting the expanded acronym. Both pronunciations are given as correct by the Oxford English Dictionary^[2] and the American Heritage Dictionary.^[3]

According to Steve Wilhite, the creator of the GIF format, the original pronunciation deliberately echoes the American peanut butter brand, Jif, and the employees of CompuServe would often say "Choosy developers choose GIF", spoofing this brand's television commercials.^[4] This pronunciation was also identified by CompuServe in their documentation of a graphics display program called CompuShow.^[4]

Usage[link]

An example of a short GIF animation made with a digital camera. The file is over 2MB in size.

• GIFs are suitable for sharp-edged line art (such as logos) with a limited number of colors. This takes advantage of the format's lossless compression, which favors flat areas of uniform color with well defined edges.
• GIFs can be used to store low-color sprite data for games.
• GIFs can be used for small animations and low-resolution film clips.
• In view of the general limitation on the GIF image palette to 256 colors, it is not usually used as a format for digital photography. Digital photographers use image file formats capable of reproducing a greater range of colors, such as TIFF, RAW or JPEG.
  

File format[link]

File:Empty.gif in a hex editor

Conceptually, a GIF file describes a fixed-sized graphical area (the "logical screen") populated with zero or more "images". Many GIF files have a single image that fills the entire logical screen. Others divide the logical screen into separate sub-images. The images may also function as animation frames in an animated GIF file, but again these need not fill the entire logical screen.

GIF files start with a fixed-length header ("GIF87a" or "GIF89a") giving the version, followed by a fixed-length Logical Screen Descriptor giving the size and other characteristics of the logical screen. The screen descriptor may also specify the presence and size of a Global Color Table, which follows next if present.

Thereafter, the file is divided into segments, each introduced by a 1-byte sentinel:

• An image (introduced by 0x2C, a comma ',')
• An extension block (introduced by 0x21, an exclamation point '!')
• The trailer (a single byte of value 0x3B, a semi-colon ';'), which should be the last byte of the file.

An image starts with a fixed-length Image Descriptor, which may specify the presence and size of a Local Color Table (which follows next if present). The image data follow: one byte giving the bit width of the unencoded symbols (which must be at least 2 bits wide, even for bi-color images), followed by a linked list of sub-blocks containing the LZW-encoded data.

Extension blocks (blocks that "extend" the 87a definition via a mechanism already defined in the 87a spec) consist of the sentinel, an additional byte specifying the type of extension, and a linked list of sub-blocks with the extension data. Extension blocks that modify an image (like the Graphic Control Extension that specifies the optional animation delay time and optional transparent background color) must immediately precede the segment with the image they refer to.

The linked lists used by the image data and the extension blocks consist of series of sub-blocks, each sub-block beginning with a byte giving the number of subsequent data bytes in the sub-block (1 to 255). The series of sub-blocks is terminated by an empty sub-block (a 0 byte).

This structure allows the file to be parsed even if not all parts are understood. A GIF marked 87a may contain extension blocks; the intent is that a decoder can read and display the file without the features covered in extensions it does not understand.

The full detail of the file format is covered in the GIF specification.^[1]

Palettes[link]

An example of a GIF image saved with a 'web-safe' palette and dithered using the Floyd–Steinberg method. Note that due to the reduced number of colors in the image, there are obvious display issues.

GIF is palette-based: the colors used in an image (a frame) in the file have their RGB values defined in a palette table that can hold up to 256 entries, and the data for the image refer to the colors by their indexes (0–255) in the palette table. The color definitions in the palette can be drawn from a color space of millions of shades (2²⁴ shades, 8 bits for each primary), but the maximum number of colors a frame can use is 256. This limitation seemed reasonable when GIF was developed because few people could afford the hardware to display more colors simultaneously. Simple graphics, line drawings, cartoons, and grey-scale photographs typically need fewer than 256 colors.

As a further refinement, each frame can designate one index as a "transparent background color": any pixel assigned this index takes on the color of the pixel in the same position from the background, which may have been determined by a previous frame of animation.

Many techniques, collectively called dithering, have been developed to approximate a wider range of colors with a small color palette by using pixels of two or more colors to approximate in-between colors. These techniques sacrifice spatial resolution to approximate deeper color resolution. While not part of the GIF specification, dithering can of course be used in images subsequently encoded as GIF images. This is often not an ideal solution for GIF images, both because the loss of spatial resolution typically makes an image look fuzzy on the screen, and because the dithering patterns often interfere with the compressibility of the image data, working against GIF's main purpose.

In the early days of graphical web browsers, graphics cards with 8-bit buffers (allowing only 256 colors) were common and it was fairly common to make GIF images using the websafe palette.^{[citation needed]} This ensured predictable display, but severely limited the choice of colors. Now that 32-bit graphics cards, which support 24-bit color, are the norm, palettes can be populated with the optimum colors for individual images.

A small color table may suffice for small images, and keeping the color table small allows the file to be downloaded faster. Both the 87a and 89a specifications allow color tables of 2ⁿ colors for any n from 1 through 8. Most graphics applications will read and display GIF images with any of these table sizes; but some do not support all sizes when creating images. Tables of 2, 16, and 256 colors are widely supported.

True color[link]

Although GIF is not often used for truecolor images (as it was not designed for that purpose), there are at least two methods that can generate 24-bit RGB truecolor images when decoded correctly.

GIF is designed, even in the earlier GIF87a specification, on the principle of rendering multiple images onto a fixed-sized logical screen. Each image can have its own 256-color palette, so that the logical screen can be tiled with multiple smaller images, which together can use any selection of colors from the 24-bit RGB color space.^{[5] [6]}

Another technique uses the transparency feature introduced in GIF89a: a GIF file can be constructed as a series of overlapping full-screen images, each image filling in colors from a local color table that weren't in the previous ones. In this case transparent pixels are used to preserve colors from previous stages.^[7]

Example GIF file[link]

Sample image (enlarged), actual size 3 pixels wide by 5 high

Bytes D_h to 30C_h in the example define a palette of 256 colors.

Microsoft's Paint program saves a small black and white image as the following GIF file. Paint does not make optimal use of the GIF format; due to the unnecessarily large color table (storing a full 256 colors instead of the used 2) and symbol width, this GIF file is not an efficient representation of the 15-pixel image (illustrated enlarged above).

Although the Graphics Control Extension block declares color index 16 (hexadecimal 10) to be transparent, that index is not used in the image. The only color indexes appearing in the image data are decimal 40 and 255, which the Global Color Table maps to black and white, respectively.

Note that the hex numbers in the following tables are in little-endian byte order, as the format specification prescribes.

byte#  hexadecimal  text or
(hex)               value       Meaning
0:     47 49 46
       38 39 61     GIF89a      Header
                                Logical Screen Descriptor
6:     03 00        3            - logical screen width in pixels
8:     05 00        5            - logical screen height in pixels
A:     F7                        - GCT follows for 256 colors with resolution 3 x 8 bits/primary
B:     00           0            - background color #0
C:     00                        - default pixel aspect ratio
                   R    G    B  Global Color Table
D:     00 00 00    0    0    0   - color #0 black
10:    80 00 00  128    0    0   - color #1
 :                                       :
85:    00 00 00    0    0    0   - color #40 black
 :                                       :
30A:   FF FF FF  255  255  255   - color #255 white
30D:   21 F9                    Graphic Control Extension
30F:   04           4            - 4 bytes of GCE data follow
310:   01                        - there is a transparent background color
311:   00 00                     - delay for animation: not used
313:   10          16            - color #16 is transparent
314:   00                        - end of GCE block
315:   2C                       Image Descriptor
316:   00 00 00 00 (0,0)         - NW corner position of image in logical screen
31A:   03 00 05 00 (3,5)         - image width and height in pixels
31E:   00                        - no local color table
31F:   08           8           Start of image - LZW minimum code size
320:   0B          11            - 11 bytes of LZW encoded image data follow
321:   00 51 FC 1B 28 70 A0 C1 83 01 01
32C:   00                        - end of image data
32D:   3B                       GIF file terminator

Image coding[link]

The image pixel colors, scanned horizontally from top left, are converted by LZW encoding to codes that are then mapped into bytes for storing in the file. For the sample image above the reversible mapping between 9-bit codes and bytes is shown below.

9-bit   binary   Bytes
(hex)            (hex)
        00000000  00
100
       0101000|1  51
028
       111111|00  FC
0FF
       00011|011  1B
103
       0010|1000  28
102
       011|10000  70
103
       10|100000  A0
106
       1|1000001  C1
107
        10000011  83
        00000001  01
101
       0000000|1  01

A slight compression is evident: pixel colors defined initially by 15 bytes are exactly represented by 12 code bytes including control codes. The encoding process that produces the 9-bit codes is shown below. A local string accumulates pixel color numbers from the palette, with no output action as long as the local string can be found in a code table. There is special treatment of the first two pixels that arrive before the table grows from its initial size by additions of strings. After each output code, the local string is initialized to the latest pixel color (that could not be included in the output code).

                          Table           9-bit
                     string --> code      code    Action
                          #0 | 000h               Initialize root table of 9-bit codes
                    palette  |  :
                     colors  |  :
                        #255 | 0FFh
                         clr | 100h
                         end | 101h
                             |            100h     Clear
Pixel          Local         |
color Palette  string        |
BLACK  #40     28            |            028h     1st pixel always to output
WHITE  #255    FF            |                     String found in table
                  28 FF      | 102h                Always add 1st string to table
               FF            |                     Initialize local string
WHITE  #255    FF FF         |                     String not found in table
                             |            0FFh     - output code for previous string
                  FF FF      | 103h                - add latest string to table
               FF            |                     - initialize local string
WHITE  #255    FF FF         |                     String found in table
BLACK  #40     FF FF 28      |                     String not found in table
                             |            103h     - output code for previous string
                  FF FF 28   | 104h                - add latest string to table
               28            |                     - initialize local string
WHITE  #255    28 FF         |                     String found in table
WHITE  #255    28 FF FF      |                     String not found in table
                             |            102h     - output code for previous string
                  28 FF FF   | 105h                - add latest string to table
               FF            |                     - initialize local string
WHITE  #255    FF FF         |                     String found in table
WHITE  #255    FF FF FF      |                     String not found in table
                             |            103h     - output code for previous string
                  FF FF FF   | 106h                - add latest string to table
               FF            |                     - initialize local string
WHITE  #255    FF FF         |                     String found in table
WHITE  #255    FF FF FF      |                     String found in table
WHITE  #255    FF FF FF FF   |                     String not found in table
                             |            106h     - output code for previous string
                  FF FF FF FF| 107h                - add latest string to table
               FF            |                     - initialize local string
WHITE  #255    FF FF         |                     String found in table
WHITE  #255    FF FF FF      |                     String found in table
WHITE  #255    FF FF FF FF   |                     String found in table
                                                   No more pixels
                                          107h     - output code for last string
                                          101h     End

For clarity the table is shown above as being built of strings of increasing length. That scheme can function but the table consumes an unpredictable amount of memory. Memory can be saved in practice by noting that each new string to be stored consists of a previously stored string augmented by one character. It is economical to store at each address only two words: an existing address and one character.

The LZW algorithm requires a search of the table for each pixel. A linear search through up to 4096 addresses would make the coding slow. In practice the codes can be stored in order of numerical value; this allows each search to be done by a SAR (Successive Approximation Register, as used in some ADCs), with only 12 magnitude comparisons. For this efficiency an extra table is needed to convert between codes and actual memory addresses; the extra table upkeeping is needed only when a new code is stored which happens at much less than pixel rate.

Image decoding[link]

Decoding begins by mapping the stored bytes back to 9-bit codes. These are decoded to recover the pixel colors as shown below. A table identical to the one used in the encoder is built by adding strings by this rule:

Is incoming code found in table?
 YES: add string for local code followed by first byte of string for incoming code
 NO:  add string for local code followed by copy of its own first byte

      shift
9-bit ----> Local      Table                 Pixel
code        code   code --> string   Palette color  Action
100h               000h  | #0                       Initialize root table of 9-bit codes
                    :    | palette
                    :    | colors
                   0FFh  | #255
                   100h  | clr
                   101h  | end
028h                     |             #40    BLACK Decode 1st pixel
0FFh        028h         |                           Incoming code found in table
                         |             #255   WHITE  - output string from table
                   102h  | 28 FF                     - add to table
103h        0FFh         |                           Incoming code not found in table
                   103h  | FF FF                     - add to table
                         |                           - output string from table
                         |             #255   WHITE
                         |             #255   WHITE
102h        103h         |                           Incoming code found in table
                         |                           - output string from table
                         |             #40    BLACK
                         |             #255   WHITE
                   104h  | FF FF 28                  - add to table
103h        102h         |                           Incoming code found in table
                         |                           - output string from table
                         |             #255   WHITE
                         |             #255   WHITE
                   105h  | 28 FF FF                  - add to table
106h        103h         |                           Incoming code not found in table
                   106h  | FF FF FF                  - add to table
                         |                           - output string from table
                         |             #255   WHITE
                         |             #255   WHITE
                         |             #255   WHITE
107h        106h         |                           Incoming code not found in table
                   107h  | FF FF FF FF               - add to table
                         |                           - output string from table
                         |             #255   WHITE
                         |             #255   WHITE
                         |             #255   WHITE
                         |             #255   WHITE
101h                     |                           End

LZW code lengths[link]

Shorter code lengths can be used for palettes smaller than the 256 colors in the example. If the palette is only 64 colors (so color indexes are 6 bits wide), the symbols can range from 0 to 63, and the symbol width can be taken to be 6 bits, with codes starting at 7 bits. In fact, the symbol width need not match the palette size: as long as the values decoded are always less than the number of colors in the palette, the symbols can be any width from 2 to 8, and the palette size any power of 2 from 2 to 256. For example, if only the first four colors (values 0 to 3) of the palette are used, the symbols can taken to be 2 bits wide with codes starting at 3 bits.

Conversely, the symbol width could be set at 8, even if only values 0 and 1 are used; these data would only require a 2-color table. Although there would be no point in encoding the file that way, something similar typically happens for bi-color images: the minimum symbol width is 2, even if only values 0 and 1 are used.

The code table initially contains codes that are one bit longer than the symbol size in order to accommodate the two special codes clr and end and codes for strings that are added during the process. When the table is full the code length increases to give space for more strings, up to a maximum code 4095 = FFF(hex). As the decoder builds its table it tracks these increases in code length and it is able to unpack incoming bytes accordingly.

Uncompressed GIF[link]

The GIF encoding process can be modified to create a file that is without LZW compression but still viewable as a GIF image. This was previously done as a way to avoid patent infringement. Uncompressed GIF can also be a useful intermediate format for a graphics programmer because individual pixels are accessible for reading or painting. It is only necessary to pass the uncompressed GIF through an image editor to reduce it to an ordinary GIF.

The modified encoding method is to ignore building the LZW table and emit only the root palette codes and the codes for CLEAR and STOP. This technique leads to simpler encoding (a 1-to-1 correspondence between code values and palette codes) but sacrifices all of the compression. The standard GIF decoder processing an uncompressed GIF will not be prevented from writing strings to its table but the code width must never increase since that triggers a different packing of bits to bytes.

If the symbol width is n, the codes of width n+1 fall naturally into two blocks: the lower block of 2ⁿ codes for coding single symbols, and the upper block of 2ⁿ codes that will be used by the decoder for sequences of length greater than one. Of that upper block, the first two codes are already taken: 2ⁿ for CLEAR and 2ⁿ + 1 for STOP. We must also prevent the decoder from using the last code in the upper block, 2ⁿ⁺¹ − 1, because when the decoder fills that slot, it will increase the code width. Thus in the upper block there are 2ⁿ − 3 codes available to the decoder that won't trigger an increase in code width. Because the decoder is always one step behind in maintaining the table, it does not generate a table entry upon receiving the first code from the encoder, but will generate one for each succeeding code. Thus the encoder can generate 2ⁿ − 2 codes without triggering an increase in code width. Therefore the encoder must emit extra CLEAR codes at intervals of 2ⁿ − 2 codes or less to make the decoder restart. The GIF standard allows such extra CLEAR codes at to be inserted in the image data at any time. The composite data stream is partitioned into sub-blocks that each carry from 1 to 255 bytes.

For the sample 3x5 image above, the following 9-bit codes represent "clear" (100) followed by image pixels in scan order and "stop" (101).

9-bit codes: 100 028 0FF 0FF 0FF 028 0FF 0FF 0FF 0FF 0FF 0FF 0FF 0FF 0FF 0FF 101

After the above codes are mapped to bytes, the uncompressed file differs from the compressed file thus:

 :
320: 14            20            20 bytes uncompressed image data follow
321: 00 51 FC FB F7 0F C5 BF 7F FF FE FD FB F7 EF DF BF 7F 01 01
335: 00                          - end
 :

Compression example[link]

The trivial example of a large image of solid color demonstrates the variable-length LZW compression used in GIF files.

------------------------------------------------------------------------------------------------
        CODE            |         PIXELS          |    NOTES
------------------------------------------------------------------------------------------------
   no. | value | length | this code | accumulated |    Relations using N¡ apply only to same-
   N¡  | N¡+256| (bits) |    N¡     | N¡(N¡+1)/2  |<-- color pixels until coding table is full.
________________________________________________________________________________________________
   0:  |  100h |    9   |           |             | Clear code table
----------------        -----------------------------------------------------
   1:  |   FFh |        |     1     |      1      | Top left pixel color chosen as the
       |       |        |           |             | highest index of a 256-color palette
----------------        -----------------------------------------------------
   2:  |  102h |        |     2     |      3      |
----------------        -----------------------------------------------------
   3:  |  103h |        |     3     |      6      |
   :       :   |        |     :            :      |
 255:  |  1FFh |        |    255    |    32 640   | Last 9-bit code
-----------------------------------------------------------------------------
 256:  |  200h |   10   |    256    |    32 896   |
   :       :   |        |     :            :      |
 767:  |  3FFh |        |    767    |   294 528   | Last 10-bit code
-----------------------------------------------------------------------------
 768:  |  400h |   11   |    768    |   295 296   |
   :       :   |        |     :     |      :      |
1791:  |  7FFh |        |   1791    | 1 604 736   | Last 11-bit code
-----------------------------------------------------------------------------
1792:  |  800h |   12   |   1792    | 1 606 528   |
   :       :   |        |     :     |      :      |
3839:  |  FFFh |        |   3839    | 7 370 880   | Code table full
----------------        -----------------------------------------------------
   :   |  FFFh |        |   3839    | The maximum code may repeat for more same-color pixels.
   :   |       |        |           | Overall data compression asymptotically approaches
   :   |       |        |           | 3839 x 8 / 12 = 2559-1/3
-------|-------|        |-----------|----------------------------------------
       |  101h |        |           |             | End of image data
_____________________________________________________________________________

The code values shown are packed into bytes which are then packed into blocks of up to 255 bytes. A block of image data begins with a byte that declares the number of bytes to follow. The last block of data for an image is marked by a zero block-length byte.

Interlacing[link]

The GIF Specification allows each image within the logical screen of a GIF file to specify that it is interlaced; i.e., that the order of the raster lines in its data block is not sequential. This allows a partial display of the image that can be recognized before the full image is painted.

An interlaced image is divided from top to bottom into strips 8 pixels high, and the rows of the image are presented in the following order:

• Pass 1: Line 0 (the top-most line) from each strip.
• Pass 2: Line 4 from each strip.
• Pass 3: Lines 2 and 6 from each strip.
• Pass 4: Lines 1, 3, 5, and 7 from each strip.

The pixels within each line are not interlaced, but presented consecutively from left to right. As with non-interlaced images, there is no break between the data for one line and the data for the next. The indicator that an image is interlaced is a bit set in the image's header block.

Animated GIF[link]

The GIF format can be used to display animation, as in this image of Newton's Cradle.

Basic animation was added to the GIF89a spec via the Graphics Control Extension (GCE), which allows various images (frames) in the file to be painted with time delays. An animated GIF file comprises a number of frames that are displayed in succession, each introduced by its own GCE, which gives the time delay to wait after the frame is drawn. Global information at the start of the file applies by default to all frames. The data is stream-oriented, so the file-offset of the start of each GCE depends on the length of preceding data. Within each frame the LZW-coded image data is arranged in sub-blocks of up to 255 bytes; the size of each sub-block is declared by the byte that precedes it.

By default, however, an animation displays the sequence of frames only once, stopping when the last frame is displayed. Since GIF is designed to allow users to define new blocks, Netscape in the 1990s used the Application Extension block (intended to allow vendors to add application-specific information to the GIF file) to implement the Netscape Application Block (NAB).^[8] This block, placed immediately before all the animation frames, specifies the number of times the sequence of frames should be played. (The value 0 signifies continuous display.) Support for these repeating animations first appeared in Netscape Navigator version 2.0, and then spread to other browsers.^[9] Most browsers now recognize and support NAB, though it is not strictly part of the GIF89a specification.

The following example shows the structure of the animation file Rotating earth (large).gif shown (as a thumbnail) at the top of the article.

byte#  hexadecimal  text or
(hex)               value      Meaning
0:     47 49 46
       38 39 61     GIF89a     Header
                               Logical Screen Descriptor
6:     90 01        400         - width in pixels
8:     90 01        400         - height in pixels
A:     F7                       - GCT follows for 256 colors with resolution 3 x 8bits/primary
B:     00           0           - background color #0
C:     00                       - default pixel aspect ratio
D:                             Global Color Table
:
30D:   21 FF                   Application Extension block
30F:   0B           11          - eleven bytes of data follow
310:   4E 45 54
       53 43 41
       50 45        NETSCAPE    - 8-character application name
       32 2E 30     2.0         - application "authentication code"
31B:   03           3           - three more bytes of data
31C:   01           1           - data sub-block index (always 1)
31D:   FF FF        65535       - unsigned number of repetitions
31F:   00                       - end of App Extension block
320:   21 F9                   Graphic Control Extension for frame #1
322:   04           4           - four bytes of data follow
323:   08                       - no transparency
324:   09 00                    - 0.09 sec delay before painting next frame
326:   00                       - no transparent color
327:   00                       - end of GCE block
328:   2C                      Image Descriptor
329:   00 00 00 00  (0,0)       - NW corner of frame at 0, 0
32D:   90 01 90 01  (400,400)   - Frame width and height: 400 x 400
331:   00                       - no local CT; no interlace
332:   08           8          LZW min code size
333:   FF           255        - 255 bytes of LZW encoded image data follow
334:                data
433:   FF           255        - 255 bytes of LZW encoded image data follow
                    data
                     :
92BA:  00                      - end of LZW data for this frame
92BB:  21 F9                   Graphic Control Extension for frame #2
 :                                                              :
153B7B:21 F9                   Graphic Control Extension for frame #44
 :
15CF35:3B                      File terminator

The animation delay for each frame is specified in the GCE in hundredths of a second. Some economy of data is possible where a frame need only rewrite a portion of the pixels of the display, because the Image Descriptor can define a smaller rectangle to be rescanned instead of the whole image. Displays that do not support animated GIFs show only the first frame.

Internet Explorer slows down GIFs if the frame-rate is 20 frames per second or higher and Microsoft report that Google Chrome and Safari also slow down some GIF animations.^[10]

Unisys and LZW patent enforcement[link]

In 1977 and 1978, Jacob Ziv and Abraham Lempel published a pair of papers on a new class of lossless data-compression algorithms, now collectively referred to as LZ77 and LZ78. In 1983, Terry Welch developed a fast variant of LZ78 which was named Lempel–Ziv–Welch (LZW).^[11][12]

Welch filed a patent application for the LZW method in June 1983. The resulting patent, US 4558302 , granted in December 1985, was assigned to Sperry Corporation who subsequently merged with Burroughs Corporation in 1986 and formed Unisys.^[11] Further patents were obtained in the United Kingdom, France, Germany, Italy, Japan and Canada.

In June 1984, an article by Welch was published in the IEEE magazine which publicly described the LZW technique for the first time.^[13] LZW became a popular data compression technique and, when the patent was granted, Unisys entered into licensing agreements with over a hundred companies.^[11][14]

The popularity of LZW led CompuServe to choose it as the compression technique for their GIF format, developed in 1987. At the time, CompuServe was not aware of the patent.^[11] Unisys became aware that the GIF format used the LZW compression technique and entered into licensing negotiations with CompuServe in January 1993. The subsequent agreement was announced on December 24, 1994.^[12] Unisys stated that they expected all major commercial on-line information services companies employing the LZW patent to license the technology from Unisys at a reasonable rate, but that they would not require licensing, or fees to be paid, for non-commercial, non-profit GIF-based applications, including those for use on the on-line services.^[14]

Following this announcement, there was widespread condemnation of CompuServe and Unisys, and many software developers threatened to stop using the GIF format. The PNG format (see below) was developed in 1995 as an intended replacement.^[11][12][13] However, obtaining support from the makers of Web browsers and other software for the PNG format proved difficult and it was not possible to replace the GIF format, although PNG has gradually increased in popularity.^[11] The libungif library allowed GIFs to be decoded but not encoded without use of the Unisys LZW patent.^[15]

In August 1999, Unisys changed the details of their licensing practice, announcing the option for owners of Billboard^{[clarification needed]} and Intra net Web sites^{[clarification needed]} to obtain licenses on payment of a one-time license fee of $5000 or $7500.^[16] Such licenses were not required for website owners or other GIF users who had used licensed software to generate GIFs. Nevertheless, Unisys was subjected^{[unbalanced opinion]} to thousands of online attacks and abusive emails from users believing that they were going to be charged $5000 or sued for using GIFs on their websites.^[17] Despite giving free licenses to hundreds of non-profit organizations, schools and governments, Unisys was completely unable to generate any good publicity and continued to be condemned by individuals and organizations such as the League for Programming Freedom who started the "Burn All GIFs" campaign.^[18]

The US LZW patent expired on June 20, 2003.^[19] The counterpart patents in the United Kingdom, France, Germany and Italy expired on June 18, 2004, the Japanese counterpart patents expired on June 20, 2004 and the counterpart Canadian patent expired on July 7, 2004.^[19] Consequently, while Unisys has further patents and patent applications relating to improvements to the LZW technique,^[19] the GIF format may now be used freely^[20]

PNG and other alternatives[link]

Portable Network Graphics (PNG) was designed as a replacement for the GIF format in order to avoid infringement of Unisys' patent on the LZW compression technique.^[11] PNG offers better compression and more features than GIF,^[21] animation being the only significant exception. PNG is more suitable than GIF in instances where true-color imaging and alpha transparency are required. MNG was originally developed as a PNG-based solution for animations, but has not been widely adopted. The GIF format is still preferred for animation over PNG, although true Animated Portable Network Graphics are under development by Mozilla and are supported in Firefox 3.^[22][23]

Although support for PNG format came slowly, new web browsers generally support PNG. Older versions of Internet Explorer do not support all features of PNG. Versions 6 and earlier do not support alpha channel transparency without using Microsoft-specific HTML extensions.^[24] Gamma correction of PNG images was not supported before version 8, and the display of these images in earlier versions may have the wrong tint.^[25]

PNG files can be much larger than GIF files in situations where a GIF and a PNG file were created from the same high-quality image source, as PNG is capable of storing more color depth and transparency information than GIF. However, for identical 8-bit (or lower) image data, PNG files are typically smaller than the equivalent GIFs, due to the more efficient compression techniques used in PNG encoding.^[26] Complete support for the GIF format is complicated chiefly by the complex canvas structure it allows, though this is what enables the compact animation features.

In 2004, an extension to the PNG format called APNG was proposed. It was to provide the ability to animate PNG files, while retaining backwards compatibility in decoders that cannot understand the animation chunk. Older decoders will simply render the first frame of the animation. MNG, a variant of PNG that supports animation, reached version 1.0 in 2001, but few applications support it. Animated GIF remains widely used, as many applications are capable of creating the files, and it remains the only animated image format supported in nearly all modern web browsers without the use of a plug-in.^[27] Nevertheless, embedded Flash objects, MPEGs and other video formats are used in place of animated GIFs in many websites. Other approaches, such as individual frames served by AJAX, or SVG images may be animated via JavaScript or SMIL.

See also[link]

• Comparison of graphics file formats
• Comparison of layout engines (graphics)
• GNU plotutils (supports pseudo-gif format which uses run-length encoding rather than LZW)
• Software patent
• Microsoft GIF Animator, a free program to create simple animated GIFs

References[link]

External links[link]

Wikimedia Commons has media related to: GIF

• GIF89a specification
• The GIF Pronunciation Page
• LZW GIF decoding by Arturo San Emeterio Campos
• LZW and GIF explained
• Replacing a Dictionary with a Square Root – suggestions for compressing GIFs without using LZW compression
• Web Graphics discusses and illustrates the differences between GIF, JPEG and PNG formats
• Gifology

David or Dave Karp may refer to:

• David Karp (novelist) (1922–1999), American novelist and television writer who also used the pseudonym Wallace Ware
• David A. Karp, American sociologist
• David Karp (pomologist) (born 1958), American culinary journalist
• David Karp (entrepreneur) (born 1986), founder of Tumblr
• Dave Karp, a character in the 1992 film The Mighty Ducks

This disambiguation page lists articles about people with the same name. If an internal link led you here, you may wish to change the link to point directly to the intended article.

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (August 2009)

Steve Wilhite of CompuServe invented the GIF file format which went on to become the de facto standard for 8-bit images on the Internet until the late 1990s.^{[citation needed]}

Steve Wilhite remained on the CompuServe/AOL payroll into the first decade of the 21st century working on a variety of CompuServe systems. These included CompuServe's wire protocol for their GUI clients in the 1980s, new service features in the early 1990s, web chat software in the late 1990s, and investigating web community models until his departure after being disabled by a stroke.^{[citation needed]} He has since recovered.

Wilhite's name comes up frequently in debate over the pronunciation of the GIF acronym.^{[citation needed]} Steve Wilhite always used the pronunciation that sounds like Jif peanut butter and if asked would usually reply "Choosy programmers choose 'jif'."

External links[link]

• The GIF Pronunciation Page

This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. v t e

This article uses bare URLs for citations. Please consider adding full citations so that the article remains verifiable. Several templates and the Reflinks tool are available to assist in formatting. (Reflinks documentation) (January 2012)

Ronan Keating
Ronan Keating
Background information
Birth name	Ronan Patrick John Keating[1]
Born	(1977-03-03) 3 March 1977 (age 35) Swords, Dublin, Republic of Ireland
Genres	Pop, dance pop, folk rock, electropop
Occupations	Musician, singer-songwriter, television/radio personality, actor, composer
Years active	1993–present
Labels	Polydor
Associated acts	Boyzone
Website	www.ronankeating.com

Ronan Patrick John Keating^[1] (born 3 March 1977) is an Irish recording artist, singer-songwriter, musician, and philanthropist. Keating debuted on the professional music scene alongside Keith Duffy, Mikey Graham, Shane Lynch and Stephen Gately, in 1994 as the lead singer of Boyzone. His solo career started in 1999, and resulted in 9 albums. Keating gained worldwide attention when his single "When You Say Nothing at All" was featured in the film Notting Hill and peaked at number one in several countries. As a solo artist, Keating has sold over 22 million records worldwide,^[2] and in Australia he is best known as a judge on The X Factor.^[3]

Keating has worked as a charity campaigner most notably for the Marie Keating Foundation, a foundation that raises awareness for breast cancer. It is named after his mother, who died of the disease in 1998. Keating's fortune is around €15 million.^[4][5]

Life and career[link]

Early life, marriage and Boyzone: 1994–99[link]

Boyzone performing at the tour with Ronan Keating as the lead singer.

Ronan Keating was born on 3 March 1977, the youngest of five children. He grew up on the Northside of Dublin and Co Meath. His father Gerry Keating was a lorry driver; his mother Marie was a hairdresser and had her own salon in Dunshaughlin, Co Meath. He has one sister: Linda, and three brothers: Ciaran, Gerard and Gary.^[6] He was a track and field athlete and represented Ireland in several tournaments, winning the All Ireland under-13 200m title. He also worked as an assistant in a shoe shop just as his siblings emigrated to the United States.^[7]

Keating is also godfather to Mackenzie Bannatyne. Keating joined the band Boyzone on 1993. Keating, Keith Duffy, Richard Rock, Shane Lynch and Stephen Gately were chosen as Boyzone members. Rock would later leave the group before being replaced by Mikey Graham. The group performed in various clubs and pubs before being signed by PolyGram in 1994 and released a cover version of "Working My Way Back to You" by The Four Seasons. The group also released a cover version of "Love Me for a Reason" which would peak on several charts. In 1998, his mother died at the age of 54^[8] from breast cancer,^[9][10] resulting in the establishment of the Marie Keating Foundation. Keating married Yvonne Connolly in April 1998 and together, the couple have three children: Jack (born 15 March 1999), Marie (born 18 February 2001) and Ali (born 7 September 2005).

From 1994–1999, Boyzone released 3 studio albums and 1 compilation album before disbanding in 2000.

[edit] Ronan and When You Say Nothing At All: 1999–2000

In 1999, while still a member of Boyzone, Keating recorded a version of "When You Say Nothing At All" for the motion picture Notting Hill. The single peaked at number one in the UK charts, leading to a successful solo career.^[11] Keating released his debut solo album entitled Ronan in 2000, peaking at number one in the UK Albums Chart. The album was given several negative reviews, however, it sold over 750,000 copies and became one of the top selling albums of the year in the United Kingdom. It debuted at number one on the UK Albums Chart, and have been certified four-times platinum by the British Phonographic Industry for sales of 1.2 million copies. In the singer's native Ireland, the album debuted at number two. The album also became a commercial success in other European countries, where it charted within the top ten of eight countries. In 2001, Ronan was certified two-times platinum by the International Federation of the Phonographic Industry for shipments of two million copies inside Europe.^[12]

The album produced four UK and Irish top-ten singles: "When You Say Nothing at All" (originally recorded for the soundtrack of the 1999 film Notting Hill), "Life Is a Rollercoaster", "The Way You Make Me Feel", and "Lovin' Each Day", the latter of which was featured on the re-release edition of the album, and later on Keating's second album, Destination (2002).Also the song "Lovin each day" is from a movie "Summer catch".

Solo career: 2000–07[link]

After the successful debut album Ronan, Keating continued on with his solo career and since has released four more studio albums: Destination (2002), Turn It On (2003), 10 Years of Hits (2004) and Bring You Home (2006), four of which peaked at number one in the UK Albums Chart. Keating collaborated with several major stars, including Elton John, Lulu, LeAnn Rimes and the Bee Gees, for these albums.

Keating and Paul Brady co-wrote the 2001 hit single "The Long Goodbye",^[13] one of Keating's most loved hits amongst fans and a huge hit for Brooks & Dunn in the United States. Keating and Brady won the "BMI European song-writing award" for the single. In 2003, Keating was named Rear of the Year – an award given to celebrities with a notable posterior.^[14] In October 2007, Keating was listed in the Guinness Book of Records for being the only artist ever to have 30 consecutive top 10 singles in the UK chart, beating the likes of Elvis Presley. Keating also embarked on two world tours, won the Ivor Novello and BMI songwriting awards, released an autobiography, had a role as ambassador for Christian Aid and earnt sales in excess of 22 million albums worldwide. In 2007 he released 2 fragrances,the range consists of a female fragrance, Hope By Ronan, which is based upon musk and amber scents and a male scent, Believe by Ronan, based on Sicilian Lemon, Lavender and Clary Sage smells. All proceeds go to the Marie Keating foundation.

Keating performed at the 2006 FIFA World Cup opening party at the Brandenburg Gate in Berlin, Germany, in front of an audience of nearly 250,000 people, and posed nude for Cosmopolitan magazine's 10 Years of Naked Centrefolds. On 9 May 2007, Keating became the first international number-one selling foreign artist to perform a concert in Phnom Penh, Cambodia. Keating also performed at the Olympic Stadium Indoor Arena. Keating has dueted with Elton John at Madison Garden in New York and has sung for the Pope twice and performed for Prince Charles at the Prince's Trust 30th birthday, which took place at the Tower of London. He performed on stage for the Swedish Royal family at Crown Princess Victoria's birthday celebrations, and at the opening ceremony of the 19th European Athletics Championships in Gothenburg.

[edit] Back Again... No Matter What and Stephen Gately's death: 2007–10

On 5 November 2007, Keating confirmed that Boyzone would reunite for a special appearance on the BBC's annual fundraiser, Children in Need, performing a medley of hits, although had not yet commented on the possibility of a new tour or album. Soon, the Boyzone went on a 29-date tour. The tour, taking in cities such as Cardiff, Newcastle, Liverpool, London at the O2 Arena and Wembley, Manchester, Birmingham, Glasgow, Aberdeen, Sheffield, Newcastle, Nottingham, Edinburgh Castle and the RDS in Dublin. Stephen Gately, close friend and bandmate of Keating, died on 10 October 2009 of a pulmonary edema, or fluid in the lungs. This left Keating devastated.

In 2009 Keating co-wrote the song "Believe Again" sung by Niels Brinck, who won the Dansk Melodi Grand Prix and represented Denmark in the Eurovision Song Contest 2009 in Moscow where it qualified for the final from the second semi-final and finished in 13th place with 74 points.^[15] Following the success of Ronan Keating's album Songs For My Mother,^[16] he has recorded another entitled Winter Songs. Teaming up again with Songs For My Mother producer Steve Lipson, Keating pulled together eleven songs that evoked memories of winter and Christmas for him. Winter Songs is a mix of traditional and modern festive classics, including tracks from artists such as Simon & Garfunkel, Joni Mitchell and Sugarland along with perennials "Silent Night" and "Have Yourself a Merry Little Christmas". The album also includes two brand new songs, "Its Only Christmas" and "Scars".^[17] In March 2010 the new Boyzone album "Brother" was released and went to number one in UK and Ireland.

On 12 November 2010, Keating released his seventh studio album entitled, Duet in Australia and New Zealand.^[18] "Believe Again" was released as the lead single from the album and features guest vocals from Australian singer, Paulini

[edit] Brother tour and When Ronan Met Burt: 2011–present

He joined Boyzone on their tour of the UK and Ireland during February and March 2011 with a 21 date tour of the Ireland and UK with their arena-based Brother Tour.^[19] Bringing some Antipodean sunshine to proceedings were the soulful vocals of singer/songwriter Guy Sebastian, support act from Australia.^[20] On 21 March 2011 a new album from Ronan Keating was released worldwide named When Ronan Met Burt.^[21] In April he will make his film debut in Australia to shoot scenes for the top secret project.^[22]

He performed at the Westfalenhallen in Dortmund, Germany in front of a 16,500 crowd.^[23]

2012 Tour and studio album[link]

Ronan Keating toured Australia and New Zealand in the beginning of 2012 at the state theatre in Sydney, Brisbane convention centre, Melbourne Regent Theatre, Newcastle Entertainment Centre, Canberra Royal Theatre, Wollongong Entertainment Centre, Adelaide festival theatre and at Perth Kings Park in front of 29,000 in all making 1.6 million pounds.^[24]

A new fifth studio album will be released on the 3rd September 2012 and a tour in the UK and Ireland later in the year will follow.^[25] Ronan said: "Now I have a new lease of life and I'm ready to write and record, i'm working on a new studio album, which I hope to release later this year, it will feature brand new songs".^[26] "It's not folk. It's a mix! It's a pop album. Gregg Alexander and I are working together again. It's got that 'Life is a Rollercoaster' feel again. I'm having fun with it again, it's been five years since I've done a studio album. I'm a little bit nervous, I just want to make a great record, for me, rather than for anyone else."

He will also be reuniting with his Boyzone bandmates Keith Duffy, Mikey Graham and Shane Lynch in 2013 to celebrate their 20th anniversary as a group, "Next year Boyzone will be 20 years gone, so we'll be doing something."^[27]

Charity work[link]

In October 2005, shortly after joining Christian Aid and the Trade Justice Campaign in 2004, Keating went to Rome where he was appointed as a UN Goodwill Ambassador via the Food and Agricultural Organisation.^[28]

Keating ran in the London Marathon on 13 April 2008 to raise money for Cancer Research, with a personal best time of 3hr 59min.^[29] He has also walked the length of Ireland twice, each time raising money for the Marie Keating Foundation, now linked to Cancer Research in the UK. Each year the foundation holds charity balls and various events, raising funds to keep their mobile units on the road.

In 2009, Keating climbed Mount Kilimanjaro to raise money for Comic Relief; joining him were Gary Barlow, Chris Moyles, Ben Shephard, Kimberley Walsh, Denise van Outen, Fearne Cotton, Alesha Dixon and Cheryl Cole.^[30]

In June 2009, Keating received a Special Achievement Award from Cancer Research UK – he was singled out for his work with them since 2006. He, along with the Marie Keating Charity, has helped to raise over £1.7 million for the UK charity. This money is used to fund three special mobile units which raise awareness throughout the UK.^[31]

In October 2009, he pulled out of the Chicago Marathon due to the sudden death of his bandmate Stephen Gately; he had intended to run in memory of his mother.^[32]

In September 2011, he swam the Irish sea 90 km stretch from Dublin to Holyhead with a team of celebrities to raise money for cancer charities and set a new Guinness World Record for open water swimming with a 11-member celebrity team. They raised £1 million for Cancer Research Britain and the Marie Keating Foundation.^[33]

Awards[link]

Over the years he has won Smash Hits Best Solo Male. He was given a tree in London's Hyde Park for performing for The Prince's Trust.^[34] He also has a World Music Award for the best selling Irish artist.^[35]

Other work[link]

Presenting[link]

On 3 May 1997, Keating presented the Eurovision Song Contest along with Carrie Crowley.^[36] He presented the MTV Europe Music Awards in 1997 and 1999, and co-presented the MTV Asia Awards in 2002 with Mandy Moore. He also hosted Miss World 1998.^[37]

In 1999 Keating presented BBC1 talent show "Get Your Act Together" for the full 9 episodes.

On 20 April 2009, Keating guest co-hosted The Morning Show in Australia alongside Kylie Gillies, while the show's regular male co-host Larry Emdur was on holiday.^[38] In addition, he has stood in for Steve Wright on his Sunday Love Songs on BBC Radio 2.^[39] He currently presents a Sunday request show on Magic 105.4 FM.^[40]

In a section for the Jeremy Clarkson 2009 DVD Duel, Keating was invited to take part in an off-road race to find "the fastest off-road celebrity", along with newsreader Kate Silverton, Rugby player Matt Dawson, and Clarkson.^[41] He came third overall, after being forced to abandon the car with only 20 seconds left to complete the course to disarm the on-board time bomb.

Keating is a judge on the Australian version of The X Factor on the Seven Network in 2010. Season two has him mentoring the over 25's category. His fellow Boyzone bandmembers helped him in the judges' house selection of the contest. He was the winning mentor for the 2010 Season; his over 25 artist Altiyan Childs won the show.

In 2010 the edition of Miss Earth beauty pageant in Vietnam, Keating made a star appearance to sing his solo hits.

He appeared as a guest on episode 7, series 5 of Celebrity Juice along with Kimberley Walsh and Chipmunk.

Acting[link]

Keating has recently stated he would like to break into acting, but does not intend to stop working as a recording artist.^{[citation needed]} He recently auditioned for a role in the upcoming fantasy movie "The Hobbit" and was unsuccessful. The film is based on the J. R. R. Tolkien novel of the same name.^[42]

April 2011 Ronan will start shooting his first movie in Australia. It is a romantic musical comedy called Goddess, his co-star is British Actress Laura Michelle Kelly. The film's being directed by Mark Lamprell who wrote 'Babe – Pig in the city' and is due for release in 2012. ^[43]

Controversy[link]

Louis Walsh[link]

When Keating announced he wanted to take a break from Boyzone, Louis Walsh continued to manage his career. Keating achieved a number one hit with "Life is a Rollercoaster" in 2000 while his album sold 4.4 million copies. Keating and Walsh later agreed to part company and then had a bitter falling out.^[44][45] Walsh told the press: "[Keating] wasn't the most talented one – he's not a great singer and he's got no personality."^[46] Keating later told Closer magazine: "That man absolutely tried to ruin me and if he thinks we can ever hug and make up he can forget it. I haven't heard from him in three years and I wouldn't have a problem if I never saw him again. He's not a nice character."^[47]

The feud between the two men had apparently ended by March 2008^[48] and they helped in selecting the finalists in the Groups category in The X Factor, a reality show in the UK.^[49]

Thom Yorke[link]

Keating has criticised Radiohead frontman Thom Yorke several times in the press throughout late 2008 and early 2009, calling him a "muppet" and an "idiot" due to Yorke allegedly ignoring Keating at a hotel.^[50] Shortly after Keating's remarks, Kanye West and Miley Cyrus also complained about Yorke's alleged rudeness. In response to the accusations, Yorke left a blog on Radiohead's official site for those who were not among "those people I have managed to offend by doing nothing."^[51]

Personal life[link]

Keating married model Yvonne Connolly in April 1998 and together, the couple have three children – Jack (born 15 March 1999), Marie (born 18 February 2001) and Ali (born 7 September 2005).^[52] Following the death of his mother Marie in 1998 of breast cancer, the family home, which Keating had bought at the age of eighteen, was sold, rendering his father Gerry homeless and resulting in a bitter feud between father and son – Gerry was not invited to his son's wedding, which took place in Nevis. The two later reconciled after two years without communication.^[7]

Keating and his wife split in late 2011,^[53] after almost 14 years of marriage, and made their decision public in April 2012.^[54][55][56]

Discography[link]

Studio Albums[link]

• Ronan (2000)
• Destination (2002)
• Turn It On (2003)
• Bring You Home (2006)
• Fire's (2012)

Compliation and covers Albums[link]

• 10 Years of Hits (2004)
• Songs for My Mother (2009)
• Winter Songs (2009)
• Duet (2010)
• When Ronan Met Burt (2011)

See also[link]

• List of Eurovision Song Contest presenters

References[link]

External links[link]

• Ronan Keating- The Official Britain and Ireland Website
• Marie Keating Foundation
• Ronan Keating "This is Who I Am" Interview Heat World, June 2009
• FAO Goodwill Ambassador website

Preceded by Robbie Williams Jenny McCarthy	MTV Europe Music Awards host 1997 1999	Succeeded by Jenny McCarthy Wyclef Jean
Preceded by Morten Harket & Ingvild Bryn	Eurovision Song Contest presenter (with Carrie Crowley) 1997	Succeeded by Terry Wogan & Ulrika Jonsson