The invention relates generally to computer reconstruction, and more particularly, to the reconstruction of scene using 2-dimensional (2D) to 3-dimensional (3D) conversion.
Humans perceive the world in three spatial dimensions. Unfortunately, most of the images and videos created today are 2D in nature. If we were able to imbue these images and videos with 3D information, not only would we increase their functionality, we could dramatically increase our enjoyment of them as well. However, imbuing 2D images and video with 3D information often requires completely reconstructing the scene from the original 2D data depicted. A given set of images can be used to create a model of the observer together with models of the objects in the scene (to a sufficient level of detail) enabling the generation of realistic alternate perspective images of the scene. A model of a scene thus contains the geometry and associated image data for the objects in the scene as well as the geometry for the cameras used to capture those images.
In reconstructing these scenes, features in the 2D images, such as edges of objects, often need to be extracted and their positions ascertained relative to the camera. Differences in the 3D positions of various object features, coupled with differing camera positions for multiple images, result in relative differences in the 3D to 2D projections of the features that are captured in the 2D images. By determining the positions of features in 2D images, and comparing the relative locations of these features in images taken from differing camera positions, the 3D positions of the features may be determined.
One technique, known as camera calibration, uses multiple 2D images captured using different camera perspectives of a scene. A set of point correspondences may then be found, which allows calculation of geometric attributes such as position and orientation of the camera for each image. This leads to the determination of 3D coordinates for features found in the 2D images. Many current methods of camera calibration, such as robot vision and satellite imaging, are geared toward full automation. M. Pollefeys, et al., “Visual Modeling with a Hand-Held Camera,” International Journal of Computer Vision, September, 2004, pages 207-232, Volume 59, Number 3, Kluwer Academic Publishers, Manufactured in The Netherlands, describes a procedure using a hand-held video camera for recreating a 3D scene. In this process, a camera operator is in control of the camera, and collects images of an object from multiple perspectives. The images in the video sequence are then processed to obtain a reconstruction of the object that is suitable for stereoscopic 3D projection.
However, fundamental problems still exist with current camera calibration methods. For example, a typical motion picture will have a very large and predetermined image set, which (for the purposes of camera and scene reconstruction) may contain extraneous or poorly lit images, have inadequate variations in perspective, and contain objects with changing geometry and image data. Nor can the known camera calibration methods take advantage of the processor saving aspects of other applications, such as robot navigation applications that, while having to operate in real time using verbose and poor quality images, can limit attention to specific areas of interest and have no need to synthesize image data for segmented objects.
In addition, existing methods of camera calibration are not ideally suited for scene reconstruction. The reasons for this include excessive computational burden, inadequate facility for scene refinement, and the point clouds extracted from the images do not fully express model-specific geometry, such as lines and planes. The excessive computational burden often arises because these methods correlate all of the extracted features across all frames used for the reconstruction in a single step. Additionally, existing methods may not provide for adequate interactivity with a user that could leverage user knowledge of scene content for improving the reconstruction.
The existing techniques are also not well suited to the 2D to 3D conversion of things such as motion pictures. Existing techniques typically cannot account for dynamic objects, they usually use point clouds as models which are not adequate for rendering, and they do not accommodate very large sets of input images. These techniques also typically do not accommodate varying levels of detail in scene geometry, do not allow for additional geometric constraints on object or camera models, do not provide a means to exploit shared geometry between distinct scenes (e.g., same set, different props), and do not have interactive refinement of a scene model.
The present invention is directed to a system and method for interactive and iterative reconstruction in a manner that helps to reduce computational requirements by generating a model from a subset of the available data, and then refining that model using additional data. Example embodiments directed to scene reconstruction, reconstruct a 3D scene from a plurality of 2D images of that scene by first generating a model of the 3D scene from a subset of the 2D images. The model can then be refined using specific characteristics of each image in the subset that are calculated using the other images in the subset. The model is further refined using images not in the original subset.
One illustrative embodiment performs the initial calculations for 3D scene reconstruction on a smaller number of key 2D frames, using a reduced number of user selected key-points within those frames. Such embodiments of the invention can facilitate numerous aspects of iterative improvement that can increase the accuracy and reduce the computational demands of the reconstruction process. These improvements may include the ability to reconsider the choice of key frames and key vertices used in the initial reconstruction. These improvements may also include camera positions that are calculated for intermediate frames through a process of resectioning. In one embodiment, the resectioning is based on the observed projection of known 3D geometry. These improvements may further include mesh detail that can be added through a process of triangulation. In one embodiment, the triangulation is based on camera geometry calculated at alternate frames and the observed projection of that detail in those frames.
Embodiments of the invention can also allow a user to specify feature points in the form of a rough triangle mesh, or any mesh in which the vertices of the mesh specify the features of interest, rather than having software automatically generate all feature points. While automatic feature detection software may produce more features than would a user, the user is able to specify the set of features that are of interest. This then reduces the calculation burden. Embodiments of the invention may also allow the use of key frames for initial scene estimation, rather than weighting every frame uniformly. For example, key frames may be selected from a set of frames which are offset from each other by significant camera geometry differences.
Embodiments of the invention may also allow a user to control the selection of which frames are used in the reconstruction and which details in the object are reconstructed, along with the order of images used. Further, embodiments of the invention can allow segmentation of images into static and dynamic regions, where the segmentation may be further improved using the iterative calculations.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.
For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
When starting with a sequence of 2D images captured by a moving camera or multiple cameras in different positions, 3D scene reconstruction typically involves combining camera calibration and object reconstruction which will generate the geometry for both the camera(s) and the objects in the scene. For example, if a camera has captured multiple images from different positions in a room, 3D geometry representing the motion of the camera and triangle meshes for features in the room, such as walls, furniture, and other objects will typically need to be determined.
However, before considering the individual steps, a brief description of the process is provided at a higher level. The goal of the process is to produce a camera model representing the perspective of each input image together with a model for each distinguished object in the scene. This process allows an object's appearance in each input image to be accounted for by rendering the object model according to the corresponding camera model. This process constructs models for static objects. Dynamic objects are objects whose geometries do change. Static objects are objects whose geometry within the scene do not change significantly throughout the available images, while ignoring the complementary class of dynamic objects. In some embodiments, the reconstruction of dynamic objects can be incorporated later through a separate process, such as standard modeling and animation techniques.
The camera model of an object illustratively encapsulates the object's geometry within the scene, and its projected appearance in each of the available images. An illustrative representation of such a model is a parametric surface mesh where each vertex has both a 3D location in scene coordinates, and a sequence (one per available image) of pairs containing an indication of the visibility of the corresponding image feature and the 2D location of that feature where visible.
For purposes of discussing the figures, images will be numbered sequentially, according to the simplest curve connecting all of the camera positions, whether or not the images were captured in that order, and whether or not the images were all captured by a single camera. For example, collection curve 110 of
Referring back to
It should be noted that the assignment of meaningful coordinate values to mesh vertices does not occur in process 301. Further, not all mesh structures need be specified at once. Instead separate iterations can be used to incorporate structures visible within a specific set of frames.
Applying process 301 to the images of
Process 302 performs the selection of key frames. For the purpose of this discussion, key frames refer to those available images for which camera geometry is calculated, non-key frames are referred to as intermediate frames. The set of key frames preferably are chosen to represent the full range of camera motion such that each key frame exhibits a significantly different camera perspective and that each key frame shares sufficient image information (viz. feature correspondences) with some number of other key frames. It should be noted that a balance in choosing key frames is needed. The more key frames selected typically result in more shared information, and thus, better results. However, this increases computational complexity, and can quickly become intractable.
Some embodiments of the present invention use at process 302 an automated selection process to select a subset of key frames from a set of available frames based on motion analysis. Other embodiments leverage a user's knowledge of the scene content through user input (acquired through a graphical user interface or other appropriate means) to guide the selection of the key frames.
In one embodiment, images 2001, 2004 and 2006, in
Process 303 performs the specification of key vertices. For the purposes of this discussion, key vertices refer to mesh vertices for which scene coordinate values are calculated later in process 304. The key vertices of a mesh are a subset of the existing vertices which express the essential mesh structure (viz. important features) at a minimal level of detail. However, other vertices can be used.
At each key frame (such as frames 2001, 2003 and 2006), each key vertex is marked as being visible or not visible due to object occlusions (either by dynamic objects or by other static objects, or the object itself). Further, at each key frame the image coordinates for visible key vertices are chosen to match the corresponding image feature. The process of specifying key vertices may be performed algorithmically, through user interaction, or by a combination of both.
Applying process 303 to the images of
Basic camera calibration and scene reconstruction algorithm are performed at process 304. Through numerical optimization process 304 calculates camera geometry for each key frame and 3D scene coordinate values for each key vertex, such that the projection of each calculated scene-point through each calculated camera matches the corresponding image coordinates as accurately as possible. This process can be represented by the following equation:
Cf(Pv)=I(f,v) Equation (1)
where Cf is the camera matrix at frame f, Pv is the same coordinate value for a visible vertex v, and I(f,v) is the observed image coordinate value for frame f at vertex v.
In some embodiments, the camera attributes and vertex coordinate values calculated in a previous iteration can be used as initial estimates for process 304.
According to the embodiment of
In some embodiments, at this point processes 302 and 303 can be repeated by adding key frame 2003 or key frame 2002. This ensures that all key vertices are visible in more than one key frame, and will be assigned scene coordinates by process 304.
The addition of mesh detail through triangulation is performed at process 305. Process 305 involves adding structure to the mesh (i.e., vertices, edges and faces), and then triangulating the location of each new vertex with reference to a set of frames for which camera geometry has already been calculated (e.g., key frames). The new vertices are assigned image coordinates at each of the selected frames. Then the underlying 3D scene location is calculated through triangulation. This assignment of image coordinates can be performed, in some embodiments, through user input or through application of automated feature detection and tracking algorithms. It should be noted that the more frames that are providing observed image coordinates for a vertex, the greater the accuracy of triangulated scene-coordinate point.
According to
Scene coordinate locations for chosen front left vertices of recess 1021 can be obtained by selecting frames 2001 and 2003, appropriately positioning those chosen vertices in each of the selected frames, and then invoking the triangulation process. Similarly, scene coordinates for the front right vertices of the hole can be obtained via frames 2004 and 2006.
It should be noted that the four back vertices are not visible in any of the available images and so their locations in scene coordinates are chosen independent of either steps 304 or 305. This process can, in some embodiments, occur via user knowledge or by using domain-specific knowledge of object 102. However, other approaches can be used.
Calculation of the camera geometry for the intermediate frames through resectioning is performed at process 306. To resection the camera geometry for a chosen intermediate frame requires the selection of a set of vertices visible in that frame for which 3D scene coordinates have already been calculated (i.e. key vertices), and then adjusting the image coordinates of these vertices to match the observed projection of the corresponding features in that frame. Then process 306 invokes a resectioning algorithm to calculate the camera parameters at that key frame.
In one embodiment, an initial camera geometry estimate can be obtained by interpolating the camera parameters at adjacent key frames. This camera geometry estimate can be used to approximate the image coordinates of the selected vertices. From these estimated coordinates further refining through user interaction or automated feature detection/tracking can occur. Note that the more vertices involved and the greater the range of depths which they exhibit, the greater will be the accuracy of the resectioned camera.
Calculating the camera geometry at intermediate frame 2002 can be achieved by selecting the four visible vertices of object 102 together with the seven visible vertices of object 101. Then by positioning these selected vertices to match the corresponding image features and invoking the resectioning procedure the camera geometry can be calculated.
Decision 307 determines whether the construction is completed to a sufficient level of detail and quality or whether another iteration should perform further refinement. If the process is not completed then the process returns to step 301. For example, a scene may contain a long table with a number of chairs around it, but all of the chairs may not be visible in any one of the images. Process 304 may select a few initial key frames for use with process 305. In process 305, a user specifies rough meshes for some of the chairs in those initially-selected key frames. The meshes, which include only some of the chairs in the scene, are refined during process 306. Then, when returning to process 305, the user already has 3D models representing chairs. Also, when returning to process 305, the user may edit existing meshes. These are available for simplifying the modeling of any newly visible chairs in subsequently-added key frames. Further, when returning to process 306, newly added key frames will have points in common with previously-processed key frames. Since the 3D locations of these common points are known, camera calibration calculations are simplified.
Traditional camera calibration would attempt to calculate scene and camera geometry automatically, with equal weighting applied to each image used. However, for many types of calculations, including camera calibration, computational burden increases faster than linearly with the number of unknowns. By reducing the complexity of the initial models, the computational burden may be significantly reduced. Then, by leveraging the results of the lower resolution data, the refinement requires less of a computational burden than was avoided. The net result of simplifying the complexity for initial calculations, and then adding the detail back by a more efficient process; therefore, reduces overall computational time. Method 30 reduces the computational burden as compared with traditional methods, provides for interactive scene refinement, and allows user-defined meshes to express model-specific geometry, such as lines and planes.
Bus 402 is also coupled to input/output (I/O) adapter card 405, communications adapter card 411, user interface card 408, and display adapter card 409. The I/O adapter card 405 connects storage devices 406, such as one or more of a hard drive, a CD drive, a floppy disk drive, or a tape drive, to computer system 400. The I/O adapter card 405 is also connected to a printer (not shown), which would allow the system to print paper copies of information such as documents, photographs, articles, and the like. Note that the printer may be a printer (e.g., dot matrix, laser, and the like), a fax machine, scanner, or a copy machine. Communications adapter card 411 is adapted to couple the computer system 400 to a network 412, which may be one or more of a telephone network, a local area network (LAN) and/or a wide-area network (WAN), an Ethernet network, and/or the Internet network. User interface adapter card 408 couples user input devices, such as keyboard 413, pointing device 407, and the like, to the computer system 400. The display adapter card 409 is driven by CPU 401 to control the display on display device 410.
Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
Number | Name | Date | Kind |
---|---|---|---|
4689616 | Goude et al. | Aug 1987 | A |
4925294 | Geshwind et al. | May 1990 | A |
5323007 | Wernick et al. | Jun 1994 | A |
5614941 | Hines | Mar 1997 | A |
5621815 | Talukdar et al. | Apr 1997 | A |
5684943 | Abraham et al. | Nov 1997 | A |
5729471 | Jain et al. | Mar 1998 | A |
5742291 | Palm | Apr 1998 | A |
5748199 | Palm | May 1998 | A |
5805117 | Mazurek et al. | Sep 1998 | A |
5969722 | Palm | Oct 1999 | A |
5977978 | Carey et al. | Nov 1999 | A |
5990900 | Seago | Nov 1999 | A |
6009189 | Schaack | Dec 1999 | A |
6016150 | Lengyel et al. | Jan 2000 | A |
6031564 | Ma et al. | Feb 2000 | A |
6049628 | Chen et al. | Apr 2000 | A |
6061083 | Aritake et al. | May 2000 | A |
6128132 | Wieland et al. | Oct 2000 | A |
6134345 | Berman et al. | Oct 2000 | A |
6134346 | Berman et al. | Oct 2000 | A |
6151404 | Pieper | Nov 2000 | A |
6204912 | Tsuchiya et al. | Mar 2001 | B1 |
6208347 | Migdal et al. | Mar 2001 | B1 |
6208360 | Doi et al. | Mar 2001 | B1 |
6215516 | Ma et al. | Apr 2001 | B1 |
6226004 | Nishihara | May 2001 | B1 |
6278460 | Myers et al. | Aug 2001 | B1 |
6320984 | Shigeta | Nov 2001 | B1 |
6333749 | Reinhardt et al. | Dec 2001 | B1 |
6342887 | Munroe | Jan 2002 | B1 |
6359630 | Morse et al. | Mar 2002 | B1 |
6429875 | Pettigrew et al. | Aug 2002 | B1 |
6434278 | Hashimoto | Aug 2002 | B1 |
6456745 | Bruton et al. | Sep 2002 | B1 |
6466205 | Simpson et al. | Oct 2002 | B2 |
6477267 | Richards et al. | Nov 2002 | B1 |
6504569 | Jasinschi et al. | Jan 2003 | B1 |
6549200 | Mortlock et al. | Apr 2003 | B1 |
6580821 | Roy | Jun 2003 | B1 |
6588908 | Shimizu | Jul 2003 | B2 |
6603504 | Son et al. | Aug 2003 | B1 |
6674925 | Schoepflin et al. | Jan 2004 | B1 |
6714196 | McCormack et al. | Mar 2004 | B2 |
6760020 | Uchiyama et al. | Jul 2004 | B1 |
6867750 | Noro | Mar 2005 | B2 |
6867787 | Shimizu et al. | Mar 2005 | B1 |
6956576 | Deering et al. | Oct 2005 | B1 |
6989840 | Everitt et al. | Jan 2006 | B1 |
7053904 | Kirk et al. | May 2006 | B1 |
7102652 | O'Donnell et al. | Sep 2006 | B2 |
7116323 | Kaye et al. | Oct 2006 | B2 |
7148907 | Smith et al. | Dec 2006 | B2 |
7181081 | Sandrew | Feb 2007 | B2 |
7289662 | Keaton et al. | Oct 2007 | B2 |
7344256 | Watanabe et al. | Mar 2008 | B2 |
7453456 | Petrov et al. | Nov 2008 | B2 |
7453489 | Ezawa | Nov 2008 | B2 |
7474803 | Petrov et al. | Jan 2009 | B2 |
7508977 | Lyons et al. | Mar 2009 | B2 |
7542034 | Spooner et al. | Jun 2009 | B2 |
7616834 | Kramer et al. | Nov 2009 | B2 |
7643966 | Adachi et al. | Jan 2010 | B2 |
7706603 | Najafi et al. | Apr 2010 | B2 |
7853085 | Miller | Dec 2010 | B2 |
7889913 | Wells | Feb 2011 | B2 |
7907774 | Parr et al. | Mar 2011 | B2 |
7907793 | Sandrew | Mar 2011 | B1 |
7965892 | Kanatsu | Jun 2011 | B2 |
8055046 | Feilkas et al. | Nov 2011 | B2 |
8217931 | Lowe et al. | Jul 2012 | B2 |
8274530 | Birtwistle et al. | Sep 2012 | B2 |
20010031073 | Tajima | Oct 2001 | A1 |
20010040570 | Light et al. | Nov 2001 | A1 |
20020030675 | Kawai | Mar 2002 | A1 |
20020122113 | Foote | Sep 2002 | A1 |
20020122585 | Swift et al. | Sep 2002 | A1 |
20020126117 | Grzeszczuk et al. | Sep 2002 | A1 |
20020126396 | Dolgoff | Sep 2002 | A1 |
20020164067 | Askey et al. | Nov 2002 | A1 |
20020186348 | Covannon et al. | Dec 2002 | A1 |
20030021453 | Weise et al. | Jan 2003 | A1 |
20030058242 | Redlich | Mar 2003 | A1 |
20030090482 | Rousso et al. | May 2003 | A1 |
20030099397 | Matsugu et al. | May 2003 | A1 |
20030161526 | Jupiter et al. | Aug 2003 | A1 |
20030164893 | Mayhew | Sep 2003 | A1 |
20030179923 | Xiong et al. | Sep 2003 | A1 |
20030202120 | Mack | Oct 2003 | A1 |
20031018473 | Price | Oct 2003 | |
20010214533 | Cull at al. | Nov 2003 | |
20030210329 | Aagaard et al. | Nov 2003 | A1 |
20040081354 | Mojsilovic et al. | Apr 2004 | A1 |
20041018051 | Lea at al | Aug 2004 | |
20040218788 | Geng | Nov 2004 | A1 |
20040247174 | Lyons et al. | Dec 2004 | A1 |
20040258309 | Keaton et al. | Dec 2004 | A1 |
20040264806 | Herley | Dec 2004 | A1 |
20050052452 | Baumberg | Mar 2005 | A1 |
20050094879 | Harville | May 2005 | A1 |
20050117215 | Lange | Jun 2005 | A1 |
20050140670 | Wu et al. | Jun 2005 | A1 |
20050151751 | Hong et al. | Jul 2005 | A1 |
20050166163 | Chang et al. | Jul 2005 | A1 |
20050216237 | Adachi et al. | Sep 2005 | A1 |
20061020764 | Maeda | Sep 2005 | |
20050223337 | Wheeler et al. | Oct 2005 | A1 |
20050231505 | Kaye et al. | Oct 2005 | A1 |
20050243088 | Lengyel | Nov 2005 | A1 |
20060023197 | Joel | Feb 2006 | A1 |
20060033762 | Card et al. | Feb 2006 | A1 |
20060044527 | Watanabe et al. | Mar 2006 | A1 |
20061006757 | Perlmutter et at. | Mar 2006 | |
20081006158 | Spooner et al. | Mar 2006 | |
20060088203 | Boca et al. | Apr 2006 | A1 |
20060114253 | Zitnick, III et al. | Jun 2006 | A1 |
20060126919 | Kitaura et al. | Jun 2006 | A1 |
20060140473 | Brooksby et al. | Jun 2006 | A1 |
20060153454 | Grimme | Jul 2006 | A1 |
20061019277 | Nomura et al. | Aug 2006 | |
20081017158 | Sandrew | Aug 2006 | |
20060221248 | McGuire et al. | Oct 2006 | A1 |
20060232583 | Petrov et al. | Oct 2006 | A1 |
20070009179 | Easwar | Jan 2007 | A1 |
20070013813 | Sun et al. | Jan 2007 | A1 |
20070024635 | Jojic et al. | Feb 2007 | A1 |
20070031037 | Blake et al. | Feb 2007 | A1 |
20070081714 | Wallack et al. | Apr 2007 | A1 |
20070097120 | Wheeler et al. | May 2007 | A1 |
20070103459 | Stoval et al. | May 2007 | A1 |
20070153122 | Ayite et al. | Jul 2007 | A1 |
20070192757 | Emi et al. | Aug 2007 | A1 |
20070253618 | Kim et al. | Nov 2007 | A1 |
20070258632 | Friedman et al. | Nov 2007 | A1 |
20070294270 | Gregory et al. | Dec 2007 | A1 |
20070296721 | Chang et al. | Dec 2007 | A1 |
20080018732 | Moller | Jan 2008 | A1 |
20080056716 | Fujikawa | Mar 2008 | A1 |
20080056719 | Bernard et al. | Mar 2008 | A1 |
20080074438 | Maillot | Mar 2008 | A1 |
20080095416 | Jeung et al. | Apr 2008 | A1 |
20080099682 | Gordon et al. | May 2008 | A1 |
20080111816 | Abraham et al. | May 2008 | A1 |
20080123937 | Arias Estrada et al. | May 2008 | A1 |
20080225040 | Simmons et al. | Sep 2008 | A1 |
20080225042 | Birtwistle et al. | Sep 2008 | A1 |
20080225045 | Birtwistle et al. | Sep 2008 | A1 |
20080225059 | Lowe et al. | Sep 2008 | A1 |
20080226123 | Birtwistle et al. | Sep 2008 | A1 |
20080226128 | Birtwistle et al. | Sep 2008 | A1 |
20080226160 | Birtwistle et al. | Sep 2008 | A1 |
20080226181 | Birtwistle et al. | Sep 2008 | A1 |
20080226194 | Birtwistle et al. | Sep 2008 | A1 |
20080228449 | Birtwistle et al. | Sep 2008 | A1 |
20080246836 | Lowe et al. | Oct 2008 | A1 |
20080259073 | Lowe et al. | Oct 2008 | A1 |
20090116732 | Zhou et al. | May 2009 | A1 |
20110164109 | Baldridge et al. | Jul 2011 | A1 |
20110169914 | Lowe et al. | Jul 2011 | A1 |
20110227917 | Lowe et al. | Sep 2011 | A1 |
20120032948 | Lowe et al. | Feb 2012 | A1 |
20120274638 | Birtwistle et al. | Nov 2012 | A1 |
20120275652 | Birtwistle et al. | Nov 2012 | A1 |
20120275687 | Lowe et al. | Nov 2012 | A1 |
20120275689 | Birtwistle et al. | Nov 2012 | A1 |
20120280989 | Birtwistle et al. | Nov 2012 | A1 |
20120313940 | Birtwistle et al. | Dec 2012 | A1 |
Number | Date | Country |
---|---|---|
1 308 902 | May 2003 | EP |
1 141 893 | Apr 2005 | EP |
2 365 243 | Feb 2002 | GB |
7-230556 | Aug 1995 | JP |
9-091436 | Apr 1997 | JP |
09-186957 | Jul 1997 | JP |
09-237346 | Sep 1997 | JP |
10-111934 | Apr 1998 | JP |
2000-194863 | Jul 2000 | JP |
2000-353244 | Dec 2000 | JP |
WO-2007130122 | Nov 2007 | WO |
WO-2007142643 | Dec 2007 | WO |
WO-2007142649 | Dec 2007 | WO |
WO-2007148219 | Dec 2007 | WO |
WO-2008051231 | May 2008 | WO |
WO-2008060289 | May 2008 | WO |
WO-2008063167 | May 2008 | WO |
WO-2008063170 | May 2008 | WO |
WO-2008112804 | Sep 2008 | WO |
WO-2008112806 | Sep 2008 | WO |
Entry |
---|
M. Pollefeys, et al., “Visual Modeling with a Hand-Held Camera,” International Journal of Computer Vision, Sep. 2004, pp. 207-232, vol. 59, No. 3, Kluwer Academic Publishers, Manufactured in The Netherlands. |
E. Mouragnon et al., “Real time localization and 3D reconstruction,” Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06), 8 pages. |
The Extended European Search Report issued for EP08250323.6, dated May 5, 2011, 8 pages. |
Office Action issued for Japanese Patent Application No. 2008-013351, dated Dec. 5, 2011, 2 pages. |
U.S. Appl. No. 10/946,955, filed Sep. 22, 2004, Spooner et al. |
U.S. Appl. No. 11/627,414, filed Jan. 26, 2007, Spooner et al. |
International Search Report and Written Opinion issued for PCT/US2008/056661; Dated: Jul. 14, 2008; 10 Pages. |
G. Vosselman et al., “Recognising Structure in Laser Scanner Point Clouds”, published by IAPRS and found at www.itc.nl/personal/vosselman/papers/vosselman2004.natscan.pdf. |
Tamal K. Dey et al., “Shape Segmentation and Matching from Noisy Point Clouds”, Proc. Eurographics Sympos. Point-Based Graphics (2004), Marc Alexa and S. Rusinkiewicz (eds) (2004), pp. 193-199. |
Yang Liu et al., “Reconstructing B-Spline Curves from Point Clouds—A Tangential Flow Approach Using Least Squares Minimization”, International Conference on Shape Modeling and Applications 2005 (SMI '05) pp. 4-12. |
International Search Report and Written Opinion issued for PCT/US2008/056668; Dated: Jul. 14, 2008; 10 Pages. |
Alexandre X. Falcao et al.: “User-Steered Image Segmentation Paradigms: Live Wire and Live Lane”; Graphical Models and Image Processing, vol. 60, Issue 4 (Jul. 1998); pp. 233-260. |
Tony F. Chan et al.; “Active Contours Without Edges”; IEEE Transactions on Image Processing; vol. 10, Issue 2, Feb. 2001; pp. 266-277. |
Tamal K. Dey et al.; “Shape Segmentation and Matching with Flow Discretization”; Proc. Workshop Algorithms Data Structures (WADS 03), LNCS 2748, F. Dehen, J.-R. Sack, M. Smid Eds., pp. 25-36, 2003. |
International Search Report and Written Opinion issued for PCT/US2008/056673; Dated: Aug. 19, 2008; 9 Pages. |
Website Interview by Tom Sassoon, Parts I-IV ; http://www.variety.com/index.asp?layout=videoBC&bcpid=1529573051; Optical Disk. |
International Search Report and Written Opinion issued for PCT/US2008/056719; Dated: Sep. 3, 2008; 9 Pages. |
International Search Report and Written Opinion issued for PCT/US2008/056697; Dated: Sep. 4, 2008; 10 Pages. |
International Search Report and Written Opinion issued for PCT/US2008/056716; Dated: Aug. 22, 2008; 8 Pages. |
International Search Report and Written Opinion issued for PCT/US2008/056388; Dated: Aug. 20, 2008; 9 Pages. |
International Search Report and Written Opinion issued for PCT/US2008/056384; Dated: Aug. 20, 2008; 11 Pages. |
International Search Report and Written Opinion issued for PCT/US2005/031664, dated Apr. 6, 2005. |
Chun-Jen Tsai et al., Model-Based Synthetic View Generation from a Monocular Video Sequence', Image Processing, 1997 Proceedings, IEEE, vol. 1 Oct. 26, 1997, pp. 444-447. |
Wurmlin S. et al., “3D Video Fragments: Dynamic point samples for Real-Time Free-Viewpoint Video”, Computers and Graphics Elsevier UK, vol. 28 No. 1 Feb. 2004, pp. 3-14. |
Labatut, Patrick, et al. “Efficient Multi-View Reconstruction of Large-Scale Scenes Using Interest Points, Triangulation and Graph Cuts,” Computer Vision, 2007.ICCV 2007.IEEE 11th International Conference on Oct. 14-21, 2007, pp. 108. |
Everitt, “Order-Independent Transparency,” NVIDIA Corporation, Oct. 13, 2013, pp. 1-14. retrieved from <http://replay.web.archive.org/20031011233027/http://developer.nvidia.com/object/order—independent—transparency.html>. |
Huang, et al,, “Automatic data segmentation for geometric feature extraction from unorganized 3-D coordinate points,” IEEE Transations on Robotics and Automation, Jun. 2001, pp. 268-279. vol. 17, No. 3. |
Lee, et al., “Patch-based Algorithms for Constrained Texture Synthesis and Labeled Texture Transfer,” Aug. 25-Aug. 27. 2002, pp. 1-7. |
Meyer, et al , “Segmentation of 3D triangulated data points using edges constucted with a C1 discontinuous surface fitting”, Computer-Aided Design, Nov. 2004, pp. 1327-1336, vol. 36, No. 13. |
Moustakas, et al., “Steroscopic video generation based on efficient layered structure and motion estimation from a monoscopic image sequence”, IEEE Transactions on Circiuts and Systems for Video Technology, Aug. 2005, pp. 1065-1073, vol. 15, No. 8. |
Chang, et al., “On an Analysis of Static Occlusion in Stereo Vision,” IEEE <http://ieeexplore.iee.org/stamp/stamp.jsp?tp=&arnumber=139799>, 1991, 2 pages. |
Number | Date | Country | |
---|---|---|---|
20080181486 A1 | Jul 2008 | US |