This subject matter of this application relates generally to methods and apparatuses, including computer program products, for multiple maps for 3D object scanning and reconstruction.
Generally, current approaches to 3D object reconstruction utilize limited “single map” techniques to provide a variety of high-level 3D model generation algorithms. However, with these techniques, it can be difficult for users to finish scanning objects due to, e.g., unreliable tracking. In “single map” reconstruction, every frame has to determine a location in the single map during scanning. When one frame loses the location information, the subsequent frames are not added into the object reconstruction process—which causes a failure to generate the corresponding 3D model.
Therefore, what is needed are systems and methods that enable a multi-map-based method for 3D object reconstruction which takes into account both accuracy and efficiency. The techniques described herein advantageously provide for tolerances in tracking loss and also result in substantial improvements for the user experience in scanning objects. For example, during scanning, the systems and methods generate multiple maps instead of only one (as in the prior systems described above). Each of these multiple maps contains its own frames to contribute to the partially scanned object, and each map has exactly the same structure containing 3D model information. Furthermore, each map is able to connect to other map(s) that are generated. This beneficially allows a user to continue scanning the object (and/or scene) without going back to the previous map and re-localizing—even when the tracking is lost. All the user has to do then is to make sure the camera field of view (FoV) has covered the entire area that needs to be scanned. As a result, these innovative techniques improve both speed and robustness of the scanning process.
The invention, in one aspect, features a system for generating multiple maps during object scanning for 3D object reconstruction. The system includes a sensor device that captures one or more RGB images and one or more depth maps of one or more objects in a scene. The system includes a computing device coupled to the sensor device, the computing device comprising a memory that stores computer-executable instructions and a processor that executes the instructions. The computing device receives the one or more RGB images and the one or more depth maps from the sensor device. The computing device creates a first map using at least a portion of the one or more depth maps. The computing device creates a second map using at least a portion of the one or more depth maps. The computing device creates a third map using at least a portion of the one or more depth maps. The computing device finds key point matches among the first map, the second map, and the third map. The computing device performs bundle adjustment on the first map, the second map, and the third map using the matched key points to generate a final map. The computing device generates a 3D mesh of the object using the final map.
The invention, in another aspect, features a computerized method of generating multiple maps during object scanning for 3D object reconstruction. A sensor device captures one or more RGB images and one or more depth maps of one or more objects in a scene. A computing device receives, from the sensor device, the one or more RGB images and the one or more depth maps. The computing device creates a first map using at least a portion of the one or more depth maps. The computing device creates a second map using at least a portion of the one or more depth maps. The computing device creates a third map using at least a portion of the one or more depth maps. The computing device finds key point matches among the first map, the second map, and the third map. The computing device performs bundle adjustment on the first map, the second map, and the third map using the matched key points to generate a final map. The computing device generates a 3D mesh of the object using the final map.
Any of the above aspects can include one or more of the following features. In some embodiments, creating a first map using at least a portion of the one or more depth maps comprises, for each depth map: locating at least one of the one or more objects in the depth map; identifying one or more key points on the located one or more objects; and combining the identified key points to generate the first map. In some embodiments, the portion of the one or more depth maps used to create the first map comprise a view of the one or more objects from a first perspective.
In some embodiments, creating a second map using at least a portion of the one or more depth maps comprises, for each depth map: locating at least one of the one or more objects in the depth map; identifying one or more key points on the located one or more objects; and combining the identified key points to generate the second map. In some embodiments, the portion of the one or more depth maps used to create the second map comprise a view of the one or more objects from a second perspective. In some embodiments, the second perspective is different from the first perspective.
In some embodiments, creating a third map using at least a portion of the one or more depth maps comprises, for each depth map: locating at least one of the one or more objects in the depth map; identifying one or more key points on the located one or more objects; and combining the identified key points to generate the third map. In some embodiments, the portion of the one or more depth maps used to create the third map comprise a view of the one or more objects from a third perspective. In some embodiments, the third perspective is different from the first perspective and the second perspective.
In some embodiments, at least one of the identified key points in the first map overlaps with at least one of the identified key points in the third map. In some embodiments, at least one of the identified key points in the second map overlaps with at least one of the identified key points in the third map. In some embodiments, at least one of the identified key points in the first map overlaps with at least one of the identified key points in the third map.
In some embodiments, finding key point matches among the first map, the second map, and the third map comprises one or more of: determining that a key point from the first map overlaps with a key point from the second map and identifying the overlapping key points as a key point match; determining that a key point from the second map overlaps with a key point from the third map and identifying the overlapping key points as a key point match; and determining that a key point from the first map overlaps with a key point from the third map and identifying the overlapping key points as a key point match. In some embodiments, the final map comprises a plurality of bundle-adjusted matched key points from the first map, the second map, and the third map.
In some embodiments, the 3D mesh is generated using a Marching Cube algorithm applied to at least a portion of the final map. In some embodiments, the one or more objects in the scene are stationary and the sensor device is moving, as the sensor device captures the one or more RGB images and the one or more depth maps. In some embodiments, the one or more objects in the scene are moving and the sensor device is stationary, as the sensor device captures the one or more RGB images and the one or more depth maps. In some embodiments, the one or more objects in the scene are moving and the sensor device is moving, as the sensor device captures the one or more RGB images and the one or more depth maps.
Other aspects and advantages of the invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating the principles of the invention by way of example only.
The advantages of the invention described above, together with further advantages, may be better understood by referring to the following description taken in conjunction with the accompanying drawings. The drawings are not necessarily to scale, emphasis instead generally being placed upon illustrating the principles of the invention.
Each of the above-referenced patents and patent applications is incorporated by reference herein in its entirety. The methods and systems described in the above patents and patent applications, and in the present patent application, are available by implementing the Starry Night SDK, available from VanGogh Imaging, Inc. of McLean, Va.
The system 100 includes a sensor 103 coupled to a computing device 104. The computing device 104 includes an image processing module 106. In some embodiments, the computing device can also be coupled to a data storage module (database 108), e.g., used for storing certain 3D models, color images, maps, and other data as described herein. The sensor 103 is positioned to capture scans (e.g., color (RGB) images and/or depth maps) of a scene 101 which includes one or more physical objects (e.g., object 102). In some embodiments, a user manually rotates and moves the object 102 in the scene 101 so that the sensor 103 captures a plurality of scans of the object from different angles and/or sides; in some embodiments, the user's hand is captured in the scans along with the object.
Exemplary sensors that can be used in the system 100 include, but are not limited to, time-of-flight (ToF) sensors that are capable of capturing depth information of the pixels along with the images of a real-world object and/or scene to collect data on its position, location, and appearance. Other types of sensors include 3D scanners, digital cameras, and other types of devices. In some embodiments, the sensor 103 is embedded into the computing device 104, such as a camera in a smartphone, for example. An exemplary sensor 103 can be a 3D scanner built from combining a depth camera and a high-resolution RGB camera. The cameras can be calibrated so their data can be registered to each other. In one embodiment, the sensor 103 includes a Sony DepthsSense™ ToF sensor coupled to, e.g., a computing device such as a mobile device with an embedded camera. It should be appreciated that other combinations of these devices or other devices can be used to perform the techniques described herein.
The computing device 104 receives images (also called scans) of the scene 101 from the sensor 103 and processes the images to generate 3D models of objects (e.g., object 102) represented in the scene 101. The computing device 104 can take on many forms, including both mobile and non-mobile forms. Exemplary computing devices include, but are not limited to, a laptop computer, a desktop computer, a tablet computer, a smart phone, an internet of things (IoT) device, augmented reality (AR)/virtual reality (VR) devices (e.g., glasses, headset apparatuses, and so forth), or the like. In some embodiments, the sensor 203 and computing device 104 can be embedded in a larger mobile structure such as a robot or unmanned aerial vehicle (UAV). It should be appreciated that other computing devices can be used without departing from the scope of the invention. The computing device 104 includes network-interface components to connect to a communications network (not shown). In some embodiments, the network-interface components include components to connect to a wireless network, such as a Wi-Fi or cellular network, in order to access a wider network, such as the Internet.
The computing device 104 includes an image processing module 106 configured to receive images captured by the sensor 103 and analyze the images in a variety of ways, including detecting the position and location of objects represented in the images and generating 3D models of objects in the images. The image processing module 106 is a hardware and/or software module that resides on the computing device 104 to perform functions associated with analyzing images capture by the scanner, including the generation of 3D models (e.g., .OBJ files) based upon objects in the images. In some embodiments, the functionality of the image processing module 106 is distributed among a plurality of computing devices. In some embodiments, the image processing module 106 operates in conjunction with other modules that are either also located on the computing device 104 or on other computing devices coupled to the computing device 104. It should be appreciated that any number of computing devices, arranged in a variety of architectures, resources, and configurations (e.g., cluster computing, virtual computing, cloud computing) can be used without departing from the scope of the invention. An exemplary image processing module 106 is the Starry Night SDK, available from VanGogh Imaging, Inc. of McLean, Va.
It should be appreciated that in one embodiment, the image processing module 106 comprises specialized hardware (such as a processor or system-on-chip) that is embedded into, e.g., a circuit board or other similar component of another device. In this embodiment, the image processing module 106 is specifically programmed with the image processing and modeling software functionality described below.
The image processing module 106 receives (202) the depth map(s) and RGB image(s). The image processing module 106 starts to reconstruct the scanned object and creates (202) a first map. The image processing module 106 adds frames into the first map—as shown in
Next, the image processing module 106 creates (204) a second map and adds new frames into the second map—where the frames added to the second map are from a different side and/or perspective of the object (e.g., the opposite side) than the frames added to the first map. Similar to creating the first map, the image processing module 106 performs a loop to receive each frame, track the object, and then update the second map based upon the tracking. As shown in
The image processing module 106 then creates (206) a third map to cover any areas missing from the first map and the second map, and adds new frames into the third map. Similar to creating the first map and the second map, the image processing module 106 performs a loop to receive each frame, track the object, and then update the third map based upon the tracking.
Once all three maps are created as described above, the image processing module 106 finds (208) key point matches among the three maps. Each map has a set of key points, and every two maps have some shared key points. In order to find key point matches, the image processing module 106 can apply 2D/RGB feature matching and 3D/point based matching algorithms. In some embodiments, ORB descriptor distance and point normal are used as criteria to calculate the similarity among the matched key points.
After finding the key point matches, the image processing module 106 performs (210) bundle adjustment on the first map, second map, and third map using the matched key points to generate a final map.
Using all of the key points in the final map, the image processing module 106 then generates (212) a 3D point cloud of the object 102. Then, the image processing module 106 can utilize a Poisson algorithm to construct a 3D mesh on the 3D point cloud, and textures are applied to the 3D mesh (as created from the RGB images of the object received from the sensor device 103) to generate a 3D model of the object. In some embodiments, the module 106 generates the 3D mesh using a Marching Cube algorithm, and the texture is then added using, e.g., the open-source MVS module.
In the example described above, it should be appreciated that, during scanning, the object 102 does not move relative to its surroundings—only the sensor device 103 is moving. Due to this limitation, it is not possible to scan the bottom of the object 102. However, the multi-map-based method described herein can overcome this limitation as described below.
The scanning process can be separated into different modes including non-movement and movement of the object (i.e., relative to the scene). As shown in
The image processing module 106 generates two independent maps using the above scans—one map that comprises key points from the scans 902-910 of the object 102 without movement (i.e., static scanning) and another map that comprises key points from the scans 1002-1004 of the object 102 with manual movement (i.e., dynamic scanning). As described previously, the image processing module 106 can then find key point matches between the static map and the dynamic map and perform bundle adjustment on the static map and dynamic map using the matched key points to generate a final map. Then, the image processing module 106 can generate a 3D mesh of the object from the final map and apply textures using the RGB images to create a 3D object. As shown in
The techniques described herein also address the problem of disjointed maps. Disjointed maps can occur when new maps are created due to tracking loss during scanning. For example, when tracking is lost, the tracking algorithm no longer knows where the object 102 is in relation to the previous map, so the new map exists in a different coordinate system. Over the course of a complete scan, this can lead to several sub-maps within the multi-map that have no connection to each other. In order to fully reconstruct the object in 3D space, these sub-maps must be combined into one map by finding overlapping areas between them. However, this overlap may not occur until scanning is completed, so a final combining step must be performed before bundle adjusting the entire model.
The image processing module 106 identifies (1204) initial matches of keyframes between different sub-maps. In one embodiment, the module 106 uses ORB feature descriptors found in each keyframe to create a bag-of-words histogram for the keyframe. The module 106 then compares histograms of different keyframes to find a pair of keyframes with a high potential to match correctly. If the histograms are similar, the module 106 then searches for ORB features with matches in both of the two keyframes. If the module 106 finds a large number of ORB features that match and agree on a pose transformation, then the module 106 considers these two keyframes matched. Using this technique, the module 106 can look for keyframe matches between any pair of keyframes from different sub-maps.
The image processing module 106 then determines (1206) pose deltas (or pose transformations) from the viewing angle of one keyframe to the other keyframe using the ORB feature matches between the two keyframes. The module 106 combines the original poses of the keyframes in their respective coordinate systems with the determined delta or transformation to find the transformation between coordinate systems. For example, given frame A with pose PA in the first map's coordinate system CA and frame B with pose PA in the first map's coordinate system CA, the module 106 first finds the delta pose PAB transforming points in A to points in B. The module 106 can then express the transformation between coordinate systems as CB=PBPABPA−1CA.
Now, the image processing module 106 has a number of possible transformations from one map to another, one per keyframe pair. The module 106 determines (1208) map-to-map deltas by identifying the number of inliers in each possible transformation, where the transformation with the largest number of inliers then describes the most likely alignment between two maps. The module 106 takes the two maps with the largest number of inliers and combines them into one map by inserting all key points and key frames into a single map after transforming them into the shared coordinate system. The module 106 then repeats this procedure until all of the maps have been combined into one coordinate system.
The image processing module 106 then performs (1210) feature matching on the keyframes. Because all keyframes from all maps are now in the same coordinate system, the module 106 can easily search for good feature-to-feature correspondences in any pair of overlapping keyframes. These correspondences tie all keyframes together into one map that can be bundle adjusted.
Then, the image processing module 106 can perform (1212) bundle adjustment on the new map. It should be appreciated that global bundle adjustment takes place the same way it would when there is only a single map, reducing any error in the sub-map to sub-map pose estimation.
The above-described techniques can be implemented in digital and/or analog electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The implementation can be as a computer program product, i.e., a computer program tangibly embodied in a machine-readable storage device, for execution by, or to control the operation of, a data processing apparatus, e.g., a programmable processor, a computer, and/or multiple computers. A computer program can be written in any form of computer or programming language, including source code, compiled code, interpreted code and/or machine code, and the computer program can be deployed in any form, including as a stand-alone program or as a subroutine, element, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one or more sites.
Method steps can be performed by one or more specialized processors executing a computer program to perform functions by operating on input data and/or generating output data. Method steps can also be performed by, and an apparatus can be implemented as, special purpose logic circuitry, e.g., a FPGA (field programmable gate array), a FPAA (field-programmable analog array), a CPLD (complex programmable logic device), a PSoC (Programmable System-on-Chip), ASIP (application-specific instruction-set processor), or an ASIC (application-specific integrated circuit), or the like. Subroutines can refer to portions of the stored computer program and/or the processor, and/or the special circuitry that implement one or more functions.
Processors suitable for the execution of a computer program include, by way of example, special purpose microprocessors. Generally, a processor receives instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and/or data. Memory devices, such as a cache, can be used to temporarily store data. Memory devices can also be used for long-term data storage. Generally, a computer also includes, or is operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. A computer can also be operatively coupled to a communications network in order to receive instructions and/or data from the network and/or to transfer instructions and/or data to the network. Computer-readable storage mediums suitable for embodying computer program instructions and data include all forms of volatile and non-volatile memory, including by way of example semiconductor memory devices, e.g., DRAM, SRAM, EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and optical disks, e.g., CD, DVD, HD-DVD, and Blu-ray disks. The processor and the memory can be supplemented by and/or incorporated in special purpose logic circuitry.
To provide for interaction with a user, the above described techniques can be implemented on a computer in communication with a display device, e.g., a CRT (cathode ray tube), plasma, or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse, a trackball, a touchpad, or a motion sensor, by which the user can provide input to the computer (e.g., interact with a user interface element). Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, and/or tactile input.
The above described techniques can be implemented in a distributed computing system that includes a back-end component. The back-end component can, for example, be a data server, a middleware component, and/or an application server. The above described techniques can be implemented in a distributed computing system that includes a front-end component. The front-end component can, for example, be a client computer having a graphical user interface, a Web browser through which a user can interact with an example implementation, and/or other graphical user interfaces for a transmitting device. The above described techniques can be implemented in a distributed computing system that includes any combination of such back-end, middleware, or front-end components.
The components of the computing system can be interconnected by transmission medium, which can include any form or medium of digital or analog data communication (e.g., a communication network). Transmission medium can include one or more packet-based networks and/or one or more circuit-based networks in any configuration. Packet-based networks can include, for example, the Internet, a carrier internet protocol (IP) network (e.g., local area network (LAN), wide area network (WAN), campus area network (CAN), metropolitan area network (MAN), home area network (HAN)), a private IP network, an IP private branch exchange (IPBX), a wireless network (e.g., radio access network (RAN), Bluetooth, Wi-Fi, WiMAX, general packet radio service (GPRS) network, HiperLAN), and/or other packet-based networks. Circuit-based networks can include, for example, the public switched telephone network (PSTN), a legacy private branch exchange (PBX), a wireless network (e.g., RAN, code-division multiple access (CDMA) network, time division multiple access (TDMA) network, global system for mobile communications (GSM) network), and/or other circuit-based networks.
Information transfer over transmission medium can be based on one or more communication protocols. Communication protocols can include, for example, Ethernet protocol, Internet Protocol (IP), Voice over IP (VOIP), a Peer-to-Peer (P2P) protocol, Hypertext Transfer Protocol (HTTP), Session Initiation Protocol (SIP), H.323, Media Gateway Control Protocol (MGCP), Signaling System #7 (SS7), a Global System for Mobile Communications (GSM) protocol, a Push-to-Talk (PTT) protocol, a PTT over Cellular (POC) protocol, Universal Mobile Telecommunications System (UMTS), 3GPP Long Term Evolution (LTE) and/or other communication protocols.
Devices of the computing system can include, for example, a computer, a computer with a browser device, a telephone, an IP phone, a mobile device (e.g., cellular phone, personal digital assistant (PDA) device, smart phone, tablet, laptop computer, electronic mail device), and/or other communication devices. The browser device includes, for example, a computer (e.g., desktop computer and/or laptop computer) with a World Wide Web browser (e.g., Chrome™ from Google, Inc., Microsoft® Internet Explorer® available from Microsoft Corporation, and/or Mozilla® Firefox available from Mozilla Corporation). Mobile computing device include, for example, a Blackberry® from Research in Motion, an iPhone® from Apple Corporation, and/or an Android™-based device. IP phones include, for example, a Cisco® Unified IP Phone 7985G and/or a Cisco® Unified Wireless Phone 7920 available from Cisco Systems, Inc.
Comprise, include, and/or plural forms of each are open ended and include the listed parts and can include additional parts that are not listed. And/or is open ended and includes one or more of the listed parts and combinations of the listed parts.
One skilled in the art will realize the technology may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The foregoing embodiments are therefore to be considered in all respects illustrative rather than limiting of the technology described herein.
This application claims priority to U.S. Provisional Patent Application No. 62/956,757, filed on Jan. 3, 2020, the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5675326 | Juds et al. | Oct 1997 | A |
6259815 | Anderson et al. | Jul 2001 | B1 |
6275235 | Morgan, III | Aug 2001 | B1 |
6525722 | Deering | Feb 2003 | B1 |
6525725 | Deering | Feb 2003 | B1 |
7248257 | Elber | Jul 2007 | B2 |
7420555 | Lee | Sep 2008 | B1 |
7657081 | Blais et al. | Feb 2010 | B2 |
8209144 | Anguelov et al. | Jun 2012 | B1 |
8542233 | Brown | Sep 2013 | B2 |
8766979 | Lee et al. | Jul 2014 | B2 |
8942917 | Chrysanthakopoulos | Jan 2015 | B2 |
8995756 | Lee et al. | Mar 2015 | B2 |
9041711 | Hsu | May 2015 | B1 |
9104908 | Rogers et al. | Aug 2015 | B1 |
9171402 | Allen et al. | Oct 2015 | B1 |
9607388 | Lin et al. | May 2017 | B2 |
9710960 | Hou | Jul 2017 | B2 |
9886530 | Mehr et al. | Feb 2018 | B2 |
9978177 | Mehr et al. | May 2018 | B2 |
10467792 | Roche et al. | Nov 2019 | B1 |
20050068317 | Amakai | Mar 2005 | A1 |
20050128201 | Warner et al. | Jun 2005 | A1 |
20050253924 | Mashitani | Nov 2005 | A1 |
20060050952 | Blais et al. | Mar 2006 | A1 |
20060170695 | Zhou et al. | Aug 2006 | A1 |
20060277454 | Chen | Dec 2006 | A1 |
20070075997 | Rohaly et al. | Apr 2007 | A1 |
20080180448 | Anguelov et al. | Jul 2008 | A1 |
20080310757 | Wolberg et al. | Dec 2008 | A1 |
20090232353 | Sundaresan et al. | Sep 2009 | A1 |
20100111370 | Black et al. | May 2010 | A1 |
20100198563 | Plewe | Aug 2010 | A1 |
20100209013 | Minear et al. | Aug 2010 | A1 |
20100302247 | Perez et al. | Dec 2010 | A1 |
20110052043 | Hyung et al. | Mar 2011 | A1 |
20110074929 | Hebert et al. | Mar 2011 | A1 |
20120056800 | Williams et al. | Mar 2012 | A1 |
20120063672 | Gordon et al. | Mar 2012 | A1 |
20120098937 | Sajadi et al. | Apr 2012 | A1 |
20120130762 | Gale et al. | May 2012 | A1 |
20120194516 | Newcombe et al. | Aug 2012 | A1 |
20120194517 | Izadi et al. | Aug 2012 | A1 |
20120306876 | Shotton et al. | Dec 2012 | A1 |
20130069940 | Sun et al. | Mar 2013 | A1 |
20130123801 | Umasuthan et al. | May 2013 | A1 |
20130156262 | Taguchi et al. | Jun 2013 | A1 |
20130201104 | Ptucha et al. | Aug 2013 | A1 |
20130201105 | Ptucha et al. | Aug 2013 | A1 |
20130208955 | Zhao et al. | Aug 2013 | A1 |
20140160115 | Keitler et al. | Jun 2014 | A1 |
20140176677 | Valkenburg et al. | Jun 2014 | A1 |
20140206443 | Sharp et al. | Jul 2014 | A1 |
20140240464 | Lee | Aug 2014 | A1 |
20140241617 | Shotton et al. | Aug 2014 | A1 |
20140270484 | Chandraker et al. | Sep 2014 | A1 |
20140321702 | Schmalstieg | Oct 2014 | A1 |
20150009214 | Lee et al. | Jan 2015 | A1 |
20150045923 | Chang et al. | Feb 2015 | A1 |
20150142394 | Mehr et al. | May 2015 | A1 |
20150213572 | Loss | Jul 2015 | A1 |
20150234477 | Abovitz et al. | Aug 2015 | A1 |
20150262405 | Black et al. | Sep 2015 | A1 |
20150269715 | Jeong et al. | Sep 2015 | A1 |
20150279118 | Dou et al. | Oct 2015 | A1 |
20150301592 | Miller | Oct 2015 | A1 |
20150325044 | Lebovitz | Nov 2015 | A1 |
20150371440 | Pirchheim et al. | Dec 2015 | A1 |
20150381968 | Arora | Dec 2015 | A1 |
20160026253 | Bradski et al. | Jan 2016 | A1 |
20160071284 | Kontschieder | Mar 2016 | A1 |
20160071318 | Lee et al. | Mar 2016 | A1 |
20160171765 | Mehr | Jun 2016 | A1 |
20160173842 | De La Cruz et al. | Jun 2016 | A1 |
20160358382 | Lee et al. | Dec 2016 | A1 |
20170053447 | Chen et al. | Feb 2017 | A1 |
20170054954 | Keitler et al. | Feb 2017 | A1 |
20170054965 | Raab et al. | Feb 2017 | A1 |
20170148155 | Wei | May 2017 | A1 |
20170221263 | Wei et al. | Aug 2017 | A1 |
20170243397 | Hou et al. | Aug 2017 | A1 |
20170278293 | Hsu | Sep 2017 | A1 |
20170316597 | Ceylan et al. | Nov 2017 | A1 |
20170337726 | Bui et al. | Nov 2017 | A1 |
20180005015 | Hou et al. | Jan 2018 | A1 |
20180025529 | Wu et al. | Jan 2018 | A1 |
20180114363 | Rosenbaum | Apr 2018 | A1 |
20180144535 | Ford et al. | May 2018 | A1 |
20180288387 | Somanath et al. | Oct 2018 | A1 |
20180300937 | Chien et al. | Oct 2018 | A1 |
20190208007 | Khalid | Jul 2019 | A1 |
20190244412 | Yago Vicente et al. | Aug 2019 | A1 |
20190251728 | Stoyles et al. | Aug 2019 | A1 |
20200086487 | Johnson et al. | Mar 2020 | A1 |
20200105013 | Chen | Apr 2020 | A1 |
Number | Date | Country |
---|---|---|
1308902 | May 2003 | EP |
10-1054736 | Aug 2011 | KR |
10-2011-0116671 | Oct 2011 | KR |
2006027339 | Mar 2006 | WO |
Entry |
---|
Rossignac, J. et al., “3D Compression Made Simple: Edgebreaker on a Corner-Table,” Invited lecture at the Shape Modeling International Conference, Genoa, Italy (Jan. 30, 2001), pp. 1-6. |
Melax, S., “A Simple, Fast, and Effective Polygon Reduction Algorithm,” Game Developer, Nov. 1998, pp. 44-49. |
Myronenko, A. et al., “Point Set Registration: Coherent Point Drift,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, No. 12, Dec. 2010, pp. 2262-2275. |
Bookstein, F., “Principal Warps: Thin-Plate Splines and the Decomposition of Deformations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, No. 6, Jun. 1989, pp. 567-585. |
Zadi, S. et al., “KinectFusion: Real-time 3D Reconstruction and Interaction Using a Moving Depth Camera,” UIST '11, Oct. 16-19, 2011, 10 pages. |
Papazov, C. et al., “An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes,” presented at Computer Vision—ACCV 2010—10th Asian Conference on Computer Vision, Queenstown, New Zealand, Nov. 3-12, 2010, 14 pages. |
Biegelbauer, Georg et al., “Model-based 3D object detection—Efficient approach using superquadrics,” Machine Vision and Applications, Jun. 2010, vol. 21, Issue 4, pp. 497-516. |
Kanezaki, Asako et al., “High-speed 3D Object Recognition Using Additive Features in a Linear Subspace,” 2010 IEEE International Conference on Robotics and Automation, Anchorage Convention District, May 3-8, 2010, pp. 3128-3134. |
International Search Report and Written Opinion from PCT patent application No. PCT/US13/062292, dated Jan. 28, 2014, 10 pages. |
International Search Report and Written Opinion from PCT patent application No. PCT/US14/045591, dated Nov. 5, 2014, 9 pages. |
Sumner, R. et al., “Embedded Deformation for Shape Manipulation,” Applied Geometry Group, ETH Zurich, SIGGRAPH 2007, 7 pages. |
Rosten, Edward, et al., “Faster and better: a machine learning approach to corner detection,” arXiv:08102.2434v1 [cs.CV], Oct. 14, 2008, available at https://arxiv.org/pdf/0810.2434.pdf, 35 pages. |
Kim, Young Min, et al., “Guided Real-Time Scanning of Indoor Objects,” Computer Graphics Forum, vol. 32, No. 7 (2013), 10 pages. |
Rusinkewicz, Szymon, et al., “Real-time 3D model acquisition,” ACM Transactions on Graphics (TOG) 21.3 (2002), pp. 438-446. |
European Search Report from European patent application No. EP 15839160, dated Feb. 19, 2018, 8 pages. |
Liu, Song, et al., “Creating Simplified 3D Models with High Quality Textures,” arXiv:1602.06645v1 [cs.GR], Feb. 22, 2016, 9 pages. |
Stoll, C., et al., “Template Deformation for Point Cloud Filtering,” Eurographics Symposium on Point-Based Graphics (2006), 9 pages. |
Allen, Brett, et al., “The space of human body shapes: reconstruction and parameterization from range scans,” ACM Transactions on Graphics (TOG), vol. 22, Issue 3, Jul. 2003, pp. 587-594. |
International Search Report and Written Opinion from PCT patent application No. PCT/US15/49175, dated Feb. 19, 2016, 14 pages. |
Harris, Chris & Mike Stephens, “A Combined Corner and Edge Detector,” Plessey Research Roke Manor, U.K. (1988), pp. 147-151. |
Bay, Herbert, et al., “Speeded-Up Robust Features (SURF),” Computer Vision and Image Understanding 110 (2008), pp. 346-359. |
Rublee, Ethan, et al., “ORB: an efficient alternative to SIFT or SURF,” Willow Garage, Menlo Park, CA (2011), available from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.370.4395&rep=rep1&type=pdf, 8 pages. |
Lowe, David G., “Distinctive Image Features from Scale-Invariant Keypoints,” International Journal of Computer Vision, vol. 60, Issue 2, Nov. 2004, pp. 91-110. |
Kaess, Michael, et al., “iSAM: Incremental Smoothing and Mapping,” IEEE Transactions on Robotics, Manuscript, Sep. 7, 2008, 14 pages. |
Kummerle, Rainer, et al., “g2o: A General Framework for Graph Optimization,” 2011 IEEE International Conference an Robotics and Automation, May 9-13, 2011, Shanghai, China, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20210209849 A1 | Jul 2021 | US |
Number | Date | Country | |
---|---|---|---|
62956757 | Jan 2020 | US |