Antialiased high-resolution frame buffer architecture

Abstract: A method and a system is provided to generate an antialised image including at least one object. The method comprises the steps of: receiving current data describing each of at least one objects into a processing buffer, rasterizing portions of the current data representing edges of the at least one objects, transforming the rasterized data in the high resolution cache into low resolution data, and receiving at least one of the current data and the rasterized data into a low resolution memory.

Description: The use of graphics in computer and communication applications is very widespread and is becoming increasingly more prevalent. A computing device often transmits a document including graphical data to a printing device using a page description language. Page description languages (e.g., the PostScript® language) include interpretive programming commands useful for implementing powerful graphics capabilities. When transmitted via a page description language, graphical data is typically first converted to a bit-map data file. Printing devices then convert the bit-map data to appropriate marks on paper. When an image is printed, objects within the image are arranged one on top of another on a page. An object in a higher layer partially, or even completely, covers an object in a lower layer. Alternatively, the two (2) objects abut one another. When printed, the edges between the overlapping or abutting objects may appear jagged. Therefore, it is often desirable to antialias these edges. Antialiasing provides the illusion of increased resolution without incurring the costs associated with increased memory and/or increased device resolution. Processing costs are only slightly increased by antialiasing and, in some cases, are actually decreased. Costs associated with devices capable of displaying higher resolution are also avoided since antialiasing is appropriate for displaying higher-resolution data on a lower-resolution device. The most notable improvements provided by antialiasing occur on slightly slanted lines and edges, and near the horizontal and vertical portions of gradual curves. When printed at lower resolutions without being antialiased, these features often times appear jagged. Strokes may be of any color, and edges may separate any two (2) colors. However, the most visible jagged edges are often between colors having high luminance contrast. There are a number of known approaches to antialiasing. The simplest and best known approach is to rasterize at a higher-than-final resolution. The final image is then computed by filtering and scaling-down the high-resolution version to a low-resolution image (i.e., the final image). This method is known as supersampling. The filtering and scaling operations consist of, at each output pixel, taking an average (possibly weighted) of the pixels in the region of the high-resolution image which maps to the region of the final image surrounding that output pixel's center. Substantially more complex methods of antialiasing exist in which the full geometry in the region of each pixel is used to compute analytically either the weighted or unweighted average. In terms of runtime complexity, the more complex methods are better than the filtering and scaling-down method described above. Furthermore, the more complex methods theoretically give better results. However, the more complex methods are also typically more difficult to implement. Another approach to antialiasing is to use alpha-blending. In alpha-blending, only a low-resolution frame buffer is used to store the image. As each new primitive (e.g., object) is added to the frame buffer, it is immediately merged with existing data already in the frame buffer. In interior regions of an object, the merge is simply a replacement (i.e., the new data replaces the original data). In exterior regions of an object, the frame buffer is unaffected. Along an edge of an object, the fractional coverage of a pixel by the new object is computed. The color of the new object is blended with the existing color data in the frame buffer, using the computed fractional coverage, to control how much of each color is used in the antialiased pixel. Alpha-blending is sufficient for text against a solid background, and probably for text against any background. However, it is generally not successful for abutting edges of polygons. FIGURE 1 illustrates a pixel 10 of interest in a PostScript printing scheme. The pixel of interest 10 contains parts of first and second objects 12, 14 , respectively, which abut each other at a common edge 16 . The first object 12 is a first color and the second object 14 is a second color. The first and second colors are represented in FIGURE 1 as horizontal and vertical lines, respectively. The pixel of interest 10 shown in FIGURE 1 is one of many pixels that may be used to make up a sweep or vignette. As is common in PostScript masters, the vignette is created from many abutting rectangles, of only slightly varying color. FIGURE 2 illustrates the desired antialiased final pixel 20 , which would result from alpha-blending the pixel of interest illustrated in FIGURE 1. The color of the desired final pixel 20 represents a blend of respective amounts, which are proportional to the fractional coverage, of the first and second colors in FIGURE 1. The color of the desired final pixel 20 is represented in FIGURE 2 as diagonal lines from the bottom-left to the top-right. FIGURE 3 illustrates the actual antialiased pixel 22 which would result from the pixel of interest 10 in the PostScript printing scheme shown in FIGURE 1. The color of the actual pixel 22 is not consistent with the color of the desired final pixel 20 shown in FIGURE 2. The color of the actual pixel 22 is represented in FIGURE 3 as diagonal lines from the top-left to the bottom-right. FIGURES 4A-4C illustrate the method by which alpha-blending is used to achieve the actual antialiased pixel 22 shown in FIGURE 3. After the first object 12 is positioned on the page, the pixel of interest 10 partially covers the first object 12 and partially covers the background 24 (e.g., white). Therefore, the first object 12 is alpha-blended with the white background 24 , yielding an intermediate pixel 26 , which is illustrated with dashed lines in FIGURE 4B. Then, the second object 14 is positioned on the page over the intermediate pixel 26 as illustrated in FIGURE 4C. Alpha-blending is performed again for the intermediate pixel of interest 30 . This time, the pixel of interest 30 includes the color from the second object 14 and the result from the first alpha-blending, yielding the pixel 22 shown in FIGURE 3. Therefore, when alpha-blending is used with PostScript printing schemes, the actual color of the resulting pixel is a function of the colors of the objects and the background color, rather than only the colors of the objects. Lin S. et al.: "An Anti-Aliasing Method for Parallel Rendering," Computer Graphics International, 1998, Proceedings Hannover Germany 22-26 June 1998, Los Alamitos, CA, USA, IEEE Comput. Stock, US, 22 June 1998 (1998-06-22), pages 228 - 235 describes a parallel rendering method based on the adaptive supersampling technique to produce antialias images with low memory consumption. Unlike traditional supersampling methods, this one does not supersample every pixel, but only the edge pixels. Various strategies are considered to reduce the memory consumption in order for the method to be applicable in situations where limited or fixed amount of prealocated memory is available. The algorithm has been implemented on a parallel machine based on the message passing model. Some experimental results on the memory usage and the performance of a method are presented. According to an illustrative embodiment of the present invention, a method of generating an antialiased image including at least one object comprises the features defined in claim 1. According to another illustrative embodiment of the present invention, a system for processing a color image comprises the features defined in claim 2. FIGURE 1 illustrates a pixel of interest in a prior art PostScript printing scheme; FIGURE 2 illustrates the desired antialiased final pixel, which would result in the prior art system, from alpha-blending the pixel of interest shown in FIGURE 1; FIGURE 3 illustrates the actual antialiased pixel, which would result in the prior art system, from the pixel of interest shown in FIGURE 1; FIGURES 4A, 4B, and 4C illustrate the prior art alpha-blending method used to achieve the actual antialiased pixel shown in FIGURE 3; FIGURE 5 illustrates a system for processing an image according to the present invention; FIGURE 6 illustrates components included within the computing device shown in FIGURE 5; FIGURE 7 illustrates an image to be processed according to the present invention; FIGURE 8 illustrates a pixel of interest including an edge between the two (2) rectangles shown in FIGURE 7; FIGURE 9 illustrates a pixel of interest of the lower circle shown in FIGURE 7; FIGURE 10 illustrates a pixel of interest including an edge between the upper and lower circles shown in FIGURE 7; FIGURES 11A - 11D illustrate a flow-chart of the method for processing an image according to the present invention; and FIGURE 12 illustrates an alternate embodiment of components included within the computing device shown in FIGURE 5. FIGURE 5 illustrates a system 110 for creating and processing an image from PostScript. The system 110 includes a computing device 112 to which an output device 120 is connected. In the preferred embodiment, the output device 120 is a color printing device. However it is to be understood that other output devices (e.g., a color facsimile machine) are also contemplated. FIGURE 6 illustrates components within the computing device 112 . Objects within the image are processed from back to front. While the preferred embodiment describes receiving the image in the PostScript language, it is to be understood that other page description languages are also contemplated. As described above, a description of a page contains one or more types of object: text, synthetic graphics, and pictorial. The following section describes processing of synthetic graphics. As the image is rasterized, successive sections (e.g., pixels of interest) of the rasterized data are received, one after another, from the display memory 124 into the image processor 122 . As each pixel of interest is received in the image processor 122 , that segment of data is transformed into low-resolution, antialiased data. The antialiased data includes intermediate values along edges of objects within the image for providing the appearance of smoothness. FIGURE 7 illustrates an image 126 to be processed according to the method of the present invention. The image 126 includes four objects 130, 132, 134, 136 . As described above, each of the objects 130, 132, 134, 136 in the image 126 is processed one after another. Within the image 126 shown in FIGURE 7, two (2) of the objects 130, 132 are first and second rectangles, respectively, having edges 140, 142 that abut each other. Because the two (2) edges 140, 142 abut, they are referred to as a common edge 144 . The other two (2) objects 134, 136 are circles that overlap one another. A common edge 146 between the lower and upper circles 134, 136 , respectively, follows the contour of the upper circle 136 . The first rectangle 130 and the lower circle 134 include a first color, which is illustrated by horizontal lines. The second rectangle 132 and the upper circle 136 include a second color, which is illustrated by vertical lines. The common edge 144 between the two (2) rectangles 130, 132 and the common edge 146 between the two (2) circles 134, 136 include a plurality of pixels. It is not uncommon for one or more of the pixels along the common edges 144, 146 to partially cover both the first and second rectangles 130, 132 and/or both the lower and upper circles 134, 136, respectively. In other words, it is not uncommon that both the first and second colors partially cover one or more of the pixels along the common edges 144, 146 . FIGURE 8 illustrates an enlarged view of a pixel of interest 150 showing the common edge 144 between the two (2) rectangles 130, 132 . The pixel of interest 150 is partially covered by both the first and second colors. FIGURE 9 illustrates an enlarged view of a pixel of interest 152 from the lower circle 134 . FIGURE 10 illustrates a pixel of interest 154 from the common edge 146 between the lower and upper circles 134, 136 , respectively. The pixel of interest 152 shown in FIGURE 9 is directly below the pixel of interest shown in FIGURE 10. In other words, the pixel of interest 152 shown in FIGURE 9 is positioned at the same image location within the image 126 as the pixel of interest 154 shown in FIGURE 10. However, the pixel of interest 152 shown in FIGURE 9 is rasterized earlier than the pixel of interest 154 shown in FIGURE 10. Therefore, the pixel of interest 152 is merely indicated in FIGURE 7 within parentheses. With reference to FIGURES 5-11D, the system 110 determines a current section of the image 126 in a step 200 . Image coordinates of the current section within the image 126 are determined in a step 202 . Respective locations within a high-resolution cache 158 and a low-resolution memory 160 , which correspond to the image coordinates, are determined in steps 204 and 206 , respectively. The high-resolution cache 156 and low-resolution memory 160 are both included within the computing device 112 . The size of the low-resolution memory 160 is at least large enough to store a low-resolution representation of the entire image 126 . The size of the high-resolution cache 156 may be adjusted according to different applications. More specifically, the high-resolution cache 156 is at least large enough to store data representing a high-resolution version of a single section of the image 126 . Alternatively, the size of the high-resolution cache 156 is large enough to store enough data for a high-resolution version of the entire image 126 . In the preferred embodiment, however, the high-resolution cache 156 is large enough to store high-resolution data for 1-3 rasterized scanlines of the image 126 . Because the low-resolution memory 160 is capable of storing an entire low-resolution version of the image, there is a one-to-one correspondence between locations within the low-resolution memory and the image 126 . In other words, x- and y-coordinates calculated in the step 202 are preferably used to indicate a location in the image 126 and in the low-resolution memory 160 . However, because the high-resolution cache 156 is preferably much smaller than the images 126 , a hash function is used to determine locations within the high-resolution cache 156 that correspond to locations within the image 126 . In the preferred embodiment, the hash function used to determine a location in the high-resolution cache 156 corresponding to the image location determined in the step 202 is 2x + 3y. Therefore, once the location of the current section (i.e., the pixel of interest) is determined within the image 126 , the x-coordinate and the y-coordinate of the image location are substituted into the hash function to determine the corresponding location within the high-resolution cache 156 . As is commonly practiced in the art, rasterization algorithms operate on objects in order from one edge to another along a scanline before proceeding to the next scanline. Thus on a given scanline, first one edge is processed. Then zero or more interior pixels are processed. Finally the other edge is processed. By the nature of the algorithm, it is clear whether an edge or interior pixel is being processed. For example, if the pixel of interest currently being processed is that shown in either FIGURE 8 or FIGURE 10, the pixel represents an edge of an object. If, on the other hand, the pixel of interest currently being processed is that shown in FIGURE 9, the pixel represents an interior of an object. Unlike the pixels illustrated in FIGURES 8 and 10, the pixel illustrated in FIGURE 9 only includes a single color. A determination is made in step 210 as to whether the current section represents an interior ar an edge of the object currently being processed. If the pixel of interest represents an interior of the object currently being processed, low-resolution data representing the pixel of interest is received into the location, which corresponds to the current section of the image 126 , within the low-resolution memory 160 , in a step 212 . Next, in a step 214 , a determination is made as to whether the location within the high-resolution cache 156 , which corresponds to the current image location, includes valid data. Each "location" within the high-resolution memory includes several segments of data. More specifically, one segment contains the high-resolution data (typically sixteen bits), another segment contains the x-coordinate and the y-coordinate of the image location associated with the high-resolution data, and another segment contains a validity bit. The validity bit indicates whether the high-resolution data stored in a particular location is valid. Therefore, the determination in step 214 , as to whether the data stored in the corresponding location of the high-resolution cache 156 is valid, is made by examining the validity bit. In the preferred embodiment, it is to be understood that each of the validity bits in the high-resolution cache 156 is set to "invalid" before an image is processed. If the high-resolution data at the corresponding location is valid, the x-and y-coordinates of the high-resolution data are examined, in step 216 , to determine if they match the x- and y-coordinates of the current image location of the current section. If the coordinates in the cache 156 do match the coordinates of the current image location, the high-resolution data stored in the cache 156 corresponds to a previously rasterized layer of the image 126 . For example, the data could correspond to the portion of the lower circle 134 that is covered by the upper circle 136 . Therefore, the validity bit in the cache 156 is set to "invalid" in a step 220 . If the high-resolution data at the corresponding location is invalid, and/or if the coordinates in the cache 156 do not match the coordinates of the current image location, the validity bit is not changed. At this point, if the pixel of interest currently being processed represents an interior of an object, processing is returned to step 200 to process the next current section, if all the sections of the image 126 have not been processed. If the pixel of interest represents an edge of an object currently being processed, a determination is made in step 222 as to whether the location within the high-resolution cache 156 , which corresponds to the image location of the current section, includes valid data from a previously processed section of the image 126 . If it is determined in the step 222 that the data already in the high-resolution cache 156 is valid, step 224 determines if the image location of the valid data in the high-resolution cache 156 corresponds to the image location of the current section. More specifically, the image location corresponding to the high-resolution data in the cache 156 is determined by examining the x-coordinate and the y-coordinate associated with the high-resolution data. Those x- and y-coordinates are then compared with the x- and y-coordinates of the current section, which were calculated in step 202 . If the image location of the high-resolution data in the high-resolution cache 156 does not match the image location of the current section, a low-resolution representation of the high-resolution data stored in the cache 156 is determined in a step 226 , and the low-resolution version of the data is received in the image processor 122 . Then, a location within the low-resolution memory 160 , which corresponds to the x-and y-coordinates of the high-resolution data in the high-resolution cache 156 , is ascertained in a step 230 . Then, in step 232 , the low-resolution representation determined in step 226 is received into the low-resolution memory location determined in step 230 . Control is then passed to step 236 . If, on the other hand, the image location of the high-resolution data in the high-resolution cache 156 does match the image location of the current section, the previous high-resolution data is received from the high-resolution cache into the image processor 122 in a step 234 . Then, control is passed to step 246 . In step 236 , the x- and y-coordinates of the image location, which correspond to the pixel of interest, are received into the corresponding location within the high-resolution cache 156 . Previous low-resolution image data, corresponding to a previously processed section at the current image location, is received from the low-resolution memory 160 into the image processor 122 in a step 240 . A high-resolution representation of the low-resolution data, received into the image processor 122 in the step 236 , is determined in a step 242 . Then, a high-resolution representation of the low-resolution data from the current section is determined and received into the image processor 122 in a step 244 . Converting the low-resolution to high-resolution data may be done by any of a number of ways. The two (2) high-resolution representations in the image processor 122 are merged in a step 246 . The merged data, which results from step 246 , is then received from the image processor 122 into the location within high-resolution cache 156 , which corresponds to the image location of the current section, in a step 250 . Lastly, the location within high-resolution cache 156 , which corresponds to the image location of the current section, is set as "valid" in a step 252 . Then, in step 254 control is returned to step 200 to process the next section. While text and pictorials could be processed in like manner to synthetic graphics, this would be undesirably slow. Instead, pictorials are processed by writing pictorial data directly into the low-resolution frame buffer, while clearing any valid bits belonging to pixels in corresponding parts of the high resolution cache. In like fashion, text avoids the high resolution cache, except to clear any affected valid bits. However, while pictorials have no need for high resolution information, text is first rasterized at high resolution, then filtered down to low resolution, and stored in a low resolution character cache. Low resolution, filtered characters are then combined with the low resolution frame buffer using alpha blending. That is, the resolution character cache contains (typically 8 bit) values indicating the mask information, which is combined with the current color information and the color in the low resolution frame buffer to provide the new color which is written into the frame buffer. In those mask pixels whose value is full on, the new color is written directly to the frame buffer. In those mask pixels whose value is 0, the frame buffer is left unchanged. In the remaining mask pixels, some intermediate value, α, is used in the equation: new value = old value + α (current color - old value) A second embodiment of the computing device according to the present invention is illustrated in FIGURE 12. With reference to FIGURE 12, the computing device 300 includes a specialized processor 302 , which provides the function of antialiasing data written into a frame buffer memory 304 . The computing device 300 maintains a high resolution cache 306 as described above for the first embodiment. The cache 306 is maintained as some form of associative memory which can readily indicate whether a given address maps to any cache location. In this embodiment, the addresses are mapped using a hashing scheme as described above. However, other possible mapping implementations are also contemplated. The specialized processor 302 receives commands from a general processor 310 requesting the specialized processor 302 to a) set the current color, b) set the entire low resolution pixel at some address to the current color, (i) with or (ii) without alpha blending c) set a single high resolution pixel at some address to the current color, d) set all pixels in a sub-rectangle of a high resolution block to the current color, or e) initiate a DMA copy of a block of pixels representing a pictorial, possibly rotating the block while copying. In case d), only sub-rectangles that are either (i) above and to the left, (ii) above and to the right, (iii) below and to the left, or (iv) below and to the right of a specified pixel may be specified (including a specification of which of these four cases). Thus the specialized processor 302 recognizes at least six op-codes, all of which include operands. The specialized processor 302 maintains the high resolution cache 306 , and hides from the general purpose processor 310 the details of scaling low resolution pixels to high resolution form. Also, the specialized processor 302 maintains an instruction queue, allowing the general purpose processor 310 to continue with other operations without waiting for graphical operations to complete, and allowing the special purpose processor 302 to execute non-conflicting operations without waiting for memory reads and writes to be complete. When the specialized processor 302 receives a "set color" command, the processor 302 stores a value of the "set color" command's first operand in an internal register 312 . When the specialized processor 302 receives a "set low" command, the specialized processor 302 initiates a write operation to the low resolution frame buffer memory 304 at the destination indicated by the first and second operands, using the value in the internal register 312 . The specialized processor 302 also tests the high-resolution cache 306 to determine whether the destination location is in the cache 306 , in which case the processor 302 clears the "cache valid" flag of the corresponding location. When the specialized processor 302 receives a "set low with alpha" command, the processor 302 compares the value in the third operand of the command to 0 and to all ones, and in the former case, does nothing further. In the latter case the processor 302 proceeds as if a regular "set low" code had been received. In the remaining cases (all other values of alpha), the processor 302 first initiates a read from a memory corresponding to the location in the first and second operands into an internal register 316 . The specialized processor 302 then combines the value in the register 312 with the value in the register 316 , weighted by the contents of the third operand of the command. After combining the two values, the result is written back to the memory 314 at the same location. In the preferred embodiment, the combining operation applies the mathematical expression described above for alpha blending. However, other methods, including approximations using a table lookup, are also contemplated. When the specialized processor 302 receives a "set high resolution pixel" command it tests the high-resolution cache 306 for the location identified by the first and second operands of the command (with low order bits masked off) ― the target location. If the cache 306 contains the target location, it sets the pixel within a cache block at that location to the current color in the register 312 . If the high-resolution cache 306 does not contain the target location, it forms averages of any of the eight neighbors of the target location, which are in the cache 306 . Then the specialized processor 302 initiates reads of the remaining neighbors, along with the target location itself, from the low resolution buffer 304 . With these nine values, the specialized processor 302 forms a scaled-up version of the target location. The specialized processor 302 also forms the average of the location in the cache 306 to which the target location will map after the operation, and writes that average to the low resolution memory 304 at the location mapping to the cache location before the operation. Once the scaled-up version is available, the specialized processor 302 replaces the location in the scaled-up version indicated by the low order bits of the first two operands with the value in the register 312 . When the specialized processor 302 receives a "set high resolution rectangle" command it performs essentially the same operations as for "set high resolution pixel", except that it also decodes the rectangle instructions to determine which of the high resolution pixels are to be set. The specialized processor 302 then sets all those pixels to the current color when it obtains a high resolution version of the location (either from the cache or by scaling). When the specialized processor 302 receives a "DMA write" command, the processor 302 sets a first register "DA" to the value of the first operand of the command: this first register is used as the starting location for the data copy. The processor 302 sets a second register "DL" to the value of the second operand of the command: this is used as a scanline length during the copy. The processor 302 sets a third register "DN" to the value of the third operand of the command: this is the number of scanlines in the copy; and it sets a fourth register "DS" to the value of the fourth operand of the command: this is the number of bytes between starts of successive scanlines in the input. The remaining two operands specify the X and Y location in the frame buffer 304 of the starting destination location. These remaining two operands are stored in registers DX and DY. With all registers initialized, the specialized processor 302 begins a direct memory copy, in which it reads values at memory locations within the address space of general processor 310 specified by DA, incrementing DA and decrementing DL with every read. The specialized processor 302 then writes the values at X and Y locations DX and DY, incrementing DX with every write. When DN becomes zero, DX is set back to the value in the fifth operand, DY is incremented, DL is set back to the value of the third operand, DA is increased by DS-DL, and DN is decremented. When DN reaches 0, the copy ceases. In a third embodiment, a specialized processor offers a DMA with alpha operation which combines the effects of the DMA write with the set low resolution with alpha.

Claims: A method of generating an antialiased image including at least one object (130, 132, 134, 136), comprising: 1) receiving current data describing each of the at least one objects (130, 132, 134, 136) into a processing buffer; 2) rasterizing portions of the current data representing edges of the at least one objects (130, 132, 134, 136); 3) receiving the rasterized data into a high resolution cache (156); 4) transforming the rasterized data in the high resolution cache into low resolution data; and 5) receiving at least one of the current data and the rasterized data into a low resolution memory (160), characterized by determining (210) if the current section does include an edge; if the current section includes an edge, said method further including 6) determining (222) if previous high-resolution data is included in the high-resolution cache (156); if the previous high-resolution data is included in the high-resolution memory and the previous high-resolution data corresponds to a previous section of a previously processed object, the previous section having a same location within the image as the current section: 7) merging (246) the previous high-resolution data with a high-resolution version of the current data; and 8) receiving (250) the merged data from the step 7 into the high-resolution cache (156); if the previous high-resolution data is included in the high-resolution cache (156) and the previous high-resolution data corresponds to a previous section of a previously processed object, the previous section having a different location within the images as the current section: 9) receiving (226) a low-resolution version of the previous high-resolution data from the high-resolution memory into the low-resolution memory (160); 10) receiving (230, 232) original low-resolution data from the low-resolution memory (160) into the processing buffer, the original low-resolution data corresponding to the same location within the image as the current section; 11) merging (246) a high-resolution version of the original low-resolution data with the high-resolution version of the current data; and 12) receiving (250) the merged data from the step 11 into the high-resolution memory; if the previous high-resolution data is not included in the high-resolution memory: 13) receiving the high-resolution version of the current data in the high-resolution cache (156). A system for processing a color image, comprising: a high-resolution cache (156) for storing high-resolution data; a low-resolution memory (160), connected to the high-resolution cache (156), for storing low-resolution data, the low-resolution memory (160) being capable of storing at least as much data as the high-resolution cache (156); a processing buffer; an image processor (122), connected to both the high-resolution cache (156) and the low-resolution memory (160), said image processor (122) being adapted to perform the steps of 1) receiving current data describing each of at least one objects (130, 132, 134, 136) into the processing buffer; 2) rasterizing portions of the current data representing edges of the at least one objects (130, 132, 134, 136); 3) receiving the rasterized data into the high resolution cache (156); 4) transforming the rasterized data in the high resolution cache into low resolution data; and 5) receiving at least one of the current data and the rasterized data into the low resolution memory (160), characterized in that said image processor (122) is further configured for 6) determining (222) if previous high-resolution data is included in the high-resolution cache (156); if the previous high-resolution data is included in the high-resolution memory and the previous high-resolution data corresponds to a previous section of a previously processed object, the previous section having a same location within the image as the current section; 7) merging (246) the previous high-resolution data with a high-resolution version of the current data; and 8) receiving (250) the merged data from the step 7 into the high-resolution cache (156); if the previous high-resolution data is included in the high-resolution cache (156) and the previous high-resolution data corresponds to a previous section of a previously processed object, the previous section having a different location within the images as the current section: 9) receiving (226) a low-resolution version of the previous high-resolution data from the high-resolution memory into the low-resolution memory (160); 10) receiving (230, 232) original low-resolution data from the low-resolution memory (160) into the processing buffer, the original low-resolution data corresponding to the same location within the image as the current section; 11) merging (246) a high-resolution version of the original low-resolution data with the high-resolution version of the current data; and 12) receiving (250) the merged data from the step 11 into the high-resolution memory; if the previous high-resolution data is not included in the high-resolution memory: 13) receiving the high-resolution version of the current data in the high-resolution cache (156).

Inventors: KLASSEN VICTOR R, KLASSEN, VICTOR R.
Applicants: XEROX CORP, XEROX CORPORATION
Application year: 1999
Main classification: G06T15
IPC codes: G06T11, H04N1, G09G5, G06T5, B41J5