Method of comprehensive distortion correction for a computer image generation system

• US 4,714,428 A
• Filed: 01/28/1987
• Issued: 12/22/1987
• Est. Priority Date: 12/19/1985
• Status: Expired due to Term

• Current Assignee: Intel Corporation
• Original Assignee: General Electric Company
• Inventors: Bunker, William M., Merz, Donald M.
• Primary Examiner(s): Picard, Leo P.
• Application Number:
  US07/009,649
• Time in Patent Office: 328 Days
• Field of Search: 434/43, 340/723
• US Class Current: 434/43
• CPC Class Codes: G06T 15/20 Perspective computation

Abstract

A method for computer image generation producing simulated visual scenes for applications such as flight training, employing a comprehensive distortion correction to generate the image takes place in three sequential stages: Controller, Geometry Processor, and Display Processor. The Display Processor generates video to produce the desired scene on the raster of the display device. If the scene is projected through a wide-angle lens and/or is projected onto a curved screen, the combination of optical and geometric distortion presents a highly distorted scene to the viewer. The comprehensive distortion correction method produces a precisely predistorted scene on the projector raster so it appears valid to the viewer. Mapping between projector space and viewer space is highly nonlinear. However, a small region of the display (span) is selected sufficiently small so that the projector/viewer transformation may be considered linear. The Geometry Processor defines face edges in viewer space and maps edge vertices into projector space. In the Display Processor detection of spans intersected by a given face is done in viewer space using the mapped span corners and edge coefficients defined by the Geometry Processor. Edge to span corner distances are determined in viewer space. This produces a piecewise linear approximation to the curves which exact mapping would provide. The edges are continuous at span boundaries and have slope discontinuities so small as to be imperceptable. The resulting scene appears fully valid to the viewer, with all distortions corrected.

Claims

1. In an image generating system of the type for converting digital data into a sequence of display frames of image data in projector space suitable for display on a video image system in viewer space, the image system forming a display by individually illuminating each of a plurality of color pixels, each of the frames of image data defining a plurality of faces and each of the frames being divided into a plurality of spans, including an electronic control means for converting the digital data, a method for correcting for geometric distortion and optical distortion comprising the steps of:

(a) identifying data for a frame of display, the data defining face locations in viewer space, each of the faces associated with at least one span and being arranged in a descending order of priority;

(b) calculating transformation coefficients for mapping projector space span corners into viewer space;

(c) determining the highest priority face for each span;

(d) determining an area within a viewer space span covered by the highest priority face;

(e) computing pixel image data representative of the pixels within the projector space span covered by the face;

(f) repeating step (c) through step (f) until the last face is processed into pixel image data or until all areas of the spans are fully covered by faces; and

(g) transferring the pixel image data to the video image system.

2. The method of claim 1, wherein the step (b) of calculating, further comprises the step of predetermining the transformation coefficients for a mapping for a fixed projection of the pixel image for a fixed view.

3. The method of claim 1, wherein the step (b) of calculating, further comprises the step of computing a variable mapping for a moving viewer or projection relative to the video image system.

4. The method of claim 1, wherein the step (c) of determining further comprises the step of determining an edge of the highest priority face for a projector space span.

5. The method of claim 4, wherein the step of determining an edge, further comprises the steps of:

(a) identifying data for a face, the data representative of an edge of a face in viewer space, each edge having a starting and a terminating vertex and a slope;

(b) locating the edge vertices in viewer space coordinates;

(c) transforming the edge vertices from viewer space to projector space for defining a starting projector space span and a terminating projector space span for an edge of the face;

(d) transforming the projector space span corners to viewer space span corners;

(e) computing a perpendicular distance in viewer space from the edge of the face to the viewer space span corners;

(f) determining from the viewer space distance a subsequent projector space span intersected by the edge of the face;

(g) storing in a memory each projector space span intersected by the edge;

(h) storing where the edge intersects the span boundaries in projector space;

(i) repeating step (d) of transforming through step (h) of storing until the last edge of the face is processed; and

(j) repeating step (a) of identifying through step (c) of transforming using a next face, until all the faces are processed.

6. The method of claim 5, wherein the step (f) of determining further comprises the step of searching along the edges of a face in a clockwise direction, beginning with a first edge of a face, for each span that an edge of a face passes through.

7. The method of claim 5, wherein the step (e) of computing a perpendicular further comprises the steps of:

(a) inputting, into the address lines of a read only memory, data representative of the slope of an edge and the endpoints;

(b) calculating the perpendicular distance from the corner of each span according to the formula D=LO+LI*I+LJ*J, where;

D is the perpendicular distance from a point (I,J) to an edge;

LO is an initial predetermined distance from a fixed reference point such as I=0 and J=0;

LI is the cosine of the edge slope; and

LJ is the sine of the edge slope;

and

(c) outputting, from the data lines of the read only memory, data representative of the perpendicular distance from the corner of a span to an edge.

8. The method of claim 5, further comprising the steps of:

(a) determining a projector space span to be processed based upon data representative of the area covered by previously processed faces;

(b) recalling from memory the edges of the highest priority non-processed face intersecting a projector space span;

(c) determining the portions of the span covered by the face defined by the recalled edges; and

(d) repeating steps (a) of determining through step (c) of determining until all spans are covered or until all faces are processed.

9. The method of claim 8, wherein step (c) of determining the portions of the span further comprises the steps of:

(a) recalling from memory where the edge intersects the span boundaries in projector span;

(b) calculating new edge coefficients for the projector space span;

(c) determining a pixel of a projector space span intersected by an edge of a face;

(d) dividing the pixel into a plurality of subpixel areas;

(e) computing a distance from the center of each pixel area to the edge;

(f) determining the area of the subpixel areas covered by the face bounded by the edge;

(g) computing a weight for each subpixel area from the area covered by the face and the color of the face;

(h) repeating step (d) of dividing through step (g) of computing for each edge through the pixel;

(i) summing the weighted values for each pixel;

(j) generating a color for each pixel corresponding to the summed weighted values; and

(k) repeating step (c) of determining through step (h) of generating for each pixel intersected by an edge in the span.

10. The method of claim 9, wherein the step (i) of summing further comprises the steps of:

(a) receiving data representative of a translucency of a face in a subpixel area;

(b) summing the translucency of the subpixel area of the face with the weighted value for the subpixel to obtain a translucency weighted value.

11. The method of claim 10, further comprising the step of receiving data representative of a translucency of a face in a subpixel area based upon a programatic event representative of smoke, fog, environmental events, and events characteristic of simulated warfare.

12. The method of claim 9, wherein the step (e) of computing a distance from the center of each pixel area, further comprises the step of computing the distance from the center of a subpixel area to the edge by bilinear interpolation of the distances from the corners of the pixel to the edge.

13. The method of claim 9, wherein the step (f) of determining the area of the subpixel areas, further comprises the step of determining the subpixel areas assigned to the face as a function of the distance to the edge and slope of the edge.

14. The method of claim 9, wherein the step (e) of computing a distance from the center of each pixel area, further comprises the steps of:

(a) inputting the distances from each pixel area to the edge, and the edge slope, into a read only memory having address lines for input and memory lines for output;

(b) calculating the perpendicular distance from the corner of each span according to the formula D=LO+LI*I+LJ*J, where;

D is the perpendicular distance from a point (I,J) to an edge;

LO is an initial predetermined distance from a fixed reference point such as I=0 and J=0;

LI is the cosine of the edge slope; and

LJ is the sine of the edge slope; and

(c) determining the subpixel areas assigned to the face from the distance to the edge and the slope of the edge; and

(d) outputting the subpixel areas assigned to the face on the memory lines of the rear only memory.

15. The method of claim 14, further comprising the step of determining the accuracy of a subpixel area assigned to the face by a total area accuracy of at least one-half subpixel area.

16. The method of claim 15, further comprising the step of determining the accuracy of a subpixel area assigned to the face by a positioned accuracy of at least one subpixel.

17. The method of claim 9, wherein the step (g) of computing, further comprises the step of computing a weight for each subpixel area equal to the area covered by a face times the color.

18. The method of claim 9, the step (i) of summing further comprises the step of receiving data representative of a translucency of a face in a subpixel area based upon input from an external logic means.

19. The method of claim 1, wherein the step (h) of transferring, further comprises the steps of:

(a) receiving data for a pixel, the data including a haze control, an illumination control and a texture control;

(b) computing a color contribution for the pixel image data from the data and the previous pixel image data; and

(c) transferring the color contribution of the pixel image data to the video display.

20. In an image generating system of the type for converting digital data into a sequence of display frames of image data in projector space suitable for display on a video image system in viewer space, the image system forming a display by individually illuminating each of a plurality of color pixels, each of the frames of image data defining a plurality of faces and each of the frame being divided into a plurality of spans, including an electronic control means for converting the digital data, a method for correcting for geometric distortion and optical distortion comprising the steps of:

(a) identifying data for a frame of display, the data defining face locations in viewer space, each of the faces associated with at least one span;

(b) calculating transformation coefficients for mapping projector space span corners into viewer space;

(c) determining a face to be processed for each span;

(d) determining an area within a viewer space span covered by said face;

(e) computing pixel image data representative of the pixels within the projector space span covered by said face;

(f) repeating step (c) through step (f) until a last face is processed into pixel image data; and

(g) transferring the pixel image data to the video image system.

21. The method of claim 20, wherein the step (b) of calculating, further comprises the step of computing a variable mapping for a moving viewer or projection relative to the video image system.

22. The method of claim 20, wherein the step (b) of calculating, further comprises the step of predetermining the transformation coefficients for a mapping for a fixed projection of the pixel image for a fixed view.

23. The method of claim 22, wherein the step (c) of determining further comprises the step of determining an edge of the highest priority face for a projector space span.

24. The method of claim 23, wherein the step of determining an edge, further comprises the steps of:

(a) identifying data for a face, the data representative of an edge of a face in viewer space, each edge having a starting and a terminating vertex and a slope;

(b) locating the edge vertices in viewer space coodinates;

(c) transforming the edge vertices from viewer space to projector space for defining a starting projector space span and a terminating projector space span for edge of the face;

(d) transforming the projector space span corners to viewer space span corners;

(e) computing a perpendicular distance in viewer space from the edge of the face to the viewer space span corners;

(f) determining from the viewer space distance a subsequent projector space span intersecting by the edge of the face;

(g) storing in a memory each projector space span intersected by the edge;

(h) storing where the edge intersects the span boundaries in projector space;

(i) repeating step (d) of transforming through step (h) of storing until the last edge of the face is processed; and

(j) repeating step (a) of identifying through step (c) of transforming using a next face, until all the faces are processed.

25. The method of claim 24, wherein the step (f) of determining further comprises the step of searching along the edges of a face in a clockwise direction, beginning with a first edge of a face, for each span that an edge of a face passes through.

26. The method of claim 24, wherein the step (e) of computing a perpendicular distance further comprises the steps of:

(a) inputting, into the address lines of a read only memory, data representative of the slope of an edge and endpoints;

(b) calculating the perpendicular distance from the corner of each span according to the formula D=LO+LI*I+LJ*J, where;

D is the perpendicular distance from a point (I,J) to an edge;

LO is an initial predetermined distance from a fixed reference point such as I=0 and J=0;

LI is the cosine of the edge slope; and

LJ is the sine of the edge slope;

and

(c) outputting, from the data lines of the read only memory, data representative of the perpendicular distance from the corner of a span to an edge.

27. The method of claim 24, further comprising the steps of:

(a) determining a projector space span to be processed based upon data representative of the area covered by previously processed faces;

(b) recalling from memory the edges of the highest priority non-processed face intersecting a projector space span;

(c) determining the portions of the span covered by the face defined by the recalled edges; and

(d) repeating steps (a) of determining through step (c) of determining until all spans are covered or until all faces are processed.

28. The method of claim 27, wherein step (c) of determining the portions of the span further comprises the steps of:

(a) recalling from memory where the edge intersects the span boundaries in projector span;

(b) calculating new edge coefficients for the projector space span;

(c) determining a pixel of a projector space span intersected by an edge of a face;

(d) dividing the pixel into a plurality of subpixel areas;

(e) computing a distance from the center of each pixel area to the edge;

(f) determining the area of the subpixel areas covered by the face bounded by the edge;

(g) computing a weight for each subpixel area from the area covered by the face and the color of the face;

(h) repeating step (d) of dividing through step (g) of computing for each edge through the pixel;

(i) summing the weighted values for each pixel;

(j) generating a color for each pixel corresponding to the summed weighted values; and

(k) repeating step (c) of determining through step (h) of generating for each pixel intersected by an edge in the span.

29. The method of claim 28, wherein the step (i) of summing further comprises the steps of:

(a) receiving data representative of a translucency of a face in a subpixel area;

(b) summing the translucency of the subpixel area of the face with the weighted value for the subpixel to obtain a translucency weighted value.

30. The method of claim 29, further comprising the step of receiving data representative of a translucency of a face in a subpixel area based upon a programatic event representative of smoke, fog, environmental events, and events characteristic of simulated warfare.

31. The method of claim 28, the step (i) of summing further comprises the step of receiving data representative of a translucency of a face in a subpixel area based upon input from an external logic means.

32. The method of claim 28, wherein the step (e) of computing a distance from the center of each pixel area, further comprises the step of computing the distance from the center of a subpixel area to the edge by bilinear interpolation of the distances from the corners of the pixel to the edge.

33. The method of claim 28, wherein the step (f) of determining the area of the subpixel areas, further comprises the steps of determining the subpixel areas assigned to the face as a function of the distance to the edge and slope of the edge.

34. The method of claim 28, wherein the step (e) of computing a distance from the center of each pixel area, further comprises the steps of:

(a) inputting the distance from each pixel area to the edge, and the edge slope, into a read only memory having address lines for input and memory lines for output;

(b) calculating the perpendicular distance from the corner of each span according to the formula D=LO+LI*I+LJ*J, where;

D is the perpendicular distance from a point (I,J) to an edge;

LO is an initial predetermined distance from a fixed reference point such as I=0 and J=0;

LI is the cosine of the edge slope; and

LJ is the sine of the edge slope;

and

(c) determining the subpixel areas assigned to the face from the distance to the edge and the slope of the edge; and

(d) outputting the subpixel areas assigned to the face on the memory lines of the read only memory.

35. The method of claim 34, further comprising the step of determining the accuracy of a subpixel area assigned to the face by a total area accuracy of at least one-half subpixel area.

37. The method of claim 28, wherein the step (g) of computing, further comprises the step of computing a weight for each subpixel area equal to the area covered by a face times the color.

38. The method of claim 20, wherein the step (h) of transferring, further comprises the steps of:

(a) receiving data for a pixel, the data including a haze control, an illumination control and a texture control;

(b) computing a color contribution for the pixel image data from the data and the previous pixel image data; and

(c) transferring the color contribution of the pixel image data to the video display.

36. The method of claim 36, further comprising the step of determining the accuracy of a subpixel area assigned to the face by a positioned accuracy of at least one subpixel.