EP0439714A2 - Anti-aliasing method for graphic display - Google Patents

Anti-aliasing method for graphic display Download PDF

Info

Publication number
EP0439714A2
EP0439714A2 EP90122594A EP90122594A EP0439714A2 EP 0439714 A2 EP0439714 A2 EP 0439714A2 EP 90122594 A EP90122594 A EP 90122594A EP 90122594 A EP90122594 A EP 90122594A EP 0439714 A2 EP0439714 A2 EP 0439714A2
Authority
EP
European Patent Office
Prior art keywords
pixels
triangular
region
triangular regions
color
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP90122594A
Other languages
German (de)
French (fr)
Other versions
EP0439714A3 (en
EP0439714B1 (en
Inventor
Willie Williamson, Jr.
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP0439714A2 publication Critical patent/EP0439714A2/en
Publication of EP0439714A3 publication Critical patent/EP0439714A3/en
Application granted granted Critical
Publication of EP0439714B1 publication Critical patent/EP0439714B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09GARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
    • G09G5/00Control arrangements or circuits for visual indicators common to cathode-ray tube indicators and other visual indicators
    • G09G5/20Function-generator circuits, e.g. circle generators line or curve smoothing circuits
    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09GARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
    • G09G1/00Control arrangements or circuits, of interest only in connection with cathode-ray tube indicators; General aspects or details, e.g. selection emphasis on particular characters, dashed line or dotted line generation; Preprocessing of data
    • G09G1/28Control arrangements or circuits, of interest only in connection with cathode-ray tube indicators; General aspects or details, e.g. selection emphasis on particular characters, dashed line or dotted line generation; Preprocessing of data using colour tubes
    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09GARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
    • G09G5/00Control arrangements or circuits for visual indicators common to cathode-ray tube indicators and other visual indicators
    • G09G5/36Control arrangements or circuits for visual indicators common to cathode-ray tube indicators and other visual indicators characterised by the display of a graphic pattern, e.g. using an all-points-addressable [APA] memory
    • G09G5/39Control of the bit-mapped memory
    • G09G5/391Resolution modifying circuits, e.g. variable screen formats

Definitions

  • the present invention relates generally to the display of raster images, and more specifically to an anti-aliasing algorithm for use with such displays.
  • Raster images are typically displayed using a raster image.
  • the raster image is a rectangular array of rectangular picture elements known as pixels.
  • Raster images can be displayed on CRT monitors in monochrome or various colors. Raster images are also used to display text and graphics on printers, plotters, and other display devices.
  • Aliasing is the jagged, stair-step appearance when lines and edges are displayed which are neither vertical nor horizontal. This problem is more noticeable when a small number of large pixels are used for a given area. Increasing the resolution of the display device, thereby increasing the number of pixels per unit area, improves the appearance of the raster image.
  • One of the more successful anti-aliasing algorithms involves edge blur. Along the edge of the diagonal or curved line, where stair-steps occur, there is ordinarily a sharp transition between the pixels that are drawn in the different colors of the two regions. The staircase appearance occurs because pixels of one color lay immediately adjacent to those of another color, making the jagged transition between them noticeable.
  • edge blur algorithm With an edge blur algorithm, however, it is possible to average the color values of the two regions along the edge and then display missing pixels in the staircase using this in-between color. The result is a blurring or softening of the edge, smoothing over the transition between the colors of the different regions.
  • One disadvantage of this approach is that the display device must be able to display colors which are intermediate between the colors of the two different regions.
  • the larger display or printout usually has more pixels for displaying the image than the original image.
  • a simple method to enlarge the original raster image is to simply enlarge the original pixels, mapping them to the pixels of the enlarged image. If, for example, the zoom factor is 8, each pixel of the original image becomes an 8x8 square of pixels in the resulting image. If the pixels are simply enlarged in this manner, each of the 64 pixels in a square corresponding to an original pixel is simply given the same color value as the original pixel. This gives the same appearance as simply using very large pixels in the resulting image, and the stair-step phenomena is generally more noticeable than in the original image. Use of intermediate colors for these large pixels does not completely solve the problem.
  • a method for determining the values of pixels in a resulting image having a greater number of pixels than an original image describes a technique for calculating the values of the new pixels in the resulting image.
  • a rectangular region centered on a junction of four pixels in the original image is used as the basis for calculation. This rectangular region contains one-fourth of the adjacent original pixels, and is divided into 8 triangular regions. All of the pixels of the resulting image within a triangular region are given the same color, and the color assigned to the pixels in each such triangular region is a function of the colors of the four adjacent pixels in the original image.
  • Figure 1 shows a portion of a raster image 10 formed from a plurality of pixels.
  • the pixels of Figure 1 are divided into four rows R1, R2, R3 and R4, and four columns C1, C2, C3 and C4. Pixels can be referred to by their coordinates, so that pixel 12 is identified by the location (R2, C4) and pixel 14 is identified by the location (R4, C2).
  • FIG 2 shows the four adjacent pixels in the upper left hand corner of Figure 1. Shading of the pixels is omitted in Figure 2 for clarity.
  • a method for calculating the pixel colors in the resulting image utilizes rectangular region 16. Rectangular region 16 has the same shape as each of the pixels, which is square as shown in Figures 1 and 2. Rectangular region 16 is centered on the intersection point 18 of the four pixels. In Figure 2, the four pixels illustrated are shown as being slightly spaced apart both for clarity and because adjacent pixels are actually separated by a small space in some types of displays. Rectangular region 16 is considered to include the nearest one-fourth of each adjacent pixel.
  • Figure 3 illustrates logical regions 1-8 into which rectangular region 16 is divided. Regions 1 and 5 correspond to the lower right hand corner of pixel (R1, C1) of Figure 2. Regions 2 and 6 correspond to the lower left hand corner of pixel (R1, C2). The remaining regions likewise correspond to the remaining pixels adjacent to intersection point 18. The numbered regions will be used in connection with the detailed description of the preferred method for assigning pixel colors as described in connection with Figure 4.
  • Figure 4 is a flowchart of the calculations necessary to assign colors to all of the pixels within one rectangular region 16. In order to determine the colors of all of the pixels in the resulting array, the calculation outlined in Figure 4 is performed for a rectangular region 16 for the intersection point 18 between every set of four adjacent pixels in the array. The calculation of Figure 4 is therefore performed a number of times equal to (N-1)*(M-1) for an N X M array of pixels.
  • the first step 30 is to assign colors to the pixels located in regions 1, 2, 3, 4.
  • the pixels in these regions are assigned the same color as the color of the original pixel of which each region is a part. Therefore, for example, considering rectangular region 16 of Figure 2, regions 1, 3, and 4 are assigned the shaded color, while region 2 is assigned the unshaded color.
  • the next step is to perform the conjunctive logical comparisons of step 32. If the color of region 1 is equal to the color of region 2, region 3, and region 4, the YES branch is taken. When this condition occurs, all four of the original pixels have the same color, and the entire area of rectangular region 16 is assigned this color. Therefore, regions 5, 6, 7, and 8 are assigned the same color as region 1 is step 34.
  • step 36 the test shown in step 36 is performed. This is a comparison to see whether the color of region 1 is the same as the color of 4, and the color or region 2 is the same as that of region 3. If this is the case, the four original pixels formed a checkerboard pattern using two colors, and no changes will be made within the area encompassed by rectangular region 16. Thus, if the result of test 36 is true, control skips ahead to step 38 which assigns interior triangular regions 5, 6, 7, and 8 to have the same color as their adjacent exterior triangular regions 1, 2, 3, 4. After step 38, processing is complete.
  • step 40 the color of region 1 is compared to the color of region 4. If they are the same color, control passes to step 42. If this point is reached in the flowchart, it is known that the upper left and lower right pixels have the same color, while the lower left and upper right pixels are of differing colors. This means that a line is formed by the upper left and lower right pixels, and all of the interior regions 5, 6, 7, 8 are given the same color as region 1.
  • step 42 the test of step 42 is performed. This test is analogous to that performed in step 40, except that a check is made to see whether the same colors are found in regions 2 and 3. If so, control passes to step 46. If this point in the flowchart is reached, it is known that regions 2 and 3 have the same color, while regions 1 and 4 have dissimilar colors. Therefore, all of the interior triangular regions 5, 6, 7, 8 are assigned the same color as region 2.
  • step 38 assigns each of the interior triangular regions the same color as their adjacent exterior triangular region. If step 38 is reached, it is known that one of three situations has occurred with respect to the four adjacent pixels. If control passes from step 44 to step 38, either each of the adjacent pixels is a different color from all of the others, or any adjacent pixels of the same color are vertically or horizontally adjacent. If control has reached step 38 from step 36, the two color checkerboard pattern described above occurs. In either event, the four corners of the rectangular region 16 are given the same value as the original pixels from which they are derived.
  • Figure 5 illustrates the effect of the method of Figure 4 on a portion of the raster image of Figure 1.
  • the four original pixels (R2, C2), (R2, C3), (R3, C2), and (R3, C3) are shown.
  • the zoom, or magnification, factor is 8, meaning that each original pixel is translated to an 8x8 region of pixels in the resulting image. If the pixels of Figure 1 were translated unchanged into Figure 5, a large stair-step would be evident.
  • Applying the method of Figure 4 to the various intersection points of Figure 1 gives the result of Figure 5, wherein the upper right hand corners of the (R2, C2) and (R3, C3) regions are set to the non-shaded color, and the lower left triangular region of (R2, C3) is shaded.
  • the method described above can be used when a raster image is converted to be shown on a CRT display having a greater number of pixels than that of the original display. It is also suitable for use when a raster image is to be greatly enlarged so that it can be printed on a printer or plotter. This allows, for example, an image suitable for viewing on a CRT display to be enlarged and printed on a large chart suitable for showing to an auditorium.
  • the detailed embodiment described above can be generalized to include more than eight triangular regions if desired. For example, if diagonal lines are drawn between the corners of rectangular region 16 in Figure 3, 16 triangular regions would result. These can be assigned colors as a function of the four adjacent pixels. It is also possible to center such a 16-piece region on a pixel instead of an intersection, and color the triangular regions as a function of the eight surrounding pixels. Dividing the rectangular region 16 into a large number of triangular regions is not preferred because it is computationally expensive. Also, the information content of the original pixels is much lower than that of the resulting image, and performing complex interpolations usually does not improve the resulting image to a degree which justifies the extra computation. It is usually more fruitful to simply recreate the original image at a higher resolution if possible.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Image Processing (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Generation (AREA)

Abstract

A method for determining the values of pixels in a resulting image having a greater number of pixels than an original image describes a technique for calculating the values of the new pixels in the resulting image. A rectangular region centered on a junction of four pixels in the original image is used as the basis for calculation. This rectangular region contains one-fourth of the adjacent original pixels, and is divided into 8 triangular regions. All of the pixels of the resulting image within a triangular region are given the same color, and the color assigned to the pixels in each such triangular region is a function of the colors of the four adjacent pixels in the original image.

Description

  • The present invention relates generally to the display of raster images, and more specifically to an anti-aliasing algorithm for use with such displays.
  • Computer text and graphics are typically displayed using a raster image. The raster image is a rectangular array of rectangular picture elements known as pixels. Raster images can be displayed on CRT monitors in monochrome or various colors. Raster images are also used to display text and graphics on printers, plotters, and other display devices.
  • One problem encountered when displaying a raster image is that of aliasing. Aliasing is the jagged, stair-step appearance when lines and edges are displayed which are neither vertical nor horizontal. This problem is more noticeable when a small number of large pixels are used for a given area. Increasing the resolution of the display device, thereby increasing the number of pixels per unit area, improves the appearance of the raster image.
  • One of the more successful anti-aliasing algorithms involves edge blur. Along the edge of the diagonal or curved line, where stair-steps occur, there is ordinarily a sharp transition between the pixels that are drawn in the different colors of the two regions. The staircase appearance occurs because pixels of one color lay immediately adjacent to those of another color, making the jagged transition between them noticeable.
  • With an edge blur algorithm, however, it is possible to average the color values of the two regions along the edge and then display missing pixels in the staircase using this in-between color. The result is a blurring or softening of the edge, smoothing over the transition between the colors of the different regions. One disadvantage of this approach is that the display device must be able to display colors which are intermediate between the colors of the two different regions.
  • It is sometimes desirable to enlarge a raster image to create a large graphic printout or display. The larger display or printout usually has more pixels for displaying the image than the original image. A simple method to enlarge the original raster image is to simply enlarge the original pixels, mapping them to the pixels of the enlarged image. If, for example, the zoom factor is 8, each pixel of the original image becomes an 8x8 square of pixels in the resulting image. If the pixels are simply enlarged in this manner, each of the 64 pixels in a square corresponding to an original pixel is simply given the same color value as the original pixel. This gives the same appearance as simply using very large pixels in the resulting image, and the stair-step phenomena is generally more noticeable than in the original image. Use of intermediate colors for these large pixels does not completely solve the problem.
  • It would be desirable to provide a method for anti-aliasing which is suitable for use when a raster image is enlarged, or otherwise translated to a resulting image having more pixels than the original. It would also be desirable to provide such a method which uses only the original image colors in order to retain sharpness of the image. It would further be desirable for such a method to be relatively simple to implement and fast in operation.
  • It is therefore an object of the present invention to provide an anti-aliasing method suitable for use when an original raster image is translated to a resulting image containing more pixels than the original, such as an enlarged image.
  • It is another object of the present invention to provide such a method which utilizes only the colors present in the original image, without requiring the generation of intermediate colors.
  • It is another object of the present invention to provide such a method which is easily implemented and fast in operation.
  • Therefore, according to the present invention, a method for determining the values of pixels in a resulting image having a greater number of pixels than an original image describes a technique for calculating the values of the new pixels in the resulting image. A rectangular region centered on a junction of four pixels in the original image is used as the basis for calculation. This rectangular region contains one-fourth of the adjacent original pixels, and is divided into 8 triangular regions. All of the pixels of the resulting image within a triangular region are given the same color, and the color assigned to the pixels in each such triangular region is a function of the colors of the four adjacent pixels in the original image.
  • The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself however, as well as a preferred mode of use, further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:
    • Figure 1 illustrates a small portion of a raster image;
    • Figure 2 is a diagram illustrating the location of a rectangular region used in the calculation of pixel colors for a resulting raster image;
    • Figure 3 illustrates the rectangular region of Figure 2 divided into 8 triangular regions;
    • Figure 4 is a flowchart illustrating the steps of a preferred implementation of the present invention; and
    • Figure 5 illustrates the results of applying the method of Figure 4 to a portion of the raster image of Figure 1.
  • Figure 1 shows a portion of a raster image 10 formed from a plurality of pixels. The pixels of Figure 1 are divided into four rows R1, R2, R3 and R4, and four columns C1, C2, C3 and C4. Pixels can be referred to by their coordinates, so that pixel 12 is identified by the location (R2, C4) and pixel 14 is identified by the location (R4, C2).
  • The pixels of Figure 1 are shown in two colors: shaded and not shaded. The invention will be illustrated below in conjunction with pixels having only two colors, but, as will be appreciated by those skilled in the art, also applies to multi-color images.
  • Figure 2 shows the four adjacent pixels in the upper left hand corner of Figure 1. Shading of the pixels is omitted in Figure 2 for clarity. When raster image 10 is to be enlarged, a method for calculating the pixel colors in the resulting image utilizes rectangular region 16. Rectangular region 16 has the same shape as each of the pixels, which is square as shown in Figures 1 and 2. Rectangular region 16 is centered on the intersection point 18 of the four pixels. In Figure 2, the four pixels illustrated are shown as being slightly spaced apart both for clarity and because adjacent pixels are actually separated by a small space in some types of displays. Rectangular region 16 is considered to include the nearest one-fourth of each adjacent pixel.
  • Figure 3 illustrates logical regions 1-8 into which rectangular region 16 is divided. Regions 1 and 5 correspond to the lower right hand corner of pixel (R1, C1) of Figure 2. Regions 2 and 6 correspond to the lower left hand corner of pixel (R1, C2). The remaining regions likewise correspond to the remaining pixels adjacent to intersection point 18. The numbered regions will be used in connection with the detailed description of the preferred method for assigning pixel colors as described in connection with Figure 4.
  • Figure 4 is a flowchart of the calculations necessary to assign colors to all of the pixels within one rectangular region 16. In order to determine the colors of all of the pixels in the resulting array, the calculation outlined in Figure 4 is performed for a rectangular region 16 for the intersection point 18 between every set of four adjacent pixels in the array. The calculation of Figure 4 is therefore performed a number of times equal to (N-1)*(M-1) for an N X M array of pixels.
  • Referring to Figure 4 considered in conjunction with Figure 3, the first step 30 is to assign colors to the pixels located in regions 1, 2, 3, 4. The pixels in these regions are assigned the same color as the color of the original pixel of which each region is a part. Therefore, for example, considering rectangular region 16 of Figure 2, regions 1, 3, and 4 are assigned the shaded color, while region 2 is assigned the unshaded color.
  • The next step is to perform the conjunctive logical comparisons of step 32. If the color of region 1 is equal to the color of region 2, region 3, and region 4, the YES branch is taken. When this condition occurs, all four of the original pixels have the same color, and the entire area of rectangular region 16 is assigned this color. Therefore, regions 5, 6, 7, and 8 are assigned the same color as region 1 is step 34.
  • If the NO branch is taken from step 32, the test shown in step 36 is performed. This is a comparison to see whether the color of region 1 is the same as the color of 4, and the color or region 2 is the same as that of region 3. If this is the case, the four original pixels formed a checkerboard pattern using two colors, and no changes will be made within the area encompassed by rectangular region 16. Thus, if the result of test 36 is true, control skips ahead to step 38 which assigns interior triangular regions 5, 6, 7, and 8 to have the same color as their adjacent exterior triangular regions 1, 2, 3, 4. After step 38, processing is complete.
  • If the result of step 36 is NO, control passes to step 40. In step 40, the color of region 1 is compared to the color of region 4. If they are the same color, control passes to step 42. If this point is reached in the flowchart, it is known that the upper left and lower right pixels have the same color, while the lower left and upper right pixels are of differing colors. This means that a line is formed by the upper left and lower right pixels, and all of the interior regions 5, 6, 7, 8 are given the same color as region 1.
  • If the result of step 40 is NO, the test of step 42 is performed. This test is analogous to that performed in step 40, except that a check is made to see whether the same colors are found in regions 2 and 3. If so, control passes to step 46. If this point in the flowchart is reached, it is known that regions 2 and 3 have the same color, while regions 1 and 4 have dissimilar colors. Therefore, all of the interior triangular regions 5, 6, 7, 8 are assigned the same color as region 2.
  • If the result of step 44 is NO, control passes to step 38. As described above, step 38 assigns each of the interior triangular regions the same color as their adjacent exterior triangular region. If step 38 is reached, it is known that one of three situations has occurred with respect to the four adjacent pixels. If control passes from step 44 to step 38, either each of the adjacent pixels is a different color from all of the others, or any adjacent pixels of the same color are vertically or horizontally adjacent. If control has reached step 38 from step 36, the two color checkerboard pattern described above occurs. In either event, the four corners of the rectangular region 16 are given the same value as the original pixels from which they are derived.
  • The precise conditions tested, and the order in which the tests are made, need not be exactly as shown in Figure 4. Any set of tests which colors regions 1-8 in the same manner as described above can be used. The general rule is to color all of the interior triangles 5-8 the same color as two diagonally opposite exterior triangular regions 1 and 4, or 2 and 3, unless the checkerboard pattern occurs.
  • Figure 5 illustrates the effect of the method of Figure 4 on a portion of the raster image of Figure 1. The four original pixels (R2, C2), (R2, C3), (R3, C2), and (R3, C3) are shown. In this example, the zoom, or magnification, factor is 8, meaning that each original pixel is translated to an 8x8 region of pixels in the resulting image. If the pixels of Figure 1 were translated unchanged into Figure 5, a large stair-step would be evident. Applying the method of Figure 4 to the various intersection points of Figure 1 gives the result of Figure 5, wherein the upper right hand corners of the (R2, C2) and (R3, C3) regions are set to the non-shaded color, and the lower left triangular region of (R2, C3) is shaded.
  • Since the edges of the triangles of Figure 3 pass through pixels of the zoomed image, it is necessary to determine whether pixels lying on both sides of a diagonal line are to be assigned the same color as the outside triangular region or interior triangular region. In the example of Figure 5, the assumption is made that pixels lying along a diagonal line of Figure 3 are assigned the same color as the outside triangular region. This causes the slight bump in the line found in the (R2, C3) quadrant of Figure 5.
  • It will be appreciated by those skilled in the art that the comparisons and assignments shown in Figure 4 can be performed very quickly, even when the original raster image has a large number of pixels. The quality of the zoomed, resulting image is improved quite dramatically. No intermediate colors need to be generated, so that the sharpness of the transitions between differently colored regions is maintained in the enlarged image.
  • The method described above can be used when a raster image is converted to be shown on a CRT display having a greater number of pixels than that of the original display. It is also suitable for use when a raster image is to be greatly enlarged so that it can be printed on a printer or plotter. This allows, for example, an image suitable for viewing on a CRT display to be enlarged and printed on a large chart suitable for showing to an auditorium.
  • The detailed embodiment described above can be generalized to include more than eight triangular regions if desired. For example, if diagonal lines are drawn between the corners of rectangular region 16 in Figure 3, 16 triangular regions would result. These can be assigned colors as a function of the four adjacent pixels. It is also possible to center such a 16-piece region on a pixel instead of an intersection, and color the triangular regions as a function of the eight surrounding pixels. Dividing the rectangular region 16 into a large number of triangular regions is not preferred because it is computationally expensive. Also, the information content of the original pixels is much lower than that of the resulting image, and performing complex interpolations usually does not improve the resulting image to a degree which justifies the extra computation. It is usually more fruitful to simply recreate the original image at a higher resolution if possible.
  • While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention.

Claims (11)

  1. A method for performing anti-aliasing when an original raster image is translated to a resulting raster image having a greater number of pixels comprising the steps of:

    defining a rectangular region at each intersection of four pixels of the original image, wherein the rectangular region is divided into eight equally sized triangular regions, with four such triangular regions forming an inner rectangular region centered within the defined rectangular region;

    assigning each of four exterior triangular regions, not within the inner rectangular region, a color the same as a corresponding adjacent pixel of the original image; and,

    if exactly one pair of diagonally opposite exterior triangular regions has the same color then assigning all of the interior triangular regions such color, else assigning each interior triangular region the same color as an adjacent exterior triangular region.
  2. The method of Claim 1, wherein each triangular region is mapped to selected pixels of the resulting image.
  3. The method of Claim 1 or 2, further comprising the step of:

    displaying the resulting image on a display device.
  4. The method of Claim 3, wherein the display device is a video monitor.
  5. The method of Claim 3, wherein the display device is a printer.
  6. A method for coloring pixels in a resulting raster image having more pixels than an original raster image, comprising the steps of:

    for each intersection of four adjacent pixels in the original image, defining a rectangular region having eight equal sized triangular regions contained therein, wherein four of the triangular regions form an inner rectangular region centered within the rectangular region and the remaining triangular regions are exterior triangular regions each corresponding to one of the adjacent pixels;

    for each rectangular region, calling a procedure which assigns color values to each triangular region; and

    coloring the pixels in the resulting raster image according to the assignments made by the called procedure.
  7. The method of Claim 6, wherein the called procedure comprises the steps of:

    assigning each exterior triangular region the color of its corresponding adjacent pixel;

    if all four exterior triangular regions have the same color, assigning all of the inner triangular regions such color and exiting the procedure;

    if exactly one pair of diagonally opposite exterior triangular regions has the same color assigning all of the interior triangular regions such color, else assigning each interior triangular region the same color as an adjacent exterior triangular region.
  8. A method for performing anti-aliasing when an original raster image is translated to a resulting raster image having a greater number of pixels comprising the steps of:

    defining a rectangular region at each intersection of four pixels of the original image, wherein the rectangular region is divided into a plurality of triangular regions, a first set of such triangular regions being exterior triangular regions and having at least one side lying along an exterior side of the rectangular region, and a second set of such triangular regions being interior triangular regions and not having any sides lying along an exterior side of the rectangular region; and

    assigning colors to each of the triangular regions as a function of the colors of the four original image pixels.
  9. The method of Claim 8, wherein all of the triangular regions have the same size.
  10. The method of Claim 8 or 9, wherein there are four interior regions forming an interior rectangular region centered within the rectangular region, and four exterior triangular regions.
  11. The method of one of Claims 8 to 10, wherein said assigning step comprises the steps of:

    assigning each of the exterior triangular regions a color the same as a corresponding adjacent pixel of the original image; and,

    if exactly one pair of diagonally opposite exterior triangular regions has the same color then assigning all of the interior triangular regions such color, else assigning each interior triangular region the same color as an adjacent exterior triangular region.
EP19900122594 1990-01-05 1990-11-27 Anti-aliasing method for graphic display Expired - Lifetime EP0439714B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US46134290A 1990-01-05 1990-01-05
US461342 1990-01-05

Publications (3)

Publication Number Publication Date
EP0439714A2 true EP0439714A2 (en) 1991-08-07
EP0439714A3 EP0439714A3 (en) 1992-04-01
EP0439714B1 EP0439714B1 (en) 1995-05-24

Family

ID=23832183

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19900122594 Expired - Lifetime EP0439714B1 (en) 1990-01-05 1990-11-27 Anti-aliasing method for graphic display

Country Status (3)

Country Link
EP (1) EP0439714B1 (en)
JP (1) JPH03252778A (en)
DE (1) DE69019723T2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1100068A2 (en) * 1999-11-11 2001-05-16 Grundig AG Apparatus for improving imaging on a display device
WO2001080496A1 (en) * 2000-04-13 2001-10-25 Nokia Corporation Method of mapping into triangles an area of wireless lan and portable device thereof

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1982003290A1 (en) * 1981-03-20 1982-09-30 Brockhurst David Mark Decoder for digital information in a t.v.signal
GB2120899A (en) * 1982-05-24 1983-12-07 Dainippon Screen Mfg A method of and apparatus for forming magnified reproduction image
JPS62229428A (en) * 1986-03-31 1987-10-08 Toshiba Corp Hardcopy controller
EP0336776A2 (en) * 1988-04-07 1989-10-11 Fujitsu Limited Image magnification

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5966261A (en) * 1982-10-08 1984-04-14 Hitachi Ltd Density converter of binary picture
JPS61264482A (en) * 1985-05-18 1986-11-22 Nippon Telegr & Teleph Corp <Ntt> Picture converting system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1982003290A1 (en) * 1981-03-20 1982-09-30 Brockhurst David Mark Decoder for digital information in a t.v.signal
GB2120899A (en) * 1982-05-24 1983-12-07 Dainippon Screen Mfg A method of and apparatus for forming magnified reproduction image
JPS62229428A (en) * 1986-03-31 1987-10-08 Toshiba Corp Hardcopy controller
EP0336776A2 (en) * 1988-04-07 1989-10-11 Fujitsu Limited Image magnification

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
PATENT ABSTRACTS OF JAPAN, vol. 12, no. 97, (P-682), 8th October 1987; & JP-A-62 229 428 (TOSHIBA CORP.) *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1100068A2 (en) * 1999-11-11 2001-05-16 Grundig AG Apparatus for improving imaging on a display device
EP1100068A3 (en) * 1999-11-11 2003-01-08 Grundig AG Apparatus for improving imaging on a display device
WO2001080496A1 (en) * 2000-04-13 2001-10-25 Nokia Corporation Method of mapping into triangles an area of wireless lan and portable device thereof

Also Published As

Publication number Publication date
EP0439714A3 (en) 1992-04-01
DE69019723D1 (en) 1995-06-29
EP0439714B1 (en) 1995-05-24
DE69019723T2 (en) 1996-01-25
JPH03252778A (en) 1991-11-12

Similar Documents

Publication Publication Date Title
US4570233A (en) Modular digital image generator
US7068275B2 (en) Methods and apparatus for rendering an image with depth-of-field display
US5301038A (en) Image processor and method for processing pixel data
US5673376A (en) Method and apparatus for graphically generating images of arbitrary size
US5715331A (en) System for generation of a composite raster-vector image
EP0346621A2 (en) Method of and apparatus for displaying a multicolor image
US20080285889A1 (en) Image transform method for obtaining expanded image data, image processing apparatus and image display device therefore
EP1402509A2 (en) Display device and method of displaying an image
US4992955A (en) Apparatus for representing continuous tone and high contrast images on a bilevel display
US5491769A (en) Method and apparatus for variable minification of an image
EP0601116B1 (en) Apparatus for generating an anti-aliased display image halo
JPS6380375A (en) Texture mapping device
JP3174342B2 (en) Multi-level to binary level raster shape converter
EP1092217B1 (en) Method of and system for detecting and rendering of graphic elements
EP0439714A2 (en) Anti-aliasing method for graphic display
EP0574245A2 (en) Method and apparatus for variable expansion and variable shrinkage of an image
Schmandt Soft Typography.
EP0814429A2 (en) An image processing system
EP0855682B1 (en) Scan line rendering of convolutions
US6891968B2 (en) Method to upscale single-pixel wide text without loss of image sharpness
JPH05297861A (en) 1/n bit phase matching method for graphics
EP0486090B1 (en) Display method and apparatus
JPH0668271A (en) Image processor
AU720754B2 (en) A method of smoothing bitmapped characters
JP2964159B2 (en) Computer graphic display system and method for performing depth queuing

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB IT

17P Request for examination filed

Effective date: 19911112

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB IT

17Q First examination report despatched

Effective date: 19931126

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT

ITF It: translation for a ep patent filed

Owner name: IBM - DR. ING. FABRIZIO LETTIERI

REF Corresponds to:

Ref document number: 69019723

Country of ref document: DE

Date of ref document: 19950629

ET Fr: translation filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19951024

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 19951107

Year of fee payment: 6

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19951123

Year of fee payment: 6

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Effective date: 19961127

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19961127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Effective date: 19970731

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Effective date: 19970801

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20051127