METHOD FOR ENCODING DIGITAL INFORMATION

Abstract: A method for encoding digital information to be transmitted from a first device to a second device, wherein the digital information is mapped according to a map of n rows and m columns which define a plurality of cells (n x m) and wherein each of said cells has a pixel value. The method is useful for compressing bitmapped images to be rendered by the simplest of graphics engines. Thus the method is particularly suited to the transmission of images to a relatively slow client on which the images are to be rendered in real time and on which any complex decompression would be too costly for such rendering. Raw compression ratios are comparable to those obtained with standard runlength encoding, but the number of drawing primitive calls required to render the compressed images directly is substantially less. If the size of the largest area exceeds predetermined limits it is subdivided into smaller areas automatically without having to specify the size and position.

Description: - 1 - Method for Encoding Digital Information Field of the Invention This invention relates to a method for encoding digital information to be transmitted from a first device s to a second device, wherein the digital information is mapped according to a map of rows and columns which define a plurality of cells and wherein each of said cells has a pixel value . In particular this invention relates to a method for ic compressing bitmapped images in order to transmit them from a fast computing device (server) . to a relatively slow computing device (client). Background to the invention It is known to encode a series of pixel values by 15 using Runlength encoding (RLE) method. RLE method takes raw data, as for example a series of pixel values, and encodes the series as a series of (count value) pairs so that long sequences of the same value can be represented by a relatively small amount of 20 data. For example, the series of values: 12 12 12 100 100 100 100 100 30 30 4 4 4 4 4 4 4 4 4 4 4 4 4 4 could be run-length encoded as: (3,12) (5,100) (2,30) (14,4) Such RLE method is a standard technique developed in 25 the 50s and used in many different areas including, for example, fax machines. It is also known from background research (using both the World Wide Web and traditional journals and textbooks) that many ideas have been presented under the Ά names 'area coding' and 'two-dimensional run-length encoding'. Unfortunately, no specific implementation details or academic references are available from any of - 2 - the sources consulted. Moreover, the sources indicate that other efforts in this area use complex recursive algorithms which emphasise optimal solutions at the cost of long runtimes, and also that these other efforts are not geared for the transmission of images for real-time rendering by relatively slow computers. This invention addresses the problem of transmitting bitmapped images from a relatively fast computing device (the server) to a relatively slow computing device (the client) in such a way that these images can be rendered quickly on the client. Therefore it is a primary object of the present invention to provide a method for encoding bitmapped information which is simple, effective and useful for relatively slow computers for rendering of two dimensional images . The Invention According to the present invention, there is provided a method for encoding digital information characterised by the following steps: starting from a predetermined first cell having a certain pixel value, to determine the largest area of cells, adjacent to said first cell, having the same pixel value as said first cell; - to generate a code indicative of the row-column position of said first cell, of the dimensions of said largest area and of said pixel value common to all the cells of said area; to proceed to a second cell, adjacent to said area and having a pixel value different from the pixel value of said first cell; and starting from said second cell, to determine another largest area of cells, adjacent to said second cell, having the same pixel value as said second cell; - 3 - to generate a code indicative of the row-column position of said second cell, of the dimensions of said largest area and of said pixel value common to all the cells of said area; to repeat said steps until all cells of said digital information have been encoded. According to a variant of the present invention, in an initial step, the most prevalent pixel value V is determined, either exactly by fully enumerating all pixel values, or probabilistically by enumerating a randomly selected subset of the pixel values. All cells with pixel value V are then ignored in the basic encoding process and the output is augmented with the value V and the overall dimensions of the input. According to a second variant of the present invention, the background pixel value V is determined by running the basic method of the invention and choosing the pixel value which appears in the greatest number of said largest areas, rather than simply the most prevalent value on a pixel-by-pixel basis. Brief Description of Drawings This and other characteristics of the present invention will become apparent when the following description of a preferred embodiment, provided by way of a non-exhaustive example, is considered in conjunction with the accompanying drawings, in which: Fig. 1 represents a bitmapped rectangle of information to be encoded according to the present invention; Fig. 2 represents sub-rectangles of the rectangle of Fig. 1. Preferred Mode for Carrying out the Invention The method of the invention (algorithm) takes as its input a bitmapped rectangle or information R of width W and height H. Each of the W x H cells of the rectangle contains a pixel of dimension P bits. With reference to Fig. 1 it is shown such a rectangle R of width W 20 and height H 16. The pixels P in the figure are 8 bits in dimension and are shown in decimal notation in which they can vary from 0 to 255. The rows of the rectangle are labelled with their indices Y from 0 to 15 and the columns with their indices X from 0 to 19 (the rectangle of Fig. 1, as its form indicates, represents the image of an X outlined by one colour and against a background of another) . The invention was developed with a specific client/server pair in mind, the server being a specially modified X-server running on a fast Unix computer, and the client being a Java applet running within a web browser on another computer. The applet in question takes bitmapped rectangles R from the specially modified X-server and renders them in a Java AWT panel. The rectangles R represent changed areas of the X- server's display, and thus the applet (which also sends mouse and keyboard events back to the X-server) allows the user to interact with his or her X-server 's applications within any Java-capable browser. The idea of the invention is to produce from the rectangle R a set of sub-rectangles S (Figs. 1 and 2) from which the original rectangle R can be reconstructed. Each sub-rectangle S will consist of cells of a single pixel value and will be specified by a block of numbers (tuple) (PI, XI, Yl, Wl, HI) where (Pi) is the pixel value, (XI, Yl) represent the indices of the column and row of the original rectangle where the top-left corner of the sub-rectangle S appears, and (W1,H1) represent the width and height of the subrectangle S. - 5 - The output of the algorithm is a set of such tuples. The basic algorithm proceeds as follows: 1. Mark all cells of the rectangle R as free and name the top left cell of R as the new current cell C. 2. Determine the largest sub-rectangle S of the rectangle R whose top-left corner is the current cell C and which consists entirely of cells whose pixel values are the same as the value of the current cell C. 3. Output the tuple (Pi, XI, Yl , Wl , HI ) where PI is the 0 pixel value of the current cell C, (XI, Yl) is the column-row position current cell C within the rectangle R, and (Wl,Hl) holds the width and height of the sub-rectangle S. 4. Mark all cells of sub-rectangle S as consumed (i.e. no longer free) . 5 5. Proceed left-to-πght and top-to-bottom from the current cell C until a free cell F is encountered (If no free cell F remains, the algorithm is done) . 6. Name the free cell F as the current cell C and jump to step 2. 0 The output of the algorithm is the list of tuples produced at step 3 and the original rectangle R can be reconstructed by drawing all of the single-coloured sub- rectangles S specified by these tuples. Thus, for example, the first few tuples output for the 5 rectangle R shown m Figs. 1 and 2 would be: (240, 0, 0,2,16) (255,2, 0,1,4) (255, 3, 0, 3, 1) . Alternatively, the algorithm can start from any corner 0 or from any point of the rectangle R. For example, by starting from the top-right corner of the rectangle R, it is possible to proceed right-to-left and top-to-bottom for encoding the image and generating the single-coloured sub- rectangles S. - It is also clear that the bitmapped information to be encoded instead of rectangular shape, as hereinbefore - 6 - described, can be of any other shape, for example circular or triangular, and that it is possible to encode bitmapped information of any shape by using sub-areas not necessarily of rectangular shape. As a second example, when bitmapped rectangles represent changes to a Graphical User Interface (GUI display), i.e. a screen of windows, images and text such as would appear on a PC or Unix Workstation, it is clear that such rectangles are often dominated by one pixel value; th s observation leads to a variant of the algorithm in which the most prevalent pixel value V is determined in an initial pass, either exactly by fully enumerating all pixel values, or probabilistically by enumerating a randomly selected subset of the pixel values. In this case, all cells of pixel value V (the background value) are marked as consumed before the basic method of the invention is run, and the output is prepended with the background rectangle parameters (V,0,0,W,H). Reconstruction can be done as for the basic method of the invention, so long as the special background rectangle is drawn first and the remaining sub-rectangles are drawn in overlay mode. The number of sub-rectangles required to represent the image can be reduced by determining the background pixel value V by running the basic algorithm and choosing the pixel value which appears in the greatest number of sub- rectangles, rather than simply the most prevalent value on a pixel-by-pixel basis. In this case it is possible to reduce the number of subrectangles at the cost of a very slightly more complicated algorithm. A variant to the basic algorithm differs from it as follows : if the width W of rectangle R exceeds a threshold MAXW or if the height H of rectangle R exceeds a threshold MAXH, then the rectangle R is partitioned into a number of - 7 - smaller rectangles each of which has height less than or equal to MΔXH and width less than or equal to MAX . Each of these smaller rectangles is then encoded using the basic algorithm. ^ Typically, MAXH and MAXW will be chosen such that the (x,y,w,h) parameters in the output tuples can each be represented m a small amount of storage, e.g., a single byte or less. For bitmapped rectangles which represent changes to a 0 GUI display, this variant almost invariably reduces the number of bytes required to encode those rectangles, thereby increasing the speed with which those rectangles may be transmitted from server to client. This effect occurs because the identification of those portions of the GUI 5 display which are unsuitable for the basic encoding (and therefore better left unencoded) happens at a much finer granularity in the variant than in the basic algorithm. By varying the values of MAXH and MAXW, this granularity can be varied to an optimal level. The determination of MAXH and 0 MAXW values can be done either statically (i.e., before the method is employed) or dynamically (i.e., as the method is being employed, possibly varying from rectangle to rectangle based on analysis of previous encodings.) . There is a variation on this variant of the method for 5 encoding digital information which has been filed under UK Patent No. 9726941.9. The differences are: 1. MAXW and MAXH are fixed at 16, although the same principles are applicable to any other values. This 0 means that the X, Y, W and H of the subrectangles can be specified in 4 bits each, 16 bits in total. 2. When splitting the original rectangle into rectangles ("tiles") of no more than MAXW and MAXH this is done in a predetermined way. This means that the position 5 and size of each tile do not have to be explicitly specified - the encoded contents of the tiles simply follow one another in the predetermined order. The ordering of tiles that we use is starting at the top left going in left-to- right, top-to-bottom order. If the width of the whole rectangle is not an exact multiple of MAXW then the width of z the last tile in each row will be correspondingly smaller. Similarly, if the height of the whole rectangle is not an exact multiple of MAXH then the height of each tile in the final row will also be smaller. The original variant does not mention how the position 0 and size of the rectangles after splitting (called "tiles" here) are specified. There are the following differences: Each tile is either encoded as raw pixel data, or as a variation on the basic method as follows: a) each tile has a background pixel value, as 5 before. However, the background pixel value does not need to be explicitly specified for a given tile if it is the same as the background of the previous tile; b) if all of the subrectangles of a tile have the same pixel value, this can be specified once as a 0 foreground pixel value for the whole tile. Then each subrectangle can be specified by a tuple (X,Y,W,H), rather than the existing (P,X,Y,W,H). As with the background, the foreground pixel value can be left unspecified, meaning it is carried over from the previous tile. 5 As indicated above, the primary application of this invention is the transmission of bitmapped rectangles of information from a modified X-server to a Java applet for real-time rendering. In fact the example has been developed for providing much better performance than other approaches, C such as standard runlength encoding (RLE), m the transmission of bitmapped images from a server to a relatively slow computer or client. In general, compressing images into sets of simple drawing primitives makes sense when the images are to be J transmitted to a client which must render the images in real - 9 - time but which does not possess the capability to perform complex decompression in real time. There are almost certainly instances other than this particular example where this is the case and hence where this invention would prove useful. In addition, there may well be classes of two- dimensional information or data other than bitmapped images which would benefit from this invention both for purposes of compression and for post-processing after transmission or storage. Therefore the encoding method of the invention could be used for other things as well. Moreover, the invention could easily be extended to 3 or more dimensions, e.g. to compress 3D volumes.

Claims: - 10 - Cl aims : 1. A method for encoding digital information to be transmitted from a first device to a second device, wherein said digital information is mapped according to a map of s rows and columns which define a plurality of cells and wherein each of said cells has a pixel value, said method being characterised by the following steps: from a predetermined first cell having a certain pixel value, determining the largest area of cells, adjacent ιθ to said first cell, having the same pixel value as said first cell; generating a code indicative of the row-column position of said first cell, of the dimensions of said largest area, and of said pixel value common to all the 15 cells of said area; proceeding to a second cell, adjacent to said area and having a pixel value different from the pixel value of said first cell; from said second cell, determining another 20 largest area of cells, adjacent to said second cell, having the same pixel value as said second cell; generating a code indicative of the row-column position of said second cell, of the dimensions of said largest area, and of said pixel value common to all the 25 cells of said area; and repeating said steps until all said cells have been encoded, characterised by the step of determining whether the dimensions of said largest area exceed predetermined limits 30 and if the result of the determination is that said limits are exceeded, subdividing said largest area into smaller areas, the dimensions of which are less than said predetermined limits and in that the step of subdividing the largest area comprises subdividing the area in a - 11 - predetermined order without explicitly specifying the size and position of each smaller area. 2. A method according to claim 1 characterised in that said largest area is a rectangle. 3. A method according to claim 1 in which each smaller area is assigned the same pixel value as the said largest area. 4. A method according to claim 1 characterised in that said map is of rectangular shape and comprises n rows and m columns. 5. A method according to claim 1 characterised by the initial step of determining the most prevalent pixel value of said digital information.

Inventors: RICHARDSON TRISTAN JOHN, WOOD KENNETH ROBERT, RICHARDSON, TRISTAN, JOHN, WOOD, KENNETH, ROBERT
Applicants: OLIVETTI TELEMEDIA SPA, ORACLE CORP, RICHARDSON TRISTAN JOHN, WOOD KENNETH ROBERT, OLIVETTI TELEMEDIA S.P.A., ORACLE CORPORATION, RICHARDSON, TRISTAN, JOHN, WOOD, KENNETH, ROBERT
Application year: 1999
Main classification: H03M7
IPC codes: H04N1