|Publication number||US5347600 A|
|Application number||US 07/781,586|
|Publication date||13 Sep 1994|
|Filing date||23 Oct 1991|
|Priority date||5 Jul 1989|
|Also published as||CA2062965A1, CA2062965C, DE69020564D1, DE69020564T2, EP0480941A1, EP0480941B1, US5065447, WO1991000666A2, WO1991000666A3|
|Publication number||07781586, 781586, US 5347600 A, US 5347600A, US-A-5347600, US5347600 A, US5347600A|
|Inventors||Michael F. Barnsley, Alan D. Sloan|
|Original Assignee||Interated Systems, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (4), Non-Patent Citations (31), Referenced by (141), Classifications (12), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application is a continuation-in-part of U.S. patent application Ser. No. 07/375,840 entitled METHOD AND APPARATUS FOR PROCESSING DIGITAL DATA filed Jul. 5, 1989 by Michael F. Barnsley and Alan D. Sloan, now U.S. Pat. No. 5,065,447 issued Nov. 12, 1991. The disclosure of the aforementioned U.S. patent application, now U.S. Pat. No. 5,065,447 is hereby expressly incorporated by reference.
This application is related to U.S. patent application Ser. No. 07/781,587 entitled FRACTAL TRANSFORM COMPRESSION BOARD filed on even date herewith by Michael F. Barnsley, Alan D. Sloan, John H. Elton, Charles S. Moreman, and Guy A. Primiano. The disclosure of the aforementioned U.S. patent application Ser. No. 07/781,587 is hereby expressly incorporated by reference.
The present invention relates generally to image processing and, more particularly, to methods and apparatus which employ contractive transformations for representing images and compressing image data.
There is a collection of important problems related to the way in which computers and other digital devices deal with images. Broadly, this subject is referred to as "digital image processing," and covers the analysis, storage, and communication of images by means of digital devices. Four specific areas within the broad subject of digital image processing which are of particular interest are image compression, image representation, image recognition, and image analysis.
The present invention is applicable to all four of these areas. However, the issues involved in each area are extensive and complex. Therefore, only two of the areas, image compression and image recognition, will be discussed, to provide a background of the advantages of the present invention.
To understand the problem of image compression, consider an image, such as a photograph of a person or a natural scene, represented as an array of 1024×1024 picture elements, or pixels. The pixels may be black and white or various shades of gray. If there are two hundred fifty six possible shades of gray, then the image can be completely described in digital terms by a binary string of 1024×1024×8 binary digits (bits) each having a value of one or zero. Such a representation of an original scene is known as a "digitized" image, since it consists of binary digits and is suitable for processing by a digital computer. The bits are commonly formed together into eight-bit: groups know as "bytes" and stored together as a "data file" for use by digital devices such as computers.
If no compression is used, more than one million bytes of memory are required by a computer simply to store a single image as described above. Image compression involves decreasing the number of bits required to represent an image in such a way that either an exact replica of the image (termed "lossless compression") or an approximate replica (termed "lossy compression") of the image can be retrieved.
There are four main reasons for desiring effective compression of a data file representing an image. First, the speed of transmission of a data file is essentially proportional to its size. The larger the file, the longer it takes to transmit. Second, the storage space required is proportional to the file size. To store files representing sixty uncompressed images of the type mentioned above requires sixty megabytes of storage space. If the representation of the image can be compressed fifty percent, twice as many images can be kept in the same storage space. Third, compressed images cost less to transmit, process, archive, and retrieve than uncompressed images. Fourth, compressed images can be processed faster than uncompressed images. For example, suppose a sample image is compared against a library of stored images to determine whether a wren appears in the sample image. Although the only difference between the images may be a tiny bird, to detect this difference using uncompressed data, the files representing the images would need to be compared bit by bit, pixel by pixel. If the images were properly compressed, the comparison may proceed more quickly. For this fourth reason, if no other, data compression is likely to play an important role in knowledge based computing systems.
Examples of current needs for effective compression are as follows:
(1) Transmission of medical images by telephone. This includes high resolution medical X-rays and CAT-scans. Medical advice could be sought from a number of consultants in remote locations, provided that the transmission costs are sufficiently low and the transmission times are sufficiently short.
(2) Sending video data from computer to computer by telephone. In many situations remote computers are linked by telephone lines using a modem. The communication between computers is limited by the "bandwidth" of the line between the computers and the speed of the modem. For standard telephone lines, the highest speeds with which computers can transfer data from one to another is 9600 bits/second. If a single video image resolved into 128×128×8, or 131,072 bits, at 30 frames/second the video information is generated at 3,932,160 bits/second. Accordingly, a compression ratio of 409:1 is needed for this application.
(3) 64 Kilobit/second telephone communication lines for video transmission. The goal is to be able to allow consumers to access movies on demand. The quality of the video demanded is high. Accordingly a good means of compression is required.
(4) High definition television (HDTV), and advanced television (ATV). It is probable that the United States will require that any form of HDTV must be compatible with NTSC signals, the standard broadcast television signals currently transmitted in the U.S. HDTV will provide images having about twice the horizontal and vertical resolution of NTSC television images. To achieve this, it has been proposed that additional bandwidth be used by broadcasting stations. Such additional bandwidth would not be required if effective means for image compression were available and the additional image data required for HDTV could be transmitted via existing communication bands.
(5) Digital Video Interaction (DVI) type applications. The goal is to store as much video image data as possible on a medium such as an optical disk. The higher the compression which can be achieved, the more applications of interactive retrieval at video rates become practical.
(7) More efficient FAX (facsimile) transmission. Current FAX machines transmit a page of text in about 15 seconds. Although some compression of black-and-white imagery is achieved by Type 3 FAX machines, an increase in the compression ratio by a factor of ten would permit text transmission via FAX at the rate of 40 pages a minute. This would result in significant financial savings.
(8) More efficient data retrieval. As the amount of data stored in a computer becomes larger, the access time to retrieve that data increases, because of the greater size of the data files. Image compression can be used to speed up the access to data by decreasing the amount of memory which must be searched to retrieve it.
Prior art methods and apparatus for exact compression achieve ratios of between 0.5 and 0.1. That is, the number of bits required to store and reproduce an exact copy of an original image is between one half and one tenth the original number of bits. Such performance is clearly not sufficient to meet the requirements of some of the current applications listed above.
Moreover, some prior art digital data compression methods, while suitable for certain applications, are computationally complex, and thus may require many hours of manual operation of a computer to achieve compressed data.
Still other prior art data compression methods employ look-up tables as part of the compression procedure. Procedures using look-up tables can be useful in certain applications, such as where the class of images being compressed is small. However, use of look-up tables can limit the ability to provide adaptive capabilities useful in applications such as general purpose video processing including large numbers of diverse images and other applications where the image class cannot be narrowed down in advance. When the class of images to be compressed is large, the look-up tables also have to be very large, requiring the use of extremely large amounts of system memory. Moreover, compression ratios are decreased as the size of the look-up table is increased.
Accordingly, improved methods and apparatus for image data compression are required.
Another important problem in digital image processing concerns the representation of images in a computer. Real world images that we perceive are not digital, i.e., discrete. Instead, these images have a continuous extended nature. An image in the mind's eye is viewed as being endlessly magnifiable. For example, if we think of a small image such as a tiny black cat, we begin with the concept of "black cat" and perceive in the mind a small black shaped silhouette. If we think of the image as being continuously enlarged, additional details appear in the image in the mind, such as textured fur and whiskers. We are able, in our minds, to continuously enlarge the image to provide whatever level of detail is necessary.
Computers, on the other hand have this ability to only the most rudimentary degree. It is currently possible, for example, to define only simple images, such as a line, in a computer such that the image retains a high level of detail at any magnification. This is done by storing in the computer a definition of, for example, a line, which specifies the very essence of the line without specifying its qualities at any particular level of magnification. The line is defined in the computer as the concept of a geometric entity extending between two specified points. When desired, this definition is used to produce an image at any required degree of magnification.
If the screen on which an image of the stored definition of the line is to be displayed has a resolution capability of, for example, three hundred dots per inch and the line image is desired to be displayed as an image two inches long, an image is displayed consisting of a display pattern six hundred dots long and, for example, three dots wide. If a larger image is desired to be displayed from the same stored definition of a line, the screen may show an image three dots wide and twelve hundred dots long. It would be desirable to provide a method for representing complex images, such as a black cat, in a computer with the same type of scale-independent resolution.
There is thus a need for a way of representing images in a computer which, although they are input and output using digital devices and are stored in digital form, are actually encoded in a manner which allows the image to be handled as though it were continuous. The solution to this problem would mean that computers treat images in a manner more analogous to the way in which the human mind stores and analyzes images. This solution is believed to be central to many important problems involving image recognition and analysis by digital computational devices.
Applications of image representation include:
(1) Recognition of what is in an image.
(2) Pattern recognition applications.
(3) Check reading machines. An image representation system would allow the recognition of signatures, and the blanking out of extraneous background material.
(4) Machines for detecting man-made objects in an image.
(5) Image analyzers mounted on earth-orbiting satellites for spotting forest fires and monitoring deforestation activities.
(6) Passive transponders for use in supermarkets.
(7) Systems for receiving images at one resolution and outputting them at a higher resolution, such as line art, photographs, and image enhancement systems.
(8) Automatic devices for recognizing people's faces. These may be used in security applications.
(9) High Definition Television. Specific applications include image enhancement, use of the vertical blanking interval to provide additional information, and transmission of compressed image representation data for high-definition images.
(10) Analysis of images of roots of plants for the purpose of providing scientific data concerning the root.
It is therefore desirable to provide an efficient means for image representation which allows digital representation which is resolution independent, and which does not inherently describe discrete images, but rather describes analog (continuous) images. The representation method should apply equally well to digital as to analog images.
It is similarly desirable to develop image compression methods and apparatus whose input is a set of data, corresponding to a two-dimensional array of numerical attributes of a digitized picture, and whose output is a smaller data set from which the original can be regenerated exactly or approximately. It is further desirable to provide improved image compression methods and apparatus which can be employed for exact or non-exact image representation, and which are capable of improving compression ratios by up to several orders of magnitude. Such methods and apparatus should produce digital data which correspond to a given image, and should employ the digital data for image compression, communication, analysis or storage, and subsequent regeneration. Moreover, such methods and apparatus should be capable of representing color and intensity information as an additional dimension of the image, and allow compression and decompression of this color information.
It is also desirable to provide methods and apparatus for automatic determination of parameters which constitute a compressed data set representing an original image and which are capable of producing an approximate representation of the original image by applying the compressed data set to a set of data representing an arbitrary starting image.
It is also desirable to provide methods and apparatus for compressing and decompressing digital data representative of motion pictures using the fractal transform.
Finally, it is desirable to provide methods and apparatus to produce images which, after multiple passes through the complete encoding and decoding process, emerge the same as if they had only been through the process once, and which provide a means for expanding images to higher resolution.
Briefly described, the present invention provides improved methods and apparatus for representing image data in a compressed form in a self-referential manner. The compressed data set is formed in a digital computer by a process of repeated comparisons between image data representing different small pieces of the image, known as domain blocks and shrunken range blocks, and recording the addresses of optimal matches. The image is decoded by an inverse process.
The preferred embodiment of the present invention employs mathematical operations known as local affine transformations. These transformations are employed in the process of encoding digital data representing an image. The encoded output constitutes a "fractal transform" of an image and consists of coefficients of the affine transformations. Different fractal transforms correspond to different images.
The fractal transforms are iteratively processed in the decoding operation. Contrary to intuitive expectation, it has been discovered that if the encoding and decoding procedures of the invention are followed, the original image, or an image that looks like the original image, is produced after a finite number of iterations.
In accordance with the purpose and principles of the invention, there is provided a method for automatically processing digital image data consisting of image information. The method comprises the steps, performed by a data processor, of storing the image data in the data processor; generating a plurality of uniquely addressable domain blocks from the stored image data, each of the domain blocks representing a different portion of the image information such that all of the stored image information is contained in at least one of the domain blocks, and at least two of the domain blocks being unequal in shape; and creating, from the stored image data, a plurality of uniquely addressable mapped range blocks corresponding to different subsets of the image data with each of the subsets having a unique address. The creating step included the substep of executing, for each of the mapped range blocks, a corresponding procedure upon the one of the subsets of the image data which corresponds to the mapped range block. The method further includes the steps of assigning unique identifiers to corresponding ones of the mapped range blocks, each of the identifiers specifying for the corresponding mapped range block an address of the corresponding subset of image data; selecting, for each of the domain blocks, the one of the mapped range blocks which most closely corresponds according to predetermined criteria; and representing the image information as a set of the identifiers of the selected mapped range blocks.
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention, and, together with the description, serve to explain the principles of the present invention.
FIGS, 1(a)-1(d) show a digitized black and white image in the process of dividing the image into domain blocks;
FIGS. 2(a)-2(c) show the process of dividing the image of FIG. 1(a) into range blocks;
FIGS. 3(a)-3(b) show the process of a shifted decomposition of the image of FIGS. 1(a)-1(d) for the purpose of forming additional range blocks;
FIGS. 4(a)-4(b) show the process of producing shrunken range blocks from the range blocks of FIGS. 2(a)-2(c) and 3(a)-3(b);
FIG. 5 is a logic flow chart of method for automatically processing digital image data which constitutes a preferred embodiment of the invention;
FIG. 6 is a block diagram of a data processor for performing the method shown in FIG. 5;
FIGS. 7 and 8 illustrate the process of generating shrunken range blocks;
FIG. 9 shows the process of selecting the shrunken range blocks which most closely resembles a domain block;
FIG. 10 shows the process of producing a Hausdorff distance;
FIG. 11 shows a fractal transform of the image of FIG. 1;
FIG. 12 is a logic flow chart showing a method for automatically creating a fractal transform representative of black and white image data;
FIG. 13 is a logic flow diagram of a method for automatically generating an image by a data processor from a set of identifiers consisting of the fractal transform produced by the method of FIG. 12;
FIG. 14 is a block diagram of a preferred embodiment of apparatus for decoding a fractal transform;
FIG. 15 shows a decompression system which is used to decode the fractal transform of FIG. 11;
FIG. 16 shows the process of applying the fractal transform of FIG. 11 to an image in buffer A of FIG. 15 to obtain an image in a buffer B;
FIG. 17 shows a further stage in the process of FIG. 16;
FIG. 18 shows the production of an output image from the decompression system of FIG. 15;
FIG. 19 is a logic flow diagram of a preferred embodiment of the method of FIG. 13;
FIG. 20 is a logic flow chart of an alternative to the method shown in FIG. 19, in which only a single image buffer is used;
FIGS. 21(a)-21(b), 22(a)-22(b) and 23-24 illustrate the production of a fractal transform representing a grayscale image;
FIG. 25 illustrates a method for representing a grayscale image, having four possible levels of gray, in binary form;
FIG. 26 shows a fractal transform of the grayscale image of FIG. 21;
FIG. 27 is a logic flow diagram showing a method for automatically creating a fractal transform representative of grayscale image data;
FIG. 28 shows a decompression system for decoding the fractal transform shown in FIG. 26 to obtain the original grayscale image of FIG. 21;
FIG. 29 is a logic flow chart of a method for decoding the grayscale fractal transform of FIG. 26;
FIG. 30 is a logic flow chart of a method for compressing and decompressing color images;
FIG. 31 is a block diagram of apparatus which constitutes a preferred embodiment for performing the method of FIG. 20;
FIG. 32 is a logic flow diagram of a method for generating compressed digital data representing image information in a motion picture, by a data processor, for storage or transmission;
FIG. 33 is a logic flow diagram of a method for automatically generating digital data representing the frames of a motion picture;
FIG. 34 is a block diagram of apparatus for providing a videophone;
FIG. 35 illustrates an alternate method of generating a fractal transform;
FIG. 36 illustrates a method for producing a shrunken range block;
FIG. 37 is a diagram illustrating overlapping range blocks;
FIG. 38 is a diagram illustrating an alternate method for retrieving and decoding an image represented by a fractal transform;
FIG. 39 is a block diagram of apparatus for implementing the method illustrated in FIG. 38.
Before describing the preferred embodiment of the invention, background information and discussion will be provided of the nature of the invention in relation to both image compression and image representation.
Many images contain much redundant information. For example, an image of a natural scene may contain a meadow, trees, and sky. Once one knows what a particular blade of grass looks like, one has useful information about other blades. Thus, there are enormous amounts of redundant information in a meadow scene. The pine needles on a pine tree are by no means randomly placed in the image; they are organized by the underlying structure of the tree. The structures of the clouds are governed to a good approximation by briefly expressed equations of physics, such as the Navier-Stokes equations. These examples indicate that significant compression can be achieved of data representing images such as meadows, trees, and sky.
Thus, redundancy is an important factor in image compression and image representation of images such as natural scenes, portraits, computer graphics images which can be expressed in terms of repetition, after processes of affine transformation and contraction. As mentioned earlier, one pine needle in an image of a forest is more or less like any other pine needle in that image. A compressed image does not require description of each pine needle in that image; rather, a single pine needle is described and then its basic information is utilized via mathematical algorithms to reproduce other pine needles in the image in a natural manner. This might be likened to describing one letter in a page of text and then describing the other occurrences of that letter in terms of the first occurrence.
There are essentially two steps in digital image processing. The first involves the transformation of the image into another representation. This often involves data compression, but not necessarily. The second involves recreating the original image, which may involve decompression.
Referring now to the drawings, in which like elements are identified by like reference characters, preferred embodiments of the methods and apparatus of this invention will now be described in detail. First, a data compression method and apparatus in accordance with the invention will be described.
FIG. 1 shows a digitized black and white image 30 formed of a plurality of pixels 32. The image is stored as image data in a data processor, with one bit representing the image value (black or white) of each pixel. The preferred embodiment of the invention employs a plurality of uniquely addressable blocks 34, called domain blocks, which are generated from the stored image data. Each of the domain blocks represent a different portion of the image information such that all domain blocks together contain all of the stored image information.
The stored image data are also used, in the preferred embodiment, to create a plurality of uniquely addressable mapped range blocks. Each mapped range block corresponds to a different subset of the image data, with each of the subsets having a unique address with respect to the image data. Preferably, the range blocks have a greater number of pixels than the domain blocks, and are created by executing, for each of the mapped range blocks, a corresponding procedure upon the subset of the image data which corresponds to that mapped range block. The procedure can include such processes as shrinking, rotating, cropping, and inverting. For example, in the preferred embodiment, the image 30 is broken up into range blocks 36, as shown in FIG. 2, and rotated and inverted to produce additional range blocks 38. Further range blocks 40 may be produced by selecting other subsets of the input digitized image 30, as shown in FIG. 3.
A shrinking process, illustrated in FIG. 4, is preferably applied to the range blocks 36, 38, and 40 to produce shrunken range blocks 42. The shrinking process ensures that the shrunken range blocks 42 contain the same number of pixels as the domain blocks 34.
The concepts of domain blocks and range blocks will be useful in understanding the principles of the present invention which, in one aspect, provides a method, performed in a data processor, for processing digital image data consisting of image information, as shown in FIG. 5. First at step 42, image data is stored in a data processor. Step 44 of FIG. 5 comprises generating a plurality of uniquely addressable domain blocks from the stored image data, each of the domain blocks representing a different portion of the image information such that all of the stored image information is contained in at least one of the domain blocks; that is, all of the domain blocks together contain all of the stored image information. Step 46 comprises creating, from the stored image data, a plurality of uniquely addressable mapped range blocks corresponding to different subsets of the image data with each of the subsets having a unique address, the creating step preferably including the substep of executing, for each of the mapped range blocks, a corresponding procedure upon the one of the subsets of the image data which corresponds to the mapped range block. Step 48 comprises assigning unique identifiers to corresponding ones of the mapped range blocks, each of the identifiers specifying for the corresponding range block a procedure and an address of the corresponding subset of image data. Next, step 50 comprises selecting, for each of the domain blocks, the one of the mapped range blocks which most closely corresponds according to predetermined criteria. Finally, step 52 comprises representing the image information as a set of the selected identifiers.
A block diagram of a suitable data processor 60 is shown in FIG. 6. Data processor 60 includes an input device 62, such as an image scanner. Input device 62 is connected to a central processor unit 64. Central processor unit (CPU) 64 includes a block comparator 66, control logic 68, and a mapping processor 70. CPU 64 is connected to an output device 72, such as a data transmitter or disk drive, and to a memory device 74. The image data is stored in memory device 74. Memory device 74 includes a pair of buffers 76, 78. Buffer 76 is used to store a plurality of domain blocks 34, and buffer 78 is used to store range blocks 36,38,40 and shrunken range blocks 42.
Control logic 68 of CPU 64 executes programs stored in memory 74 to initiate block comparison and mapping functions in block comparator 66 and mapping processor 70, respectively.
In the preferred embodiment, the image data received from input device 62 is formed by control logic 68 into an array of digital data of a predetermined size, such as, for example, 256×256 pixels and, corresponding to step 42 of FIG. 5, is stored into memory 74. According to step 44, the array is then formed into an array of domain blocks 34 each including, for example, sixteen pixels arranged into four rows and four columns. Alternately, domain blocks 34 may be formed with various sizes and shapes, as shown in FIG. 1(d). For example, each domain block may differ from all other domain blocks as shown in FIG. 1(d).
According to step 46, the stored image data is formed into range blocks 36 containing a larger number of pixels than the number of pixels in domain blocks 34. These range blocks are then given unique addresses with respect to the stored image data, corresponding to step 48. In the preferred embodiment, such addresses consist of the x,y coordinates of the lower left pixel of the range block with respect to the array of the entire stored image data. For example, if the image data is stored as an array of pixels two hundred fifty-six pixels wide and two hundred fifty-six pixels high and is formed into four range blocks, the range block in the lower left of the array is assigned an address of 0,0. Similarly, the range block in the upper left of the array is assigned an address of 0,128, the lower right range block is assigned an address of 128,0, and the upper right range block is assigned an address of 128,128.
Additional range blocks 38 are also created in the preferred embodiment by processing the range blocks with local affine transforms such as rotation by 90°, 180°, and 278°, and inversion. In addition to shrunken range blocks 42, an escape block 95 (FIG. 9) is provided which is the same size as the shrunken range blocks, but which has no content (i.e., there is no picture drawn on it).
The method for producing shrunken range blocks will now be described in greater detail, with reference to FIGS. 7 and 8. FIG. 7 illustrates a first embodiment of a method for producing a shrunken range block. As can be seen in FIG. 7, a range block 34 includes a plurality of black and white pixels 32. In the method shown in FIG. 7, known as a direct shrinking method, shrunken range block 42 is the output of the method and range block 34 is the input. Shrunken range block 42 is obtained from range block 34 by the following mathematical operation:
where i and j respectively represent x and y positions of pixels, shown in FIG. 7.
Similarly, FIG. 8 illustrates a shrinking by averaging method, in which shrunken range block 42' is obtained as output from the method when range block 34' is supplied as input. Specifically, the shrinking by averaging method may be expressed mathematically as:
where: f(0)=0; and f(2)=f(3)=f(4)=1.
Unique identifiers are then assigned to the mapped range blocks. Each of the identifiers specify both the address of the subset of image data from which the corresponding range block was created and the procedure which was applied to the mapped range block. In the preferred embodiment, each of shrunken range blocks 42 and the escape block 95 are assigned an identifier. The escape block has a unique identifier. Shrunken range block identifiers include an address and an indication of affine transformations which have been applied to the range block from which the shrunken range block was derived.
In the preferred embodiment, each range block 36 consists of a quadrant of the 256×256 array which constitutes the stored image data. The address of the identifier, as specified above, is the x,y coordinate in the stored image array of the pixel in the lower left corner of range block from which the corresponding shrunken range block was derived. The identifier, in the preferred embodiment, also includes a first code indicating a 0°, 90°, 180°, or 278° rotation, and a second code indicating whether inversion has been performed to produce a range block prior to shrinking. It can be seen that the procedure specification includes the case where no rotation or inversion is applied prior to shrinking.
Next, corresponding to step 50 of FIG. 5, the mapped range blocks are compared to the domain blocks. For each domain block, one of the mapped range blocks is selected which most closely corresponds, according to predetermined criteria, to that domain block.
In the preferred embodiment, each domain block 34 is associated with either a single shrunken range block, or the escape block. This is achieved by means of block comparator 66 (FIG. 9), which selects, from the shrunken range blocks 42 and the escape block 95, the one which is "closest" to the domain block, i.e. most similar to the domain block.
Although addresses of range blocks in the preferred embodiment are x,y pixel coordinates, for purposes of explanation the range block addresses will be expressed as quadrant numbers 1-4, as shown in FIG. 9. Similarly, rotation in FIG. 9 will be expressed as degrees, rather than as a code. In the example shown in FIG. 9, shrunken range block #2 is the closest shrunken range block to input domain block 34. In a similar manner, each domain block of image 30 is processed by block comparator 66 to select the closest shrunken range block 42 (or escape block 95).
As noted previously, domain blocks may be created in different shapes. In an alternative embodiment, sets of range blocks are created, with the shape of the blocks of a set being the same, and the shape of the blocks of each set corresponding to the shape of a domain block.
Block comparator 66 of FIG. 9 will now be described in greater detail. The purpose of block comparator 66 is to determine, for each domain block, which of the shrunken range blocks is most similar in appearance to the specified domain block. That is, which of the shrunken range blocks is "closest" to the domain block. This alternative statement implies an analogy which is useful in understanding the concept of comparisons between blocks of image data. That concept is referred to as "distance." In order to evaluate "distance" between blocks, consider the concept of distance between points in space. If two points A and B are present in a two-dimensional coordinate system, their positions within the coordinate system may be represented by xA,yA and xB,yB, respectively. The distance between the points is thus the square root of the sum (xA -xB)2 +(yA -yB)2. This procedure yields the distance between points A and B "as the crow flies", and is referred to as the Euclidean distance.
Another way of thinking about the distance between points A and B mentioned above is to consider that such points represent locations in a large city made up of a matrix of perpendicular streets. The distance between points A and B could then be determined "as the taxi drives" rather than "as the crow flies", and is represented as (|xA -xB |)+(|yA -yB |). Such distance has been termed the "Manhattan" distance.
From the concept of distance between two points, consider the concept of distance between a single point and a set of a plurality of other points. Using any convenient concept of distance, such as the Euclidean or Manhattan distance discussed above, the distance between a point and a set may be thought of as the sum of the distances from the point to each individual point within the set.
Using the concept of distance from a point to a set, the distance between two sets of points may be considered. A very general description of the distance between two sets is a "sum of a sum." That is, a first point of the first set is selected. The distance between this point and each point in the second set is calculated. Next, a second point is selected from the first set. The distance between this second point and each point of the second set is then calculated and added to the first set. In a similar manner, distances between each succeeding point of the first set and all of the points of the second set are calculated and summed to yield the distance between the two sets of points.
The concept of distances between two sets is employed in calculating a distance between two groups of image data, for the purpose of selecting, from a group of shrunken range blocks, the shrunken range block which is most similar to a domain block. In particular, the preferred embodiment makes use of a mathematical concept known as the Hausdorff distance. This concept is well known in the art and is discussed, for example, in Fractals Everywhere by Michael F. Barnsley.
The Hausdorff distance H between two blocks of image data f and g can be expressed as H (block f, block g). In the preferred embodiment, block comparator 66 calculates the quantity H between a domain block and each of the shrunken range blocks. The shrunken range block which yields the lowest value of H is selected as the "closest" shrunken range block to the specified domain block.
This concept may be more readily appreciated by reference to FIG. 10, in which (a) and (b) respectively show two blocks of black and white image data, namely, block f and block g. Block f consists of a cross of black pixels plus an additional black pixel in the upper right hand corner. Block g consists of a square formed of a block of sixteen black pixels. Directly below the image blocks f and g in FIGS. 10a and 10b are binary representations of the image data contained in blocks f and g. Specifically, the binary representation of blocks f and g consists of a matrix of zeros (0's) and ones (1's), with 0's representing a white pixel and 1's representing a black pixel.
Directly below each binary block f and g is a distance table for the respective binary block. The distance table consists of a matrix of numbers each corresponding to one of the pixels in the blocks f and g. The number in each position of the distance tables for image blocks f and g represent the number of pixels between the pixel corresponding to that position and the closest position corresponding to a black pixel (or in the binary block, a 1). For example, the upper left hand entry of distance table f in FIG. 10a is a 4. This represents the fact that moving only in horizontal and vertical directions, not diagonal, (the Manhattan distance concept), there are four pixels between the upper left hand pixel of image block f and the closest black pixel. This can be seen by beginning at the upper left hand pixel, counting over three pixels to the right and down one pixel.
The entry immediately to the right of the left hand entry of the distance table for block f is the number 3. This indicates the fact that starting from the pixel just to the right of the upper left hand pixel of block f, there are three pixels between the specified pixel and the closest black pixel. This can be seen by counting over two pixels to the right and down one pixel. In a similar manner, each entry of the distance table for image block f is determined. Also, a distance table is computed in the same way for image block g.
The lowest blocks of FIG. 10 represent the distance table f intersected by binary block g, and the distance table g intersected by binary block f. A value D is computed equal to the sum of the numbers of the two intersection figures. As can be determined from FIG. 10, the sum of the numbers of the distance table f intersected by binary block g is 25 and the sum of the numbers of distance table g intersected by binary block f is 4, yielding a value D equal to 29. A modified Hausdorff distance H for image blocks f and g can be expressed as follows: H (block f, block g)=D (block f, block g)+D (1-block f, 1-block g). The term "1-block f" is the inverse of image block f, and thus is an image block in which each pixel is the opposite of a corresponding pixel of block f.
Block comparator 66 calculates quantity H between a selected domain block and each shrunken range block, and chooses as the selected shrunken range block, that shrunken range block which yields the lowest value of H.
Alternative embodiments are, of course, possible. For example, a modified Hausdorff distance between blocks could be calculated, using the concept of Euclidean distance rather than Manhattan distance. Similarly, block comparator 66 could employ distance measuring concepts other than the Hausdorff distance to select a shrunken range block which is most similar to each domain block.
Once the selection of mapped range blocks is completed, the image information is then represented as a set of the unique identifiers corresponding to the selected mapped range blocks, corresponding to step 52 of FIG. 5. The list of identifiers of the selected range shrunken range blocks 42, (including both addresses and local affine transform procedures, such as rotation, reflection, or inversion, to be performed on the data specified by the address) constitutes the "fractal transform" 98 of image 30, as shown in FIG. 11. Each domain block 34 of image 30 is represented by an address 99 of a shrunken range block. For example, the domain block in the upper left corner of image 30 may be closest to shrunken range block #3. The domain block immediately to the right of the upper left domain block may be closest to shrunken range block #5 rotated 90°. The next domain block to the immediate right may be closest to the Escape block 95. In such example, the first three addresses of fractal transform 98 would be 3, 5(90), E, as shown in FIG. 11. The set of identifiers can thus be stored, transmitted, or analyzed.
FIG. 12 shows in detail a preferred embodiment of a method of automatically creating a fractal transform representative of black and white image data according to this invention. At step 100, digital image data is stored in buffer A of a data processor. Preferably that image data consists of binary information representing a black and white image. A range block size should be preselected so that when the input image is stored in buffer A, range blocks are automatically assigned to the different digital image data in buffer A.
At step 102, range block pointers for buffer A and shrunken range block pointers for buffer B are initialized. The size of the input image data array and the sizes of both the range blocks and the shrunken range blocks are predetermined values. Therefore, these pointers, consisting of x,y coordinates in buffers A and B, can be determined.
At step 104, a shrinking process is applied to the range block in buffer A specified by the range block pointer. In certain applications, local affine transforms, such as rotation, reflection, or inversion, may be applied to the range block prior to shrinking to obtain a greater number of shrunken range blocks for a given input image. The shrunken range blocks are then read into the locations in buffer B identified by the shrunken range block pointers.
The range block pointers for buffer A and the shrunken range block pointers for buffer B are then incremented at step 106. A determination is made at step 108 to see whether all of the range blocks in buffer A have been shrunk. If not, steps 104 and 106 are repeatedly executed until all, range blocks in buffer A have been shrunk.
Next a domain block pointer in buffer A is initialized (step 112) and the shrunken range block pointer in buffer B is initialized (step 114). At step 116, the Hausdorff distance between the domain block specified by the domain block pointer and the current shrunken range block specified by the shrunken range block pointer is determined.
If the Hausdorff distance just computed is less than the currently stored distance value (which is initialized to the largest possible Hausdorff distance), then at step 118 the currently stored distance value is replaced by the distance value most recently computed. The current shrunken range block pointer value is also stored. If the most recently computed Hausdorff distance is not less than the currently stored distance value, the most recently computed distance value is discarded.
At step 120, the shrunken range block pointer is incremented and a determination is made whether all of the shrunken range blocks have been checked. If not, steps 116 and 118 are repeated until all shrunken range blocks have been checked. If so, the currently stored shrunken range block pointer, consisting of x,y coordinates, and the associated procedure information (reflection and inversion), is then appended to the list of identifiers representing the domain blocks of the input image data stored in buffer A (step 124).
Next, the domain block pointer is incremented at step and a determination made whether all domain blocks have been processed. If not, steps 116-126 are repeatedly executed until all domain blocks have been processed. The list of identifiers, each corresponding to one of the domain blocks of the original input data, is then output at step 130 as the fractal transform of image data representing the black and white image supplied as input to the data processor.
In the preferred embodiment, the identifiers of the shrunken range blocks are expressed as follows.
X is an eight bit value representing the x-coordinate of the lower left corner of the range block in the original image array;
Y is an eight bit value representing the y-coordinate of the lower left corner of the range block in the original image array;
rr is a two-bit value representing rotation as follows:
10=180° rotation, and
i is a one-bit value representing inversion as follows:
0=no inversion, and
Although in the preceding examples, transform processes such as rotation and inversion have been performed on shrunken range blocks prior to comparison with domain blocks in the encoding process, rotations and inversions may be performed instead on domain blocks. The result is mathematically equivalent.
In another aspect, the present invention provides a method for generating an image by a data processor from a compressed data set consisting of a set of identifiers. The data processor includes a memory having a plurality of buffers each having a plurality of addressable areas specified by a buffer address. Each of the identifiers corresponds to an addressable area in the buffers and includes a buffer address and a procedure specification. As shown in FIG. 13, the method includes a first step 140 comprising inputting the set of identifiers. Step 142 comprises storing a predetermined pattern of digital data in one of the buffers designated as a source buffer. Step 144 comprises determining, for each of the identifiers, a pattern of data corresponding to each identifier by applying the procedure specified in that identifier to the portion of the source buffer indicated by the buffer address in that identifier. Next, a step 146 comprises storing the pattern of data into the addressable area of another one of the buffers, designated as a destination buffer, indicated in the corresponding identifier. A step 148 comprises repeating the determining and destination buffer storing steps, with the destination buffer being considered as the source buffer, until predetermined criteria are met. Finally, a step 149 comprises providing the contents of the destination buffer as data representative of an image when the predetermined criteria are met.
FIG. 14 shows a data processor 150 for executing the method of FIG. 13. Data processor 150 includes an input device 152 such as a data receiver or a disk drive. Input device 152 is connected to a CPU 154 which includes control logic 156, a counter 158, and a pattern generator 160. A memory device 162 is connected to CPU 154 and includes a pair of buffers 164 and 166. An output device 168 is also connected to CPU 154 and may comprise a CRT display device.
FIG. 15 illustrates a system for carrying out a preferred method of the invention for recovering the image from fractal transform 98. First, a predetermined pattern of digital data is stored in one of the buffers designated as a source buffer. As shown in FIG. 15, digital data representative of an initial image 202 and fractal transform 198 are input to a decompression system 204, which preferably comprises data processor 150. Initial image 202 is loaded into a buffer A, designated the source buffer.
Decompression system 204 then determines, for each of the identifiers, a corresponding pattern of data. The corresponding pattern is determined by applying the procedure specified by that identifier to the portion of the source buffer indicated by the identifier's buffer address. Decompression system 204 then stores the resulting pattern into a corresponding addressable area of another one of the buffers, buffer B, designated as a destination buffer.
This procedure is demonstrated in FIG. 16. In that Figure, a buffer A acts as a source buffer and is filled with data representative of initial image 202. A buffer B acts as a destination buffer and is partitioned into decode domain blocks 206. Each of the decode domain blocks 206 corresponds to one identifier of input fractal transform 198. In determining the pattern of data to be stored into each decode domain block 206, the corresponding identifier of the domain block is used. As described above, each identifier in fractal transform 198 consists of an address and a procedure specification. The address represents a range block derived from a specified portion (for example, the lower left quadrant) of a set of data representative of an input image. In the decompression process, the address of the identifier corresponding to a decode domain block 206 is used to specify the same portion, e.g. the lower left quadrant, of the data set stored in the source buffer, buffer A of FIG. 16, which represents initial image 202. This portion of the data stored in buffer A is then processed by the procedure specified by the identifier corresponding to the domain block and the processed data further processed by shrinking. The processed and shrunken data is then stored into a corresponding decode domain block in buffer B.
For example, if an identifier corresponding to a specified decode domain block 206 of buffer B consists of "1(90)", this represents an address and a procedure. The address indicates that range block #1 is involved, consisting of the lower left quadrant of an image. The procedure specifies rotation by 90°. Thus, to derive the digital data to be stored into the specified decode domain block, the data representing the lower left quadrant of the image in buffer A is operated on by a procedure to rotate the corresponding image by 90° and the data is then processed by a shrinking algorithm to obtain a shrunken range block in the manner discussed above with respect to the process of forming the fractal transform. The resultant data representing the shrunken range block is then stored into the specified decode domain block of buffer B.
In a similar manner, each of the decode domain blocks 206 is filled with data specified by the corresponding identifier of fractal transform 98. If the address of the corresponding identifier specifies the escape block, i.e., a block containing image data representing a blank image, an escape block is stored in the corresponding decode domain block.
In the preferred embodiment of the invention, the preceding two steps of (1) filling buffer A with image data and (2) filling all decode domain blocks of buffer B with digital data representing shrunken range blocks of buffer A specified by the identifiers of the fractal transform, are repeated until predetermined criteria are met, as shown in FIG. 18. During this repetition, instead of filling buffer A with data representing the initial image 202, the image data in buffer B (FIG. 16) is read back into buffer A. This can be observed by noting that the content of buffer B of FIG. 16 is stored in buffer A of FIG. 17.
The method concludes with providing the contents of the destination buffer as data representative of an image when the predetermined criteria are met.
Thus, the steps of FIGS. 16 and 17 are repeated a certain number of times, until "convergence" is achieved. The number of iterations, as monitored by counter 158 (FIG. 14), depends on the dimensions (measured in pixels) of the domain blocks and range blocks and may consist of a fixed number of iterations. Alternatively, the iterations may be determined by measuring the difference between the image data in buffers A and B and terminating the iteration process when the difference is less than a predetermined value.
FIG. 19 shows a detailed description of a preferred method for automatically generating an image by a data processor according to the present invention from a set of identifiers consisting of the fractal transform of an original image. The fractal transform could be generated from the method in FIG. 12 or any other method which can generate a set of identifiers such as produced by the method of FIG. 12.
At step 250, a buffer A, comprising an image buffer in the data processor, is initialized with initial image data representing a solid black image (i.e., all 1's). Any initial image could be used. However, all-black is a convenient and easily stored set of image data.
At step 252, a main loop counter (the functions of which may be provided by counter 158) is initialized to zero. The main loop counter indicates the numbers of times the image generation steps of FIGS. 16 and 17 have been repeated. This number may be compared to a predetermined value selected for the specific application, to end the iteration process.
At step 254 a domain block pointer is initialized for a second buffer, buffer B, which has been previously divided into domain blocks. Also at step 254, a fractal transform pointer is initialized to point to the first identifier of the fractal transform representing the input compressed image data.
At step 256, the identifier specified by the fractal transform pointer is applied to image data in buffer A. The address in that identifier specifies a range block in buffer A, and the process of that identifier is then applied to the specified range block. As noted previously, the identifier could also specify the escape block. Next, a shrunken range block is constructed from the processed, specified range block from buffer A and the shrunken range block (or the escape block) is read into a domain block in buffer B pointed to by the current value of the domain block pointer. The technique of obtaining a shrunken range block can use any of the shrinking techniques described above, or may use a different technique altogether.
At step 258, the domain block and fractal transform pointers are incremented. A determination is then made at step 260 whether the last identifier of the input fractal transform has been processed. If not, the method loops back to step 256.
If the last fractal transform identifier has been processed, the method advances to step 262 in which the main loop counter is incremented. A determination is made at block 264 whether the main loop counter has reached a maximum value. If not, the contents of buffer B are transferred to buffer A, as shown at step 266, and the method loops back to step 254. After a predetermined number of iterations of steps 254-266, the contents of buffer B are supplied as output data representing the original uncompressed image.
The method shown in FIG. 19 provides an iterative process in which the number of iterations are specified by a predetermined value. Alternatively, the iterations of the method shown in FIG. 19 could continue until the contents of buffer B only differ from the contents of buffer A by less than a predetermined amount. This method, known as the convergence method, may be further described as follows. After the step in which the contents of buffer B have been computed, the following steps are carried out:
i) initialize a and b, respectively consisting of a pointer to a domain block in buffer A and a pointer to a domain block in buffer B which has the same relative position in buffer B as the domain block in buffer A pointed to by a.
ii) initialize an integer register to zero.
iii) use a block comparator, such as comparator 66, to compute a distance between the domain block pointed to by a and the domain block pointed to by b.
iv) increment the register value by this distance.
v) increment pointers a and b.
vi) repeat steps (iii) and (iv) until all domain blocks have been processed.
vii) store the register value as a final register value.
viii) repeat steps (i)-(vii) each time the contents of buffer B are recomputed and compare the successive final register values.
ix) cease iterations shown in FIG. 19 when successive final register values differ by less than a predetermined threshold value.
As will be apparent to those of ordinary skill in the art equivalent implementations of the present invention could be provided. For example, the original image can be generated from the compressed fractal transform by use of only a single image buffer, as shown in FIG. 20. FIG. 20 identifies the steps in an alternative embodiment of the invention for a method of generating an image by a data processor from a set of identifiers. The data processor includes a memory having an image buffer with a plurality of addressable areas specified by a buffer address. Each of the identifiers corresponds to an addressable area in the buffer and includes both a buffer address and a procedure to be applied to the data in the area identifier by the corresponding address. First a predetermined pattern of digital data for an arbitrary image is stored in the image buffer. This is indicated at step 300 in which image data representing an arbitrary input image is stored in an image buffer. The set of identifiers, comprising a fractal transform, is provided as input to a data processor as shown in block 304. For each addressable area of the image buffer, a pattern of data corresponding to that identifier is determined by applying the procedure in that identifier to the portion of the image buffer indicated by the buffer address of that identifier. That data pattern is then stored back into the same area of the image buffer indicated by the buffer address for the corresponding identifier.
As shown in FIG. 20, these steps are performed by setting a pointer to a first domain block in the image buffer (at step 306). Next, at step 308, the address of a range block corresponding to the image block specified by the pointer is read. A shrunken range block is then constructed from the image data in the image buffer, as indicated in block 310. Next, the data present in the domain block of the identifier is then replaced by the data from the shrunken range block, as indicated at step 312.
The steps of identifying and storing are then repeated until a predetermined criteria are met, and the contents of the image buffer are provided as data representative of an image. As shown in step 314, the domain block pointer is incremented and a determination made at step 316 whether all domain blocks have been processed. If not, steps 308, 310, and 312 are repeated until all domain blocks are processed. A determination is then made at step 318 whether the contents of the image buffer are stable, that is, differ by less than a predetermined amount from the previous contents. This determination may be made by performing steps (i)-(vii) of the convergence method described above. When the predetermined threshold value of the final register value is reached, the contents of the image buffer are then provided as output representative of the original compressed image, as indicated at step 320.
The present invention is suitable for processing grayscale images as well as for processing black and white images. A grayscale image is an image formed of pixels which may have any one of a plurality of graduated light intensities, ranging from completely black to completely white. FIGS. 21-24 illustrate a preferred process by which a fractal transform of an input digitized grayscale image 360 is found. Image 360 is divided into domain blocks 362, and range blocks 364 as shown in FIGS. 21 and 22, respectively. Additional range blocks may also be created by procedures such as rotation and reflection, as described previously with respect to black and white range blocks.
A shrinking process is then applied to the range blocks to produce shrunken range blocks 366, as shown in FIG. 23. The shrinking process is such that the shrunken range blocks contain the same number of pixels as the domain blocks and can employ shrinking techniques as described above with respect to black and white images. However, unlike the procedure for processing black and white images, there is no escape block included among the shrunken range blocks. Each pixel of the domain blocks and shrunken range blocks has a number associated with it which represents its grayscale value, i.e. the brightness of the pixel. For example each pixel in image 360 (FIGS. 21 and 22) has a grayscale value of 0-255.
As shown in FIG. 24, each domain block 362 is compared to shrunken range blocks 366 and is associated with a single shrunken range block 369 which most closely corresponds to the domain block. This association will be described below in greater detail with respect to FIG. 30 and is performed by a block comparator 368 which compares the grayscale values of the pixels of each block to grayscale values of pixels in each shrunken range block 366. To assist in finding a shrunken range block 369 which closely corresponds to a domain block, vertical scaling parameters P and Q may be applied to domain block pixel grayscale values VGS to obtain a new pixel grayscale value V'GS =PVGS +Q.
FIG. 25 provides further explanation of the processing of grayscale images. A grayscale image 400 formed of pixels 401 having four possible levels of gray can be represented in binary form as shown at 402. Thus, each pixel in binary representation 402 has its intensity level represented by a value of 0-3.
Shrunken range blocks 366 can be constructed from the binary representation 402. First, four binary representation of range blocks 364 can be constructed as the lower left (1), lower right (2), upper left (3), and upper right (4) quadrants of binary image representation 402. These range block binary representations are then processed by shrinking techniques as described above to form shrunken range blocks 404.
Binary representation 402 is also divided into binary domain blocks 406. The binary domain blocks are numbered 1-16 in order from left to right and from bottom to top of binary representation 402. Each of binary domain blocks 406 is a 2×2 pixel array of non-overlapping subsets of binary image representation 402. The domain block size is chosen to be the same as the shrunken range block size.
Using a value of P equal to 0.5 and values of Q as indicated in FIG. 25 to compute new pixel grayscale values V'GS =PVGS +Q, the Hausdorff distances between each binary domain block 406 and each binary shrunken range block 404 are calculated, and the most similar binary shrunken range block 404 is selected for each binary domain block 406. The results are shown in table 408 of FIG. 25. Table 408 shows that domain blocks 1-6, 8-10, and 14 are each most similar to shrunken range block 1; domain blocks 7, 11, and 16 are most similar to shrunken range shrunken range block 2; and domain blocks 12, 13, and 15 are most similar to shrunken range block 3. The fractal transform 410 of image 400 then consists of the sequential list of shrunken range block numbers along with vertical scaling parameters P and Q, as shown in table 408 and in FIG. 26.
The corresponding fractal transform 410 for grayscale input image 60 is thus a list of identifiers consisting of the "addresses" of the shrunken range blocks and associated vertical scaling parameters, one address and set of vertical scaling parameters being associated with each domain block, as shown in FIG. 26. Although no procedures, such as rotation and inversion, have been discussed in the explanation of FIG. 25 in order to avoid unnecessary complication of explanation, the preferred embodiment employs such procedures, and the codes specifying the procedures are included in each identifier of the fractal transform.
FIG. 27 shows in detail a preferred method for automatically creating a fractal transform representative of grayscale image data in accordance with the present invention. At step 500, digital image data representing a grayscale image is stored in buffer A of a data processor. At step 502, a range block pointer for buffer A and a shrunken range block pointer for buffer B are initialized. At step 504, predetermined procedures are applied to the range block of buffer A specified by the range block pointer. Such procedures include local affine transforms, such as rotation, reflection, or inversion prior to shrinking to obtain a greater number of shrunken range blocks for a given input image. The processed range blocks are then stored into buffer B at the locations indicated by the shrunken range block pointers.
The range block pointer for buffer A and shrunken range block pointer for buffer B are then appropriately incremented at step 506, and the range is examined at step 508 to see whether all range blocks have been accessed. If not, steps 504 and 506 are repeatedly executed until all range blocks have been accessed. A domain block pointer for buffer A is initialized at step 512 and the shrunken range block pointer for buffer B is initialized in step 514.
At step 516, vertical scaling parameters P and Q are determined to minimize the L distance between the domain block addressed by the domain block pointer and the shrunken range block addressed by the range block pointer. As is well known to those skilled in the art, L distances are used to measure the distances between graphs of functions rather than between sets of points. A digitized grayscale image can be thought of as a function formed from a two dimensional array of indices representing pixel locations in an image indicating the intensity value associated with the pixels. That is, the function f(i,j) represents the intensity at pixel i,j where i,j specify the location of the pixel in the image array. An L distance compares two functions by appropriately summing and in some way averaging the differences between the intensities at each pixels. It is an L2 distance if the differences are squared before they are summed, in which case the "averaging" is achieved by taking the square root of the sum. It is an L1 distance if the absolute values of the differences are utilized. If the L distance between two images is small then the two images look alike. L distances have the advantage that they generally can be calculated faster and easier than Hausdorff distances. In particular, a weighted L2 distance DL is used in the preferred embodiment to select vertical scaling parameters P and Q and is expressed as;
DL =|xi -yi |2 wi
where: xi,yi are indexed intensity values in respective images, wi are non-negative numbers, and N is the number of pixels in each image.
The distance between digital grayscale images A and B (or blocks taken therefrom) can be measured using both Hausdorff distances and using L distances. In the first case the images are treated as a sets of points in a three dimensional array and in the second case they are treated as functions. In the embodiment shown in FIG. 27, L2 distances are used in selecting P and Q values.
At step 518, the Hausdorff distance between the domain block specified by the domain block pointer and the shrunken range block specified by the shrunken range block pointer and scaled by P and Q is determined. The Hausdorff distance is computed in the same manner as described with respect to FIGS. 10a and 10b. A determination is then made at step 520 if the value computed at step 518 is less than the currently stored value. If so, the currently stored value is replaced by the value just computed at step 518, along with the identifier of the shrunken range block which was used to generate the value just computed. If the value computed at step 518 is not less than the currently stored value, the value just computed is discarded.
At step 522, the range block pointer is incremented and a determination made as to whether all range blocks have been checked. If not, the method of FIG. 22 loops back to steps 516-522 until all shrunken range blocks have been checked.
The identifier stored by the loop consisting of steps 516-522 is then appended at step 526 to a list of identifiers each representing one of the domain blocks of the input image data stored in buffer A. The domain block pointer is incremented at step 528 and a determination made whether all domain blocks have been processed. If not, steps 516-528 are repeatedly executed until all domain blocks have been processed. The list of identifiers, each corresponding to one of the domain blocks of the original input data, is then output at step 532 as the fractal transform according to this method of image data representing the input grayscale image.
FIG. 28 illustrates how a grayscale image is recovered from a fractal transform 410 (which includes scaling parameters). An arbitrary initial image 534 and a fractal transform 478 are input to a decompression system 536, preferably embodied in a data processor. Initial image 476 is loaded into a buffer A. A buffer B is partitioned into domain blocks; and into each domain block is read a shrunken range block which is specified by the corresponding address of fractal transform 410, scaled as specified by the vertical scaling parameters. The shrunken range block is constructed from initial image 534 in buffer A. Image 534 in buffer A is treated, addressed, and processed into shrunken range blocks, in exactly the same manner as the original image. Each of the identifiers forming the grayscale fractal transform corresponds to one of the domain blocks in buffer B of FIG. 28 and is used to select a shrunken range block from buffer A to read into the corresponding domain block, thus forming an interim image in buffer B. The interim image in buffer B is now read back into buffer A, and buffer B is cleared. The steps of reading into each domain block of buffer B a shrunken range block of buffer A specified by a corresponding address of the fractal transform to form an interim image, and reading the interim image of buffer B into buffer A are repeated either a prescribed number of times or until "convergence" is achieved.
In general, the number of iterations of the steps of placing shrunken range blocks in buffer B and replacing contents of buffer A with contents of buffer B depends on the dimensions (measured in pixels) of the domain blocks and range blocks. The number of iterations may also be determined experimentally, by detecting convergence, defined as when the successive images in buffer B do not change by more than a predetermined amount. The decoded image is the one which is finally obtained after the iterative process is complete.
FIG. 29 shows a logic flow diagram which constitutes a preferred embodiment for decoding a grayscale fractal transform such as the one generated by the method of FIG. 27. First, an initial image is supplied to buffer B, as indicated at step 550. Next, a main loop counter, a domain block pointer for buffer B, and a fractal transform pointer are initialized, as indicated in step 552. The next entry of the fractal transform as specified by the fractal transform pointer, is obtained at step 554 and a corresponding shrunken range block is created from buffer A. The range block is then scaled with vertical scaling parameters P and Q and read into a domain block of a corresponding position in buffer B. At step 556, domain block pointer for buffer B and the fractal transform pointer are incremented. A determination is made at step 558 whether the last domain block and fractal transform have been processed. If not, the method loops back through steps 554 and 556 until each entry of the fractal transform has been processed.
The main loop counter is incremented at step 560. If the prescribed number of iterations, has not been reached (Step 562), the method loops back to step 552 and creates a domain block in buffer B from each fractal transform entry. The process continues until the prescribed number of iterations has been reached. At that time, the contents of buffer B are provided as data representative of the grayscale image previously compressed into the input fractal transform.
A numerical example of the construction of a grayscale fractal transform using vertical scaling parameters will now be described. Using the procedure shown in FIG. 29 with 8×8 domain blocks and 16×16 range blocks, the 256×256 grayscale was converted to digital data. The original image data required 65,536 bytes of memory for storage. After processing using the method of FIG. 22, a fractal transform was produced which required 2,560 bytes of memory for storage.
Other sizes of domain blocks and range blocks, as well as different numbers of range blocks could, of course be used. Decreasing the block size increases the number of blocks and increases the fidelity of the compression/decompression process. That is, the difference between the original and decoded images is reduced. Exact compression results when there is no difference between the original image and the decompressed image when viewed at a specified screen resolution. However, decreasing the block size and increasing the number of possible range blocks also increases the length of search when determining the closest shrunken range block. This in turn increases the processing time for a given type of computer or increases expense if a more powerful computer is used to eliminate the potentially greater processing time.
The present invention also provides a method for enhancing images. Image data representing a grayscale image at a first resolution is stored in the data processor. For example, data from an image comprising an array of 256×256 pixels is supplied as input to the method of FIG. 27. A fractal transform is obtained using the method. The fractal transform is then decoded at a second resolution higher than the first resolution to produce output image data by decoding the fractal transform using the method of FIG. 29 including a pair of larger buffers to produce an output image array larger than 256×256. For example, use of buffers in the method of FIG. 29 to provide a 512×512 output array yields an image having a resolution of twice that of the original input image. If a typeface is used to form a set of input images, this technique can be used to provide a scalable font. That is, fractal transforms representing the symbols of the typeface can be decoded to any desired resolution to provide multiple fonts of the type face symbols at any desired size.
The invention may also be used to compress and decompress color images, as shown in FIG. 30. Digital data representing a color image is input and a trio of grayscale fractal transforms are produced, one for each of primary colors red, green, and blue. The three fractal transforms are concatenated to form a color fractal transform. To reproduce the original color image from the compressed data of the color fractal transform, the color fractal transform is separated into individual fractal transforms representing grayscale fractal transforms of red, green, and blue images. The individual fractal transforms are then decoded using, for example, the method shown in FIG. 29, to produce red, green, and blue intensity images. These intensity images are combined in a manner well known in the art and are output as a decompressed color image.
While the algorithms for decoding of the grayscale fractal transform can be implemented in a wide variety of general purpose computers, it will be appreciated that the small variation in operations required and large numbers of operations can be efficiently embodied in a special purpose computation device. Accordingly, preferred apparatus for processing digital image data using the methods described above is shown in FIG. 31.
The apparatus of FIG. 31 includes a host interface 600, memory 602, 604, 605, and 606, a memory interface circuit 610, a digital signal processor 612, and display output interface 613 on a printed circuit board which is compatible with PC/AT type computers based on the Intel 80286 central processing unit.
The digital signal processor 612 and the memory interface 610 are connected to a PC expansion bus for receiving commands and data. The preferred digital signal processor 612 is a TMS320C30 manufactured by Texas Instruments Incorporated. Details concerning the operation of the preferred digital signal processor 612 are available in the literature supplied by the manufacturer.
It will be understood that while the digital signal processor 612 employed in the disclosed embodiment is capable of performing a wide variety of floating point operations, the purpose for which it is used in the present invention is to provide high speed implementation of the arithmetic portions of a fractal transform decoding method, such as shown in FIG. 29. Accordingly, it will be understood that the other functions which could be carried out by the digital signal processor 612 are not employed in the disclosed embodiment. In particular, although the digital signal processor 612 generally operates on thirty-two bit data, in the disclosed embodiment, it adds and multiplies signed eight bit data provided by the memory interface 610 in response to a sequence of instructions contained in the program code ROM 602.
These primary components operate to decode a set of range block addresses and transfer the results of the decoding process to the screen buffer, 604 and 605 forming display memory banks A and B, which in the disclosed embodiment consists of a single 262,144 by 4 bit multiport video RAM TMS44C251 manufactured by Texas Instruments Incorporated. Details concerning the operation of the preferred display memory banks A and B are available in the literature supplied by the manufacturer.
In the disclosed embodiment, the data set representing an image is an array of 256 pixels by 256 pixels, although it will be appreciated that the size of this array is arbitrary and that a larger array gives rise to greater resolution. Moreover, it should be understood that the data set representing the image is the same for the display resolution, the screen buffer resolution, and for all arithmetic calculations. In the disclosed embodiment, each pixel intensity value is represented by an eight bit value so that images having 256 gray or pseudo-color intensity levels can be decoded, although it will be appreciated that the size of this array is arbitrary and that more than eight bits per pixel gives rise to more than 256 intensity levels, while less than eight bits per pixels gives rise to less than 256 intensity levels. In particular, twenty four bits per pixel would give rise to sufficient intensity levels to describe 256 intensity levels each of red, green and blue primary components.
The preferred display memory banks A and B, although physically one device, are conceptually treated as two banks of memory. One bank is thought of a containing the "current image" and is used as the source of image data. The other is thought of as containing the "new image" and is used as the destination of image data. During the iterative decoding process, the roles of the memory banks are interchanged. The banks are distinguished by a memory start address offset which in the case of bank A is 0 and in the case of bank B is 131,076 (measured in four bit memory locations). Each bank is of sufficient size to contain an entire 256×256×8 bit image. The memory interface 610 contains address generators to generate arrays of data corresponding to square subimages. The subimages are determined by a row and column address of the upper left hand corner of the subimage and a size. The subimage with upper left hand corner row equal to R and column equal to C and dimension S is denoted by sub(R,C,S). Sub(R,C,S) contains S times S pixel locations and contains all the pixel locations from row R to row R+S-1 and from column C+S-1.
The host interface 600 receives and transmits signals and data from the expansion bus 611 of an IBM PC/AT on PC address, data and bus control lines 615. Data and addresses are sent to the memory interface 610 on the lines 617. The memory interface 610 consists of memory address generators and address sequencers. Two types of data are transmitted to the memory interface 610. Image codes are placed into and retrieved from program data RAM 606 which is 4096 by 8 bits. The image code is preceded by a byte of data, the format byte. The low four bits, bits 0,1,2,3, of the format byte determine the domain block size and therefore the range block size, since the range block size is always twice the domain block size in the disclosed embodiment. Valid values of the domain block size are 4-16. Both the domain blocks and range blocks are square in the disclosed embodiment. Thus, one dimension completely specifies the domain block size.
The format byte is stored in a static RAM format register in the memory interface 610. The format byte is used by the digital signal processor 612 to compute the actual dimensions of the displayed image in pixels. The dimension of the displayed image may be somewhat less than 256 by 256. It is determined as the largest number of pixels which is a multiple of the domain block size and which is simultaneously no larger than 256. For example, if the domain block size is 5, then the image width and height in pixels is 255 and not 256. This is because 51 times 5 is 255, which number is not larger than 256, while 52 times 5 is 260, which exceeds 256. The number is computed by integer dividing 256 by 5 and then integer multiplying by 5. A list of image size values as a function of format value is now provided in the format i,f; where i is image size and f is format value:
256,4; 255,5; 252,6; 252,7; 256,8; 252,9; 250,10; 253,11; 252,12; 247,13; 252,14; 255,15; 256,16.
The result is stored in an eight bit image size static RAM register in the memory interface 610.
An address sequencer in the memory interface 610, using the format register value, generates addresses in the program data RAM 606 to store the image codes which are transmitted from the host interface 600 into the memory interface 610. The program data RAM 606 consists of 4096 memory locations, each one byte wide. An image code may consist of up to 2048 codes, each of which occupies two bytes of the program data RAM. CODELENGTH, the number of two-byte program data RAM words which contain valid data, is the square of (the value in image size divided by the value in format). CODELENGTH varies between 256 and 2048 as the value in format varies between 4 and 16. The sixteen bits of the first CODELENGTH words in the program data RAM contain both address and transform information. The partitioning of each such word between address and transform information depends on the value in the format register according to the following formula:
______________________________________Format Value Address Bits Transform Bits______________________________________4-7 0-11 12-15 8-15 0-9 10-1516 0-7 8-15______________________________________
the address bits are divided in equal parts to form a row address and a column address according to the following table:
______________________________________Format Value Row Address Bits Column Address Bits______________________________________4-7 0-5 6-11 8-15 0-4 5-916 0-3 4-7______________________________________
It will be appreciated that although the numbers of bits allocated to the row address and column address are equal in each code word, the value of those bits may vary from row address to column address and from code word to code word. The row address bits and column address bits are used to address upper left hand locations of range blocks. Valid values for the row and column address vary according to the value in format. These address can range from 0 to a maximum value as expressed in the following list. The list is given as (m,f) where m is the maximum address value for a given format value:
In the disclosed embodiment, pixel row and column addresses are computed by multiplying the row address and column address values by the domain block size stored as the value in format. The address generator of memory 610 then determines physical memory address in the display memory banks 604 and 605.
The transform bits are used, together with the values in NUMSCALE and DENOMSCALE registers in the memory interface 610, to carry out the grayscale fractal transform decoding operation. The digital signal processor 612 receives both of the signed eight bit NUMSCALE and DENOMSCALE values over the lines 619. In the disclosed embodiment, these values are selected by an operator and are fixed for an entire image computation. It will be understood that providing a larger program data RAM would permit distinct NUMSCALE and DENOMSCALE values to be used for each code word. The NUMSCALE and DENOMSCALE values are loaded from the PC/AT host to the host interface on lines 615 and from the host interface to the NUMSCALE and DENOMSCALE registers in the memory interface 610 on lines 617.
The decoding steps of the grayscale fractal transform are carried out in an initialization step and repeated decoding iteration steps. The instructions required to carry out the decoding procedure are loaded from the program ROM 602 which is connected to the digital signal processor 612.
An initialization signal is sent from the PC/AT host on the lines 615 to initialize the memory interface 610. The memory interface 610 now receives twenty-six bits, the first eight of which are stored in the format register, the next nine of which are stored in the NUMSCALE register and the final nine of which are stored in the DENOMSCALE register. A code counter is now initialized to the value of 16 times CODELENGTH. Bits are now loaded from the PC/AT host over the data lines 615 to the host interface and from there over the data lines 617 to the memory interface 610. An address sequencer in the memory interface 610, having been initialized by the initialization signal above, provides successive addresses in the program data RAM 606 and transfers the data bits it receives to the byte memory areas so addressed. The code counter is decremented with each bit and the data transfer process halts when it reaches zero. A signal is then sent to the digital signal processor 612 to load the program from the program code ROM 602. The values in the NUMSCALE and DENOMSCALE registers are transferred to memory locations in the RAM of the digital signal processor 612. The value of format is also transferred to a memory location in the RAM of the digital signal processor 612, which computes and stores the value of CODELENGTH as described above. Another digital signal processor RAM address location, display bank, is cleared.
A memory location configured as a block counter in the RAM of the digital signal processor 612 is set at the starting address of the program data RAM 606, which is contained in the program code ROM 602. Each Decoding Iteration Step consists of CODELENGTH iterations of Block Decoding Steps. The value of display bank is sent to the memory interface 610 and stored in a bank register on the memory interface 610.
At the start of a Block Decoding Step, the value of BLOCK COUNTER in the digital signal processor 612 is passed on the data lines 619 to the memory interface 610. The eight bits of data at that address in the program data RAM and the next eight bits of data are passed back to the memory interface 610 on data lines 619. The transform bits of the code word are sent on data lines 13 to the digital signal processor 612 and stored in a memory location, Q, in the digital signal processor 612. The row and column address bits of the code word are used by the display address generator on the memory interface 610 to generate the addresses of a square block, with horizontal and vertical dimension equal to two times format, of pixel data in the display memory bank. If the value of display bank is 0 then the addresses are generated in display memory bank B 605. The upper left hand corner of the square block is generated as that pixel on the format times row address row and format times column address column. The image data in this square block is SUB(ROW ADDRESS times FORMAT,COLUMN ADDRESS times FORMAT,2 times FORMAT). The addresses are generated as 2 by 2 subblocks of this square block as with row addresses subrow-row address times format+2 times i and column addresses subcol=column address times FORMAT+2 times j.
The address generator initializes counters with values i and j at 0 and then increments j until j reaches FORMAT when it is reset to 0. When j is reset, then i is incremented until i reaches FORMAT when it is reset to 0. A register in the digital signal processor 612, PIXEL, is cleared. For each value of i and j between 0 and FORMAT-1 inclusive, the byte values at the byte of pixel data stored at the address locations of the four pixels in SUB(SUBROW, SUBCOL,2) is sent over the address lines of 619 to the memory interface 610 and then over the data lines of 619 to the digital signal processor 612 and accumulated in the PIXEL register.
After all four values have been received the value is right shifted two places to effect a division by 4. Q is added to the result of (PIXEL times NUMSCALE divided by DENOMSCALE) and the result of this computation is stored in a digital signal processor register 612, NEWPIXEL.
A second address generator in the memory interface 610 determines destination addresses in the display memory. The pixel coordinates of the upper left hand coordinates are computed by the second address generator. The pixel row of this location is
DESTROW=(BLOCKCOUNT/(IMAGE SIZE/FORMAT)) times FORMAT.
The pixel column address of this location is
DESTCOL=(BLOCKCOUNT/(IMAGESIZE/FORMAT)) times FORMAT where X/Y denotes the remainder of integer division of X by Y.
The addresses of the FORMAT times FORMAT pixels in
are computed as the counters i and j vary. NEWPIXEL is sent over the data lines 13 to the memory interface 610 and stored in the destination display memory address of the pixel located at row=DESTROW+i and column=DESTCOL+j. When all FORMAT times FORMAT pixels in SUB(DESTROW,DESTCOL,FORMAT) are replaced with NEWPIXEL values in this manner, counters i and j are cleared and BLOCKCOUNT is incremented.
This completes a Block Decoding Step. The Block Decoding Step is repeated CODELENGTH many times with the incremented blockcount values. The value of display bank is replaced by 1 --the value of display bank and consequently alternates between 0 and 1. The Decoding Iteration Step is then completed.
The display of the image is carried out essentially asynchronously with the computational decoding. Pixel values are indeed read out of the display memory asynchronously, but the memory bank which is used as the source of the display pixels is specified by the value of display bank. The display output interface 613 provides the R-G-B output. The video output logic timing device 617 drives the preferred color pallet, a Brooktree Bt453RAMDAC, not shown in FIG. 31.
The ratio of the image code to the decoded image size is called the compression ratio of the device. The compression ratio of the device may be computed by dividing twice CODELENGTH by the square of image size. The disclosed embodiment yields compression ratios varying from 1:16 when format contains the domain block size value of 4 to a compression ratio of 1:128 when the value of format is 16. The restriction of format values to vary between 4 and 16 is arbitrary. Larger values of FORMAT lead to larger compression ratios.
An intended purpose of the disclosed decoding device is to provide an economical means of decoding images which have been encoded by the grayscale fractal transform. The usefulness of the device can also be measured in the compression ratio which it achieves. The compression ratio can be effectively increased by compressing the fractal transform codes by traditional compression of a grayscale fractal transform. For example, publicly available Huffman encoding schemes could be used to encode the fractal transform codes. The Huffman encoded fractal transform codes are then Huffman decoded before transmission to the disclosed apparatus for decoding the fractal transform.
Use of the fractal transform techniques described herein has a significant advantage over prior art techniques such as vector quantization and Huffman coding in that no look-up tables are used. Thus, the compression ratio can be easily changed, the system can be used in an adaptive mode, useful in applications such as DVI and preparation of old movies for transmission along telephone lines.
The disclosed methods and apparatus are particularly suitable for application to the problem of transmitting movies over standard telephone lines. FIG. 32 is a logic flow chart of a method for generating compressed digital data representing image information in a motion picture, by a data processor, for storage or transmission. At step 702, first and second processing buffers are initialized with predetermined image data. In the preferred embodiment, the processing buffers are initialized to values of 0. Preferably, the processing buffers are formed to store grayscale pixel values of a square image array. In the preferred embodiment, the processing buffers provide storage of a 256×256 array of 8-bit pixels. The value of a counter in the data processor is also initialized at step 702.
Next, at step 704, image information contained in the first frame of the motion picture to be processed is digitized to produce digitized image data. The image information may be digitized at the same resolution as the processing buffers. In the preferred embodiment, the image information from the first frame of the movie is digitized into a 256×256 array of pixels having an 8-bit grayscale value.
At step 706, the digitized image data from the first frame of the movie is stored in a frame buffer. The counter value is then checked to determine if the value is greater than a predetermined limit value. The counter is used for the purpose of repeating the processing of the first frame for a fixed number of times, for example, 8. That is, the limit value referred to in step 708 is set to 8. If the counter value is greater than the limit value, image information from the next sequential frame of the movie is digitized to produce digitized next frame image data and the digitized next frame image data is stored in a frame buffer. If the counter value is not greater than the limit value, as determined in step 708, step 710 is bypassed, with the result that image data from the first frame remains in the frame buffer.
At step 712, image data from the frame buffer is stored into the first processing buffer. This image data is then processed in the same manner as set forth in FIG. 5. Specifically, domain blocks are created in step 714. Next, at step 716, shrunken range blocks are created in the second processing buffer. For each domain block, the closest shrunken range block is selected at step 718 and the selected shrunken range block is used to replace the corresponding domain block in the first processing buffer at step 720.
The set of identifiers of the selected shrunken range blocks is then used at step 722 to form a fractal transform such as fractal transform 410, shown in FIG. 26. This fractal transform is referred to as a current transform. The current transform, which comprises compressed digital data representative of the image information in the first frame of the movie, is then provided as output at step 724, and the contents of the first processing buffer are copied into the second processing buffer at step 726.
At step 728, the counter value is incremented and a determination is made at block 730 if all frames of the movie have been processed. If not, processing returns to step 708. If all frames have been processed, the method ends at 732.
Referring now to FIG. 33, there is shown a logic flow chart of a method for automatically generating digital data representing the frames of a motion picture. The data is generated by a data processor from a sequence of current transforms, each having a set of identifiers. The data processor includes a memory having a plurality of buffers, each having a plurality of addressable areas specified by a buffer address. Each of the identifiers corresponds to an addressable area in the buffers and includes a buffer address and a procedures specification. In the preferred embodiment, a pair of buffers A and B are provided, corresponding in size to the processing buffers discussed with respect to FIG. 32. Specifically, buffers A and B in the preferred embodiment each have a size sufficient to store an array of 256×256 by 8 bits.
At step 800, an initialization step is performed in which a predetermined pattern of digital data is stored into at least one of the buffers, buffer B, designated as a source buffer. Preferably, both buffers A and B are initialized to all 0's. A current transform, preferably generated by a process such as shown in FIG. 32, is input at step 802 from the sequence of current transforms which constitute compressed digital data representing a motion picture. At step 804, the digital data in buffer A is formed into domain blocks, each corresponding to an identifier in the input current transform. At step 806, the digital data in buffer B is formed into shrunken range blocks, in the same manner as is discussed above with respect to FIG. 13. At step 808, each domain block in buffer A is replaced by a shrunken range block. Specifically, for each of the identifiers in the current transform input at block 802, a pattern of data is determined which corresponds to each of the identifiers. This pattern of data is determined by applying the procedures specified in that identifier to the portion of the source buffer, buffer B, indicated by the buffer address in the identifier. Next at step 808, the patterns of data are stored into the addressable areas of buffer A, designated as a destination buffer, as indicated by the addresses of the corresponding identifiers. In the preferred embodiment, each domain block of buffer A is replaced by a shrunken range block of buffer B. This process is identical to that described above with respect to FIG. 13.
Next, at step 810, the contents of the destination buffer are provided as data representative of an image in the frame. That is, image data from buffer A is output as digital data representative of an image in the frame. This image corresponds to the frame represented by the current transform input in step 802.
At step 812, a determination is made as to whether all current transforms have been processed; that is, have images corresponding to all desired frames been processed. If so, the process ends at step 814. Otherwise, the contents of the destination buffer are copied into the source buffer. That is, as shown at step 816, the contents of buffer A are copied into buffer B and processing returns to step 802 to decompress the next current transform of the sequence. The sequence of sets of image data output at step 810 constitutes decompressed image data representing each frame of a motion picture.
The principles of the present invention are also particularly suitable for application to a videophone. FIG. 34 is a block diagram of apparatus 1000 for providing a videophone. Apparatus 1000 includes two latch-and-hold inputs units 1011 and 1012, a control logic unit 1013, two data processors 1014 and 1015 (respectively functioning as a videophone encoder and a videophone decoder), and two output units 1016 and 1017. Apparatus 1000 has two functional modes: encoding and decoding. Control logic unit 1013 selects either the encoding mode or the decoding mode as determined by input data.
In the encoding mode, a video source 1002, such as a video camera, provides an analog signal to a frame grabber circuit 1006 which converts each frame of video from source 1002 into digital data and stores the digital data in frame grabber unit 1006. Control logic unit 1013 causes video input unit 1011 to read digital data stored in frame grabber 1006 and pass the data to videophone encoder 1014. Videophone encoder 1014 is a fractal encoder of the type described previously with respect to FIG. 6. Videophone encoder 1014 processes the digital video data which it receives from control logic unit 1013. This processing produces fractal transforms for the frames, which are then output through data output unit 1016 Data output unit 1016 may be a standard telephone modem circuit.
In the decoding mode, fractal transforms are supplied by a data source 1004, which may also be a standard telephone modem circuit. Control logic unit 1013 causes data input unit 1012 to read and accumulate the data supplied by data source 1004 and pass it to videophone decoder 1015. Videophone decoder 1015 is a fractal decoder of the type described with respect to FIG. 14. Videophone decoder 1015 processes the fractal transforms which are received from control logic unit 1013. The processing results in digital video data which is sent from decoder 1015 to video output unit 1017. This output unit transforms the digital data into analog data for display on the video display unit 1020.
An alternative method of generating a fractal transform is disclosed in FIG. 35. As shown therein, an image is stored as image data in a data processor in a 64,000 location buffer arranged as a 200×320 array 1100. Each location represents the image value (0-255) of a pixel of an image. Pixels of array 1100 are arranged into domain blocks, such as 1102, each consisting of an array of 8×8 pixels. The domain blocks thus form a 25×40 block array in the buffer.
Image data of the buffer is then used to form range data. For example, the image data of the buffer may be shrunken in a 4:1 ratio to form a range data array 1104, as shown in FIG. 35. Range data array 1104 may be so formed by selecting every other pixel of array 1100. This is illustrated in FIG. 36, wherein every other pixel of a segment of array 1100 is selected to form a corresponding segment of array 1104.
Array 1104 is then used to form a series of shrunken range blocks, used for comparison with domain blocks 1102 to form a fractal transform, similar to the methods described above. However, in this alternative embodiment, shrunken range blocks are formed as series of overlapping blocks from range data array 1104. Each shrunken range block is an 8×8 array of pixels, with the address of the shrunken range block specified by the row and column coordinate of the upper left pixel of each 8×8 block. As shown in FIG. 37, overlapping shrunken range blocks may be formed with a specified separation, or "gap," between the upper left pixel of each overlapping block. As shown in FIG. 37, a first shrunken range block 1108 is formed as an 8×8 array of pixels, having an upper left pixel located at row and column coordinate 0,0. A second shrunken range block 1110 is formed by a 8×8 pixel array whose upper left pixel has a row and column coordinate of 0,2. A third shrunken range block 1112 is formed of an 8×8 pixel array whose upper left pixel is located at row and column coordinates 2,4. In a similar manner, it can be seen that the series of shrunken range blocks can be formed by 8×8 pixel arrays whose upper left pixel has a row coordinate of 0,2,4, . . . 91 and a column coordinate of 0,2,4, . . . 151.
Each shrunken range block formed from range data array 1104 is then subjected to transform processes consisting of rotation by 0°, 90°, 180°, and 270°, each of which is also subjected to inversion. Thus, for each shrunken range block formed from range data array 1104, a total of eight comparison shrunken range blocks is generated.
The fractal transform for the image corresponding to data stored in array 1100 is then formed in a manner similar to that described in previous embodiments, by selecting, for each domain block contained in array 1100, the shrunken range block which is "closest," according to any of the distance criteria set forth previously. That is, each domain block is compared with the overlapping shrunken range blocks formed from range data array 1104, various rotations of each domain block are compared with the overlapping shrunken range blocks, and the inversions of each of the domain blocks and their rotations are compared with the shrunken range blocks. Alternatively, and in a manner which is a mathematical equivalent, inversion and rotation may be performed on shrunken range blocks.
When the closest comparison shrunken range block is formed, its identity is used to form an identifier for the corresponding domain block. The identifier consists of the row and column coordinate of the upper left pixel of the domain block, a two-bit code designating the rotation (0°, 180°, 270° or 360°) of the domain block, and a one-bit code specifying whether the rotated domain block is inverted or not.
The final component of each identifier is a vertical scaling parameter q which is unique for each identifier. An additional vertical scaling parameter p is selected, which is common to all identifiers of a fractal transform. For example, the p value may be 0.75.
The q value is selected as follows. First, the average pixel value of the domain block is determined, by calculating the average pixel value of each of the 64 pixels forming the domain block. Next, the average pixel value of the pixels of the selected shrunken range block is then calculated. (The domain block average is the same for each of the rotated and inverted domain blocks.) The product of the average pixel value of the selected shrunken range block and the p value of 0.75 is calculated, and the product is subtracted from the average pixel value of the domain block to form the q value. Since pixel values for each pixel range from 0-255, the value of q generally ranges from -127 to +128.
In a similar manner, an identifier including a row and column coordinate, a two-bit rotation code, a one-bit inversion code, and a q value is formed for each of the 1,000 domain blocks of image array 1100. The set of 1,000 identifiers thus constitutes the fractal transform of the image represented by array 1100.
An alternative method for retrieving and decoding an image represented by a fractal transform is shown in FIG. 38. FIG. 38 shows a buffer 1150 capable of storing image data for an image consisting of an array of pixels which is 320 pixels wide and 200 pixels high. Buffer 1150 is formed from memory locations in a data processor, each of which contains a numeric value and each of which is specified by a memory location address. The image represented by data stored in buffer 1150 is formed of pixels, each of which has a pixel value and each of which is specified by a row and column coordinate. There is thus a one-to-one correspondence between numeric values stored in addressed locations of buffer 1150 and pixel values located at row and column coordinates of the image. Pixels and memory locations will therefore be referred to interchangeably in the discussion of the alternative method set forth below.
Each pixel has a gray scale value of 0-255. As shown in FIG. 38, the pixels of buffer 1150 may be represented by row and column coordinates having values of 0-199 and 0-319. The array of pixels in buffer 1150 is in turn divided into one thousand domain blocks each consisting of an 8×8 array of pixels. As noted previously, domain blocks of buffer 1150 correspond to domain blocks of an original uncompressed image, now represented by a fractal transform. An abridged form of a fractal transform is shown at the top of FIG. 38.
Data representing an arbitrary image is initially stored in buffer 1150. For example, an arbitrary image consisting of a uniform gray tone of value 128 may be stored in buffer 1150.
The alternative method of decoding compressed digital data represented in FIG. 38 is termed "pixel chaining." Unlike the process referred to previously with respect to FIGS. 16-18, decompression using the method illustrated in FIG. 36 need not occur throughout the entire image. In the pixel chaining process, a first step is to select an arbitrary pixel, out of the 64,000 pixels represented by the 200×320 array of buffer 1150. This arbitrary pixel is designated as "pixel #1" and constitutes the first entry in a table of numbered pixels to be created, as shown in Table I. For example, the first arbitrarily selected pixel may be the pixel designated by the row, column coordinate 1,26 in buffer 1150.
TABLE I______________________________________ Rela- tive Top Coordi- Left ImagePixel nate Range Coor-Coordi- Pixel Do- in the Coor- q dinatenate Value main Domain dinate value in Range______________________________________1,26 z1 4 1,2 30,154 q1 32,15832,158 z2 180 0,6 74,98 q2 74,11074,110 z3 374 2,6 30,154 q3 34,16634,166 z4 181 2,6 28,146 q4 32,1581,26 → 32,158 → 74,110 → 34,166 → 32,158______________________________________
The next step is to determine the domain block with which pixel #1 is associated. As can be seen in FIG. 38, pixel 1,26 comprises a pixel of the fourth domain block of the image stored in buffer 1150.
Next, the identifier of the fractal transform corresponding to the domain block determined in the previous step is selected. As was set forth previously, and as shown in the abridged fractal transform noted in FIG. 38, each identifier of the fractal transform consist of data specifying a range block address and a scaling factor q. In the preferred embodiment, the p value for each identifier of the fractal transform is the same; thus for individual identifiers, only the q value is individually specified. Moreover, for simplicity in explanation, transform processes, such as rotation, inversion, etc. will not be further mentioned in this example. However, it is to be understood that such processes may be specified in each identifier.
As noted above, various methods of identifying range blocks within the identifiers of the fractal transform may be employed. For example, the identifiers may consist of the row and column coordinates of the upper left hand corner of a range block consisting of a 16×16 array of pixels. Using this system, range blocks can overlap. For example, a range block may be specified by the coordinates 0,0. This specifies a range block consisting of a 16×16 array of pixels, the upper left hand pixel of which is located at coordinate 0,0 and the lower righthand coordinate of which is located at coordinate 15,15. A second range block may consist of an array of 16×16 pixels whose upper left hand coordinate is 2,0 and whose lower righthand coordinate is 17,15.
In example illustrated in FIG. 38, the range block specified by the fourth identifier of the fractal transform (corresponding to domain block #4, in which pixel 1,26 is located) is a 16×16 pixel array whose upper left hand corner is situated at the coordinate 30,154. Next, a shrinking process is applied to the range block to provide a shrunken range block. One method of producing a shrunken range block from the range blocks illustrated in FIG. 38 is to generate an 8×8 pixel array consisting of every other pixel of the corresponding unshrunken range block.
After shrinking, a pixel is selected from the shrunken range block which corresponds to the position of the arbitrarily selected pixel #1 in the domain block of buffer 150. In the example shown in FIG. 38, pixel #1 (buffer coordinate 1,26) is the pixel located in row 1, column 2 of the fourth domain block of buffer 1150. The corresponding pixel in the shrunken range block is then identified. Recalling that a shrunken range block of buffer 1150 includes only every other pixel of the array, the corresponding pixel is the seventh pixel in the first row of the corresponding shrunken range block character 1070 in FIG. 38. The address of this pixel is known as a "target address", and has an address of 32,158.
Next, the target address 32,158 is entered in Table I as pixel #2, and it is determined in which domain block pixel #2 is located. As can be seen in FIG. 38, pixel #2 having an address of 32,158 is contained in domain block 180. The identifier of the fractal transform for domain block 180 is then determined. In the example of FIG. 38, the corresponding one hundred eightieth identifier of the fractal transform includes a range block address of 74,98. The 16×16 range block located at 74,98 is then determined and shrunk in the same manner as described immediately above. Next, the target address of the pixel of the shrunken range block which corresponds to the position of pixel #2 in domain block 180 is determined. This target address is 74,110, and is added to Table I as pixel #3.
The process continues until one of three conditions occurs: a) a target address is obtained which is the same as a pixel address already contained in Table I and whose pixel value is not known, b) a target address is obtained which is the same as a pixel address already contained in the list and whose pixel value is known, or c) the number of pixels in the list exceeds a predetermined value.
In the present example, it can be seen from FIG. 38 and Table I that iterations continue until a pixel having coordinates of 32,158 is reached. This is the same as pixel #2.
At this point, pixel values are assigned in buffer 1104 for pixels whose addresses are contained in the Table I. Note that the pixel values for pixels of Table I are denoted as z1, z2, z3, and z4. These pixel values can be assigned through an iteration process or by simultaneously solving a set of linear equations. In particular, pixel values z2, z3, and z4 are defined as follows:
A trial pixel value of, for example, 128 is assigned to each of z2, z3, and z4, and each of the equations repeatedly solved until values for z2, z3, and z4 converge.
Alternatively, the three equations can be solved simultaneously to obtain values for z2, z3, and z4. A value for z1 can then be found from z1=p*z2+q1.
At this point, two options are available. If decompression of the entire image is desired, a second arbitrary pixel, whose decompressed value has not been determined, is selected and the process is repeated, beginning with the second selected pixel, to develop a list, similar to Table I, until either of the three criteria noted above are achieved. Alternatively, if a specified portion of the image is desired to be decompressed, a pixel in the desired area can be selected as the first pixel of the list.
For example, a new arbitrary pixel of coordinates 1, 27 may be selected, which is adjacent to pixel #1, above. Using the procedure set forth immediately above, a new table, Table II, similar in format to Table I, can be formed.
TABLE II______________________________________ Rela- tive Top Coordi- Left ImagePixel nate Range Coor-Coordi- Pixel Do- in the Coor- q dinatenate Value main Domain dinate value in Range______________________________________1,27 z5 4 1,3 30,154 q5 = 32,160 q132,160 z6 181 0,0 28,146 q6 = 28,146 q428,146 z7 139 4,2 66,106 q7 74,110______________________________________
Note that the third entry in Table II is a target pixel having a coordinate of 74,110. The value of this pixel, z3, is already known, as set forth in Table I. Thus, pixel values z7, z6 and z5 can be obtained as follows:
This process of assigning pixel values is continued until all pixel values in the image area of interest have been updated.
The pixel chaining method described above may be implemented in the apparatus shown in FIG. 39. Apparatus 1200 includes an input device 1202, which may be, for example, a modem, where identifiers are received over a telephone line or other communications channel. In situations where an image is to be decoded from a fractal transform stored on magnetic media, input device 1202 may be a disk drive. Input device 1202 is coupled to a processor 1204 which is in turn coupled to an output device 1206 and a memory 1208. Processor 1204 and memory 1208 may comprise, for example, a personal computer. Alternatively, processor 1204 and memory 1208 may comprise special purpose high speed image decompression hardware. Output device 1206 may comprise a video output board, for use in situations where a decoded image is to be immediately displayed. Alternatively, output device 1206 may comprise a disk drive, for applications in which the decoded image data is to be stored on magnetic or other storage media.
Input device 1202 thus comprises input means for receiving data representative of identifiers. Memory 1208 includes a plurality of domain blocks each corresponding to a portion of an encoded image and to one of the identifiers. Each of the domain blocks comprises locations specified by a memory address.
Processor 1204 constitutes processor means for: (a) storing a predetermined pattern of digital data in the memory; (b) choosing a location as a selected location; (c) storing the memory address of the selected location in a table; (d) finding a next identifier corresponding to a determined domain block containing the selected location; (e) determining, from the next identifier, a specified area of memory constituting a shrunken range block; (f) finding a target location in the shrunken range block having a position in the shrunken range block which corresponds to the position of the selected location in the determined domain block; (g) storing the memory address of the target location in the table and designating the memory address of the target location as the selected location; (h) repeating steps (c) through (g) until predetermined criteria are met; (i) determining decoded pixel values for locations of the table; and (j) repeating steps (b) through (i) until a desired portion of the encoded image is decoded. Output device 1206 thus comprises output means coupled to the processor means for supplying an output signal representative of the decoded image.
The present invention provides data compression methods and apparatus which exhibit higher performance than prior art methods and apparatus. Moreover, the present invention avoids the necessity for hours of manual operation of a computer to achieve compressed data. Since look-up tables are not required, the present invention can provide adaptive capabilities, while minimizing the amount of memory required.
The invention provides the ability to represent and store images in a digital computer with scale-independent resolution using a two-dimensional array of numerical attributes of a digitized picture as input and providing an output which is a smaller data set from the original. The present invention can provide both exact and non-exact image representation by choice of appropriate block sizes and screen resolution.
The invention further provides the ability to subject image data to multiple passes of an encoding and decoding process such that the image data emerges the same as if it had been encoded and decoded only once.
It will be apparent to those skilled in the art that various modifications and variations can be made in the apparatus and methods of this invention without departing from the spirit or scope of the present invention. The present invention covers such modifications and variations which are within the scope of the appended claims and their equivalents.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4442454 *||15 Nov 1982||10 Apr 1984||Eastman Kodak Company||Image processing method using a block overlap transformation procedure|
|US4694407 *||11 Jun 1985||15 Sep 1987||Rca Corporation||Fractal generation, as for video graphic displays|
|US4941193 *||2 Oct 1987||10 Jul 1990||Iterated Systems, Inc.||Methods and apparatus for image compression by iterated function system|
|US5093872 *||2 May 1989||3 Mar 1992||Interand Corporation||Electronic image compression method and apparatus using interlocking digitate geometric sub-areas to improve the quality of reconstructed images|
|1||*||A Better Way to Compress Images, by Barnsley et al., Byte Magazine, Jan. 1988.|
|2||*||A New Class of Markov Processes for Image Encoding, School of Mathematics, Georgia Inst. of Technology (1988), pp. 14 32.|
|3||A New Class of Markov Processes for Image Encoding, School of Mathematics, Georgia Inst. of Technology (1988), pp. 14-32.|
|4||*||An Ergodic Theorem for Iterated Maps, Ergodic Theory and Dynamical Systems, 7 (1987).|
|5||Barnsley et al. "Harnessing Chaos for Image Synthesis", Computer Graphics vol. 22, No. 4 Aug. 1988.|
|6||*||Barnsley et al. Harnessing Chaos for Image Synthesis , Computer Graphics vol. 22, No. 4 Aug. 1988.|
|7||*||Chaotic Compression, by Barnsley et al., Computer Graphics World, Nov. 1987.|
|8||*||Construction of Fractal Objects with Iterated Function Systems, Siggraph 85 Proceedings, vol. 19, No. 3, 271 278 (1985).|
|9||Construction of Fractal Objects with Iterated Function Systems, Siggraph '85 Proceedings, vol. 19, No. 3, 271-278 (1985).|
|10||*||Data Compression: Pntng by Numbrs The Economist, May 21, 1988.|
|11||*||Fractal Geometry Understanding Chaos, Georgia Tech Alumni Magazine, p. 16 (Spring 1986).|
|12||Fractal Geometry-Understanding Chaos, Georgia Tech Alumni Magazine, p. 16 (Spring 1986).|
|13||*||Fractal Modelling of Biological Structures, Perspectives in Biological Dynamics and Theoretical Medicine, Koslow, Mandell, Shlesinger, eds., Annals of New York Academy of Sciences, vol. 504, 179 194. (date unknown).|
|14||Fractal Modelling of Biological Structures, Perspectives in Biological Dynamics and Theoretical Medicine, Koslow, Mandell, Shlesinger, eds., Annals of New York Academy of Sciences, vol. 504, 179-194. (date unknown).|
|15||*||Fractal Modelling of Biological Structures, School of Mathematics, Georgia Institute of Technology (Date Unknown).|
|16||*||Fractal Modelling of Real World Images, Lecture Notes for Fractals: Introduction, Basics and Perspectives, Siggraph (1987).|
|17||*||Fractals A Geometry of Nature, Georgia Institute of Technology Research Horizons, p. 9 (Spring 1986).|
|18||Fractals-A Geometry of Nature, Georgia Institute of Technology Research Horizons, p. 9 (Spring 1986).|
|19||*||Harnessing chaos For Images Systhesis, by Barnsley et al., Computer Graphics, vol. 22, No. 4, Aug. 1988.|
|20||*||Iterated Function Systems and The Global Construction of Fractals, Proc. R. Soc. Lond., A399, 243 275 (1985).|
|21||Iterated Function Systems and The Global Construction of Fractals, Proc. R. Soc. Lond., A399, 243-275 (1985).|
|22||Jacquin, A. E. "A Novel Fractal Block Coding Technique for Digital Images" ICASSP 90. 1990 (Apr.) Int'l Conf. on Acoustics, Speech, and Signal Processing (cat. No. 90CH2847-2).|
|23||*||Jacquin, A. E. A Novel Fractal Block Coding Technique for Digital Images ICASSP 90. 1990 (Apr.) Int l Conf. on Acoustics, Speech, and Signal Processing (cat. No. 90CH2847 2).|
|24||*||Just the Bare Facts, Please, by William Baldwin, Forbes Magazine, Dec. 12, 1988.|
|25||*||Making A New Science, pp. 215, 239, by James Gleick (date unknown).|
|26||*||Packing It In by Ivars Peterson, Science News, vol. 131, No. 18, p. 283, May 2, 1987.|
|27||*||Packing It In Fractals . . . , Science News, vol. 131, No. 18, pp. 283 285, May 2, 1987.|
|28||Packing It In-Fractals . . . , Science News, vol. 131, No. 18, pp. 283-285, May 2, 1987.|
|29||*||Researchers Use Fractal Geometry . . . , by Skip Derra, Research and Development Magazine, Mar. 1988.|
|30||*||Solution of an Inverse Problem for Fractals and Other Sets, Proc. Natl. Acad. Sci. USA, vol. 83, 1975 1977 (Apr. 1986).|
|31||Solution of an Inverse Problem for Fractals and Other Sets, Proc. Natl. Acad. Sci. USA, vol. 83, 1975-1977 (Apr. 1986).|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US5510838 *||22 Nov 1994||23 Apr 1996||Igp, Research And Development Ltd.||Apparatus and method for picture representation by data compression|
|US5577183 *||1 Dec 1995||19 Nov 1996||Hewlett-Packard Company||Printer system that stores compressed font glyphs in data blocks and decompressed glyphs in each data block together using same decompression procedure|
|US5600572 *||7 Mar 1995||4 Feb 1997||Thomson Consumer Electronics S.A.||Method for transmission of variable-format images via low data rate transmission systems|
|US5673120 *||21 Dec 1994||30 Sep 1997||Nec Corporation||Image output device|
|US5701369 *||31 Aug 1995||23 Dec 1997||Samsung Electronics Co., Ltd.||Fractal image compression device and method|
|US5717788 *||18 Apr 1995||10 Feb 1998||Iterated Systems, Inc.||Method and system for analyzing data|
|US5721543 *||30 Jun 1995||24 Feb 1998||Iterated Systems, Inc.||System and method for modeling discrete data sequences|
|US5732157 *||15 Dec 1994||24 Mar 1998||Canon Kabushiki Kaisha||Image processing apparatus and method using lossless encoding of a difference between image blocks|
|US5740282 *||30 Jun 1995||14 Apr 1998||Iterated Systems, Inc.||System and method for contractive mapping resynchronization of a data transmission|
|US5745392 *||5 Oct 1995||28 Apr 1998||Chevron U.S.A. Inc.||Method for reducing data storage and transmission requirements for seismic data|
|US5768437 *||1 Mar 1993||16 Jun 1998||Bri Tish Technology Group Ltd.||Fractal coding of data|
|US5774357 *||6 Jun 1995||30 Jun 1998||Hoffberg; Steven M.||Human factored interface incorporating adaptive pattern recognition based controller apparatus|
|US5784554 *||28 May 1993||21 Jul 1998||Apple Computer, Inc.||Dynamic sampling profiler|
|US5822721 *||22 Dec 1995||13 Oct 1998||Iterated Systems, Inc.||Method and apparatus for fractal-excited linear predictive coding of digital signals|
|US5838832 *||3 Apr 1995||17 Nov 1998||Iterated Systems, Inc.||Method and system for representing a data set with a data transforming function and data mask|
|US5857036 *||4 Mar 1996||5 Jan 1999||Iterated Systems, Inc.||System and method for the fractal encoding of datastreams|
|US5862263 *||9 Apr 1996||19 Jan 1999||Samsung Electronics Co., Ltd.||Fractal image compression device and method using perceptual distortion measurement|
|US5867386 *||6 Jun 1995||2 Feb 1999||Hoffberg; Steven M.||Morphological pattern recognition based controller system|
|US5867603 *||10 Jul 1995||2 Feb 1999||Iterated Systems, Inc.||Method for transmitting fractal transform data to support different compressor/decompressor designs|
|US5870502 *||8 Apr 1996||9 Feb 1999||The Trustees Of Columbia University In The City Of New York||System and method for a multiresolution transform of digital image information|
|US5875108 *||6 Jun 1995||23 Feb 1999||Hoffberg; Steven M.||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US5901246 *||6 Jun 1995||4 May 1999||Hoffberg; Steven M.||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US5917962 *||6 Jun 1995||29 Jun 1999||Apple Computer, Inc.||Method and apparatus for partitioning an image|
|US5924053 *||3 Jul 1995||13 Jul 1999||Commonwealth Scientific And Industrial Research Organisation||Fractal representation of data|
|US5926611 *||20 Dec 1996||20 Jul 1999||Hughes Electronics Corporation||High resolution digital recorder and method using lossy and lossless compression technique|
|US5946417 *||10 Sep 1998||31 Aug 1999||The Trustees Of Columbia University In The City Of New York||System and method for a multiresolution transform of digital image information|
|US6055335 *||14 Sep 1995||25 Apr 2000||Kabushiki Kaisha Toshiba||Method and apparatus for image representation and/or reorientation|
|US6081750 *||6 Jun 1995||27 Jun 2000||Hoffberg; Steven Mark||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US6094453 *||16 Jan 1997||25 Jul 2000||Digital Accelerator Corporation||Digital data compression with quad-tree coding of header file|
|US6120451 *||31 Dec 1998||19 Sep 2000||General Electric Company||Ultrasound color flow display optimization by adjustment of threshold|
|US6126605 *||31 Dec 1998||3 Oct 2000||General Electric Company||Ultrasound color flow display optimization by adjusting dynamic range|
|US6198851||11 Sep 1998||6 Mar 2001||Sony Corporation||Apparatus and method for encoding/decoding|
|US6201897||9 Nov 1998||13 Mar 2001||Earth Resource Mapping||Transformation and selective inverse transformation of large digital images|
|US6272258 *||18 Dec 1998||7 Aug 2001||Deutsche Thomson-Brandt Gmbh||Method for fractal coding of video or audio signals|
|US6275615||3 Dec 1999||14 Aug 2001||Kabushiki Kaisha Toshiba||Method and apparatus for image representation and/or reorientation|
|US6339659 *||27 Oct 1998||15 Jan 2002||Sony Corporation||Fractal coding/decoding of picture data using memory capacity information|
|US6356667||15 Oct 1998||12 Mar 2002||Sony Corporation||Encoding apparatus and method, decoding apparatus and method and recording medium|
|US6373989 *||19 Oct 1998||16 Apr 2002||Sony Corporation||Iterated image transformation and decoding apparatus and method, and recording medium|
|US6400996||1 Feb 1999||4 Jun 2002||Steven M. Hoffberg||Adaptive pattern recognition based control system and method|
|US6418424||4 May 1999||9 Jul 2002||Steven M. Hoffberg||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US6442298||26 Oct 2000||27 Aug 2002||Earth Resource Mapping, Limited||Transformation and selective inverse transformation of large digital images|
|US6480541||23 Oct 1998||12 Nov 2002||Realnetworks, Inc.||Method and apparatus for providing scalable pre-compressed digital video with reduced quantization based artifacts|
|US6501862 *||1 Apr 1999||31 Dec 2002||Sony Corporation||Picture information processing method and apparatus and entertainment apparatus|
|US6526178||28 Jan 1999||25 Feb 2003||Sony Corporation||Picture mapping apparatus and picture mapping method, and picture generation apparatus and picture generation method|
|US6567563 *||22 Sep 1998||20 May 2003||Samsung Electronics Co., Ltd.||Video image searching method and apparatus|
|US6633682 *||21 Jun 1999||14 Oct 2003||New York University||Progressive fractal rendering|
|US6640145||3 Jun 2002||28 Oct 2003||Steven Hoffberg||Media recording device with packet data interface|
|US6661904||8 Jul 1999||9 Dec 2003||Personalogo||Method and system for automated electronic conveyance of hidden data|
|US6714145||26 Sep 2002||30 Mar 2004||Richard Marques||Method and apparatus for integer-based encoding and decoding of bits|
|US6735740 *||4 Mar 1998||11 May 2004||Fujitsu Limited||Document composite image display method and device utilizing categorized partial images|
|US6738520 *||19 Jun 2000||18 May 2004||Intel Corporation||Method of compressing an image|
|US6775411||18 Oct 2002||10 Aug 2004||Alan D. Sloan||Apparatus and method for image recognition|
|US6775415 *||25 May 2000||10 Aug 2004||George Mason University||Fractal image compression using reinforcement learning|
|US7046728||30 Jun 2000||16 May 2006||Intel Corporation||Method of video coding the movement of a human face from a sequence of images|
|US7046862||6 Nov 2002||16 May 2006||Fuji Xerox Co., Ltd.||Image processing apparatus and program|
|US7075986||12 Nov 2002||11 Jul 2006||Realnetworks, Inc.||Method and apparatus for providing scalable pre-compressed digital video with reduced quantization based artifacts|
|US7103640||13 Sep 2000||5 Sep 2006||Econnectix, Llc||Network distributed tracking wire transfer protocol|
|US7110547 *||9 Jan 2001||19 Sep 2006||University Of New Hampshire||Method and apparatus for the compression and decompression of image files using a chaotic system|
|US7215772||18 Mar 2002||8 May 2007||Chaoticom, Inc.||Method and apparatus for remote digital key generation|
|US7215776||20 Jun 2000||8 May 2007||University Of New Hampshire||Method and apparatus for the compression and decompression of audio files using a chaotic system|
|US7233978||1 Jun 2001||19 Jun 2007||Econnectix, Llc||Method and apparatus for managing location information in a network separate from the data to which the location information pertains|
|US7286670||26 Mar 2002||23 Oct 2007||Chaoticom, Inc.||Method and apparatus for chaotic opportunistic lossless compression of data|
|US7382923 *||19 Oct 2001||3 Jun 2008||Canon Kabushiki Kaisha||Method and device for processing and decoding a coded digital signal|
|US7440570||16 Jan 2007||21 Oct 2008||Groove Mobile, Inc.||Method and apparatus for remote digital key generation|
|US7480415 *||27 Dec 2002||20 Jan 2009||Stmicroelectronics S.A.||Fractal-coding addressing of reference block memories|
|US7526137 *||12 Nov 2003||28 Apr 2009||Fuji Xerox Co., Ltd.||Image processing apparatus, image processing method, image processing program, and storage medium|
|US7610551||26 Feb 2007||27 Oct 2009||Verisign, Inc.||System and method for managing distribution of multi-formatted content|
|US7714747||8 Jan 2007||11 May 2010||Realtime Data Llc||Data compression systems and methods|
|US7777651||2 Jun 2008||17 Aug 2010||Realtime Data Llc||System and method for data feed acceleration and encryption|
|US7792876 *||23 May 2006||7 Sep 2010||Syniverse Icx Corporation||Imaging system providing dynamic viewport layering|
|US7814169||22 Aug 2003||12 Oct 2010||Econnectix, Llc||System and method for establishing and retrieving data based on global indices|
|US7814170||13 Feb 2006||12 Oct 2010||Econnectix Corporation||Network distributed tracking wire transfer protocol|
|US7860309||30 Sep 2004||28 Dec 2010||Verisign, Inc.||Media publishing system with methodology for parameterized rendering of image regions of interest|
|US7974714||29 Aug 2006||5 Jul 2011||Steven Mark Hoffberg||Intelligent electronic appliance system and method|
|US7974988||26 Feb 2007||5 Jul 2011||Syniverse Icx Corporation||System and method for cross-carrier mobile device capability discovery|
|US8046313||13 Nov 2006||25 Oct 2011||Hoffberg Steven M||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US8054879||8 Jan 2010||8 Nov 2011||Realtime Data Llc||Bandwidth sensitive data compression and decompression|
|US8073047||19 May 2008||6 Dec 2011||Realtime Data, Llc||Bandwidth sensitive data compression and decompression|
|US8090936||19 Oct 2006||3 Jan 2012||Realtime Data, Llc||Systems and methods for accelerated loading of operating systems and application programs|
|US8112619||19 Oct 2006||7 Feb 2012||Realtime Data Llc||Systems and methods for accelerated loading of operating systems and application programs|
|US8145833 *||30 Oct 2009||27 Mar 2012||CSR Technology Holdings Inc.||Compression solution for embedded devices and systems|
|US8275897||8 Apr 2006||25 Sep 2012||Realtime Data, Llc||System and methods for accelerated data storage and retrieval|
|US8369967||7 Mar 2011||5 Feb 2013||Hoffberg Steven M||Alarm system controller and a method for controlling an alarm system|
|US8423711 *||27 Mar 2012||16 Apr 2013||Cambridge Silicon Radio Limited||Compression solution for embedded devices and systems|
|US8502707||9 Feb 2010||6 Aug 2013||Realtime Data, Llc||Data compression systems and methods|
|US8504710||26 Oct 2006||6 Aug 2013||Realtime Data Llc||System and methods for accelerated data storage and retrieval|
|US8532406 *||27 Oct 2010||10 Sep 2013||Morpho, Inc.||Partial expansion method of encoded images and image processing apparatus|
|US8553759||6 Jun 2011||8 Oct 2013||Realtime Data, Llc||Bandwidth sensitive data compression and decompression|
|US8583263||8 Mar 2011||12 Nov 2013||Steven M. Hoffberg||Internet appliance system and method|
|US8643513||6 Jun 2011||4 Feb 2014||Realtime Data Llc||Data compression systems and methods|
|US8692695||16 Aug 2010||8 Apr 2014||Realtime Data, Llc||Methods for encoding and decoding data|
|US8717203||24 Sep 2013||6 May 2014||Realtime Data, Llc||Data compression systems and methods|
|US8717204||24 Sep 2013||6 May 2014||Realtime Data Llc||Methods for encoding and decoding data|
|US8719438||5 May 2011||6 May 2014||Realtime Data Llc||System and methods for accelerated data storage and retrieval|
|US8723701||24 Sep 2013||13 May 2014||Realtime Data Llc||Methods for encoding and decoding data|
|US8742958||24 Sep 2013||3 Jun 2014||Realtime Data Llc||Methods for encoding and decoding data|
|US8756332||26 Oct 2006||17 Jun 2014||Realtime Data Llc||System and methods for accelerated data storage and retrieval|
|US8779950||5 Mar 2012||15 Jul 2014||Dcba, Llc||Command encoded data compression|
|US8867610||19 Dec 2013||21 Oct 2014||Realtime Data Llc||System and methods for video and audio data distribution|
|US8880862||27 May 2011||4 Nov 2014||Realtime Data, Llc||Systems and methods for accelerated loading of operating systems and application programs|
|US8892495||8 Jan 2013||18 Nov 2014||Blanding Hovenweep, Llc||Adaptive pattern recognition based controller apparatus and method and human-interface therefore|
|US8929442||19 Dec 2013||6 Jan 2015||Realtime Data, Llc||System and methods for video and audio data distribution|
|US8933825||11 Apr 2014||13 Jan 2015||Realtime Data Llc||Data compression systems and methods|
|US8934535||20 Sep 2013||13 Jan 2015||Realtime Data Llc||Systems and methods for video and audio data storage and distribution|
|US9054728||24 Sep 2014||9 Jun 2015||Realtime Data, Llc||Data compression systems and methods|
|US9116908||12 Jun 2014||25 Aug 2015||Realtime Data Llc||System and methods for accelerated data storage and retrieval|
|US9141992||23 Feb 2012||22 Sep 2015||Realtime Data Llc||Data feed acceleration|
|US9143546||3 Oct 2001||22 Sep 2015||Realtime Data Llc||System and method for data feed acceleration and encryption|
|US9236882||1 Jun 2015||12 Jan 2016||Realtime Data, Llc||Data compression systems and methods|
|US9275474 *||29 Jul 2013||1 Mar 2016||Morpho, Inc.||Partial expansion method of encoded images and image processing apparatus|
|US9286643||28 Feb 2012||15 Mar 2016||Applaud, Llc||Personalized memory compilation for members of a group and collaborative method to build a memory compilation|
|US9361562 *||15 Mar 2013||7 Jun 2016||AI Cure Technologies, Inc.||Method and apparatus for fractal multilayered medication identification, authentication and adherence monitoring|
|US9535563||12 Nov 2013||3 Jan 2017||Blanding Hovenweep, Llc||Internet appliance system and method|
|US9543980||6 Feb 2015||10 Jan 2017||Massachusettes Institute Of Technology||Systems and methods for model-free compression and model-based decompression|
|US9667751||14 Sep 2015||30 May 2017||Realtime Data, Llc||Data feed acceleration|
|US20010048446 *||22 May 2001||6 Dec 2001||Akira Ishida||Rendering device|
|US20020032787 *||1 Jun 2001||14 Mar 2002||Overton John K.||Method and apparatus for managing location information in a network|
|US20020048319 *||19 Oct 2001||25 Apr 2002||Patrice Onno||Method and device for processing and decoding a coded digital signal|
|US20030072370 *||12 Nov 2002||17 Apr 2003||Realnetworks, Inc.||Method and apparatus for providing scalable pre-compressed digital video with reduced quantization based artifacts (continuation)|
|US20030169940 *||9 Jan 2001||11 Sep 2003||University Of New Hampshire||Method and apparatus for the compression and decompression of image files using a chaotic system|
|US20040071350 *||28 Jul 2003||15 Apr 2004||Tinku Acharya||Method of compressing an image|
|US20040084348 *||4 Nov 2002||6 May 2004||Jonathan Nash||Tortilla-packaging box and support apparatus|
|US20040123134 *||8 Dec 2003||24 Jun 2004||Sasich Philip S.||Method and system for electronic conveyance of data in a secure manner|
|US20040126033 *||12 Nov 2003||1 Jul 2004||Fuji Xerox Co., Ltd.||Image processing apparatus, image processing method, image processing program, and storage medium|
|US20040205055 *||22 Aug 2003||14 Oct 2004||John Overton||System and method for establishing and retrieving data based on global indices|
|US20050001855 *||2 Mar 2004||6 Jan 2005||Eun-Sook Kang||Method of and apparatus for enlarging image and printing enlarged image and computer-readable recording medium for storing computer program|
|US20050172154 *||28 Jan 2005||4 Aug 2005||Chaoticom, Inc.||Systems and methods for providing digital content and caller alerts to wireless network-enabled devices|
|US20050194661 *||26 Apr 2005||8 Sep 2005||Micron Technology, Inc.||Solvent prewet and method to dispense the solvent prewet|
|US20050226519 *||27 Dec 2002||13 Oct 2005||Stmicroelectronics S.A.||Fractal-coding addressing of reference block memories|
|US20070011267 *||13 Feb 2006||11 Jan 2007||Econnectix, Llc||Network distributed tracking wire transfer protocol|
|US20070053517 *||1 Aug 2006||8 Mar 2007||University Of New Hampshire||Method and apparatus for the compression and decompression of image files using a chaotic system|
|US20070177730 *||16 Jan 2007||2 Aug 2007||Short Kevin M||Method and apparatus for remote digital key generation|
|US20070208791 *||3 Apr 2007||6 Sep 2007||University Of New Hampshire||Method and apparatus for the compression and decompression of audio files using a chaotic system|
|US20080005275 *||14 May 2007||3 Jan 2008||Econnectix, Llc||Method and apparatus for managing location information in a network separate from the data to which the location information pertains|
|US20080147592 *||26 Feb 2007||19 Jun 2008||Srinivasarao Nandiwada||System and method for cross-carrier mobile device capability discovery|
|US20080147674 *||26 Feb 2007||19 Jun 2008||Srinivasarao Nandiwada||System and method for managing distribution of multi-formatted content|
|US20090194694 *||29 Jan 2009||6 Aug 2009||Fujifilm Corporation||Radiation detection apparatus and radiation image capturing system|
|US20110216981 *||27 Oct 2010||8 Sep 2011||Masaki Hiraga||Partial expansion method of encoded images and image processing apparatus|
|CN102196260A *||1 Dec 2010||21 Sep 2011||株式会社摩如富||Partial expansion method of encoded images and image processing apparatus|
|EP0910042A2 *||14 Oct 1998||21 Apr 1999||Sony Corporation||Method and apparatus for encoding or decoding digital video data|
|EP0910042A3 *||14 Oct 1998||8 Mar 2000||Sony Corporation||Method and apparatus for encoding or decoding digital video data|
|U.S. Classification||382/249, 375/E07.204, 382/233|
|International Classification||G06T9/00, H04N1/415, H04N7/30, H04N1/41|
|Cooperative Classification||G10L25/36, H04N19/99, G06T9/001|
|European Classification||H04N7/26Z16, G06T9/00F|
|23 Oct 1991||AS||Assignment|
Owner name: ITERATED SYSTEMS, INC., GEORGIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:BARNSLEY, MICHAEL F.;SLOAN, ALAN D.;REEL/FRAME:005896/0920
Effective date: 19910927
|20 Feb 1998||FPAY||Fee payment|
Year of fee payment: 4
|19 May 1998||CC||Certificate of correction|
|5 Apr 2001||AS||Assignment|
Owner name: MEDIABIN, INC., GEORGIA
Free format text: CHANGE OF NAME;ASSIGNOR:ITERATED SYSTEMS, INC.;REEL/FRAME:011658/0395
Effective date: 20010208
|25 Feb 2002||FPAY||Fee payment|
Year of fee payment: 8
|28 Feb 2006||FPAY||Fee payment|
Year of fee payment: 12