DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0033] Notations and Nomenclature

[0034] The following ‘notations and nomenclature’ are provided to assist in the understanding of the present invention and the preferred embodiments thereof.

[0035] Procedure—A procedure is a self-consistent sequence of computerized steps that lead to a desired result. These steps are defined by one or more computer instructions. These steps are performed by a computer executing the instructions that define the steps. Thus, the term “procedure” can refer to a sequence of instructions, a sequence of instructions organized within a programmed-procedure or programmed-function, or a sequence of instructions organized within programmed-processes executing in one or more computers.

[0036] Operating Environment

[0037] FIG. 2 illustrates a computer, indicated by general reference character 200 , that incorporates the invention. The computer 200 includes a processor 201 having a central processor unit (CPU) 203 , a memory section 205 , and an input/output (I/O ) section 207 . The I/O section 207 is connected to a presentation device 211 , a disk storage unit 213 and a CD-ROM drive unit 215 . The CD-ROM drive unit 215 can read a CD-ROM medium 217 that typically contains a program and data 219 . The CD-ROM drive unit 215 (along with the CD-ROM medium 217 ) and the disk storage unit 213 comprise a filestorage mechanism (a filesystem). Some embodiments of the invention include a network interface 221 that connects the computer 200 to a network 223 . An application program 225 executes from the memory section 205 . The application program 225 can be loaded into the memory section 205 over the network 223 or from the filesystem. In one embodiment of the invention, the application program 225 includes computer code that causes the computer to perform the inventive steps. The CD-ROM drive unit 215 (along with the CD-ROM medium 217 ) are illustrative of mechanisms that can be used to read computer code from a removable media. One skilled in the art will understand that not all of the displayed features of the computer 200 need to be present for the invention.

[0038] Data Space

[0039] One aspect of the invention maps points between two data spaces. FIG. 3 A through FIG. 3D illustrate some of the possible data spaces that can be mapped by this aspect of the invention.

[0040] FIG. 3A illustrates a gridded destination data space 300 showing a first grid point 301 , a second grid point 303 , a third grid point 305 , and a fourth grid point 307 . These points are bounding points for the destination data space. Each of the intersections in the destination data space (for example a fifth grid point 309 ) is precisely mapped to a source data space. The grid points bound regions that contain data points that will be approximately mapped to the source data space. For example, the third grid point 305 and the fifth grid point 309 are two of the four grid points that bound a region 311 that contains points having mappings that will be interpolated. A bilateral-bilinear interpolation algorithm performs this approximate mapping. The bilateral-bilinear interpolation algorithm is subsequently described with respect to FIG. 5 and FIG. 6 as applied to patches in a two-dimensional data space.

[0041] FIG. 3B illustrates a gridded source data space 350 indicating how the destination data space is mapped to the source data space. The resolution of the gridded destination data space 300 and the gridded source data space 350 need not be the same. The gridded source data space 350 can contain (or reference) warped image data that represents a true image that has been warped by a lens. One skilled in the art will understand that a physical lens need not be used to generate the warped image as ray-tracing techniques through a virtual lens can also be used to generate the warped image. A virtual lens can be used to generate images in a virtual-space. Once the image is generated, the invention can be used to present the image.

[0042] One aspect of the invention backward maps the destination data space to the source data space using a mapping that generates a perspective corrected image in the destination data space. One step in this mapping process precisely maps the first grid point 301 , the second grid point 303 , the third grid point 305 , the fourth grid point 307 , the fifth grid point 309 , and other grid points to the gridded source data space 350 . These grid points map to a mapped first grid point 301 ′, a mapped second grid point 303 ′, a mapped third grid point 305 ′, a mapped fourth grid point 307 ′, a mapped fifth grid point 309 ′ and other grid points respectively in the source data space. Thus, the region 311 is mapped to a mapped region 311 ′.

[0043] Notice that the gridded destination data space 300 when mapped into the gridded source data space 350 need not result in a parallelogram—the slopes of each of the lines defined by the mapped grid points can be different.

[0044] FIG. 3C illustrates a 3-D gridded destination data space, indicated by general reference character 360 , that has a first plane 361 (bounded by the first grid point 301 , the second grid point 303 , the third grid point 305 and the fourth grid point 307 ) and a second plane 363 (sp) (bounded by a sp-first grid point 365 , a sp-second grid point 367 , a sp-third grid point 369 and another point that cannot be seen in FIG. 3C ).

[0045] FIG. 3D illustrates a 3-D gridded source data space, indicated by general reference character 370 , that indicates how the 3-D gridded destination data space 360 is mapped to the 3-D gridded source data space 370 . A mapped first plane 361 ′ is bounded by the mapped first grid point 301 ′, the mapped second grid point 303 ′, the mapped third grid point 305 ′, and the mapped fourth grid point 307 ′. A mapped second plane 363 ′ (msp) is bounded by a msp-second grid point 367 ′, and a msp-third grid point 369 ′, and two other points that cannot be seen in FIG. 3D .

[0046] FIG. 3 C and FIG. 3D show how grid points can be imposed on three-dimensional spaces. Once the grid points are precisely mapped, the points contained in the region (the volume) between and including the first plane 361 and the second plane 363 can be interpolated by extending the subsequently described techniques. Similar techniques can be applied to n-dimensional spaces.

[0047] Although the bilateral-bilinear interpolation algorithm is applicable to n-dimensional spaces, subsequent discussion of the algorithm is directed to two-dimensional spaces containing image data. Each region is a two-dimensional patch containing points that represent pixels. One skilled in the art will understand how to modify the described algorithm to be applicable to higher dimensional spaces, for non-image data, and to a source data space that references the data. Such a one will also understand that the invention can be used (without limitation) to map a viewport onto spherical, cylindrical, and panoramic spaces.

[0048] FIG. 4A illustrates a patch in destination data space, indicated by general reference character 400 , bounded by a first grid point 401 , a second grid point 403 , a third grid point 405 and a fourth grid point 407 . The destination patch 400 contains a number of pixels (in the illustration, 36 pixels) of which a pixel 409 is but one. The bilateral-bilinear interpolation algorithm efficiently generates data values for the pixels contained in the destination patch 400 . In this particular illustration, the 36 pixels are arranged in six scan lines. Each scan line is six pixels long. One skilled in the art will understand that the destination patch 400 need not be square and may include more or fewer pixels than the 36 used in the illustration. The grid points are mapped to the source data space as is shown with respect to FIG. 4B .

[0049] FIG. 4B illustrates a mapped patch in source data space, indicated by general reference character 420 , indicating some of the parameters used by the bilateral-bilinear interpolation algorithm. The mapped patch 420 is bounded by the mapped first grid point 401 ′, the mapped second grid point 403 ′, the mapped third grid point 405 ′, and the mapped fourth grid point 407 ′ each of which have been precisely mapped to the source data space from the corresponding points in the destination data space. The data that is used to generate the value for the pixel 409 in the destination data space is located at a mapped pixel contribution area 409 ′. The mapped pixel contribution area 409 ′ contains pixels of a warped image at a resolution possibly different from the pixel resolution in the destination data space. Techniques known in the art are used to determine the value of the pixel 409 based on the information within the mapped pixel contribution area 409 ′.

[0050] The mapped grid points define lines that bound the mapped patch 420 . Thus, the mapped first grid point 401 ′ and the mapped third grid point 405 ′ define a second boundary line 421 ; the mapped second grid point 403 ′ and the mapped fourth grid point 407 ′ define a third boundary line 423 ; the mapped first grid point 401 ′ and the mapped second grid point 403 ′ define a first boundary line 425 and a mapped third grid point 405 ′ and a mapped fourth grid point 407 ′ define a final boundary line 427 . One skilled in the art will understand that a different geometry can be used other than the one described.

[0051] A first slope 428 represents the slope of the first boundary line 425 . A second slope 429 represents the slope of the second boundary line 421 and in the two-dimensional case includes delta-x and delta-y components. A third slope 431 represents the slope of the third boundary line 423 . A final slope 435 represents the slope of the final boundary line 427 .

[0052] The bilateral-bilinear interpolation algorithm operates by determining the second slope 429 and the third slope 431 for the boundary lines. The second slope 429 and the third slope 431 need not be the same. Each of these slopes is used to determine a respective delta-x and delta-y value that is dependent on the number of scan lines in the destination patch 400 (N _yd ). Next, each pixel in the first scan line in the destination patch 400 is iterated. To do this, a delta-x and delta-y representing the first slope 428 is determined responsive to the number of pixels in the scan line contained by the destination patch 400 (N _xd ), and the coordinates of the starting pixel and the ending pixel. As each destination pixel is iterated the mapped pixel contribution area 409 ′ in the source data space is evaluated to determine a value for the destination pixel. As the destination pixel is advanced, the corresponding position in the source data space is advanced by the delta-x and delta-y corresponding to the first slope 428 . Once the first scan line has been processed subsequent scan lines in the destination patch 400 are processed. The starting coordinates for a subsequent scan line in the mapped patch 420 is advanced by the delta-x and delta-y corresponding to the second slope 429 and the ending position of the subsequent scan line in the mapped patch 420 is advanced by the delta-x and delta-y corresponding to the third slope 431 . Thus, the subsequent slope for each mapped scan line changes dependent on the slope of the second boundary line 421 and the third boundary line 423 . Thus for example, a subsequent slope 437 can be (and usually is) different from the first slope 428 , the final slope 435 and any other subsequent slope.

[0053] Each subsequent scan line in the destination patch 400 is iterated (such that the last subsequent scan line is the final boundary line 427 ).

[0054] One skilled in the art will understand that the bilateral-bilinear interpolation algorithm, previously summarized and subsequently described in detail, assures that adjacent patches correctly align. Thus, the bilateral-bilinear interpolation algorithm does not generate mapping artifacts as shown in FIG. 1 A and FIG. 1C .

[0055] Data Space Mapping

[0056] FIG. 5 illustrates a mapping process, indicated by general reference character 500 used to backward map data points in a destination data space to data points in a source data space. The mapping process 500 initiates at a ‘start’ terminal 501 and continues to an ‘initialization’ procedure 503 . The ‘initialization’ procedure 503 performs initialization steps for the mapping process 500 . These steps can include steps for allocating memory for the source data space, allocating memory for the destination data space, determining the resolution of the presentation device (if any) used to present the destination data, and the spacing of grid points in the destination data space. Next, the mapping process 500 continues to a ‘load source data’ procedure 505 that inputs the source data into the source data space. The source data can be read (without limitation) from a file, a scanner device, a video device, from a network, a medical diagnostic tool or other similar device. In addition, the source data can represent a portion of a video data stream (the video data stream can be compressed; in addition the video stream can be live video, stored video or computer generated video). The ‘load source data’ procedure 505 need not complete before the mapping process 500 continues to a ‘determine grid points’ procedure 507 . The ‘determine grid points’ procedure 507 uses the resolution and the size of the destination data space and possibly other parameters to determine the size of the region. Depending on the configuration of the source data space and the destination data space, the region can be n-dimensional. The region defines the data points that will be interpolated instead of being precisely mapped. The bilateral-bilinear interpolation algorithm can be applied to n-dimensional spaces. When the region is two-dimensional, the region is referred to as a patch.

[0057] A ‘precisely map grid points’ procedure 508 precisely maps the grid points that bound the selected region in the destination data space to points in the source data space. The ‘precisely map grid points’ procedure 508 uses well known transformations that can include floating point multiplication and division operations to precisely locate points in the source data space that correspond to the grid points in the destination data space.

[0058] Once the grid points that bound the region have been precisely mapped, the mapping process 500 continues to an ‘iterate region’ procedure 509 that iterates each region in the destination data space that is to be interpolated. A ‘get grid point coordinates in source data space’ procedure 511 obtains the grid points that bound the iterated region. Then a ‘map points in region’ procedure 513 applies a bilateral-bilinear interpolation algorithm to approximately map the points in the region to a portion of the data in the source data space. The bilateral-bilinear interpolation algorithm is subsequently described with respect to FIG. 6 .

[0059] The mapping process 500 repeats to the ‘iterate region’ procedure 509 until all the regions in the destination data space are iterated. The resulting data in the destination data space can then be presented by a ‘present destination space data’ procedure 514 . This presentation can be accomplished (without limitation) by visually presenting the information by using a presentation device such as a printer or monitor, by providing a printout of the data, or by subsequent processing of the data using other mechanisms. The mapping process 500 completes through an ‘end’ terminal 515 .

[0060] One skilled in the art will understand that the precisely mapped grid points define lines in the source data space that can serve as boundary lines for the mapped region in the source data space.

[0061] FIG. 6 illustrates a bilateral-bilinear interpolation algorithm process, indicated by general reference character 600 that is invoked from the ‘map points in region’ procedure 513 of FIG. 5 . A preferred embodiment is directed towards mapping data between two two-dimensional data spaces. This embodiment can be used to generate a perspective corrected image from a warped image that was generated from a true image projected through a lens (such as a fisheye lens or a catadioptric lens). One skilled in the art will understand that a physical lens need not be used to generate the warped image as ray-tracing techniques through a virtual lens can also be used to generate the warped image.

[0062] The bilateral-bilinear interpolation algorithm process 600 initiates at a ‘start’ terminal 601 and continues to an ‘initialize’ procedure 603 . The ‘initialize’ procedure 603 determines the slopes for the boundary lines in the source data space that define the limits of the scan lines in the patch. The slope is defined by a delta-x and delta-y that depend on the number of scan lines in the patch. The ‘initialize’ procedure 603 also defines the starting and ending coordinates in the source data space for the first scan line that is to be interpolated. For a patch bounded by points P ₀ (x ₀ ,y ₀ ), P ₁ (x ₁ ,y ₁ ), P ₂ (x ₂ ,y ₂ ), and P ₃ (x ₃ ,y ₃ ) (these points corresponding to the mapped first grid point 401 ′, the mapped second grid point 403 ′, the mapped third grid point 405 ′, and the mapped fourth grid point 407 ′ of FIG. 4B ) in the source data space and where the patch in the destination data space includes N _yd scan lines, each scan line containing N _xd pixels, the ‘initialize’ procedure 603 can include steps similar to:

[0063] dxl=(x2−x0)/nyd; // determine slope of left line

[0064] dyl=(y2−y0)/nyd;

[0065] dxr=(x3−x1)/nyd; // determine slope of right line

[0066] dyr=(y3−y1)/nyd;

[0067] startx=x0; // set starting coordinates

[0068] starty=y0;

[0069] endx=x1; // set ending coordinates

[0070] endy=y1;

[0071] Next, the bilateral-bilinear interpolation algorithm process 600 continues to an ‘iterate scan line in patch’ procedure 605 that iterates each scan line in the patch in the destination data space. When all the scan lines in the patch have been iterated, the bilateral-bilinear interpolation algorithm process 600 completes through an ‘end’ terminal 607 . The number of iterations to iterate each scan line in the patch is the value of nyd.

[0072] An ‘initialize working variables’ procedure 609 initializes the variables used for the iteration of the pixels in the iterated scan line. These initializations include determining the slope for the iterated scan line based on the coordinates of the start point and the end point of the scan line in the source data space. The start point of the scan line substantially lies on the boundary line defined by P ₀ and P ₂ . The end point of the scan line substantially lies on the line defined by P ₁ and P ₃ . Thus, these lines bound each scan line. The slope of the scan line is determined using the start point, the end point, and the number of pixels in the scan line in the patch. The ‘initialize working variables’ procedure 609 can include steps similar to:

[0073] dx=(endx−startx)/nxd; // determine scan line slope

[0074] dy=(endy−starty)/nxd;

[0075] sx=startx;

[0076] sy=starty;

[0077] An ‘iterate each pixel in scan line’ procedure 611 iterates each pixel in the destination scan line. To iterate each pixel in the scan line requires N _xd iterations. When all the pixels in the line have been iterated, the bilateral-bilinear interpolation algorithm process 600 continues to an ‘advance to next scan line in patch’ procedure 613 . The ‘advance to next scan line in patch’ procedure 613 advances the startx, starty, endx and endy values by dxl, dyl, dxr, and dyr respectively. Thus, the ‘iterate each pixel in scan line’ procedure 611 determines a subsequent starting point and a subsequent ending point that bound a subsequent line that has a subsequent line slope. Thus, the subsequent line depends on the slope of the boundary lines. The ‘advance to next scan line in patch’ procedure 613 can include steps similar to:

[0078] startx+=dxl; // determine new scan line start

[0079] starty+=dyl; // coordinates

[0080] endx+=dxr; // determine new scan line end

[0081] endy+=dyr; // coordinates

[0082] One skilled in the art will understand that the interpolation of each scan line thus depends on the slope of the patch's bounding lines. Thus, the end position of each scan line in one region substantially matches the start position of each scan line for an adjacent patch. The result is that there are no interpolation artifacts between adjacent patches (or regions).

[0083] Once the ‘advance to next scan line in patch’ procedure 613 completes, the bilateral-bilinear interpolation algorithm process 600 continues to the ‘iterate scan line in patch’ procedure 605 to iterate the next scan line in the patch or to exit if all scan lines have been iterated.

[0084] A ‘set pixel’ procedure 615 obtains the data value for the pixel in the destination data space from the data area specified by sx and sy in the source data space. One skilled in the art will understand how to obtain the value of a destination pixel from the source data space given coordinates in the source data space. Such a one will also understand how to combine data values in the source data space to generate the data value in the destination data space.

[0085] Once the ‘set pixel’ procedure 615 completes, the bilateral-bilinear interpolation algorithm process 600 continues to an ‘advance to next pixel in scan line’ procedure 617 . The ‘advance to next pixel in scan line’ procedure 617 advances sx and sy by dx and dy respectively. Next, the bilateral-bilinear interpolation algorithm process 600 continues to the ‘iterate each pixel in scan line’ procedure 611 until each pixel in the scan line has been iterated.

[0086] One skilled in the art will understand that the invention improves the mapping between two data spaces while still maintaining high performance.

[0087] From the foregoing, it will be appreciated that the invention has (without limitation) the following advantages:

[0088] 1) The invention dramatically reduces mapping artifacts when mapping from one data space to another.

[0089] 2) The invention provides a high performance mapping capability between data spaces.

[0090] 3) The invention provides a superior real-time presentation of a visual image when the source data space contains warped image data.

[0091] Although the present invention has been described in terms of the presently preferred embodiments, one skilled in the art will understand that various modifications and alterations may be made without departing from the scope of the invention. Accordingly, the scope of the invention is not to be limited to the particular invention embodiments discussed herein.