Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.


  1. Advanced Patent Search
Publication numberUS20040184013 A1
Publication typeApplication
Application numberUS 10/458,386
Publication dateSep 23, 2004
Filing dateJun 10, 2003
Priority dateMar 21, 2003
Also published asCN1698358A, CN100367783C, DE602004021243D1, EP1606938A1, EP1606938B1, US6793350, US6811264, US20040184010, WO2004084547A1
Publication number10458386, 458386, US 2004/0184013 A1, US 2004/184013 A1, US 20040184013 A1, US 20040184013A1, US 2004184013 A1, US 2004184013A1, US-A1-20040184013, US-A1-2004184013, US2004/0184013A1, US2004/184013A1, US20040184013 A1, US20040184013A1, US2004184013 A1, US2004184013A1
InventorsRamesh Raskar, Jeroen Baar, Srinivasa Rao, Thomas Willwacher
Original AssigneeRamesh Raskar, Baar Jeroen Van, Rao Srinivasa G., Willwacher Thomas H.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Projecting warped images onto curved surfaces
US 20040184013 A1
A method projects one or more image onto a curved display surface. First, a predetermined structured light pattern is projected onto the display surface. A stereo pair of images is acquired of the projected images on the display surface. Then, a quadric transfer function between the predetermined images and the stereo pair of images, via the display surface, is determined. Thus, an arbitrary output image can be warped according to the quadric transfer function so that when it is projected onto the display surface it appears correct.
Previous page
Next page
We claim:
1. A method for projecting an image onto a display surface, comprising:
projecting a predetermined image onto a display surface;
acquiring a stereo pair of images of the predetermined image;
determining a quadric transfer function between the predetermined image and the stereo pair of images via the display surface;
warping an output image according to the quadric transfer function; and
projecting the warped output image onto the display surface.
2. The method of claim wherein the display surface is quadric.
3. The method of claim 2 wherein the display surface is selected from a group consisting of a sphere, hemisphere, spheroid, dome, cylinder, cone, paraboloid, hyperboloid, hyperbolic parabaloid, and ellipsoid.
4. The method of claim 2 wherein the quadric surface is concave.
5. The method of claim 2 wherein the quadric surface is convex.
6. The method of claim 1 further comprising:
projecting a plurality of predetermined images onto the display surface from a plurality of viewpoints;
acquiring a stereo pair of input images of the plurality of predetermined images;
determining a quadric transfer function between each predetermined image and the stereo pair of input images via the display surface;
warping a plurality of output images according to the corresponding quadric transfer function; and
projecting the plurality of warped output images onto the display surface from the plurality of viewpoints.
7. The method of claim 6 wherein the surface is quadric.
8. The method of claim 1 wherein the plurality of warped output images overlap and appear as a single seamless image.
9. The method of claim 1 further comprising:
determining three-dimensional correspondences between features of the predetermined image and corresponding features in the pair of stereo images;
fitting a quadric surface to the three-dimensional correspondences;
determining a pose of the predetermined image with respect to the stereo pair of input images; and
determining the quadric transfer function from the pose and the correspondences.
10. The method of claim 6 further comprising:
attenuating the plurality of warped output images according to blending weights before projecting.
11. The method of claim 1 wherein the predetermined image is a checkerboard pattern.
12. The method of claim 1 further comprising:
applying non-linear minimization to an objective function to obtain the quadric transfer function.
13. The method of claim 12 wherein the objective function takes a total squared transfer error for all pixels in predetermined image.
14. The method of claim 1 wherein the output image is rendered for an arbitrary virtual viewpoint.
15. The method of claim 10 further comprising:
cropping the plurality of attenuated and warped output images to an arbitrary view frustum.
16. The method of claim 1 wherein the quadric transfer function is determined parametrically.
17. The method of claim 1 wherein the warping is implemented with a vertex shader of a graphic processing unit.
18. A system for projecting an image onto a display surface, comprising:
a projector configured to project a predetermined image onto a display surface;
a camera configured to acquire a stereo pair of images of the predetermined image;
means for determining a quadric transfer function between the predetermined image and the stereo pair of images via the display surface;
means for warping an output image according to the quadric transfer function; and
means for projecting the warped output image onto the display surface.

[0001] This is a continuation-in-part application of U.S. patent application Ser. No. 10/394,314 “Geometrically Aware Projector” filed by Raskar et al. on Mar. 19, 2003.


[0002] This invention relates generally to projecting images, and more particularly to projecting images onto curved surfaces.


[0003] Projector systems have been used to render large images onto display surfaces. With multiple projectors, it is possible to generate even larger seamless displays. Such systems are particularly useful for constructing immersive visualization environments capable of presenting high-resolution images for entertainment, education, training, and scientific simulation. Known multi-projector technologies include Cruz-Neira et al., “Surround-screen Projection-based Virtual Reality: The Design and Implementation of the CAVE,” SIGGRAPH 93 Conference Proceedings, Vol. 27, pp. 135-142, 1993, Staadt et al., “The blue-c: Integrating real humans into a networked immersive environment,” ACM Collaborative Virtual Environments, 2000.

[0004] A number of techniques are known for generating seamless images on planar surfaces using electro-optical techniques to determine registration and blending parameters, see Li et al., “Optical Blending for Multi-Projector Display Wall System,” Proceedings of the 12th Lasers and Electro-Optics Society, 1999, or using a camera in a loop, Surati, “Scalable Self-Calibrating Display Technology for Seamless Large-Scale Displays,” Ph.D. Thesis, Massachusetts Institute of Technology, 1999, Chen et al., “Automatic Alignment of High-Resolution Multi-Projector Displays Using An Un-Calibrated Camera,” IEEE Visualization, 2000, and Yang et al, “PixelFlex: A Reconfigurable Multi-Projector Display System,” IEEE Visualization, 2001, Brown et al., “A Practical and Flexible Large Format Display system,” Tenth Pacific Conference on Computer Graphics and Applications, pp. 178-183, 2002, Humphreys et al., “A Distributed Graphics System for Large Tiled Displays,” IEEE Visualization, 1999, and Humphreys et al., “WireGL: A Scalable Graphics System for Clusters,” Proceedings of SIGGRAPH, 2001.

[0005] When multiple projectors are used, an accurate estimation of the geometric relationship between overlapping images is key for achieving a seamless display. The geometric relationship influences the rendering process and soft edge blending. Camera-based methods, which exploit a homography expressed by a 3 by 3 matrix, admit casually installed projectors while eliminating cumbersome manual alignment.

[0006] The relationship for surfaces that adhere to quadric equations can be defined using a quadric image transfer function, see Shashua et al., “The quadric reference surface: Theory and applications,” Tech. Rep. AIM-1448, 1994.

[0007] Multi-projector alignment for curved surfaces can be aided by projecting a ‘navigator’ pattern and then manually adjusting the position of the projectors. For a large scale display, such as used at the Hayden Planetarium in New York, it takes technicians several hours each day to align seven overlapping projectors.

[0008] One problem is that when 3D images are displayed on a curved screen, the images are perspectively correct from only a single point in space. This 3D location is known as the virtual viewpoint or ‘sweet-spot’. As the viewer moves away from the sweet-spot, the images appear distorted. For very large display screens and many view points, it is difficult to eliminate this distortion. However, in real-world applications, viewers would like to be at the exact same place where the projectors ideally need to be located. In addition, placing projectors at the sweet-spot means using a very wide-field of view projectors, which are expensive and tend to have excessive radial or ‘fish-eye’ distortion.

[0009] In another method, a non-parametric process places a camera at the sweet-spot. The camera acquires an image of a structured light pattern projected by the projector. Then, in a trial-and-error approach, samples are taken, to build an inverse warping function between a camera input image and a projected output image by means of interpolation. Then, the function is applied, and resampled until warping function correctly displays the output image, see Jarvis, “Real Time 60 Hz Distortion Correction on a Silicon Graphics IG,” Real Time Graphics 5, pp. 6-7, February 1997, and Raskar et al., “Seamless Projection Overlaps Using Image Warping and Intensity Blending,” Fourth International Conference on Virtual Systems and Multimedia, 1998.

[0010] It is desired to provide a parametric method for aligning multiple projectors that extends the homography-based approach for planar surfaces to quadric surfaces.

[0011] In computer vision, some work has been done on using quadric formulations for image transfer functions, see Shashua et al., above, and Cross et al., “Quadric Surface Reconstruction from Dual-Space Geometry,” Proceedings of 6th International Conference on Computer Vision, pp. 25-31, 1998. However, the linear methods intended for cameras, as described below, produce large errors when used with projectors, instead of cameras.

[0012] In multi-projector systems, several techniques are known for aligning images seamlessly on flat surfaces using planar homography relationships. However, there has been little work on techniques for parameterized warping and automatic registration of images displayed on higher order surfaces.

[0013] This is a serious omission because quadric surfaces do appear in many shapes and forms in projector-based displays. Large format flight simulators have traditionally been cylindrical or dome shaped, see Scott et al., “Report of the IPS Technical Committee: Full-Dome Video Systems,” The Planetarian, Vol. 28, p. 25-33, 1999, planetariums and OmniMax theaters use hemispherical screens, Albin, “Planetarium special effects: A classification of projection apparatus,” The Planetarian, Vol. 23, pp. 12-14, 1994, and many virtual reality systems use a cylindrical shaped screen.

[0014] Therefore, it is desired to provide calibration methods, quadric transfer functions, and parametric intensity blending for images projected onto a curved display surface.


[0015] Curved display screens are increasingly being used for high-resolution immersive visualization environments. The invention provides a method and system for displaying seamless images on quadric surfaces, such as spherical or cylindrical surfaces, using a single or multiple overlapping projectors. A new quadric image transfer function is defined to achieve sub-pixel registration while interactively displaying two or three-dimensional images.


[0016]FIG. 1 is a flow diagram of pre-processing steps used by a method for projecting images onto a curved surface according to the invention;

[0017]FIG. 2 is a flow diagram of rendering steps used by a method for projecting images onto a curved surface according to the invention; and

[0018]FIGS. 3 and 4 are diagrams a multi-projector system according to the invention;

[0019]FIG. 5 is vertex shader code for a quadric transfer function according to the invention;

[0020]FIG. 6 is a diagram illustrating a homography according to the invention; and

[0021]FIG. 7 is a block diagram of multiple overlapping images.


[0022]FIGS. 3 and 4 shows the basic set-up for a system according to the invention that uses one or more projectors 301 and 401 to display a seamless image on a convex or concave curved surface, for example, a concave dome 302 or a convex dome 402. If a single projector is used the projected image covers most of the display surface, see dotted lines, and if multiple projectors are used, the projected images partially overlap as shown by dashed lines. FIG. 7 shows how three multiple overlapping images 701 can produce a larger rectangular image 710.

[0023] Quadric Transfer Function

[0024] A mapping between two arbitrary perspective views of an opaque quadric surface, Q, in 3D can be expressed using a quadric transfer function, Ψ. The quadric surface can be a sphere, hemi-sphere, spheroid, dome, cylinder, cone, paraboloid, hyperboloid, hyperbolic parabaloid, or an ellipsoid. The quadric transfer function according to our invention means an image transfer function from a first view, e.g. a projector output image, to a second view, e.g., a camera input image, via a quadratic surface. While planar homography transfer functions can be determined from four or more pixel correspondences, the quadric transfer function requires nine or more correspondences. The quadric transfer function can be defined in a closed form using the 3D quadric surface, Q and additional parameters that relate perspective projection of the two views.

[0025] The quadric surface, Q, is represented by a 4×4 symmetric matrix, such that 3D homogeneous points X, expressed as a 4×1 vector, that lie on the surface satisfy the quadratic constraint, XTQX=0. The quadric surface, Q, has nine degrees of freedom corresponding to the independent elements of the matrix. The matrix is symmetric and defined up to an overall scale.

[0026] The homogeneous coordinates of corresponding pixels, x in the first view and x′ in the second view are related by

x′≅Bx−(q T x±{square root}{square root over (((q T x)−x T Q 33 x))})e.

[0027] As shown in FIG. 6, B is a 3×3 homography matrix between the projected output pixel x 601 and the corresponding camera input pixel x′ 602 via point 603 on a plane 604 tangential to the quadric surface 605 where the pixel 601 is visible.

[0028] Given pixel correspondences (x, x′), this equation is traditionally used to compute the 21 unknowns: the unknown 3D quadric surface Q, the 3×3 homography matrix B, and an epipole, e, in homogeneous coordinates. The epipole, e, is the center of projection of the first view in the second view. The symbol ≅ denotes equality up to scale for the homogeneous coordinates. The matrix Q is decomposed as follows Q = [ Q 33 q q T 1 ] .

[0029] Thus, Q33 is the top 3×3 symmetric submatrix of Q, and q is a three-vector. Q(4, 4) is non-zero if the quadric surface does not pass through the origin, i.e., the center of projection of the first view. Hence, it can be safely assigned to be 1.0 for most display surfaces. The final 2D pixel coordinate for homogeneous pixel x′ is (x′(1)/x′(3), x′(2)/x′(3)).

[0030] Simplification

[0031] The form described above is used by Shashua et al., 1994, and Wexler and Shashua, “Q-warping: Direct Computation of Quadratic Reference Surfaces,” IEEE Conf. on Computer Vision and Pattern Recognition, CVPR, June, 1999. That form includes 21 variables, 4 more than needed. We remove part of that ambiguity by defining A=B−eqT E=qqT−Q33, and obtain the form used by our invention,

x′≅Ax±({square root}{square root over (x T Ex)})e.

[0032] Here, xTEx=0 defines the outline conic of the quadric surface in the first view. The outline conic can be geometrically visualized as an image of the silhouette or the points on the surface where the view rays are locally tangent to the surface, e.g., the elliptical silhouette of a sphere viewed from outside the sphere.

[0033] The value A is the homography via the polar plane between the first view and the second view. Note that this equation contains, apart from the overall scale, only one ambiguous degree of freedom resulting from relative scaling of E and e. This ambiguity can be removed by introducing an additional normalization constraint, such as, E(3,3)=1.

[0034] Furthermore, the sign in front of the square root is fixed within the outline conic in the image. The sign is easily determined by testing the equation above with the coordinates for one pair of corresponding pixels. Note that the parameters of the quadric transfer function can be directly computed from nine or more pixel correspondences in a projective coordinate system. So it is tempting to follow an approach similar to estimating a planar homography for planar displays, without computing any Euclidean parameters. However, as described below, in practice it is difficult to estimate the epipolar relationship in many cases. Hence, we use a pseudo-Euclidean approach, as described below.

[0035] Pre-Processing

[0036] All registration information is pre-calculated relative to a pair of stereo images. We assume that the stereo camera views the entire 3D display surface. One of the camera images is arbitrarily selected as having an origin co. The stereo images are used to determine only the 3D points on the display surface. Hence, any suitable 3D acquisition system can be used.

[0037] As shown in FIG. 1, the basic steps of our pre-processing method 100 are as follows. The details of these steps are described below. For each projector i, a predetermined image 101, e.g., a structured pattern in the form of a checkerboard, is projected 110 onto the quadric surface.

[0038] In step 120, features in images acquired of the predetermined image 101 by the stereo camera 102 are detected, and 3D points are reconstructed, i.e., correspondences 103, on the quadric surface, which correspond with the features of the predetermined. Then, the quadric surface, Q 104 is fitted 130 to the detected correspondences.

[0039] For each projector i, a pose 105 of the projector, with respect to the camera, is determined 140 using the correspondence between projector pixels and 3D coordinates of points on the surface illuminated by the pixels. Determine 150 the quadric transfer function, Ψi and its inverse Ψ1 i, between the camera co and projector i. Then, determine 160 intensity blending weights, Φi, in regions where the projected images overlap. At this point, a projector image can be projected 200 by warping, blending and projecting to appear as an undistorted output image 171 on the quadric surface.

[0040] Run-Time Processing

[0041]FIG. 2 shows the basic steps of our rendering method 200. First, a projector image is generated 210. The projector image is represented as a texture mapped set of triangles. The image can be acquired by a still camera or a video camera, or the image can be generated by computer graphic rendering a 3D scene from a virtual viewpoint. The projector image is warped 220 into a frame of the projector according to the quadric transfer function Ψ0i. Then, pixel intensities are attenuated 230 with blending weights Φi before projecting 240.

[0042] However, these steps involve several issues that need to be resolved. The quadric transfer function estimation, although a linear operation, requires non-linear optimization to reduce pixel re-projection errors. In addition, it is difficult to estimate the pose of the projector, i.e., the external parameters, because the 3D points projected on the quadric surface are usually nearly planar leading to a degenerate condition. These and other issues, and a practical solution are described below.

[0043] Calibration

[0044] We determine parameters of the quadric transfer function, Ψ0i={Ai, Ei, ei}, so that the projected output images are geometrically registered on the curved surface. The prior art methods, known for cameras, determine the quadric transfer parameters directly from pixel correspondences. That involves estimating the 4×4 quadric matrix, Q, in 3D using a triangulation of corresponding pixels and a linear method. If the internal parameters of the two views are not known, all the calculations are done in projective space after computing the epipolar geometry, i.e., the epipoles and the fundamental matrix.

[0045] However, if projectors rather than cameras are involved, the linear method produces very large re-projection errors in estimating the 3D quadric surface, Q. The errors are of the order of about 30 pixels for a conventional XGA projector.

[0046] There are several reasons for this. It is relatively straightforward to calibrate a camera directly from acquired images. However, projector calibration can only be done indirectly by analyzing images of projected images acquired by a camera. This can introduce errors. In addition, in a projector, the internal optics are usually offset from the principle point to project images upwards. Thus, the projector internal parameters are hard to estimate, and they are different than those of a camera. Furthermore, the fundamental matrix is inherently noisy given that the 3D points on the quadric surface illuminated by a single projector do not have significant depth variation in display settings such as segments of spherical or cylindrical surfaces.

[0047] Therefore, the invention uses a pseudo-Euclidean approach where the internal and external parameters of the camera and the projectors are known approximately. These parameters are used to estimate Euclidean rigid transformations. Hence, unlike the planar case, computation of an accurate image transfer function for curved screens involves three-dimensional quantities.

[0048] Quadric Surface

[0049] We use a rigid stereo camera pair, C0 and C′0, as a base for computing all geometric relationships. We arbitrarily select one of the cameras to define the origin and coordinate system. We calibrate a baseline stereo pair with the checkerboard pattern 101. For our calibration, the cameras do not necessarily have to be located at the sweet-spot, which is an important difference with respect to some of the prior art non-parametric approaches.

[0050] The stereo pair of cameras 102 observes the structured patterns projected by each projector. Using triangulation, a set of N 3D points, {Xj} on the display surface, that correspond to pattern features, are detected. The quadric surface, Q, passing though each Xj is computed by solving a set of linear equations, XTjQXj=0, for each 3D point. This equation can be written in the form XiV=0, where Xi is a 1×10 matrix, which is a function of Xi only and V is a homogeneous vector containing the distinct independent unknown variables of the quadric surface Q. With N≧9, we construct a N×10 matrix X, and solve the linear matrix equation XV=0.

[0051] Given points in general position, the elements of V, and hence Q, are the one dimensional null-space of the matrix X.

[0052] Projector View

[0053] In addition to the quadric surface, Q, we need to know the internal and external parameters of each projector with respect to the origin of the camera. We use the correspondence between the projector pixels and coordinates of the 3D points they illuminate to compute the pose and internal parameters.

[0054] However, finding the pose of a projector from known 3D points on the quadric surface is error-prone because the 3D points are usually quite close to a plane leading to an unstable solution, see Faugeras, Three-dimensional computer vision: a geometric viewpoint, MIT Press, 1993, and Forsyth et al., “Computer Vision, A Modern Approach,” FUTURESLAB, 2002, ActiveMural, Argonne National Labs, 2002.

[0055] Dealing with near-planar points is a difficult problem. If points are distributed in depth, then we can easily use a linear method to estimate the internal as well as the external parameters of the projector. On the other hand, if the points are known to be planar, then we can estimate the external parameters when some of the internal parameters are known.

[0056] For dealing with near-planar surfaces, we use an iterative procedure. If we know the projector internal parameters, we can first find an initial guess for external parameters based on homography and then use an iterative procedure based on Lu et al., “Fast and globally convergent pose estimation from video images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 22:6, pp. 610-622, 2000. Powell's method can be used for non-linear refinement of reprojection error. However, estimating projector internals is equally difficult. If the projectors cannot be easily moved, as mentioned above, then calibrating the projectors usually requires large surfaces illuminated in two or more positions.

[0057] Our strategy is to use projector internal parameters that are approximately known. We find internal parameters of just one projector and use these internal parameters for all projectors. At a later time, the same and other projectors will probably have different zoom settings and other mechanical or optical deviations. In addition, the external parameters computed by iterative method of Lu et al. is only approximate.

[0058] Camera to Projector Transfer

[0059] Therefore, we use perspective projection parameters of the camera along with approximate projection matrix of the projector to find the camera to projector quadric transfer using linear methods. Then, we refine the solution using non-linear optimization.

[0060] The quadric transfer parameters, Ψ0i={Ai, Ei, ei} are easy to calculate from the quadric surface Q, the camera projection matrix [I|0], and the projector projection matrix [Pi|ei] by

A i =P i −e i q T E i =qq T −Q 33.

[0061] As stated above, the prior art linear method for finding the parameters is too imprecise for our purpose. Misalignment on the display screen can be as much as 15-30 pixels per projector resulting in annoying visual artifacts. A seamless display requires sub-pixel accuracy. Therefore, we apply a non-linear minimization to refine the results obtained via the linear method. This can be done with an objective or ‘cost’ function.

[0062] For the objective function, we take the total squared transfer error for all pixels ɛ i = j ( x i j ( 1 , 2 ) x i j ( 3 ) - x ^ i j ( 1 , 2 ) x ^ i j ( 3 ) ) 2 ,

[0063] where {circumflex over (x)}i j are the transferred pixels for each known projected pixel xj, i.e., pattern feature points, expressed as:

{circumflex over (x)} i j =A i x i j±{square root}{square root over (x i jT E i x i j e i)}.

[0064] Note that the sign found using the linear method, which is same for all the pixels, remains the same during the non-linear optimization, e.g., the well known Nelder-Mead Simplex.

[0065] Partial Euclidean Reconstruction

[0066] One could ignore the Euclidean approach altogether, and proceed directly to projective space and non-linear optimization. If we have accurate projector internal parameters, then the non-linear optimization stages could be avoided. However, as mentioned earlier, ignoring Euclidean viewing parameters and solving the quadric transfer function purely from pixel correspondences leads to poor re-projection errors. Furthermore, the estimated 3D quadric surface, Q, cannot be used as an estimate for further non-linear optimization because the solution did not converge.

[0067] Accurate internal projector parameters only reduces the re-projection errors but do not eliminate the errors. This is because, many kinds of errors are propagated in the three dimensional Euclidean calculations, including estimating 3D points on the display surface by triangulation, estimating the 3D quadric surface using linear methods and finding the pose of the projector. The non-linear optimization attempts to minimize the physical quantity we care about the most, i.e., pixel re-projection error in image transfer from the camera to the projector for a known corresponding set of pixels.

[0068] Because the correspondence between overlapping projector pixels is indirectly defined by this image transfer function, minimizing pixel re-projection errors ensures geometric registration between the displayed pixels of the projectors.

[0069] Rendering

[0070] The rendering involves a two-pass approach. For 2D image data, we extract the appropriate input image. For 3D scenes, we first render the 3D models according to the sweet-spot. In the second pass, the resultant image is then warped into the projector image space using the quadric image transfer function.

[0071] Virtual View

[0072] When 3D scenes are displayed on a curved screen, the images are perspectively correct only from specific points in space, Such as point is popularly known as the sweet-spot or the virtual viewpoint. For a concave hemispherical surface, the sweet-spot is on a line through the center of the sphere, perpendicular to the cut-plane that cuts the sphere in half. For a convex hemispherical surface, the sweet-spot can be mirrored through the surface. For a cylindrical surface, the sweet spot is similarly located, unless projected image wraps around the entire surface, in which case the sweet-spot can be anywhere. The sweet-spot is independent of the camera's focal length, but dependent on the shape and size of the curved display, and the peripheral viewing angle. The projected imagery can appear in front of, or behind the display surface depending on the location of the sweet-spot and the focal length of the virtual camera or viewer. As the viewer moves away from the sweet-spot, the images look distorted. In addition, one needs to specify the view frustum i.e., the viewing direction or principal axis, and the extent or field of view.

[0073] For some displays, it is possible to automatically determine the sweet-spot. For example, for a concave spherical dome, the center of the dome can be considered a good sweet-spot. The sweet-spot can be determined directly from the equation of the quadric surface, Q, i.e., Q(1, 1)q. For a cylindrical screen, a point on the axis of the cylinder that is midway along the extent of the cylinder is a good choice. Sometimes, the sweet-spot is decided by practical considerations e.g., a spot that is approximately at eye-level is considered ideal because images are almost always aligned with the horizontal and vertical axes of the real world.

[0074] In our case, the virtual viewpoint can be interactively fixed or moved because we have an approximate Euclidean reconstruction of the display geometry. Because the 3D coordinates of the location are known in the camera coordinate system, it is relatively simple to locate the sweet-spot with respect to the camera.

[0075] Sweet-Spot from Surface Points

[0076] When it is difficult to determine the parameters of the virtual viewpoint for rendering, one technique finds the best-fit plane to the set of points found on the illuminated part of the display surface. We fit an oriented bounding box (OBB) to the set of 3D points {Xi} on the display surface. A point at a suitable distance in front of the screen, along the vector passing through the center of this box and normal to the best-fit plane can be selected as the sweet-spot. Because all the 3D points on a quadric surface lie on the convex hull of those 3D points, the OBB can be determined as follows.

[0077] If Y is an N×3 matrix of {Xi−{overscore (X)} where {overscore (X)}=({overscore (x)}, {overscore (y)}, {overscore (z)}) is the centroid of the N 3D points, then the eigenvector corresponding to the smallest eigenvalue of the 3×3 matrix YTY gives the normal to the best-fit plane i.e., the axis of minimum variance. On the other hand, the largest side of the OBB, i.e., the extent of the 3D points projected in the best-fit plane, gives the approximate ‘diameter’ of the screen. The distance of sweet-spot in front of the screen can be selected to be proportional to this diameter, depending on the application and the desired field of view.

[0078] For immersive applications, a large field of view is desired. Hence, the distance should be about half of the diameter. For group viewing, the distance can be comparable to the diameter.

[0079] We recalculate the quadric transfer function Ψi between the virtual view image space and each projector output image. The process is very similar to computing ΨiΨ0i. First, we find the projection of 3D points on the quadric surface into the virtual view image space. Then, the correspondence between the virtual view and the projector image and the internal and external parameters of the virtual view and projector are sufficient to update Ψi.

[0080] Display Area

[0081] The view frustum for the virtual view is defined using the sweet-spot and the extents of the OBB. The viewing at vector is from the virtual viewpoint toward the center of the OBB. Because the union of overlapping images from multiple projectors can illuminate a large area, we can ‘crop’ the view frustum to an aesthetic shape such as a rectangle or a circle. For 3D applications, we render a set of black quadrilaterals to crop regions outside the desired display area. For example, for a rectangular view, the view port is made by four large quadrilaterals near the outer edge of the view port in the projector's image. The black quadrilaterals along with the rest of the 3D models are rendered and warped as described below. For 2D applications, the area outside the input image to be displayed is considered black.

[0082] Image Transfer

[0083] Given a 3D vertex, M, in a scene to be rendered, we find its screen space coordinates, m, in the virtual view. Then, we find the transferred pixel coordinate, mi, in the output image of projector i, using the quadric transfer function, Ψ0i={Ai, Ei, ei}. The polygons in the scene are then rendered with vertices M replaced with vertices mi. Thus, the rendering process at each projector is very similar. Each projector frame buffer automatically stores the appropriate part of the virtual view image, and there is no need to explicitly determine extents of the projector.

[0084] Therefore, to render, at each projector, for each vertex M,

[0085] determine pixel m via a virtual view projection (M), and

[0086] determine a warped pixel mi via the quadric transfer function Ψi(m), then

[0087] for each triangle T with vertices {Mj},

[0088] render triangle with 2D vertices {mji}.

[0089] There are two issues with this approach. First, only the vertices in the scene, but not the polygon interiors, are accurately warped. Second, visibility sorting of polygons needs special treatment. After the quadric transfer, the edges between vertices of the polygon should theoretically map to second-degree curves in the projector's image.

[0090] However, scan conversion converts the curves to straight-line segments between the warped vertex locations. This problem is not discernible for a single projector. However, in the case of overlapping projectors, this causes individual different deviations from the original curve, and hence, the edge appears to be mis-registered on the display screen. Therefore, it is necessary to use sufficiently fine tessellation of triangles.

[0091] Commercial systems are already available that tessellate and pre-distort the input models on the fly so that they appear straight in a perspectively correct rendering on the curved screen, see U.S. Pat. No. 6,104,405, “Systems, methods and computer program products for converting image data to non-planar image data,” issued to Idaszak et al. on Feb. 26, 1997, and U.S. Pat. No. 5,319,744, “Polygon fragmentation method of distortion correction in computer image generating systems,” issued to Kelly et al. on Jun. 7, 1994, incorporated herein by reference. Our method is compatible with fine tessellation provided by such systems. Pre-distortion of the scene geometry in commercial systems is used to avoid the two-pass rendering, which involves texture-mapping result of the first pass. In our case, instead of pre-distorting the geometry, we pre-distort the image space projection. As an advantage, our invention can be implemented in part with a vertex shader of a programmable graphics unit (GPU).

[0092] Scan Conversion

[0093] When pixel locations in the projection of a triangle are warped, information needs to be passed along so that the depth buffer generates appropriate visibility information. In addition, for perspectively correct color and texture coordinate interpolation, appropriate weight values ‘w’ need to be passed. Therefore, we post-multiply the pixel coordinates with ‘w’ according to


m i(x′ i , y′ i ,w′ i)=Ψi(m(x/w,y/w),1)

m i(x i , y i , z i , w i)=[wx′ i ,wy′ i /w′ i z,w].

[0094] Thus, vertex mi has appropriate final pixel coordinate (x′i/w′i, y′i/w′i) due to the quadric transfer function along with original depth and w values.

[0095]FIG. 5 shows the code 500 for the vertex shader. For rendering 2D images, we densely tessellate the virtual view image space into triangles, and map the image as a texture on these triangles. Vertex, m, of each triangle is warped using the quadric transfer function into vertex (and pixel) mi as above. Scan conversion automatically transfers colors and texture attributes at vertex m to vertex mi, and interpolates in between. It is possible to render 3D scenes in a similar manner.

[0096] Note that our warping of a projector image using a quadric transfer function is different than rendering a quadric curve on a flat surface, see Watson et al., “A fast algorithm for rendering quadratic curves on raster displays,” Proc. 27th Annual SE ACM Conference, 1989.

[0097] Intensity Blending

[0098] Pixels intensities in the areas of overlapping images are attenuated using alpha blending of the graphics hardware. Using the parametric equations of the quadric transfer function, the alpha maps are determined as follows.

[0099] For every projector pixel, xi in projector i, we find the corresponding pixels in projector j using the equation

x i≅Ψ0j0i)−1(x i).

[0100] For cross-fading, pixels at the boundary of the projector's image are attenuated. Hence, the weights are proportional to the shortest distance from the frame boundary. The weight assigned to pixel xi, expressed in normalized window pixel coordinates (ui, vi), which are in the range [0, 1], is

[0101] Φi(xi)≅d(xi)/Σjd(xj), where, d(x) is min(u, v, 1−u, 1−v) if 0≦u, v≦1, else d(x)=0. Because we use a parametric approach, we are able to compute corresponding projector pixels and the weights at those locations at sub-pixel registration accuracy. The sum of weights at corresponding projector pixels accurately adds to 1.0.

[0102] At each projector, the corresponding alpha map is stored as a texture map and rendered as screen aligned quadrilaterals during the last stage of the rendering.

[0103] Our method can also be used to project onto a convex dome. This projecting is particularly useful when the dome was made of translucent or transparent material. When the projection is from the rear, the viewer can experience a fully immersive experience without blocking any of the projectors.

[0104] Effect of the Invention

[0105] The invention enables the construction of projector systems with curved display surfaces for 2D or 3D visualization. Our system does not require an expensive infrastructure, and can be operated with casual alignment between multiple projectors and the display surface. Our automatic registration exploits a quadric image transfer function, and eliminates tedious setup and maintenance of projectors, and hence reduces cost. The invention can simplify the construction, calibration and rendering process for widely used applications such as used in flight simulators, planetariums and high-end visualization theaters. New applications enabled include low-cost, flexible dome displays, shopping arcades and projection on cylindrical columns or pillars.

[0106] The invention provides an elegant solution to a problem that has so far been solved by discrete sampling. An advantage is that, unlike prior art systems, our projectors do not need to be placed at the sweet-spot. This is important in real-world applications where the sweet-spot is usually exactly where viewers would like to be.

[0107] Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7019713 *Oct 30, 2002Mar 28, 2006The University Of ChicagoMethods and measurement engine for aligning multi-projector display systems
US7104653 *Apr 15, 2004Sep 12, 2006Nec Viewtechnology, Ltd.System for correcting approximate expressions used in geometrical correction of projected images
US7108379 *May 7, 2004Sep 19, 2006Benq CorporationProjector for adjusting a projected image size and luminance depending on various environments
US7182465 *Feb 25, 2005Feb 27, 2007The University Of North CarolinaMethods, systems, and computer program products for imperceptibly embedding structured light patterns in projected color images for display on planar and non-planar surfaces
US7800628Jun 16, 2006Sep 21, 2010Hewlett-Packard Development Company, L.P.System and method for generating scale maps
US7854518Jun 16, 2006Dec 21, 2010Hewlett-Packard Development Company, L.P.Mesh for rendering an image frame
US7873233 *Oct 17, 2006Jan 18, 2011Seiko Epson CorporationMethod and apparatus for rendering an image impinging upon a non-planar surface
US7907792Jun 16, 2006Mar 15, 2011Hewlett-Packard Development Company, L.P.Blend maps for rendering an image frame
US8147073Feb 20, 2007Apr 3, 2012Panasonic CorporationImage signal processing apparatus and virtual reality creating system
US8210686Jan 30, 2009Jul 3, 2012Old Dominion University Research FoundationProjection system
US8212841 *Jul 6, 2007Jul 3, 2012Barco N.V.Non-linear image mapping using a plurality of non-coplanar clipping planes
US8311366Jan 12, 2007Nov 13, 2012Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.System and method for calibrating and adjusting a projected image of a projection apparatus
US8358317 *May 26, 2009Jan 22, 2013Evans & Sutherland Computer CorporationSystem and method for displaying a planar image on a curved surface
US8391542 *Apr 22, 2008Mar 5, 2013Dvtel, Inc.Method for estimating the pose of a PTZ camera
US8403502Nov 18, 2008Mar 26, 2013Barco N.V.Collimated visual display with elliptical front projection screen
US8446367Apr 17, 2009May 21, 2013Microsoft CorporationCamera-based multi-touch mouse
US8605085 *Oct 15, 2009Dec 10, 2013Nvidia CorporationSystem and method for perspective corrected tessellation using parameter space warping
US8643644 *Mar 20, 2008Feb 4, 2014Qualcomm IncorporatedMulti-stage tessellation for graphics rendering
US8646918Jun 8, 2012Feb 11, 2014Old Dominion University Research FoundationProjection system
US20080267453 *Apr 22, 2008Oct 30, 2008Ioimage Ltd.Method for estimating the pose of a ptz camera
US20090189917 *May 19, 2008Jul 30, 2009Microsoft CorporationProjection of graphical objects on interactive irregular displays
US20090237401 *Mar 20, 2008Sep 24, 2009Qualcomm IncorporatedMulti-stage tessellation for graphics rendering
US20090322740 *May 26, 2009Dec 31, 2009Carlson Kenneth LSystem and method for displaying a planar image on a curved surface
US20100171859 *Jan 22, 2010Jul 8, 2010Technische Universiteit DelftProjection and Registration Device
US20110310310 *Jun 21, 2010Dec 22, 2011Disney Enterprises, Inc.System and method for imagination park tree projections
EP1876814A1 *Jul 7, 2006Jan 9, 2008Barco NVNon-linear image mapping using a plurality of non-coplanar clipping planes
WO2007082690A1 *Jan 12, 2007Jul 26, 2007Fraunhofer Ges ForschungCalibration method and calibration system for projection apparatus
WO2013028280A2Jul 14, 2012Feb 28, 2013Qualcomm IncorporatedDynamic selection of surfaces in real world for projection of information thereon
U.S. Classification353/121
International ClassificationG06T5/00, H04N5/74, H04N17/00, G03B37/04, G06T3/00
Cooperative ClassificationH04N9/3147, H04N9/3185, G06T3/0081, G06K9/2036, H04N9/3194, G06T5/006, G03B37/04
European ClassificationH04N9/31R3, H04N9/31T1, H04N9/31S3, G03B37/04, G06T5/00G, G06K9/20E, G06T3/00R4
Legal Events
Sep 23, 2011FPAYFee payment
Year of fee payment: 8
Mar 19, 2008FPAYFee payment
Year of fee payment: 4
Oct 24, 2003ASAssignment
Effective date: 20031002
Jun 10, 2003ASAssignment
Effective date: 20030610