US 6,009,188 AGrant
Method and System for Digital Plenoptic Imaging
Issue Date:1999-12-28
•26 Claims
•38 Drawing Sheets
Abstract
A computer-based method and system for digital 3-dimensional imaging of an object which allows for viewing images of the object from arbitrary vantage points. The system, referred to as the Lumigraph system, collects a complete appearance of either a synthetic or real object (or a scene), stores a representation of the appearance, and uses the representation to render images of the object from any vantage point. The appearance of an object is a collection of light rays that emanate from the object in all directions. The system stores the representation of the appearance as a set of coefficients of a 4-dimensional function, referred to as the Lumigraph function. From the Lumigraph function with these coefficients, the Lumigraph system can generate 2-dimensional images of the object from any vantage point. The Lumigraph system generates an image by evaluating the Lumigraph function to identify the intensity values of light rays that would emanate from the object to form the image. The Lumigraph system then combines these intensity values to form the image.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Michael F. Cohen
- Steven J. Gortler
- Radek Grzeszczuk
- Richard S. Szeliski
Application Information
Application Number:US 6208304
Filing Date:1996-03-20
Priority Date:1996-03-20
Art Unit:271
Classifications
IPC:
G06T 1500
Field of Search:
382345356348359250154;173;285;294;299;300;148;240;274;275;254419;430;425;432;952;95337639;43;50;121;135;14223;463559.22;559.23
Patent Drawings (38 sheets)
Description
Technical Field
The invention relates to a computer imaging system and, more particularly, to a method and system for representing a complete 3-dimensional image of an object.
Background of the Invention
Current computer graphics systems create images of graphics objects by first modeling the geometric and surface attributes of the objects in a virtual environment along with any light sources. The graphics systems can render images of the object in the virtual environment from the vantage point of a virtual camera. Great effort has been expended to develop computer graphics systems that allow objects with complex geometries and material attributes to be modeled. Also, a great effort has been expended to produce graphics systems that simulate the propagation of light through virtual environments to create realistic images.
Such modeling of objects typically involves generating a 3-dimensional representation of the objects using, for example, a polygon mesh to represent the surface of the object. Each polygon in a polygon mesh has vertices in space that define the perimeter of that polygon. Each polygon, thus, corresponds to a small portion of the surface of the object being modeled. To increase the resolution of the modeling, the number of polygons can be increased to represent minute nuances in the shape of the object.
The rendering of an image from such a polygon mesh can be computationally intensive and may not accurately represent the image of the real object in a real environment. The rendering is computationally intensive because for each polygon that corresponds to a portion of the object that is visible in the image, the graphics system would first need to identify that polygon as visible, determine the effects of the light sources, and then apply those effects to the image. The processing at each step can be computationally intensive. Moreover, such graphics systems have had very little success in determining the effects of a light source on the object. A complex object can be made of many different materials and there has been little success in accurately modeling the reflective characteristics of various materials.
Therefore, it has remained difficult or impossible to recreate much of the complex geometry and subtle lighting effects found in the real world. To bypass the modeling problem, recently there has been interest in capturing the geometry, material properties, and motion of objects directly from the real world. This approach typically involves some combination of cameras, structured light, range finders, and mechanical sensing devices such as 3-dimensional digitizers and associated software. When successful, the results can be fed into a rendering program to create images of real objects and scenes. Unfortunately, these systems are still unable to completely capture small details in geometry and material properties. Existing rendering methods also continue to be limited in their capability to faithfully reproduce real world illumination, even if given accurate geometric models.
In certain systems, the traditional modeling/rendering process has been skipped. Instead, these systems capture a series of environment images and allow a user to look around an object from fixed vantage points. Although these captured images accurately represent the object from the fixed vantage points, the usefulness of such systems are limited because the objects can only be viewed from fixed vantage points. Attempts to interpolate an image of the objects from other vantage points have generally proved unsuccessful. It would be desirable to have a system for efficiently representing the complete appearance of an object so that accurate images of an object can be rendered from arbitrary vantage points.
Summary of the Invention
The present invention provides a method and system for 3-dimensional imaging of an object. The system collects images of the object from a plurality of vantage points. For each of a plurality of points on a surface surrounding the object, the system determines based on the collected images the intensity value and direction of light that emanates from the object and passes through the point for each of a plurality of directions. The system then stores each determined intensity value in a data structure indexed by the point on the surface and by the direction. From this 4-dimensional representation of the appearance of the object, the system can render images of the object from arbitrary vantage points. For each pixel of the image to be rendered, the system interpolates the intensity value of that pixel from the stored determined intensity values.
In another aspect, the system generates coefficients for a plenoptic function describing light that passes through each point on a closed surface. The system selects an overall direction of interest as inward or outward to indicate whether an object inside the surface or a scene outside the surface is to be imaged. The system then selects a plurality of points on the surface. For each selected point on the surface, the system estimates the intensity value of a light ray that passes through that point in the selected overall direction for each of a plurality of directions in the selected overall direction.
In yet another aspect, the invention comprises a computer-readable medium that contains a data structure for representing an appearance of an object. The data structure has for each of a plurality of points surrounding the object and for each of a plurality of directions, an intensity value representing light that emanates from the object in that direction and passes through the point.
In the following, term Lumigraph function refers to a 4-dimensional plenoptic function that represents the complete appearance of an object. The term Lumigraph data structure refers to a data structure that contains the coefficients of the Lumigraph function. The term Lumigraph point refers to a pre-defined vantage point on a surface surrounding an object, and the term Lumigraph direction refers to a pre-defined direction from a Lumigraph point.
Brief Description of the Drawings
FIG. 1 illustrates the generating of an image using the Lumigraph function.
FIG. 2 is a block diagram illustrating a cube that surrounds an object.
FIG. 3 illustrates a collection of intensity values, one for each Lumigraph direction, that is associated with a Lumigraph point.
FIG. 4 is a block diagram illustrating the sub-systems of the Lumigraph system.
FIG. 5 is a block diagram illustrating a preferred computer system for digital plenoptic imaging.
FIG. 6 illustrates the specially-designed stage for use in collecting the pictures.
FIG. 7 illustrates the collection user interface.
FIG. 8 illustrates the lower resolution Lumigraph data structures in one dimension.
FIGS. 9A-E illustrate the preferred scattered data approximation algorithm applied to 2-dimensional data.
FIGS. 10-12 illustrate the scattered data approximation algorithm for 1-dimensional images.
FIG. 13 is a diagram illustrating the rendering of an image using ray tracing.
FIG. 14 illustrates the rendering of an image using texture mapping with a constant basis function.
FIGS. 15A-C illustrate the texture mapping using an approximation of the quadralinear basis function.
FIG. 16 provides a geometrical representation of the problem
FIG. 17 shows the same 2-dimensional projection as shown in FIG. 16.
FIGS. 18A and 18B further illustrate depth correction.
FIG. 19 illustrates, in two dimensions, the Octree method.
FIG. 20 is a flow diagram of the Generate.sub.-- Lumigraph procedure.
FIG. 21 is a flow diagram of the Collect.sub.-- Pictures.sub.-- of.sub.-- Object procedure.
FIG. 22 is a flow diagram of the Create.sub.-- Geometry.sub.-- of.sub.-- Object procedure.
FIG. 23 is a flow diagram of the Develop.sub.-- Lumigraph procedure.
FIG. 24 is a flow diagram of the Splat procedure.
FIG. 25 is a flow diagram of the Pull procedure.
FIG. 26 is a flow diagram of the procedure Push.
FIG. 27 is a flow diagram of the Render.sub.-- Image (ray tracing) procedure.
FIG. 28 is a flow diagram of the Render.sub.-- Image (texture mapping) procedure.
FIG. 29 shows a design for the stage.
FIG. 30 is a high-level flow diagram for the procedure Find.sub.-- Markers.
FIG. 31 is a flow diagram of the subroutine Find.sub.-- Equivalents.
FIG. 32 is a flow diagram for the subroutine process.sub.-- pixel.
FIG. 33 is a flow diagram of the subroutine Find.sub.-- Rings.
FIG. 34 is a flow diagram of the subroutine List.sub.-- Markers.
FIG. 35 illustrates a geometric construction that describes the mathematical operations that transform the 3-dimensional real world coordinates of the marker to image coordinates for the marker.
FIG. 36 displays a representation of a light intensity magnitude calculated by application of the 7-dimensional plenoptic function.
FIG. 37 displays an object surrounded by an enclosing spherical surface.
The file of this patent contains at least one drawing executed in color. Copies of this patent with the color drawings will be provided by the Patent and Trademark Office upon request and payment of the necessary fee.
Detailed Description of the Invention
Overview
A preferred embodiment of the present invention provides a computer-based method and system for digital 3-dimensional imaging of an object which allows for viewing images of the object from arbitrary vantage points. The preferred system, referred to as the Lumigraph system, collects a complete appearance of either a synthetic or real object (or a scene), stores a representation of the appearance, and uses the representation to render images of the object from any vantage point. The appearance of an object is a collection of light rays that emanate from the object in all directions. The system stores the representation of the appearance as a set of coefficients of a 4-dimensional function, referred to as the Lumigraph function. From the Lumigraph function with these coefficients, the Lumigraph system can generate 2-dimensional images of the object from any vantage point. The Lumigraph system generates an image by evaluating the Lumigraph function to identify the intensity values of light rays that would emanate from the object to form the image. The Lumigraph system then combines these intensity values to form the image.
In a preferred embodiment, the Lumigraph function describes the light rays that emanate from the object and intersect a cube that surrounds the object. With this Lumigraph function, the Lumigraph system can generate an image from any vantage point inside or outside the cube so long as the point is outside the convex hull of the object. The convex hull is a minimum-shaped volume that surrounds the object such that any two points within the convex hull can be connected by a line that lies entirely within the convex hull. The Lumigraph system assumes the space outside the object is empty space. Therefore, each light ray leaving the convex hull of the object will continue in the same direction and with the same intensity. The Lumigraph function is represented as
where the variables s and t uniquely identify a position on the cube and the variables u and v uniquely identify the direction of a light ray that emanates from the object and intersects the point (s, t) on the cube.
To generate an image using the Lumigraph function, the Lumigraph system determines for each pixel of the image which light ray (s, t, u, v) will form the intensity value of that pixel. FIG. 1 illustrates the generating of an image using the Lumigraph function. Certain light rays from the object 101 would pass through the face 102 of the cube and contribute to the image 103. Each light ray that forms a pixel of the image is in the direction of the center of rojection 104 of the image. For each pixel, the Lumigraph system determines that (s, t) position on the face and that direction (u, v) of the light ray that forms the pixel. The Lumigraph system then evaluates the Lumigraph function at (s, t, u, v) to generate the intensity value for that pixel. Depending on the resolution of the image, more than one light ray may contribute to the formation of the pixel. The Lumigraph system in an alternate embodiment can then set the pixel to a weighted average of the intensity values generated by the Lumigraph function for each of the contributing light rays.
To generate the coefficients for the Lumigraph function, the Lumigraph system first collects a series of pictures of the object from many different vantage points. The Lumigraph system digitizes the pictures and stores the red, green, and blue intensity values for each pixel of each picture. From these intensity values, the Lumigraph system then estimates a weighted average of the intensity values of the light rays that emanate from the object and that would pass through the face of the cube in small pre-defined areas and in pre-defined directions. The centers of the pre-defined areas are referred to as Lumigraph points, and the pre-defined directions are referred to as Lumigraph directions. FIG. 2 is a block diagram illustrating a cube that surrounds an object. The Lumigraph points are arranged on the six faces 201-206 of the cube 200 that surrounds the object. The Lumigraph points 207 are evenly spaced throughout each face of the cube.
FIG. 3 illustrates a collection of intensity values, one for each Lumigraph direction, that is associated with a Lumigraph point. The collection of these weighted average intensity values indexed by their Lumigraph point and their Lumigraph direction are the coefficients of the Lumigraph function and are stored as a Lumigraph data structure. The Lumigraph data structure represents a subset of the plenoptic function relevant to the object. These intensity values are illustrated as one 2-dimensional array, indexed by variables u and v, for every Lumigraph point. Thus, the Lumigraph data structure is a multi-dimensional array that contains intensity values indexed by an indication of a Lumigraph point and a Lumigraph direction. Each light ray (s, t, u, v) that passes through a Lumigraph point in one of the Lumigraph directions is referred to as a Lumigraph ray. The intensity value (coefficient) of a Lumigraph ray is the average of the intensity values in a pre-defined area. The Lumigraph rays for each face are considered to emanate from a plane 301 that is parallel to the face 302 of the cube and a unit distance from the face. Thus, each Lumigraph point has a different set of intensity values associated with it and stored in its 2-dimensional array.
In one embodiment, the Lumigraph system generates the output intensity value of the Lumigraph function by first identifying a light ray (s, t, u, v) that forms a pixel of an image to be rendered. That is, the light ray that intersects point (s, t) on the face of the cube and that is in direction (u, v). Since the Lumigraph data structure contains intensity values for only the Lumigraph rays, the Lumigraph system identifies the Lumigraph ray that is nearest to the light ray (s, t, u, v) and uses its intensity value as the output of the Lumigraph function. The nearest Lumigraph ray is that light ray that passes through the Lumigraph point that is nearest to point (s, t) and in the Lumigraph direction that is nearest to the direction (u, v). Alternatively, the Lumigraph system may interpolate the output intensity value based on a collection of the Lumigraph rays that are near to light ray (s, t, u, v).
FIG. 4 is a block diagram illustrating the sub-systems of the Lumigraph system. The Lumigraph system comprises a collection system 401, a development system 402, and a rendering system 403. The collection system collects various pictures of the object, digitizes the pictures, and stores the digitized pictures along with their vantage points. The development system generates the weighted average intensity values of the Lumigraph rays from the intensity values of the collected pictures and stores those intensity values in the Lumigraph data structure. The rendering system then receives the Lumigraph data structure and an indication of an arbitrary vantage point and renders an image of the object from that vantage point.
FIG. 5 is a block diagram illustrating a preferred computer system for digital 3-dimensional imaging. In one embodiment, the computer system provides hardware support for graphics operations, such as provided by a Silicon Graphics workstation. Alternatively, the computer can be a standard personal computer without such hardware support. The computer system 501 contains a central processing unit, a memory, a storage device, and input/output devices. During operation, the sub-systems of the Lumigraph system 502 are loaded into and executed from the memory. The sub-system of the Lumigraph system are typically loaded into memory from a computer-readable memory device such as a disk. In addition, the collected pictures 503 and the Lumigraph data structure 504 are loaded from a storage device such as disk into memory for processing. The graphics run-time library 505 provides application programming interface for graphics operations. The Lumigraph system uses the graphic run-time library to render the desired image 506. The camera 508 and display devices 507 are used to collect the pictures of the object.
In the following, a description of a preferred implementation of the invention is followed by an analysis describing the theoretical basis underlying the implementation. Also, several different aspects of the invention are described starting with aspects that are simpler to describe. Moreover, since the Lumigraph system performs the same computations relative to each face of the cube enclosing the object, reference is made in the following description to only a single face of the cube. Also, since the Lumigraph system performs the same computation for the red, green, and blue components of an "intensity" value, the following makes reference only to the term "intensity value." One skilled in the art would appreciate that the intensity values could also be represented by models other than the RGB model, such as gray scale, CMY, or YIQ models.
Collection System
Synthetic Objects
To generate a digital plenoptic image of a synthetic object (e.g., an object that is modeled with a polygon mesh), the Lumigraph system generates images of the object from vantage points corresponding to each Lumigraph point. The system then stores the intensity values for each image into the Lumigraph data structure. When each image has the same number of pixels as there are Lumigraph directions associated with a Lumigraph point, the system stores each intensity value directly into the corresponding position of the Lumigraph data structure. Conversely, if the number of pixels and Lumigraph directions differ, then the system may calculate average intensity values for storing in the Lumigraph data structure.
Gantry-Based System
In one embodiment, the collection system can collect a picture of the object at each of the Lumigraph points with an orientation that is normal to the face of the cube. The collection system then digitizes these pictures so that each pixel corresponds to one of the Lumigraph directions for that Lumigraph point. Alternatively, depending on the resolution of the pictures, the collection system may set each intensity value of a Lumigraph ray to the weighted intensity values of several pixels. The system then stores the intensity value of each pixel in the Lumigraph data structure indexed by the Lumigraph point and direction. Alternatively, the camera could be positioned on a robot arm and moved by the arm to each Lumigraph point. A disadvantage of such collection systems is the time and expense involved in setting up the gantry or robot arm and collecting the pictures.
Hand-Held Camera
In a preferred embodiment, the collection system quickly collects pictures taken from arbitrary vantage points and employs a development process to fill the Lumigraph data structure. The collection system receives pictures of the object placed on a specially-designed stage from various arbitrary vantage points. The collection system uses special markings on the stage to calculate the vantage point from which each picture was taken. Thus, the output of the collection system is a collection of digitized pictures along with the vantage point from which each picture was taken.
FIG. 6 illustrates the specially-designed stage for use in collecting the pictures. The stage has two walls 604 and 602 fixed together at a right angle, both perpendicular to the base 603, which can be detached from the walls and rotated. The object 601 is placed at the center of the base. By rotating the base in 90.degree. increments, a camera can be positioned to take pictures from any vantage point above the plane of the base. The stage is preferably painted cyan to allow the collection system to distinguish the object from the background. The walls and base of the stage are inscribed with markers 605 colored a darker shade of cyan. Each marker preferably comprises a set of concentric rings, and each marker is uniquely identifiable.
The stage is designed so that the collection system can determine the vantage point solely from the markers in a picture. The collection system automatically determines the vantage point of a picture by (1) identifying those markers not occluded by the object, (2) scanning the picture for connected components, (3) uniquely identifying each marker based on the ratios of the radii of the concentric rings comprising the marker, and (4) calculating the vantage point from the relative positions of identified markers within the picture.
The camera preferably has a fixed lens. Prior to collecting the pictures, the collection system determines the mapping between each possible light ray impinging on its lens and the points on its film plane where the impinging light ray will fall. This mapping is used by the collection system to calculate the camera position and orientation (i.e., vantage point) from the positions of the markers in a picture.
While pictures are being taken by an operator using the hand-held camera, it is preferable that the operator obtains a reasonable sampling of all possible vantage points. To facilitate taking a reasonable sample, a collection system displays a collection user interface. FIG. 7 illustrates the collection user interface. The user interface displays a representation of the stage 701 with a translucent hemisphere 702 surrounding the object. The user interface displays an indication of the different orientations from which pictures have been taken on the surface of the hemisphere, as a trail of rectangular shapes 703. Alternatively, the pictures can be taken from various pre-defined vantage points. Taking the pictures from pre-defined vantage points would obviate the use of the special markers and calculating the vantage points for each picture, since the vantage points would be known in advance.
Development System
The development system for the gantry-based collection system is straightforward. Each pixel of the digitized picture corresponds to a weighted average intensity value of a Lumigraph ray. Thus, the development system stores the intensity value from the pixel into the Lumigraph data structure. The development system for the hand-held camera collection system, however, is not so straightforward. With the hand-held camera, the pictures are unlikely to be collected from the Lumigraph points and are likely to be unevenly spaced. Consequently, the development system needs to account for the arbitrary vantage points and uneven spacing.
The development system for the hand-held camera collection system is divided into three phases: splatting, pulling, and pushing. In the splatting phase, the development system initializes the intensity value for each Lumigraph ray to an intensity value based on the collected pictures and assigns a confidence level. The confidence level indicates the confidence that the development system has that the initial intensity value accurately represents the actual average intensity value corresponding to the Lumigraph ray. In the pulling phase, the development system calculates the average intensity values and average confidence levels for a series of lower resolution Lumigraph data structures. The resolution of a Lumigraph data structure is the number of Lumigraph rays represented in the data structure. In the pushing phase, the collection system adjusts the intensity levels of the Lumigraph rays with low confidence levels based on the average intensity levels calculated for the lower resolution Lumigraph data structures. The pulling and pushing phases combine to form a scattered data approximation algorithm.
In splatting phase, the development system establishes the initial intensity value along with a confidence level for each Lumigraph ray at the highest resolution. If the collection system collected one or more pictures with a pixel formed, in part, from a light ray that happens to be very near a Lumigraph ray, then the confidence level in the initial intensity value for that Lumigraph ray would be high. Conversely, if the collection system collected no light rays near a certain Lumigraph ray, then the confidence level in the initial intensity value of that Lumigraph ray would be low. The collection system calculates the initial intensity value of each Lumigraph ray by applying a constant or, preferably, a quadralinear averaging filter function. The filter functions indicate how the various intensity values of the collected pictures are to be combined to generate an initial intensity value. The development system calculates the coordinates (s, t, u, v) for each pixel of each picture based on the position of the pixel on the picture, the vantage point of the picture, and the characteristics of the camera or optionally uses the depth corrected coordinates (s, t, u', v') as described below.
With a constant basis function, the intensity values of the collected light rays that are nearest to each Lumigraph ray are averaged to give the initial intensity value for that Lumigraph ray. A collected light ray (s, t, u, v) is "nearest" a Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) when the following condition is satisfied: ##EQU1## where h.sub.st is the distance between neighboring Lumigraph points and h.sub.uv is the distance between neighboring Lumigraph directions. The equation for the constant basis function is: ##EQU2## The constant basis function can be considered to be a function that receives the (s, t, u, v) and (s.sub.i, t.sub.j, u.sub.p, v.sub.q) coordinates and generates a 1 when the collected light ray (s, t, u, v) is nearer to the Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) than any other Lumigraph ray. The equation for the initial intensity value x.sub.i,j,p,q for Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) is: ##EQU3## where is the collection of all collected light rays, where x.sub.s,t,u,v is the intensity value of collected light ray (s, t, u, v), and where w.sub.i,j,p,q is the confidence level represented by the following equation: ##EQU4## That is, for the constant basis function, w.sub.i, j, p, q is equal to the count of the number of collected light rays that are nearer Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) than any other Lumigraph ray.
The development system preferably uses a quadralinear basis function to calculate weighted average intensity values of the collected light rays. With a quadralinear basis function, the intensity values of the collected light rays that are in between a certain Lumigraph ray and its neighboring Lumigraph rays are averaged with a weight based on distance of the collected light ray from the certain Lumigraph ray to give the initial intensity value. A collected light ray (s, t, u, v) is "near" Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) when the following condition is satisfied:
The equation for the quadralinear basis function is: ##EQU5## The value of the quadralinear basis function varies from 1 when the collected light ray (s, t, u, v) coincides with the Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) to 0 when the collected light ray is not near the Lumigraph ray. Thus, the equations for the initial intensity value x.sub.i,j,p,q and the initial confidence level w.sub.i,j,p,q using the quadralinear basis function are the same as equations (1) and (2) with the quadralinear basis function used for function B.sub.i,j,p,q. The confidence level, when the quadralinear basis function is used, is thus the sum of the results of the basis functions for each Lumigraph ray, that is, a weighted sum of the number of collected light rays that are near the Lumigraph ray. If the confidence level is 0, then no collected light ray are near that Lumigraph ray and the initial intensity level is undefined.
In the pulling phase, the development system, generates the intensity values for each light ray of increasingly lower resolution Lumigraph data structures. The intensity value and confidence level of a Lumigraph ray at one resolution are calculated from the next higher resolution. Each lower resolution Lumnigraph data structure represents one-sixteenth the number of Lumigraph rays as the next higher resolution Lumigraph data structure. For example, if the highest resolution Lumigraph data structure represented 2.sup.24 Lumigraph rays, then the next lower resolution would be 2.sup.20, followed by 2.sup.16, 2.sup.12, 2.sup.8, 2.sup.4, and 2.sup.0. FIG. 8 illustrates the lower resolution Lumigraph data structures in one dimension. Level 0 is the highest resolution and level 4 is the lowest resolution. Each level for one dimension contains half the number of Lumigraph rays as the next higher resolution level. The highest resolution Lumigraph data structure, that is, that Lumigraph data structure which is filled with initial intensity values in the splatting phase, is referred to as level 0 and its intensity values and confidence levels are x.sub.i,j,p,q.sup.0 and w.sub.i,j,p,q.sup.0. The intensity values and confidence levels for each lower resolution Lumigraph data structure are represented by the following equations. ##EQU6## where the index k ranges over each i, j, p, and q at level r and where the filter sequence h represents:
and where the filter sequence h.sub.k,i represents: ##EQU7## The factor min(w.sub.k.sup.r, 1) ensures that intensity values with very high confidence levels do not dominate intensity values with lower confidence levels. A confidence level of 1 indicates full confidence. The sequence h.sub.k varies from 0 to 1 in increments of 1/16 and indicates the contribution that each Lumigraph ray of the higher resolution data structure contributes to a Lumigraph ray at the next lower resolution data structure. For example, for intensity values x.sub.10,10,10,10.sup.0 and x.sub.5,5,5,5.sup.1, the result of the filter sequence h.sub.k,ijpq would equal 1. Consequently, intensity value x.sub.10,10,10,10.sup.0 would fully contribute to the weighted average intensity value x.sub.5,5,5,5.sup.1. However, intensity value x.sub.9,11,9,11.sup.0 would contribute only 1/16.sup.th of its intensity value to the weighted average intensity value x.sub.10,10,10,10.sup.1 because the result of function h.sub.k,ijpq would equal 1/16.sup.th. Also, each of the 81 (3.sup.4) nearest Lunigraph rays at level r contributes an amount h.sub.k,ijpq to an intensity value confidence level at level r+1. The Lumigraph rays at each level are indexed starting at (0, 0, 0, 0). So, if the last Lumigraph ray at level 0 is indexed by (31, 31, 255, 255), then the last Lumigraph ray at level 1 would be indexed by (15, 15, 127, 127). One skilled in the art would appreciate that other filter sequences can be used for average intensity values over a wider range of light rays at the next lower level.
The pushing phase starts at the lowest resolution Lumigraph data structure, and adjusts the intensity values and confidence levels for each higher resolution data structure. For each level, the development system calculates the temporary confidence levels tw.sub.i,j,p,q.sup.r and intensity levels tx.sub.i,j,p,q.sup.r that are an interpolation of the current confidence levels ##EQU8## and intensity levels ##EQU9## at the next higher level. Conceptually, these temporary confidence levels and intensity values represent the maximum amount by which the confidence level w.sub.i,j,p,q.sup.r and intensity value x.sub.i,j,p,q.sup.r are adjusted during the pulling phase. The confidence levels and intensity values at a level are adjusted by an amount of the temporary amounts that is proportional to 1 minus the current confidence level at that level. That is, if the confidence level w.sub.i,j,p,q.sup.r is 1, then the intensity value x.sub.i,j,p,q.sup.r is not adjusted; if the confidence level is 0.5, then the intensity value is adjusted by one-half of the temporary intensity value; and if the current level is 0, then the intensity value is set equal to the temporary intensity value. The development system calculates the confidence levels in an analogous manner. Following are equations representing the temporary confidence levels and intensity values: ##EQU10## where k varies over each Lumigraph ray at level r+1 and i,j,p, and q vary at level r over each light ray. The adjusting of the intensity values and confidence levels are represented by the following equation: ##EQU11## The factor (1-w.sub.i,j,p,q.sup.r) represents the weighting of the temporary amounts. In the pushing phase, the development system uses the intensity values and confidence levels from the lower resolution Lumigraph data structure to fill the intensity values and confidence level of the higher resolution Lumigraph data structures. If a high resolution Lumigraph ray has a high confidence level, then its intensity value is left unchanged. However, if a Lumigraph ray has a low confidence level, then its intensity value may be changed to reflect the intensity values of nearby Lumigraph rays with higher confidence levels.
The depth correction described below may optionally be used to alter the filter sequence.
The combination of the pushing and pulling phase are a scattered data approximation algorithm. A scattered data approximation algorithm receives an input of scattered data and then fills in missing data by calculating an estimate of the values for the missing data. For example, if a 2-dimensional image is to be filled in and the scattered data represents 10% of the pixels of the image selected in a random manner, then the scatter data approximation would calculate values for the other 90% of the pixels. The preferred scattered data approximation algorithm preferably takes into consideration the confidence level in each of the input pixels.
FIGS. 9A-E illustrate the preferred scattered data approximation algorithm applied to 2-dimensional data. FIG. 9A is a picture of a mandrill. FIG. 9B illustrates the picture sampled along 256 line segments, and FIG. 9C illustrates the image reconstructed using the scattered data reconstruction algorithm in two dimensions. FIG. 9D illustrates the picture sampled along 100 line segments, and FIG. 9E illustrates that image reconstructed.
FIGS. 10-12 illustrate the scattered data approximation algorithm for 1-dimensional images. A 1-dimensional image can be considered to be a line with a grey scale intensity that varies. FIG. 10 shows the initial confidence levels (C.L.) and intensity values (I.V.) at level 0 in the pulling phase 1001. The line is divided into 16 pixels as indicated by 16 entries at level 0. The data 1003 corresponds to one pixel at one end of the line with a confidence level of 1 and an intensity value of 255 and all other pixels with confidence levels and intensity values of 0. The confidence levels and intensity values for levels 1-4 are also shown. Each level has one-half the number of entries of the next lower level. FIG. 10 also shows the confidence levels and intensity values as adjusted in the pushing phase 1002. Level 0 contains the final approximated intensity values. In this case since only one intensity value was input initially, all the intensity values are set equal to that value. However, the final approximated confidence levels decrease based on distance from the end of the line with the confidence level of 1. FIG. 11 illustrates an approximation when the intensity values at each end of the line are known. In this case, one end of the line has an intensity value of 255 and the other end has an intensity value of 0, both with a confidence level of 1. As expected, the algorithm sets the final approximated intensity values range from 255 to 0 along the line. FIG. 12 illustrates an approximation when the intensity values of the pixel at each end of the line are known and in the center are known. In this case, the ends have an intensity value of 255 and the center has an intensity value of 0 and the confidence level at one end is 1.0, but only 0.5 at the center and the other end. The algorithm sets the final approximated intensity levels to vary from 255 to 32 to 248. Since the center pixel only had a confidence level of 0.5, the end point with the confidence level of 1.0 had an effect on the final approximated intensity value.
Rendering System
The rendering system receives a Lumigraph data structure and a desired vantage point and renders an image of the object from that desired vantage point. The rendering system can use one of several rendering techniques such as ray tracing or texture mapping. Either rendering technique can use a constant basis function or a quadralinear basis function.
FIG. 13 is a diagram illustrating the rendering of an image using ray tracing. The desired image 1302 has a center of projection of 1301. The st plane 1303 represents one face of the cube and contains the Lumigraph points, and the uv plane 1305 represents the Lumigraph directions corresponding to a Lumigraph point. A light ray can be considered to pass through the point (s, t) in the direction (u, v) and intersect pixel 1304 on the image and the center of projection 1301. To render the image, the rendering system selects each pixel of the desired image and calculates the (s, t, u, v) coordinates of the light ray that intersects the center of projection and the selected pixel. Generally, the (s, i, u, v) coordinates will not correspond exactly to a Lumigraph point or a Lumigraph direction.
The rendering system evaluates the Lumigraph function using the Lumigraph data structure generated by the development system. The rendering system generates a resultant intensity value using either a constant basis function or a quadralinear basis function. Below is the equation for the constant basis function. ##EQU12##
That is, with the constant basis function, the rendering system selects the intensity value of the Lumigraph ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q) that is nearest the input light ray (s, t, u, v) as the resultant intensity value of the Lumigraph function. Below is the equation for the quadralinear basis function. ##EQU13##
With the quadralinear basis function, the rendering system combines the intensity values of the 16 Lumigraph rays (s.sub.i, t.sub.j, u.sub.p, v.sub.q) that are near the input light ray (s, t, u, v) weighted by their distance from the input. Below is the equation of the Lumigraph function L. ##EQU14## where the st plane contains M.times.M Lumigraph points and the uv plane contains N.times.N directions. The ray tracing of each pixel of the image can be computational expensive. However, the hardware-supported texture mapping of certain graphics workstations can be used to efficiently render the image.
Texture mapping that is supported by these graphic workstations refers to the process of designating a target polygon, designating source intensity values in a source polygon (texture), filling the target polygon with the intensity values from the source polygon, and rendering the target polygon to the image. If the source and target polygons do not have the same dimensions, then the texture mapping algorithm "adjusts" the source polygon so that the source polygon "fits" into the target polygon. Such adjustments typically involve "stretching" or "contracting" the texture. These graphics workstations support bilinear interpolation when texture mapping and alpha blending of the target polygon with the data already in the image.
FIG. 14 is a diagram illustrating the rendering of an image using texture mapping with a constant basis function. To take advantage of the hardware-supported texture mapping, the rendering system defines a graphics object corresponding to the cube and treats each 2-dimensional array of intensity values that corresponds to a Lumigraph point as a texture map. To render the desired image, the rendering system defines a square target polygon 1403 on a face of the graphics object for each Lumigraph point so that the Lumigraph point is at the center of the square. The rendering system then identifies the four light rays that pass through the corners of that square and intersect the center of projection of the desired image. The intersection of those four light rays with uv plane define a source polygon on the uv plane. The rendering system then texture maps the square target polygon with intensity values from the source polygon of the uv plane.
To texture map using a quadralinear function, the rendering system considers the quadralinear basis function to be a combination of two bilinear basis functions. Below are equations illustrating the quadralinear basis function is a combination of two bilinear basis functions. ##EQU15##
Typical hardware-supported texture mapping can automatically perform bilinear interpolation when texture mapping. Thus, although texture mapping with a quadralinear basis function is not supported, the rendering system does take advantage of the hardware support for texture mapping with bilinear interpolation. Thus, the rendering system uses texture mapping with a bilinear basis function to texture map from the uv plane to the graphics object.
The hardware support, however, does allow the target polygon to be alpha blended into the image during rendering. Alpha blending refers to a process by which the target polygon is combined with the image as it is rendered. To alpha blend, each vertex of the target polygon is assigned a weight. A weight is calculated for each pixel of the target polygon based on its distance from each of the vertices. The calculated weight is a linear combination of the weights of the vertices. When a pixel of the target polygon is rendered, the weighted intensity value of the pixel is added to the intensity value of the corresponding pixel of the image. For example, if the weight of a pixel is one, then its full intensity value is added to the image. However, if its weight is one-half, then only one-half of its intensity value is added to the image.
FIGS. 15A, 15B, and 15C illustrate the texture mapping using an approximation of the quadralinear basis function. In a preferred embodiment, for each Lumigraph point of the graphics object a hexagon is defined as shown in FIG. 15B. Each hexagon is sub-divided into 6 triangles. Each triangle is part of 3 different hexagons, one for each vertex. When texture mapping, the rendering system selects each Lumigraph point. Then, for each of the six triangles in the hexagon for that Lumigraph point, the rendering system identifies the three points on the uv plane that correspond to the vertices. The three points on the uv plane define the texture. The vertex of the target polygon corresponding to the center of the hexagon is assigned an alpha value (weight) of 1 and the other two vertices are assigned an alpha value of 0. When the target polygon is rendered, the texture is applied to the target polygon and the target polygon is alpha blended with the image. Thus, the rendering system approximates the quadralinear basis function with a combination of a bilinear and linear basis functions.
In an alternative embodiment when using depth correction (described below), the resolution of the desired image can be further enhanced by subdividing each hexagon into more than 6 triangles. For example, each of the 6 triangles can be further divided into 4 sub-triangles. FIG. 15C shows a triangle divided into 4 sub-triangles. The mid-point of each side of the larger triangle is connected to form the 4 sub-triangles. When texture mapping a sub-triangle, the alpha values at the mid-points are set to 0.5 and the alpha values at the vertices of the triangle are set to 1 or 0 as discussed above.
The above rendering assumes that the desired image is from a vantage point that is outside the cube. However, if the vantage point is inside the cube, the processing is slightly different. In particular, the center of projection is inverted so that it lies nearer the center of the cube than the desired image. When using a graphics system that uses a virtual camera placement for rendering onto the graphics object, the virtual camera is flipped about the face of the cube and inverted.
Depth Correction
If the object represented by the Lumigraph data structure were flat, and the object were to lie in the uv plane, the basis functions described above would provide a good selection and weighting of Lumigraph rays from which to interpolate the intensity in a given (s,t,u,v) direction. However, most objects have 3-dimensional surfaces, parts of which protrude in front of the uv plane, and other parts of which extend behind the uv plane. For such objects, the above-described basis functions do not select and weight light rays to produce a Lumigraph data structure from which optimally focused images can be generated. This problem is analogous to the problem of focus in camera systems. If the objects that are being imaged do not lie at approximately the same distance from the camera, then they will not all appear to be focused in the resulting image. Objects that lie both in front of and behind the plane of focus will appear blurred in the image.
A geometrical representation of the problem is provided in FIG. 16. FIG. 16 illustrates an object being imaged 1610 that is viewed down the t and v axes, presenting a 2-dimensional projection of (s, t, u, v) space into (s, u) space. The st plane is viewed on edge, projected into the s axis 1601, and the uv plane is viewed on edge, projected into the u axis 1602. The intensity value in the (s, u) direction, represented by light ray 1603 is to be interpolated from the set of Lumigraph rays selected and weighted by the 2-dimensional basis function B.sub.i,p. That selected set of Lumigraph rays is the set of Lumigraph rays between points on the s axis within a distance of h.sub.s from the point s and the points on the u axis within a distance of h.sub.u from the point u, where h.sub.s is the distance between Lumigraph points and h.sub.u is the distance between Lumigraph directions. The set of light rays 1604-1607 represent those selected by the basis function B.sub.i,p.
If the surface of the object contributing to the calculated intensity for light ray (s, u) were flush with the u axis, the Lumigraph rays selected by the basis function B.sub.i,p would intersect a region of length 1608 on the surface of the object. However, because the object is closer to the s axis, these Lumigraph rays intersect the larger region 1609. Therefore, each calculated intensity is spread out over a greater area of the surface of the object, resulting in a loss of clarity in the resulting image calculated from the Lumigraph function. Another way to look at the problem is to consider the area of the surface of the object that contributes information to the intensity value of the light ray (s, u). When the object protrudes in front of the uv plane, as in FIG. 16, a larger area of the surface of the object 1609 contributes to the calculated intensity value for the light ray (s, u) than the area of the uv plane that would contribute to the calculated intensity value for the light ray (s, u). This means that the calculated light ray represents more information in the unfocused, protruding object case than it would in the case where the object lies in the uv plane and properly focused light rays would therefore be selected by the basis function. The more object surface information contributing to a single calculated intensity, the less precisely that ray describes any particular portion of the object surface. This leads both to loss of resolution and to an overlap in the information contributing to the intensities of adjacent light rays, or blurring.
The rendering system overcomes this problem by using the approximate 3-dimensional surface of the object is obtained using the Octree method (described below) from the collected pictures. FIG. 17 shows the same 2-dimensional projection as shown in FIG. 16. Again, the intensity value of light ray (s,u) is calculated from a set of Lumigraph rays. The Lumigraph point s.sub.i which lies closest to s would be selected as the closest approximation for s. Because the distance z from the u axis to the point 1701 where the light ray (s,u) intersects the surface of the object can be determined from the approximate surface of the object, the light ray (s.sub.i, u') 1702 can be used to define a focused selected set of light rays. Thus, without depth correction, the closest Lumigraph ray to (s, u) is (s.sub.i, u.sub.p+1), but with depth correction the closest Lumigraph ray to (s, u) is (s.sub.i, u.sub.p). Essentially, this method overcomes the focus problem by shifting the shape of area of the uv plane mapped to a particular Lumigraph point. In the unfocused case, directions lying on the uv plane within a square region around (u, v) are selected by the basis function for generating a set of discrete Lumigraph rays from which to calculate the intensity value for the light ray (s, t, u, v). In the focused case, directions lying on the uv plane within a generally differently shaped area around (u', v') are selected by the basis function for generating a set of discrete Lumigraph rays from which to calculate the intensity value for the ray (s, t, u, v). By similar triangles, u' can be calculated by the equation: ##EQU16##
In 4-dimensions, a value v' can be analogously calculated. The depth corrected basis function B' can then be calculated from the equation:
FIGS. 18A and 18B further illustrate depth correction. The set of Lumigraph rays selected by the uncorrected 2-dimensional basis function for a particular intensity calculation is illustrated in FIG. 18A. The set of Lumigraph rays selected by the depth corrected basis function for the same intensity calculation is shown in FIG. 18B. The depth corrected basis function selects Lumigraph rays intersecting the surface of the object over a more narrow, focused region on the object's surface.
3-Dimensional Outline of Object
The Lumigraph system optionally depends on a 3-dimensional representation of the object being imaged to improve rendering. The 3-dimensional representation of the object can be used for depth correction as explained above. The cyan coloring of the stage enables the development system to generate an approximate 3-dimensional description of the surface of the object to be imaged. The Lumigraph system employs an octree construction algorithm to generate the surface description. The Lumigraph system first segments each picture taken by the hand-held camera into a binary object/background image by making use of the cyan color of the walls and base of the stage to distinguish the stage from the object. Initially, the Lumigraph system represents the surface of the object by a cube, comprising a number of smaller cubes, that completely encloses the object. These smaller cubes are projected mathematically onto a binary object/background image, essentially a silhouette of the object from the vantage points from which the picture was taken. The Lumigraph system removes those smaller cubes for which the projection falls outside of the silhouette of the object. The Lumigraph system marks those smaller cubes for which the projection falls on the edge of the shadow with an indication that they lie on the surface. After a small number of pictures are processed, the Lumigraph system further subdivides the marked cubes into eight smaller cubes. The Lumigraph system continues to process the image in this fashion, leading to a 3-dimensional representation of the object.
FIG. 19 illustrates, in two dimensions, the Octree method. The large square 1901 is first drawn around the curve representing an object standing on the base. The smaller squares containing portions of the object are preserved in 1902. The squares containing the boundary of the object are further subdivided 1903, and those smaller squares not containing portions of the object are discarded 1904.
The surface modeling process is analogous to having the object being imaged mounted on a turntable, with a bright light shining on the object and casting a shadow of the object onto a screen. A lump of modeling clay is mounted on a second turntable. A sculptor looks at the shadow cast by the object mounted on the first turntable, and cuts the clay to match the silhouette of the object, keeping the knife aligned in the same orientation toward the clay as the light beam is aligned toward the object. Then, the sculptor rotates the two turntables by the same number of degrees in the same direction, and cuts the clay again. After the turntables have been rotated through a full 360 degrees, the light beam is repositioned, and the process repeated. The first time through this process, the sculptor cuts with broad strokes. As the clay begins to more closely resemble the object on the other turntable, the sculptor use smaller, more careful and more precise strokes. After the sculptor repeats the process a number of times, the surface of the clay will closely approximate the surface of the object.
The octree data structure represents the 3-dimensional shape of the object. When depth correcting a light ray (s, t, u, v), it would be very time consuming to search the octree data structure. Consequently, in a preferred embodiment, a 2-dimensional array is generated that contains the depths of the object for each face of the cube. Thus, the depth can be retrieved from this array. Also, certain graphics systems provide hardware support for rendering of an object represented in an octree data structure. With such graphics systems, the intensity of a color of each cube vertex of the octree can be set in proportion to its position. For example, if the z-position is 0.5, then the blue component of the RGB value is set to 127 when using an intensity value scale of 0-255. After setting the intensity values, an image of the object corresponding to a face of the cube is rendered into a 2-dimensional array with the intensity values of the color blue corresponding to the z-position of the object. Thus, this hardware support can be used to efficiently generate a 2-dimensional array of z-position values that can be accessed when depth correcting.
Compression
In a preferred embodiment, the Lumigraph data structure is compressed to reduce storage requirements. The uncompress storage requirements for the Lumigraph data structure can be quite large. For example, if a face of the cube surrounding the object has 32.times.32 Lumigraph points, and each Lumigraph point has a 256.times.256 2-dimensional array of intensity values, and each intensity value if represented by 3 bytes, then the uncompressed storage requirement is 32.sup.2 *256.sup.2 *3*6=1.125 giga-bytes of storage. In one embodiment, each 2-dimensional array is considered a frame and a Joint Photographic Experts Group (JPEG) compression scheme is used for intra-frame compression. Such compression typically results in a compression of 20:1. Also, a Moving Pictures Experts Group (MPEG) scheme can be used for inter-frame compression. Each frame can be considered to be part of 2-dimensional moving picture with each frame corresponding to a Lumigraph point. The frames in each row or column can be considered a moving picture.
3-Dimensional Imaging of a Scene
An embodiment of the present invention can be used to generate digital 3-dimensional images of scenes. In this embodiment, a camera for taking pictures is moved about a scene (e.g, between the Washington and Lincoln memorials). Pictures at many different positions and orientations can be taken from the scene. Since markers would not typically be available in a picture to determine its vantage point, a sensor mounted on the camera could automatically provide the position and orientation of the vantage point. A Lumigraph data structure representing the scene can be created from the pictures. The cube can be considered to surround the empty region of the scene and the Lumigraph points can be on the faces in a manner that is analogous to the 3-dimensional imaging of an object. The development and rendering systems also operate in an analogous manner. Mechanisms to determine orientation and position include global positioning devices.
Implementation
FIG. 20 is a flow diagram of the Generate.sub.-- Lumigraph procedure. The procedure Generate.sub.-- Lumigraph controls the collecting of pictures of an object and then developing of the Lumigraph data structure for that object. In step 2001, the procedure invokes a procedure Collect.sub.-- Pictures.sub.-- of.sub.-- Object. Each picture is stored together with an associated vantage point. In step 2002, the procedure invokes the Segment.sub.-- Object procedure. The Segment.sub.-- Object procedure identifies whether each pixel of each picture represents the object or background information (see blue screening described below). In step 2003, the procedure invokes the Create.sub.-- Geometry.sub.-- of.sub.-- Object procedure. The Create.sub.-- Geometry.sub.-- of.sub.-- Object procedure creates a 3-dimensional outline of the object from the pictures of the object and the segment information. In step 2004, the procedure invokes the Develop.sub.-- Lumigraph procedure. The Develop.sub.-- Lumigraph procedure uses the collected pictures and vantage points to develop the Lumigraph data structure. In step 2005, the procedure invokes the Compress.sub.-- Lumigraph procedure. The procedure is then done.
FIG. 21 is a flow diagram of the Collect.sub.-- Pictures.sub.-- of.sub.-- Object procedure. The Collect.sub.-- Pictures.sub.-- of.sub.-- Object procedure controls the inputting of the pictures that are taken of the object and the determination of vantage points. The pictures are taken with a hand-held camera. In step 2101, the procedure calculates intrinsic parameters of a camera (described below). In steps 2102-2109, the procedure loops collecting pictures taken when the object is in a given orientation. In step 2102, the procedure receives an indication of the object orientation from a user. Since the base of the stage is rotatable in 90.degree. increments, the procedure needs an indication of the current orientation of the object on the stage. In step 2103, the procedure displays the user interface for the hemisphere. In step 2104-2109, the procedure loops and collects in a series of pictures for the current orientation from arbitrary vantage points. In step 2104, the procedure receives a digitized picture. In step 2105, the procedure calculates the vantage point from the picture (described below). In step 2106, the procedure updates the user interface of the hemisphere to indicate that a picture was taken at the calculated vantage point. In step 2107, the procedure stores the picture and the vantage point. In step 2109, if the user indicates that the collecting is complete, then the procedure returns, else the procedure continues at step 2109. In step 2109, if the user indicates that a new orientation is to be selected for the object, then the procedure loops to step 2102, else the procedure loops to step 2104.
FIG. 22 is a flow diagram of the Create.sub.-- Geometiy.sub.-- of Object procedure. The Create.sub.-- Geometry.sub.-- of.sub.-- Object procedure uses an octree data structure to determine the 3-dimensional outline of the object. In step 2201, the procedure creates an octree data structure to encompass the object. In steps 2202-2207, the procedure loops projecting the collected pictures onto the octree data structure. As described above, the outline of the object is projected. The procedure marks the cubes and subcubes of the octree as either full, partially full, or empty. Each partially full cube is subdivided into eight cubes. In a preferred embodiment, this process continues for four levels of cube subdivision. In addition, at each level of subdivision, an increasing number of pictures are selected for use in the projections. In step 2202, if the object geometry is complete, then the procedure returns, else the procedure continues at step 2203. In step 2203 the procedure selects a subset of pictures that are appropriate to the current subdivision level of the octree. In steps 2204-2207, the procedure loops selecting each of the pictures in the subset and marking the nodes of the octree. In step 2204, the procedure selects the next picture of the subset starting with the first. In step 2205, if all the pictures of the selected subset have already been selected, then the procedure returns to step 2202, else the procedure continues at step 2206. In step 2206, the procedure projects the selected image onto the Octree as described above. In step 407, the procedure marks the nodes in the octree and loops to step 2204 to select the next picture of the selected subset.
FIG. 23 is a flow diagram of the Develop.sub.-- Lumigraph procedure. This procedure uses a scattered data approximation algorithm to approximate the intensity value for each Lumigraph ray. In step 2301, the procedure invokes the Splat procedure. The Splat procedure initializes the confidence level and intensity value of each Lumigraph ray in the Lumigraph data structure. In step 2302, the procedure invokes the Pull procedure. The Pull procedure averages the intensity values and confidence levels into increasingly lower resolution Lumigraph data structures. In step 2303, the procedure calls the Push procedure. The Push procedure distributes the intensity levels accumulated in the lower resolution Lumigraph data structures into the higher resolution Lumigraph data structures.
FIG. 24 is a flow diagram of the Splat procedure. The Splat procedure loops through each pixel of each picture and accumulates the confidence levels and intensity values for the Lumigraph rays. The procedure also uses either a constant or quadralinear basis function for determining how each collected light ray of a picture initially affects each Lumigraph ray. In steps 2401-2408, the procedure loops selecting and processing each picture. In step 2401, the procedure selects the next picture starting with the first. In step 2402, if all the pictures have already been selected, then the procedure returns. In step 2403, the procedure selects the next pixel of the selected picture starting with the first. Each pixel corresponds to an (s, t, u, v) coordinate which is calculated based on the vantage point of the picture and location of the pixel on the picture. In step 2404, if all the pixels for the selected picture have already been selected, then the procedure loops to step 2401 to select the next picture, else the procedure continues at step 2405. In steps 2405-2408, the procedure loops selecting a Lumigraph ray that is affected by the selected pixel and adds the selected pixels intensity value and confidence level contribution to the selected Lumigraph ray. In step 2405, the procedure selects the next Lumigraph ray that is affected by the selected pixel. In step 2406, if all the Lumigraph rays that are affected by the selected pixel have already been selected, then the procedure loops to step 2403 to select the next pixel of the selected picture, else the procedure continues at step 2407. In step 2407, the procedure accumulates the confidence level for the selected Lumigraph ray by adding the amount of the basis fuinction to the selected Lumigraph ray. In step 2408, the procedure accumulates into the intensity value of the selected Lumigraph ray, the intensity value of the selected pixel multiplied by the basis weight, and then loops to step 2405 to select the next Lumigraph ray.
FIG. 25 is a flow diagram of the Pull procedure. In steps 2501-2508, the procedure loops selecting each lower resolution Lumigraph data structure starting with the highest resolution and accumulates intensity values and confidence levels in the next lower resolution Lumigraph data structure. Each Lumigraph data structure corresponds to a level. In step 2501, the procedure selects the next lower resolution Lumigraph data structure. Each Lumigraph data structure corresponds to a level starting with the lowest level. In step 2502, if all the Lumigraph structures have already been processed, then the procedure returns, else the procedure continues at step 2503. In step 2503, the procedure selects the next Lumigraph ray at the next highest level to the selected level, starting with the first. In step 2503A, if all the Lumigraph rays at the next highest level have already been selected, then the procedure loops through to step 2501 to select the next level, else the procedure continues at step 2504. In step 2504, the procedure selects the next Lumigraph ray at the selected level that contributes to the selected Lumigraph ray at the next higher level. In step 2505, if all such Lumigraph rays at the selected level have already been selected, then the procedure continues at step 2508, else the procedure continues at step 2506. In step 2506, the procedure accumulates into the confidence level of the selected Lumigraph ray at the next higher level the result of the basis function h for the selected Lumigraph ray at the selected level multiplied by the minimum of the confidence level of the selected Lumigraph ray at the selected level and 1. In step 2507, the procedure accumulates into the intensity value for the selected Lumigraph ray at the next higher level the result of the basis function h for the selected Lumigraph ray at the selected level multiplied by the minimum of the confidence level of the selected Lumigraph ray at the selected level and 1 and multiplies that result by the intensity value of the selected Lumigraph ray of the selected level. The procedure then loops to step 2504 to select the next Lumigraph ray at the selected level. In step 2508, the procedure divides the accumulated intensity value by the accumulated confidence level of the selected Lumigraph ray of the next higher level to give the weighted intensity value. The procedure then loops to step 2503 to select the next Lumigraph ray at the next higher level.
FIG. 26 is a flow diagram of the procedure Push. In steps 2601-2610, the procedure loops selecting each level starting with the second highest level and distributing the intensity values based on the confidence level of the next higher level. In step 2601, the procedure selects the next lower level, starting with the second highest level. In step 2602, if the lowest level has already been selected, then the procedure returns, else the procedure continues at step 2603. In steps 2603-2612, the procedure calculates and distributes a maximum intensity value and confidence level that can be distributed to each Lumigraph ray. In step 2603, the procedure selects the next Lumigraph ray at the selected level. In step 2603A, if all the Lumigraph rays have already been selected at the selected level, the procedure loops to select the next level in step 2601, else the procedure continues at step 2604. In step 2604, the procedure selects the next Lumigraph ray at the next higher level that affects the selected Lumigraph ray at the selected level. In step 2605, if all such Lumigraph rays at the selected level have already been selected, then the procedure continues at step 2608, else the procedure continues at step 2606. In step 2606, the procedure accumulates into a temporary confidence level, the result of the basis function h multiplied by the minimum of the confidence of the selected Lumigraph ray at the next higher level and 1. In step 2607, the procedure accumulates into a temporary intensity value the result of the basis function h multiplied by the minimum of the confidence level of the selected Lumigraph ray at the next higher level and 1, and multiplies that result by the intensity value of the selected Lumigraph ray of the next higher level. The procedure then loops to step 2604 to select the next Lumigraph ray at the selected level. In step 2608, the procedure calculates the weighted intensity value by dividing the temporary intensity value by the temporary confidence level. In step 2609, the procedure adds the temporary confidence levels multiplied by 1 minus the confidence level of the selected Lumigraph ray at the selected level to the confidence level of the selected Lumigraph ray at the selected level. In step 2610, the procedure sets the intensity value at the selected Lumigraph ray at the selected level to the temporary intensity value multiplied by 1 minus the confidence level of the selected Lumigraph ray at the selected level plus the confidence level of the selected Lumigraph ray at the selected level multiplied by the intensity value of the selected Lumigraph ray at the selected level. The procedure then loops to step 2603 to select the next Lumigraph ray at the selected level.
FIG. 27 is a flow diagram of the Render.sub.-- Image (ray tracing) procedure. The Render.sub.-- Image procedure is passed a Lumigraph data structure and a vantage point. The procedure renders an image of the object from that vantage point. This procedure uses the ray tracing technique. In step 2701, the procedure selects the next pixel of the desired image starting with the first. In step 2702, if all the pixels in the desired image have already been selected, then the procedure is done, else the procedure continues at step 2703. In step 2703, the procedure determines the face of the cube associated with the vantage point. In step 2704, the procedure calculates the (s, t, u, v) coordinates corresponding to the light ray from the center of projection through the selected pixel. In step 2705, the procedure depth corrects to give the coordinates (s, t, u', v'). In step 2706, the procedure sets the intensity value of the selected pixel to the result of the Lumigraph function L (s, t, u', v'). The procedure then loops to step 2701 to select the next pixel. In an alternate embodiment, the procedure calculates all light rays (s, t, u, v) that contribute to a pre-defined area corresponding to the pixel and then sets the intensity value of the pixel to a weighted average of those intensity values.
FIG. 28 is a flow diagram of the Render.sub.-- Image (texture mapping) procedure. The Render.sub.-- lmage procedure uses texture mapping with a bilinear-linear basis function. In step 2801, the procedure ray traces the corners of the desired image to determine which Lumigraph points contributed to the desired image. In steps 2802-2809, the procedure loops processing each Lumigraph point that contributes to the desired image. In step 2802, the procedure selects the next Lumigraph point that contributes to the desired image. In step 2803, if all the Lumigraph points have already been selected, then the procedure returns, else the procedure continues at step 2804. In step 2804, the procedure selects the next triangle for the selected Lumigraph point and ray traces its vertices to determine the coordinates (s, t, u, v). In step 2805, if all the triangles have already been selected, then the procedure loops to steps 2802 to select the next Lumigraph point, else the procedure continues at step 2806. In step 2806, the procedure depth corrects the vertices. In step 2807, the procedure texture maps the selected triangle with bilinear interpolation and alpha blending from the source triangle on the uv plane.
Calculation of Camera Vantage Point
The Stage
FIG. 6 shows the stage on which an object is placed for image capture by means of the hand-held camera. Toy lion 601 is the object to be imaged. FIG. 29 shows a design for the stage. The stage comprises a horizontal base, 2931, and two vertical sides, 2932 and 2933. Vertical side 2932 joins the base along the dotted line 2934. Vertical side 2933 joins the base along dotted line 2935 and is attached to vertical side 2932 along dotted line 2936. When so joined, the base and vertical sides form 3 sides of a cube, within which the object to be imaged is placed. The base is not permanently joined to the vertical sides, and can therefore be rotated by 90.degree., 180.degree., and 270.degree. with respect to the vertical sides in order to view the object from all directions within a hemisphere with a base coincident with the base of the object.
The background color of the stage is cyan. The base and vertical sides of the stage are marked with dark cyan bull's eye patterns that are used to determine the position and orientation of the camera from the 2-dimensional images recorded by the camera. The base is marked with 12 bull's eye patterns, 2901-2912. Vertical side 2932 is marked with 9 bull's eye patterns, 2913-2921, and vertical side 2933 is also marked with 9 bull's eye patterns, 2922-2930. Each bull's eye pattern is unique, and comprises between 2 and 5 concentric rings. The outer ring of each pattern has the same radius. One bull's eye pattern can be differentiated from all of the other bull's eye patterns by the number of concentric rings it contains, and by the ratios of the radii of the inner rings to the outermost ring. Table 2934 in FIG. 29 lists the ratios of each of the inner rings to the outer ring for the 30 bull's eye patterns.
Marker Locations
The locations of the stage markers that appear in an image captured by the hand-held camera are determined by the Find.sub.-- Markers procedure. The procedure takes a single 2-dimensional image of the object on stage as input, and produces a list of markers as output, including, for each listed marker, the marker's identity and the position of the center of the marker in 2-dimensional image coordinates. Marker identities correspond to the numbers by which each different marker is listed in Table 2934 of FIG. 29.
FIG. 30 is a high-level flow diagram for the procedure Find.sub.-- Markers. The procedure Find.sub.-- Markers first calls the subroutine Find.sub.-- Equivalents 3001 to generate a pixel map of the image, where each pixel is numbered according to the equivalence class of pixels to which the subroutine Find.sub.-- Equivalents assigns the pixel based on the intensity value recorded for the pixel. The subroutine Find.sub.-- Equivalents also generates an equivalents table that lists pairs of numbers that occur in the pixel map that are equivalent to each other. For example, those pixels numbered with 2 in the pixel map, constituting the equivalence class 2, and those pixels numbered with 8 in the pixel map, constituting the equivalence class 8, may actually comprise a larger equivalence class comprising the two sub-classes 2 and 8. In this case, the equivalents table would contain the number pair 2 and 8.
The procedure Find.sub.-- Markers next calls the subroutine Find.sub.-- Rings 3002. The subroutine Find.sub.-- Rings uses the pixel map and the equivalents table to generate a list of rings identified in the image. Each ring is described by a radius and the coordinates of its centroid. The procedure Find.sub.-- Markers finally calls the subroutine List.sub.-- Markers 3003. The subroutine List.sub.-- Markers uses the list of rings generated by subroutine Find.sub.-- Rings to identify the positions of stage markers that appear in the image. The identified markers are listed as an identifying number and a pair of coordinates describing the position of the marker in the image.
FIG. 31 is a flow diagram of the subroutine Find.sub.-- Equivalents. In step 3101, the subroutine initializes the variable num, which contains the next equivalence class number 0, the first equivalence class. The first pixel position in the pixel map, at row 0 and at column 0, is also initialized to 0. The first pixel will always belong to the first equivalence class. In steps 3102-3108, the subroutine loops selecting each pixel of the image and invokes the subroutine process-pixel.
FIG. 32 is a flow diagram for the subroutine process.sub.-- pixel. This subroutine assigns an equivalence class number for the pixel in the image at coordinates (row, column), and places that number into the pixel map at coordinates (row, column). The subroutine process.sub.-- pixel additionally places entries in the equivalents table. Step 3201 determines whether the intensity value for pixel (row, column) of the image is greater than a threshold value, where the threshold value is set somewhat less than the intensity value for a region of dark cyan in the image. If the intensity is greater than the threshold value, the variable dark is set to TRUE in step 3202, and, if not, the variable dark is set to FALSE in step 3203.
Step 3204 determines whether the value of variable column is greater than 0. If not, the variable left is set to FALSE in step 3205. If column is greater than 0, then, step 3206 determines whether the intensity of the pixel at (row, column-1), directly to the left of the pixel at (row, column), is greater than the threshold value. If it is greater, then the variables left.sub.-- dark and left are both set to TRUE in step 3207, and if not, the variable left.sub.-- dark is set to FALSE and the variable left is set to TRUE in step 3208.
Steps 3209-3213 are analogous to steps 3204-3208, except that the intensity of the pixel at (row-1, column), directly above the pixel at (row, column), is used to set the values of the variable up.sub.-- dark. If there is no upper pixel, then the variable Ip is set to FALSE in step 3210, otherwise the value of the variable up is set to TRUE. At this point in the subroutine, process.sub.-- pixel has determined whether there are pixels in the image at (row, column-1), and (row-1, column). For each of these three pixels that are in the image, process ixel has determined whether they are light or dark. This determination then leads to eight possible scenarios handled in steps 3214-3229.
If both an upper pixel and a pixel to the left of the pixel at (row, column) exist, as determined in step 3214, there are four cases handled in steps 3215-3221. If all three pixels are dark or all three pixels are light, as determined in step 3215, then the equivalence number already assigned to the pixel at (row, column-1) is assigned to the pixel at (row, column), and that number is entered into the pixel map at (row, column) in step 3216. Additionally, if the pixels at (row, column-1) and (row-1, column) have different equivalence class numbers, then an entry is placed in the equivalents table indicating that the two numbers are equivalent. If the pixels at (row, column-1) and (row-1, column) are both light or both dark, and the pixel at (row, column) is different, as determined in step 3217, then, in step 3218, a new equivalence class is created, by incrementing the variable num, and the pixel at (row, column) is assigned to the new equivalence class by entering num into the pixel map at (row, column). If both the pixel at (row, column) and the pixel to the left of it have the same dark/light value, as determined in step 3219, the pixel at (row, column) is assigned to the equivalence class of the pixel at (row, column-1) in step 3220. Finally, if step 3221 is reached, the pixel at (row, column) must have the same light/dark value as the pixel directly above it, and so it is assigned to the equivalence class of the pixel directly above it.
Steps 3222-3229 represent determinations of the equivalence class to which to assign to the pixel at (row, column) in the degenerate cases where there is either no pixel to the left, or no pixel above the pixel at (row, column). In either case, if the pixel at (row, column) has the same light/dark value as the single neighbor that it does have, it is assigned to that neighbor's equivalence class. Otherwise, a new equivalence class is created, and the pixel at (row, column) is assigned to the new equivalence class.
The essence of the equivalence class determination made by the subroutine Find.sub.-- Equivalents is that regions of dark and light pixels in the image are placed in separate equivalence classes.
FIG. 33 is a flow diagram of the subroutine Find.sub.-- Rings. Steps 3301-3304 represent a loop over all the equivalence classes found by the subroutine Find.sub.-- Equivalents, or, in other words, over the values between 0 and num-1. For each selected equivalence class, in step 3302, Find.sub.-- Rings looks for the first entry in the equivalents table output by the subroutine Find.sub.-- Equivalents that includes the selected equivalence class and another equivalence class. If such an entry exists, it indicates that both equivalence classes are sub-classes within a larger equivalence class. Therefore, each occurrence of the selected equivalence class in the pixel map and in the equivalents table is replaced by the number of the other equivalence class, thereby merging the two equivalence classes into one larger equivalence class.
Steps 3305-3309 represent a loop that iterates over the combined, or fully merged, equivalence classes resulting from the loop represented by steps 3301-3304. For each equivalence class, Find.sub.-- Rings determines, in step 3306, both a bounding square within the image that fully encloses the pixels that belong to the selected equivalence class and the centroid for the pixels of the selected equivalence class. The centroid is essentially the computed coordinates of the center of mass of the pixels, where each pixel of the equivalence class has equal weight. With these two computed values, Find.sub.-- Rings determines, in step 3307, whether the selected equivalence class potentially represents a ring corresponding to one of the rings within a stage marker. The equivalence class may potentially represent a ring if the boundary square is between a minimum and maximum value and the centroid for the pixels of the equivalence class coincides with the center of the bounding square within some reasonable tolerance. If the equivalence class may represent a stage marker ring, it is entered into the list of rings in step 3308.
FIG. 34 is a flow diagram of the subroutine List.sub.-- Markers. Steps 3401-3406 represent a loop that iterates over each set of rings with a common centroid in the list of rings created by the subroutine Find.sub.-- Rings. These sets of rings with common centroids are easily selected one-by-one from the list of rings by finding and removing the next set from the list of rings during each iteration of the loop represented by the steps 3401-3406. The selected set of rings is sorted by the size of their bounding squares in step 3402. In step 3403, the number of rings in the selected set, and the ratios of the sizes of the inner rings to the outer ring of the set is compared with the entries in the marker table shown as Table 2934 in FIG. 29. If an entry matches the selected set, as determined in step 3404, then the identity and the image coordinates of the centroid of the marker are placed in the list of markers in step 3405. When the subroutine List.sub.-- Markers finishes, the list of markers contains a complete list of the markers detected by the program Find.sub.-- Markers in the input image.
Computing Camera Pose
The camera pose is determined for each image by the program pose. The camera pose comprises 6 extrinsic parameters and 5 intrinsic parameters, described below. The locations of the stage markers in the input image flurnish a set of known values, and the location of the markers in real 3-dimensional space are fixed by the dimensions of the stage. The intrinsic and extrinsic camera parameters are constants used in a set of mathematical operations that transform the 2-dimensional image coordinates of the markers in the input image to a set of 3-dimensional coordinates for the location of the markers in real space. These operations and the set of image coordinates determined for the markers detected in the image and the known real-space coordinates for the markers comprise, in general, a set of simultaneous, non-linear, and over-determined equations that can be solved to yield values for the intrinsic and extrinsic camera parameters. This method is described in "A Versatile Camera Calibration Technique for High-Accuracy 3D Machine Vision Metrology Using Off-the-Shelf TV Cameras and Lenses," Roger Tsai, IEEE Journal of Robotics and Automation, Vol. RA-3, No. 4, 323-344 (1987), hereby incorporated by reference.
A geometric construction that describes the mathematical operations that transform the 3-dimensional real world coordinates of a marker to image coordinates for the marker is displayed in FIG. 35. The point 3501, with coordinates (X.sub.d, Y.sub.d) represents a point in an image captured by a camera. This point is also represented as a point with coordinates (X.sub.f, Y.sub.f), where the coordinates are expressed in terms of pixels, rather than distances, along the x and y film plane axes. The plane xy, 3509, which passes through the point 3502 on the downward directed z axis, 3503, is the image plane of the camera. It is assumed that the camera lens distorts the image in certain predictable ways. The point 3504 with coordinates (X.sub.u, Y.sub.u) represents the position that point 3501 would have on the image if a perfect pinhole camera, without lens distortion, had been used to capture the image. The distance between the optical center point 3505 and point 3502 is the focal length of the camera .function., 3506. The actual point in 3-dimensional space that is imaged by the camera and that corresponds to the image point (X.sub.d,Y.sub.d) is shown as point 3507 with real world coordinates (x.sub.w, y.sub.w, z.sub.w) with respect to the real world coordinate axes 3508.
A series of mathematical operations transform the real world coordinates of the imaged point 3507 at (x.sub.w, y.sub.w, z.sub.w) to the image coordinates for point 3501 at (X.sub.f, Y.sub.f). These steps are listed below.
(1) Rigid body transformation from the object world coordinate system (x.sub.w, y.sub.w, z.sub.w) to the camera 3D coordinate system (x, y, z): ##EQU17## In the above equation, T is the translation vector: ##EQU18## where T relates the camera coordinate system to the real world coordinate system, or, in other words, (T.sub.x, T.sub.y, T.sub.z) is the location of the origin of the real world coordinate origin in the camera 3D coordinate system.
R is the rotation matrix: ##EQU19## where .theta., .phi., and .psi. are the angles corresponding to camera yaw, pitch, and tilt, respectively.
(2) Transformation from 3D camera coordinates (x, y, z) to ideal image coordinates (X.sub.u, Y.sub.u): ##EQU20## where .function. is the camera focal length, and z is the distance along the x axis from the optical center at (0, 0, 0) to the plane in which the point at 3D camera coordinates (x, y, z).
(3) Transformation from ideal image coordinates (X.sub.u, Y.sub.u) to actual image coordinates (X.sub.d, Y.sub.d): ##EQU21## where k.sub.1 is the first order distortion coefficient.
(4) Transformation from actual image coordinates (X.sub.d, Y.sub.d) to the pixel coordinates (X.sub.f, Y.sub.f): ##EQU22## where (X.sub.f, Y.sub.f) are the row and column numbers of the image pixel in computer frame memory,
(C.sub.x, C.sub.y) are the row and column numbers of the center of computer frame memory, ##EQU23## d.sub.x is the center to center distance between adjacent sensor elements in X (scan line) direction,
d.sub.y is the center to center distance between adjacent CCD sensor in the Y direction,
N.sub.cx is the number of sensor elements in the X direction,
N.sub.fx is the number of pixels in a line as sampled by the computer,
S.sub.x is the uncertainty image scale factor.
The extrinsic parameters to be determined for the camera include the three angles .theta., .phi., and .psi., which represent the yaw, pitch, and tilt angles for the camera, and the three components of the vector T, which represent the translation of the camera from the origin of the real world coordinate system. These six parameters are used in the rigid body transformation of step 1. These six parameters fully define the camera pose, and allow pixels in the image captured by the camera with this pose to be correlated with light rays emanating from the object on the stage that was imaged by the camera. These six parameters vary from one image to the next, and are determined for each image by the Tsai method from the known coordinates of stage markers and their posifions within the image.
The intrinsic parameters for the camera include f k.sub.1, S.sub.x and (C.sub.x, C.sub.y), which represent the focal length of the camera, the lens distortion coefficient, an uncertainty scale factor, and the image coordinates for the optical center. These intrinsic parameters are inherent in the hand-held camera with a fixed focal length. They are determined from the first few images processed by the program procedure, and are used subsequently as known constants in the simultaneous equations solved to yield the extrinsic parameters. Additional details for the exact method for solving the over-determined set of simultaneous, non-linear equations are given in the Tsai reference.
Blue Screening
The subroutine Blue.sub.-- Screen identifies the group of pixels in an input image that represent the image of the object and the group of pixels in the object that represent background. This is not as simple as identifying cyan pixels as representing the stage background, because of the effects of electronic noise in the image, shadows, and capture of pixels that represent neither the stage nor the object. Instead, the technique described in Walter Beyer, "Traveling Matte Photograph and the Blue Screen System," American Cinematographer, May 1964, p. 266, is used. A 3-dimensional matrix representing the RGB color space with axes corresponding to red, green, and blue is used to count the pixels in the image with specific RGB values. For example, a pixel representing a red intensity of 200, a green intensity of 35, and a blue intensity of 78, where the intensities for each color range from 0 to 255, is placed as a point in RGB space with coordinates (200, 35, 78) by entering a value of one into the 3-dimensional matrix at [200, 35, 78]. If two or more pixels with identical RGB values r, g, b are present in the image, then the value for the element with indices [r, g, b] would be the number of pixels with RGB values r, g, b.
When all the image pixels have been represented in the 3-dimensional matrix, a set of 10 seeds is placed into the matrix at random positions. Each pixel is associated with the seed closest to it in RGB space, so that the pixels are distributed among 10 neighborhoods of the 10 seeds. The positions of the 10 seeds are then iteratively adjusted so that sum of the squares of the distances in RGB space between each seed and the image pixels in the seed's neighborhood are minimized. Thus, the 10 seeds end up associated in RGB space with 10 pixel neighborhoods, likely to represent the two colors of the stage and 8 colors in the object or in the non-stage background. The seeds are then compared with the expected locations of the light and dark cyan colors of the stage, and assigned to either represent stage color or non-stage color. All pixels in the neighborhood of a given seed are assigned to be stage color or non-stage color, in accordance with the assignment made for the seed. Finally, only those pixels assigned to be non-stage color, but which are surrounded by other neighborhoods of stage color, are classified as representing the object. The same 10 initial random positions are used for the 10 seeds of each image, which allows the minimization of the squares of the distances between the seeds and their neighboring pixels to be carried out in a single step.
The Lumigraph Function
Theoretical Analysis
The Lumigraph function is a 4-dimensional projection of a 7-dimensional plenoptic fuinction. A 7-dimensional plenoptic function provides a complete description of all light that passes through all points in an environment. The 7-dimensional plenoptic function is a function of the position of a point of observation within the environment, the direction of a light ray impinging on that point of observation, the wavelength of the light, and the time of observation. Three variables are needed to specify the position of the observation point within the environment, commonly named x, y, and z in the familiar rectangular coordinate system. The direction of a light ray is described using two variables. A familiar two-variable coordinate system that specifies direction is the azimuthaltitude system used in astronomy. The 7-dimensional plenoptic function provides the magnitude of light intensity at a particular observation point, in a particular direction, at a particular wavelength, and at a particular instant in time. The plenoptic function thus provides a way to calculate the view that an observer, looking in any direction, would have from any point within the environment at any time.
FIG. 36 displays a representation of a light intensity magnitude calculated by application of the 7-dimensional plenoptic function. The observation point 3601 is located at position x.sub.i, y.sub.i, z.sub.i. A light ray 3602 intersects the observation point. A reference plane 3603 contains the observation point and is parallel to the xy plane. The direction of the light ray is defined by two angles. The first defining angle 3605 is .THETA., the angle between a reference vector and the projection of the of the light ray onto the reference plane 3604. The second defining angle 3606 is .PHI..sub.i, the angle between the light ray and the reference plane. The intensity of light of wavelength .LAMBDA..sub.i at time t.sub.i is represented by the length or magnitude of the light ray vector 3602. That intensity is the value of the 7-dimensional plenoptic function P(x.sub.i, y.sub.i, z.sub.i, .THETA..sub.i, .PHI..sub.i, .LAMBDA..sub.i, t.sub.i).
In order to compactly and efficiently generate, store, and retrieve 3-dimensional images of an object, the preferred embodiment generates, stores, and retrieves a 4-dimensional projection of the 7-dimensional plenoptic function. The 4-dimensional projection, called the Lumigraph function, provides sufficient information to generate 2-dimensional color images of an object from any observation point exterior to the object.
The 4-dimensional projection is possible because of three simplifying assumptions about the environment within which the object resides. First, the desired 3-dimensional image of the object is a snapshot, very much like a still photograph. Therefore, information about the variation in the image with respect to time is not needed. Second, information about the intensities of light over a continuous spectrum of wavelengths is not needed to generate images for display on cathode ray tubes. Instead, it is sufficient to know only the intensities of red, green, and blue light. In the following description, calculation of the intensities for monochromatic light will be discussed, with the understanding that, for color images, three separate calculations for red, green, and blue light are needed. Finally, because only views external to an object are desired, it is sufficient to calculate the light intensities in directions radiating away from the object at each point on a surface enclosing the object. It is assumed that the intensity of light will remain constant from the enclosing surface outward. A view at any distance from the enclosing surface is therefore simply a scaled projection of a region of the enclosing surface onto a 2-dimensional plane.
In FIG. 37, the object 3701 is surrounded by an enclosing spherical surface 3702. The object is viewed from a distance 3703 in a direction defined by the vantage point 3706. The Lumigraph function specifies the intensities of light rays emanating from the object at the point where they intersect the enclosing spherical surface 3705. The projection of the intensities onto the 2-dimensional plane 3706 normal to the view direction vantage point defines a 2-dimensional image of the object.
Because of the three simplifying assumptions, the time and wavelength variables can be eliminated from the 7-dimensional plenoptic function. Also, because only two position coordinates are needed to specify a position on a surface, such as the enclosing sphere, only two, rather than the three x,y,x coordinates, are needed. The 7-dimensional plenoptic function is by this means projected into a function in four dimensions. The Lumigraph function is one of many possible 4-dimensional projections of the 7-dimensional plenoptic function. The particular 4-dimensional projection that corresponds to the Lumigraph function is selected by the choice of the four variables that comprise the domain of the function. That choice is, in turn, influenced by the choice of the enclosing surface for which light ray intensities are calculated. In a preferred embodiment, the enclosing surface surrounding an object to be imaged is chosen to be a cube as described earlier.
Although a preferred embodiment uses a 4-dimensional function as the Lumigraph function, functions of other dimensions are possible. For example, a 5-dimensional function can be used with the 5 .sup.th dimension representing a distance from the cube. Such a 5.sup.th dimension may be useful if the environment causes degradation of intensity values or otherwise affects the light rays outside the cube.
The choice of resolution for the Lumigraph data structure constitutes a balance between the quality of the images generated from the Lumigraph function and the time and memory requirements for computing the images. Higher resolutions provide better images, but incur greater computational costs. The resolution of the discrete Lumigraph data structure is characterized by the distance between the Lumigraph point and the distance between Lumigraph direction. In one embodiment, a single face of a cube has 32.times.32 Lumigraph point and each Lumigraph point has 256.times.256 Lumigraph directions.
One skilled in the art would appreciate that there are many uses of the Lumigraph system. For example, the Lumigraph system could be used to generate Lumigraph data structures for sculptures in a museum that can then be used to generate pictures of the sculpture. Also, a company could generate a Lumigraph data structure of its product (e.g., an automobile) and make that Lumigraph data structure available to its customers to view the product. Also, a video game developer could represent the appearance of an object with a Lumigraph data structure and generate images of that object to combine with a video scene. The Lumigraph data structure could also be stored on CD-ROM or transmitted on computer networks, such as the Internet.
Although the present invention has been described in terms of a preferred embodiment, it is not intended that the invention be limited to this embodiment. Modifications within the spirit of the invention will be apparent to those skilled in the art. The scope of the present invention is defined by the claims that follow.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. A method in a computer system for generating coefficients of a plenoptic function describing light rays emanating from an object, the method comprising: receiving a plurality of pictures of the object, each picture having been taken at a vantage point and having a plurality of pixels, each pixel having an actual initial intensity value, a location, and a direction, the location and direction of each pixel being derived from the vantage point at which the picture is taken; initializing each of the coefficients based on the location and direction of the pixels of the plurality of pictures such that the initialized coefficients represent the actual initial intensity values of the pixels, each coefficient having an initial confidence level indicating confidence that the initialization sets the coefficient to its final value; for each of a plurality of levels of resolution of the coefficients, for each of a plurality of coefficients at the level of resolution, combining coefficients at the next higher level of resolution based on the confidence level of the combined coefficients to generate an averaged coefficient and confidence level for the level of resolution, the averaged coefficient representing an average of the actual initial pixel intensity values represented by the combined coefficients at the next higher level of resolution; and for each of the plurality of levels of resolution of the coefficients, for each of a plurality of coefficients at the level of resolution, distributing the averaged coefficients and confidence levels to the coefficients and confidence levels at the next lower level of resolution based on the confidence levels at the level of resolution and the next lower level of resolution so that the representation of the actual initial pixel intensity values of the coefficients at the next lower level of resolution is adjusted.
2. The method of claim 1 wherein the plenoptic function is a 4-dimensional plenoptic function such that the four dimensions identify a light ray with a certain direction that emanates from the object and passes through a point on a surface of a convex volume surrounding the object.
3. The method of claim 1 wherein the plenoptic function is a 5-dimensional plenoptic function such that the five dimensions identify a light ray with a certain direction that emanates from the object and passes through a point outside a convex volume surrounding the object.
4. The method of claim 1 wherein the pictures are taken with a camera at a plurality of arbitrary vantage points.
5. The method of claim 4 including determining the vantage point of the picture from the picture itself.
6. The method of claim 4 including the step of determining the vantage point from information external to the picture.
7. The method of claim 1 wherein the pictures are taken with a camera at a plurality of pre-defined vantage points.
8. The method of claim 1 wherein before taking the pictures, the object is placed on a stage with background markers for use in identifying the vantage points at which a picture is taken.
9. The method of claim 1 wherein each coefficient corresponds to an intensity value associated with an area on a surface of a convex volume surrounding the object and with a direction such that the intensity value represents an average intensity of light rays that emanate from the object and pass through the area in the direction.
10. The method of claim 1 including the step of rendering an image of the object by evaluating the plenoptic function for each pixel of the image.
11. The method of claim 1 wherein the step of combining combines coefficients according to a constant basis function.
12. The method of claim 1 wherein the step of combining combines coefficient according to a quadralinear basis function.
13. A method in a computer system for generating coefficients of a plenoptic function describing light rays emanating from a physical object external to the computer system, the method comprising: collecting a plurality of pictures of the physical object, each picture having a vantage point; initializing each of the coefficients based on the collected plurality of pictures, each coefficient having an initial confidence level indicating the level of confidence that the initialization of the coefficient is accurate; for each of a plurality of levels of resolution of the coefficients, for each of a plurality of coefficients at the level, combining coefficients at the next higher resolution level based on the confidence levels of each coefficient to generate an averaged coefficient and confidence level for the level; and for each of the plurality of levels of resolution of the coefficients, for catch of a plurality of coefficients at the level, distributing the averaged coefficients and confidence levels to the coefficients and confidence levels at the next lower resolution level based on the confidence levels at the level and the next lower resolution level.
14. A method in a computer system for establishing intensity values for calculated light rays that represent an appearance of a physical object external to the computer system, each calculated light ray having a location and direction, the method comprising: collecting a plurality of pictures of the object, each picture having been taken at a vantage point and having pixels, each pixel representing the intensity value of a collected light ray with a location and direction, the location and direction based on the vantage point at which the picture is taken; and for each calculated light ray, determining which collected light rays of which pictures contribute to the intensity value of the calculated light ray based on the location and direction of the collected light rays and on the location and direction of the calculated light ray; and setting the intensity value or the calculated light ray to a combination of the intensity values of the determined collected light rays, wherein intensity value x.sub.ij,p,q for the calculated ray (s.sub.i, t.sub.j, u.sub.p, v.sub.q)is: ##EQU24## where is a collection of all collected light rays, where x.sub.s,t,u,v is the intensity value of collected light ray (s, t, u, v), where B.sub.i,j,p,q (s,t,u,v) represents a basis function, and where w.sub.i,j,p,q is a confidence level represented by: ##EQU25##
15. The method of claim 14 wherein the basis function is a constant basis function.
16. The method of claim 14 wherein the basis function is:
17. The method of claim 14 wherein the basis function is a quadralinear basis function.
18. The method of claim 14 wherein the basis function is: where h.sub.st is the distance between neighboring locations of calculated light rays and h.sub.uv is the distance between neighboring directions of calculated light rays.
19. A method in a computer system for establishing an intensity value for calculated light rays that represent an appearance of a physical object external to the computer system, comprising: providing a plurality of actual light rays representing the appearance, each actual light ray having an intensity value, location, and direction; and for each calculated light ray, determining which actual light rays contribute to the intensity value of the calculated list ray based on the location and direction of the actual light rays and on the location and direction of the calculated light ray; and setting the intensity value of the calculated light ray to a combination of the intensity values of the determined actual light rays, wherein the intensity value x.sub.i,j,p,q for the calculated ray (s.sub.i t.sub.j, u.sub.p, v.sub.q) is: ##EQU26## where is a collection of all collected light rays, where x.sub.s,t,u,v the intensity value of an actual light ray (s, t, u, v), where B.sub.i,j,p,q (s,t,u,v) represents a basis function, and where w.sub.i,j,p,q is a confidence level represented by: ##EQU27## 20.
20. The method of claim 19 wherein the basis function is:
21. The method of claim 19 wherein the basis function is a quadralinear basis function.
22. The method of claim 19 wherein the basis function is: where h.sub.st is the distance between neighboring locations of calculated light rays and where h.sub.uv is the distance between neighboring directions of calculated light rays.
23. A method in a computer system for determining intensity levels for the pixels of an image of an object from a collection of actual intensity levels of the image of the object at various vantage points comprising: setting an initial intensity level for each pixel of the image, each initial intensity level being derived from the actual intensity levels of vantage points near the pixel; setting a confidence level for each pixel of the image, the confidence level indicating a likelihood that the initial intensity level accurately represents the actual intensity level from the vantage point of the pixel; for each of a plurality of groups of pixels of the image, calculating an average intensity level for the group wherein the initial intensity levels of the pixels in the group are weighted based on the confidence levels of the pixels in the group; and for each of the plurality of groups of pixels of the image, adjusting the initial intensity levels of the pixels in the group based on the calculated average intensity level of the pixels in the group to give a final intensity level for each of the pixel in the group; wherein the adjusting of the initial intensity levels of the pixels in the group includes adjusting the calculated intensity levels for successively smaller groups of pixel based on previously adjusted average intensity levels for larger groups of pixels.
24. A method in a computer system for determining intensity levels for the pixels of an image of an object from a collection of actual intensity levels of the image of the object at various vantage points, comprising: setting an initial intensity level for each pixel of the image, each initial intensity level being derived from the actual intensity levels of vantage points near the pixel; setting a confidence level for each pixel of the image, the confidence level indicating a likelihood that the initial intensity level accurately represents the actual intensity level from the vantage point of the pixel; for each of a plurality of groups of pixels of the image, calculating an average intensity level for the group wherein the initial intensity levels of the pixels in the group are weighted based on the confidence levels of the pixels in the group; and for each of the plurality of groups of pixels of the image, adjusting the initial intensity levels of the pixels in the group based on the calculated average intensity level of the pixels in the group to give a final intensity level for each of the pixel in the group; wherein the calculating of an average intensity level for each group includes calculating average intensity levels for successively larger groups of pixels based on previously calculated average intensity levels for smaller groups of pixels and wherein the adjusting of the initial intensity levels of the pixels in the group includes adjusting the calculated intensity levels for successively smaller groups of pixel based on previously adjusted average intensity levels for larger groups of pixels.
25. A computer-readable medium containing instructions for causing a computer system to determine intensity levels for the pixels of an image of an object from a collection of actual intensity levels of the image of the object at various vantage points, comprising: setting an initial intensity level for each pixel of the image, each initial intensity level being derived from the actual intensity levels of vantage points near the pixel; setting a confidence level for each pixel of the image, the confidence level indicating a likelihood that the initial intensity level accurately represents the actual intensity level from the vantage point of the pixel; for each of a plurality of groups of pixels of the image, calculating a combined intensity level for the group wherein the initial intensity levels of the pixels in the group are weighted based on the confidence levels of the pixels in the group; for each of the plurality of groups of pixels of the image, adjusting the initial intensity levels of the pixels in the group based on the calculated combined intensity level of the pixels in the group to give a final intensity level for each of the pixel in the group wherein the adjusting of the initial intensity levels of the pixels in the group includes adjusting the calculated intensity levels for successively smaller groups of pixel based on previously adjusted combined intensity levels for larger groups of pixels.
26. A computer-readable medium containing instructions for causing a computer system to determine intensity levels for the pixels of an image of an object from a collection of actual intensity levels of the image of the object at various vantage points, comprising: setting an initial intensity level for each pixel of the image, each initial intensity level being derived from the actual intensity levels of vantage points near the pixel; setting a confidence level for each pixel of the image, the confidence level indicating a likelihood that the initial intensity level accurately represents the actual intensity level from the vantage point of the pixel; for each of a plurality of groups of pixels of the image, calculating a combined intensity level for the group wherein the initial intensity levels of the pixels in the group are weighted based on the confidence levels of the pixels in the group; and for each of the plurality of groups of pixels of the image, adjusting the initial intensity levels of the pixels in the group based on the calculated combined intensity level of the pixels in the group to give a final intensity level for each of the pixel in the group wherein the calculating of the combined intensity level for each group includes calculating combined intensity levels for successively larger groups of pixels based on previously calculated combined intensity levels for smaller groups of pixels and wherein the adjusting of the initial intensity levels of the pixels in the group includes adjusting the calculated intensity levels to successively smaller groups of pixel based on previously adjusted combined intensity levels for larger groups of pixels.
Patent Citations (10)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4831659 | 1989-05-01 | Miyaoka et al. | |
| US4928250 | 1990-05-01 | Greenberg et al. | |
| US5228098 | 1993-07-01 | Crinon et al. | |
| US5467404 | 1995-11-01 | Vuylsteke | |
| US5675377 | 1997-10-01 | Gibas | |
| US5717782 | 1998-02-01 | Denneau, Jr. | |
| US5727078 | 1998-03-01 | Chupeau | |
| US5850352 | 1998-12-01 | Moezzi et al. | |
| US5870502 | 1999-02-01 | Bonneau et al. | |
| US5905500 | 1999-05-01 | Kamen et al. |
Non-Patent Literature (27)
- Edward H. Adelson & John Y. A. Wang, Single Lens Stereo with a Plenoptic Camera, IEEE Transactions on Pattern-Analysis & Machine Vision, vol. 14, Issue 2, Feb. 1992.
- Steven J. Gortler et al, The Lumigraph, SIGGRAPH 96, Aug. 7, 1996, pp. 43-54, Aug. 7, 1996.
- Leonard McMillan & Gary Bishop, Plenoptic Modeling: An Image-Based Rendering System, SIGGRAPH '95, Aug. 9, 1995, pp. 39-46, Aug. 9, 1995.
- Edward H. Adelson & James R. Bergen, The Plenoptic Function & The Elements of Early Vision, Computational Models of Visual Processing, pp. 3-20, MIT Press, 1991.
- Akeley, Kurt, "RealityEngine Graphics," Computer Graphics Proceedings, Annual Conference Series, 1993, pp. 109-116.
- Bacchelli-Montefusco, Laura et al., "Using Interactive Graphics for Fitting Surfaces to Scattered Data," IEEE Computer Graphics and Applications, vol. 4, No. 7, Jul. 1984, pp. 43-45.
- Foley, James D. et al., Computer Graphics Principles and Practice, Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, 1990, Table of Contents, pp. 550-555.
- Franke, Richard, "Scattered Data Interpolation: Test of Some Methods," Mathematics of Computation, American Mathematical Society, U.S.A. Table of Contents and pp. 181-200.
- Franke, Richard et al., "Smooth Interpolation of Large Sets of Scattered Data," International Journal for Numerical Methods in Engineering, 1980, Table Contents and 1691-1704.
- Nielson, Gregory M., "Scattered Data Modeling," IEEE Computer Graphics & Applications, Jan. 1993, pp. 60-70.
- Ashdown, I., "Near-Field Photometry: A New Approach," Journal of the Illumination Engineering Society 22, I (1993), 163-180.
- Chen, S.E., "Quicktime VR--An Image-Based Approach to Virtual Environment Navigation," Computer Graphics, Annual Conference Series, 1995, pp. 29-38.
- Chen, S.E. and Williams, L., "View Interpolation for Image Synthesis," Computer Graphics, Annual Conference Series, 1993, pp. 279-288.
- Halle, M.W., "Holographic Stereograms as Discrete Imaging Systems," Practical Holography VIII (SPIE) 2176 (1994), 73-84.
- Levoy, M. and Hanrahan, P., "Light-Field Rendering," Computer Graphics, Annual Conference Series, 1996.
- Lewis, R.R. and Fournier, A., "Light-Driven Global Illumination with a Wavelet Representation of Light Transport," UBC CS Technical Reports 95-28, University of British Columbia, 1995.
- McMillan, L. and Bishop, G., "Plenoptic Modeling: An Image-Based Rendering System," Computer Graphics, Annual Conference Series, 1995, pp. 39-46.
- Szeliski, R., "Rapid Octree Construction From Image Sequences," CVGIP: Image Understanding 58, 1 (Jul. 1993), 23-32.
- D. Ruprecht et al., Free-Form Deformation with Scattered Data Interpolation Methods, Computing (Supplement 8), Springer Verlag, Vienna, pp. 267-281, 1993.
- T.A. Foley, Interpolation and Approximation of 3D and 4D Scattered Data, Computer and Mathematical Applications, vol. 13, No. 8, 1987, pp. 711-740.
- M. H. Yaou et al., Fast Surface Interpolation using Multi-Resolution Wavelet Transform, Oct. 1993 International Conference on Systems, Man and Cybernetics, IEEE, vol. 4, pp. 523-528.
- P. Alfeld, Scattered Data Interpolation in Three or More Variables, Mathematical Methods in Computer Aided Geometric Design, Academic Press, Inc., pp. 1-32, 1989.
- D. Ruprecht et al., Image Warping with Scattered Data Interpolation, IEEE Computer Graphics and Applications, pp. 37-43, Mar. 1995.
- K. Voegele, Scattered Data Interpolation Tools in a Microcomputer Visualization Environment, IEEE publication, pp. 315-322, Feb. 1990.
- G. Farin, Smooth Interpolation to Scattered 3D Data, Surfaces in Computer Aided Geometric Design, North Holland Publishing Company, pp. 43-63, 1983.
- L. Hong et al., An Approach to 3D Scene Reconstruction from Noisy Binocular Image Sequences using Information Fusion, IEEE publication, pp. 658-661, Aug. 1990.
- M. H. Yaou et al., Wavelet Transform in Scattering Data Interpolation, Electronic Letters, vol. 29, No. 21, pp. 1835-1837, Oct. 1993.