Feature matching and corresponding refinement and 3D submap position refinement system and method for centimeter precision localization using camera-based submap and LiDAR-based global map

Information

  • Patent Grant
  • 11151393
  • Patent Number
    11,151,393
  • Date Filed
    Friday, February 14, 2020
    4 years ago
  • Date Issued
    Tuesday, October 19, 2021
    3 years ago
Abstract
A method of localization for a non-transitory computer readable storage medium storing one or more programs is disclosed. The one or more programs comprise instructions, which when executed by a computing device, cause the computing device to perform by one or more autonomous vehicle driving modules execution of processing of images from a camera and data from a LiDAR using the following steps comprising: computing, in response to features from a 3D submap and features from a global map, matching score between corresponding features of a same class between the 3D submap and the global map; selecting, for each feature in the 3D submap, a corresponding feature with the highest matching score from the global map; determining a feature correspondence to be invalid if a distance between corresponding features is larger than a threshold; and removing the invalid feature correspondence.
Description
PRIORITY/RELATED DOCUMENTS

This patent document claims the benefit of U.S. patent application Ser. No. 15/684,389, filed on Aug. 23, 2017, which is incorporated herein by reference in its entirety for all purposes.


FIELD OF THE DISCLOSURE

The field of the disclosure is in general related to autonomous vehicles and, in particular, to a system and a method for localization using a camera-based reconstructed submap and a LiDAR-based global map.


BACKGROUND OF THE DISCLOSURE

Intelligent or autonomous vehicle is increasingly popular and has recently become a research topic of interest. In autonomous vehicle applications, robust and smooth localization in a large scale outdoor environment is a key problem. For land-based ground vehicle such as an autonomous car which operates in outdoor environment, the most prevalent sensor for localization information is global positioning system (GPS). However, as a commonly known problem, GPS satellite signal is not always available in urban environments and its accuracy is also compromised due to multi-path errors caused by, for example, high city buildings and tree canopies. Therefore, simultaneous localization and mapping (SLAM) based approaches have been increasingly developed to build a map for urban applications. Such approaches aid the inertial navigation by modeling the map and using on-board sensors to localize relative to that map.


All referenced patents, applications and literatures throughout this disclosure are incorporated herein by reference in their entirety. For example, including the following references:

  • Tim Caselitz, Bastian Steder, Michael Ruhnke, Wolfram Burgard; Monocular Camera Localization in 3D LiDAR Maps; ais.informatik.uni-Freiburg.de/publications/papers/caselitz16iros.pdf.
  • Raul Mur-Attal, J. M. M. Montiel, Member, IEEE, and Juan D. Tardos, Member IEEE; ORB-SLAM: A Versatile and Accurate Monocular SLAM System, IEEE Transactions on Robotics, Vol. 31, No. 5, October 2015, 1147-1163.
  • Torsten Sattler, Akihiko Torii, Josef Sivic, March Pollefeys, Hajime Taira, Masatoshi Okutomi, Tomas Pajdla, Department of Computer Science, ETD Zurich, Tokyo Institute of Technology, Iniria, Microsoft, Redmond, Chezeh Technology University in Prague, Are Large-Scale 3D Models Really Necessary For Accurate Visual Localization; hal.inria.fr/hal-01513083.
  • Jokob Engel and Thomas Schops and Daniel Cremers, Technical University Munich; LSD-SLAM: Large Scale Direct Monocular SLAM; researchgate.net/publication/290620817_LSD-SLAM_large-scale_direct_monocular_SLAM


BRIEF SUMMARY OF THE DISCLOSURE

Various objects, features, aspects and advantages of the present embodiment will become more apparent from the following detailed description of embodiments of the embodiment, along with the accompanying drawings in which like numerals represent like components.


Embodiments of the present disclosure provide a method of localization for a non-transitory computer readable storage medium storing one or more programs. The one or more programs comprise instructions, which when executed by a computing device, cause the computing device to perform by one or more autonomous vehicle driving modules execution of processing of images from a camera and data from a LiDAR using the following steps comprising: computing, in response to features from a 3D submap and features from a global map, matching score between corresponding features of a same class between the 3D submap and the global map; selecting, for each feature in the 3D submap, a corresponding feature with the highest matching score from the global map; determining a feature correspondence to be invalid if a distance between corresponding features is larger than a threshold; and removing the invalid feature correspondence.


In an embodiment, before computing matching score, the method further comprises: performing data alignment; and collecting the data in an environment by using sensors including a camera, the LiDAR and an inertial navigation module.


In another embodiment, before computing matching score, the method further comprises: constructing at least one 3D submap; and constructing a global map.


In yet another embodiment, constructing at least one 3D submap comprises: obtaining images from a camera; and constructing at least one 3D submap based on the images, using visual SLAM.


In still another embodiment, constructing a global map comprises: obtaining the data from the LiDAR; and constructing a city-scale 3D map based on the data from the LiDAR, using LiDAR mapping.


In yet still another embodiment, before computing matching score, the method further comprises: extracting features from the 3D submap and the global map.


In still yet another embodiment, extracting features from the 3D submap and the global map comprises: extracting structured features and unstructured features from 3D submap and the global map.


In a further embodiment, the structured features include at least one of planes, straight lines and curved lines, and the unstructured features include sparse 3D points.


In another further embodiment, extracting features from the 3D submap and the global map comprises: voxelizing the 3D submap and the global map into voxels; and estimating distribution of 3D points within the voxels, using a probabilistic model.


In yet another further embodiment, extracting features from the 3D submap and the global map comprises: classifying the extracted features into classes.


In still another further embodiment, the distance between corresponding features is determined by a trained classifier.


In yet still another further embodiment, the method further comprises: refining location of the 3D submap.


In still yet another further embodiment, refining location of the 3D submap comprises: performing an iterative estimation of location of the 3D submap until distance between corresponding features reaches a predetermined value.


Embodiments of the present disclosure also provide a system for localization. The system comprises an internet server, comprising: an I/O port, configured to transmit and receive electrical signals to and from a client device; a memory; one or more processing units; and one or more programs stored in the memory and configured for execution by the one or more processing units, the one or more programs including instructions by one or more autonomous vehicle driving modules execution of processing of images from a camera and data from a LiDAR using for: computing, in response to features from a 3D submap and features from a global map, matching score between corresponding features of a same class between the 3D submap and the global map; selecting, for each feature in the 3D submap, a corresponding feature with the highest matching score from the global map; determining a feature correspondence to be invalid if a distance between corresponding features is larger than a threshold; and removing the invalid feature correspondence.


In an embodiment, before computing matching score, the system further comprises: constructing at least one 3D submap based on images from a camera, using visual SLAM; and constructing a global map based on the data from the LiDAR, using LiDAR mapping.


In another embodiment, before computing matching score, the system further comprises: extracting structured features and unstructured features from 3D submap and the global map.


In still another embodiment, extracting features from the 3D submap and the global map comprises: voxelizing the 3D submap and the global map into voxels; and estimating distribution of 3D points within the voxels, using a probabilistic model.


In yet another embodiment, extracting features from the 3D submap and the global map comprises: classifying the extracted features into classes.


In still yet another embodiment, the system further comprises: refining location of the 3D submap.


In yet still another embodiment, refining location of the 3D submap comprises: performing an iterative estimation of location of the 3D submap until distance between corresponding features reaches a predetermined value.





BRIEF DESCRIPTION OF THE DRAWINGS

It should be noted that the drawing figures may be in simplified form and might not be to precise scale. In reference to the disclosure herein, for purposes of convenience and clarity only, directional terms such as top, bottom, left, right, up, down, over, above, below, beneath, rear, front, distal, and proximal are used with respect to the accompanying drawings. Such directional terms should not be construed to limit the scope of the embodiment in any manner.



FIG. 1 is a flow diagram showing a method of localization, in accordance with some embodiments;



FIG. 2 is a flow diagram showing a method of localization in 3D submap reconstruction and coarse alignment, in accordance with some embodiments;



FIG. 3 is a flow diagram showing a method of localization in extracting features from a 3D submap and a global map, in accordance with some embodiments;



FIG. 4 is a flow diagram showing a method of localization in feature matching and feature correspondence refinement, in accordance with some embodiments;



FIG. 5 is a flow diagram showing a method of localization in refining position of a 3D submap, in accordance with some embodiments;



FIG. 6 is a block diagram of a system for localization, in accordance with some embodiments; and



FIG. 7 is a block diagram of a processor in the system illustrated in FIG. 6 for localization, in accordance with some embodiments.





DETAILED DESCRIPTION OF THE EMBODIMENTS

The embodiment and its various embodiments can now be better understood by turning to the following detailed description of the embodiments, which are presented as illustrated examples of the embodiment defined in the claims. It is expressly understood that the embodiment as defined by the claims may be broader than the illustrated embodiments described below.


Any alterations and modifications in the described embodiments, and any further applications of principles described in this document are contemplated as would normally occur to one of ordinary skill in the art to which the disclosure relates. Specific examples of components and arrangements are described below to simplify the present disclosure. These are, of course, merely examples and are not intended to be limiting. For example, when an element is referred to as being “connected to” or “coupled to” another element, it may be directly connected to or coupled to the other element, or intervening elements may be present.


In the drawings, the shape and thickness may be exaggerated for clarity and convenience. This description will be directed in particular to elements forming part of, or cooperating more directly with, an apparatus in accordance with the present disclosure. It is to be understood that elements not specifically shown or described may take various forms. Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment.


In the drawings, the figures are not necessarily drawn to scale, and in some instances the drawings have been exaggerated and/or simplified in places for illustrative purposes. One of ordinary skill in the art will appreciate the many possible applications and variations of the present disclosure based on the following illustrative embodiments of the present disclosure.


The appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be appreciated that the following figures are not drawn to scale; rather, these figures are merely intended for illustration.


It will be understood that singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Furthermore, relative terms, such as “bottom” and “top,” may be used herein to describe one element's relationship to other elements as illustrated in the Figures.


Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and the present disclosure, and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.


Many alterations and modifications may be made by those having ordinary skill in the art without departing from the spirit and scope of the embodiment. Therefore, it must be understood that the illustrated embodiment has been set forth only for the purposes of example and that it should not be taken as limiting the embodiment as defined by the following claims. For example, notwithstanding the fact that the elements of a claim are set forth below in a certain combination, it must be expressly understood that the embodiment includes other combinations of fewer, more, or different elements, which are disclosed herein even when not initially claimed in such combinations.


The words used in this specification to describe the embodiment and its various embodiments are to be understood not only in the sense of their commonly defined meanings, but to include by special definition in this specification structure, material or acts beyond the scope of the commonly defined meanings. Thus if an element can be understood in the context of this specification as including more than one meaning, then its use in a claim must be understood as being generic to all possible meanings supported by the specification and by the word itself.


The definitions of the words or elements of the following claims therefore include not only the combination of elements which are literally set forth, but all equivalent structure, material or acts for performing substantially the same function in substantially the same way to obtain substantially the same result.


In this sense it is therefore contemplated that an equivalent substitution of two or more elements may be made for any one of the elements in the claims below or that a single element may be substituted for two or more elements in a claim. Although elements may be described above as acting in certain combinations and even initially claimed as such, it is to be expressly understood that one or more elements from a claimed combination can in some cases be excised from the combination and that the claimed combination may be directed to a subcombination or variation of a subcombination.


Reference is now made to the drawings wherein like numerals refer to like parts throughout.


As used herein, the term “wireless” refers to wireless communication to a device or between multiple devices. Wireless devices may be anchored to a location and/or hardwired to a power system, depending on the needs of the business, venue, event or museum. In one embodiment, wireless devices may be enabled to connect to Internet, but do not need to transfer data to and from Internet in order to communicate within the wireless information communication and delivery system.


As used herein, the term “Smart Phone” or “smart phone” or “mobile device(s)” or “cellular phone” or “cellular” or “mobile phone” or the like refers to a wireless communication device, that includes, but not is limited to, an integrated circuit (IC), chip set, chip, system-on-a-chip including low noise amplifier, power amplifier, Application Specific Integrated Circuit (ASIC), digital integrated circuits, a transceiver, receiver, or transmitter, dynamic, static or non-transitory memory device(s), one or more computer processor(s) to process received and transmitted signals, for example, to and from the Internet, other wireless devices, and to provide communication within the wireless information communication and delivery system including send, broadcast, and receive information, signal data, location data, a bus line, an antenna to transmit and receive signals, and power supply such as a rechargeable battery or power storage unit. The chip or IC may be constructed (“fabricated”) on a “die” cut from, for example, a Silicon, Sapphire, Indium Phosphide, or Gallium Arsenide wafer. The IC may be, for example, analogue or digital on a chip or hybrid combination thereof. Furthermore, digital integrated circuits may contain anything from one to thousands or millions of signal invertors, and logic gates, e.g., “and”, “or”, “nand” and “nor gates”, flipflops, multiplexors, etc., on a square area that occupies only a few millimeters. The small size of, for instance, IC's allows these circuits to provide high speed operation, low power dissipation, and reduced manufacturing cost compared with more complicated board-level integration.


As used herein, the terms “wireless”, “wireless data transfer,” “wireless tracking and location system,” “positioning system” and “wireless positioning system” refer without limitation to any wireless system that transfers data or communicates or broadcasts a message, which communication may include location coordinates or other information using one or more devices, e.g., wireless communication devices.


As used herein, the terms “module” or “modules” refer without limitation to any software, software program(s), firmware, or actual hardware or combination thereof that has been added on, downloaded, updated, transferred or originally part of a larger computation or transceiver system that assists in or provides computational ability including, but not limited to, logic functionality to assist in or provide communication broadcasts of commands or messages, which communication may include location coordinates or communications between, among, or to one or more devices, e.g., wireless communication devices.



FIG. 1 is a flow diagram showing a method 10 of localization, in accordance with some embodiments.


In some embodiments in accordance with the present disclosure, a non-transitory, i.e., non-volatile, computer readable storage medium is provided. The non-transitory computer readable storage medium is stored with one or more programs. When the program is executed by the processing unit of a computing device, i.e., that are part of a vehicle, the computing device is caused to conduct specific operations set forth below in accordance with some embodiments of the present disclosure.


In some embodiments, as illustrated in FIG. 6, examples of non-transitory storage computer readable storage medium may include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories. In certain embodiments, the term “non-transitory”may indicate that the storage medium is not embodied in a carrier wave or a propagated signal. In some embodiments, a non-transitory storage medium may store data that can, over time, change (e.g., in RAM or cache).


In some embodiments in accordance with the present disclosure, in operation, a client application is transmitted to the computing device upon a request of a user, for example, by a user device 64 (see FIG. 6). For example, the user device 64 may be a smart phone downloading the application from a computer server. In operation, the application is installed at the vehicle. Accordingly, specific functions may be executed by the user through a computing device, such as calibrating sensors and time synchronization, and, for example, sending and receiving calibration files for data alignment purposes.


In particular, referring to FIG. 1, in operation 11, data alignment, which includes sensor calibration and time synchronization, is performed. A vehicle is equipped with multiple complementary sensors which require calibration in order to represent sensed information in a common coordinate system. In an embodiment, sensors employed in the method include a light detection and ranging (LiDAR) sensor, a camera and an inertial navigation module. The LiDAR sensor and the cameras are mounted on the roof of the vehicle. LiDAR sensors have become increasingly common in both industrial and robotic applications. LiDAR sensors are particularly desirable for their direct distance measurements and high accuracy. In an embodiment according to the present disclosure, the LiDAR sensor is equipped with many simultaneous rotating beams at varying angles, for example, a 64-beam rotating LiDAR. The multiple-beam LiDAR provides at least an order of magnitude more data than a single-beam LiDAR and enables new applications in mapping, object detection and recognition, scene understanding, and simultaneous localization and mapping (SLAM).


The inertial navigation module in an embodiment according to the present disclosure includes a global navigation satellite system (GNSS)—inertial measurement unit (IMU). The GNSS satellite signals are used to correct or calibrate a solution from the IMU. The benefits of using GNSS with an IMU are that the IMU may be calibrated by the GNSS signals and that the IMU can provide position and angle updates at a quicker rate than GNSS. For high dynamic vehicles, IMU fills in the gaps between GNSS positions. Additionally, GNSS may lose its signal and the IMU can continue to compute the position and angle during the period of lost GNSS signal. The two systems are complementary and are often employed together.


Transformation between the inertial navigation module and LiDAR coordinate is achieved by a method similar to that described in “Unsupervised Calibration for Multi-beam Lasers” by Levinson, Jesse and Sebastian Thrun, Experimental Robotics, Springer Berlin Heidelberg, 2014. In some embodiments according to the present disclosure, the intrinsic parameters of each beam are calibrated in advance using a supervised method. Also, LiDAR scans are collected in the form of sweep. A sweep is defined as a scan coverage of the LiDAR sensor rotating from 0 degree to 360 degrees. Moreover, motion distortion within the sweep is corrected assuming that the angular and linear velocity of the LiDAR motion is constant.


The transformation between the inertial navigation module and LiDAR coordinate is briefly discussed as follows. In the case of a multi-beam LiDAR, extrinsic calibration considers the mounting location of the entire unit relative to the vehicle's own coordinate frame, while intrinsic calibration considers the configuration of each individual beam inside the unit. In an embodiment according to the present disclosure, an unsupervised method is used for extrinsic calibration, and a supervised method is used for intrinsic calibration. Specifically, the intrinsic parameters of each beam are calibrated in advance using the supervised approach.


The approach for both calibrations leverages the simple observation that laser returns projected into three dimensions are not randomly distributed in space. Since the returned points are reflections off of physical surfaces, it is impossible for a properly calibrated sensor traveling a known trajectory to return a collection of accumulated points that is randomly distributed in three dimensions. As such, in some embodiments, the method 10 relies only on an assumption that points in space tend to lie on contiguous surfaces.


The location of the LiDAR sensor relative to the vehicle's coordinate frame can be expressed with an x (longitudinal), y (lateral), and z (height) offset along with roll, pitch, and yaw angles. The (0, 0, 0) reference point and reference orientation is specified by the coordinate system being used, i.e., the three dimension point and orientation that the vehicle's positioning system considers to be the origin.


It is assumed that the environment is generally static and contains some 3D features, i.e., it is not just smooth ground. In order to achieve an accurate calibration, LiDAR measurements are recorded as the vehicle transitions through a series of known poses. Global pose information is irrelevant, as there is no existing map, so only local pose information is required. Local pose data may be acquired in any number of ways, e.g. from a wheel encoder and IMU, from an integrated GPS/IMU system, or from a GPS system with real-time corrections.


Transformation between the camera and the LiDAR coordinate is calibrated using a method similar to that described in “Automatic Camera and Range Sensor Calibration Using a Single Shot” by Geiger, Andreas, et al., Robotics and Automation (ICRA), 2012 IEEE International Conference on. IEEE, 2012. In some embodiments, the intrinsic parameters of the camera are calibrated in advance using a method described in “A Flexible New Technique for Camera Calibration” by Z. Zhang, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(11):1330-1334, 2000. In an embodiment, the camera includes a monocular camera, which is calibrated by multiple shots instead of single shot. Moreover, registration is made by minimizing reprojection error and translation norm. In another embodiment, the camera includes a stereo camera.


The transformation between the camera and the LiDAR coordinate is briefly discussed as follows. The method 10 relies on an inexpensive and simple calibration setup: Multiple printed checkerboard patterns are attached to walls and floor. As input, the method 10 requires multiple range or camera images of a single calibration target presented at different orientations, as well as the number of checkerboard rows and columns as input. The only assumption is that all sensors return either intensity or depth images and share a common field of view.


In addition to the transformation between the inertial navigation module and LiDAR coordinate and the transformation between the camera and the LiDAR coordinate, time synchronization among the LiDAR sensor, camera and inertial navigation module is achieved. Specifically, time synchronization between the LiDAR sensor and the inertial navigation module, between the inertial navigation module and the camera, and between the LiDAR sensor and the camera is achieved. In an embodiment, data acquisition of the camera and the LiDAR sensor are synchronized by a trigger metric.


After data alignment is performed, in operation 12, these sensors are used to collect data in an environment. In an embodiment, images of the environment are captured by the camera in approximately 30 Hz. LiDAR scans are collected in the form of a sweep in approximately 20 Hz. Vehicle poses, including position and orientation, are collected in an “east north up” (ENU) coordinate by the inertial navigation module in approximately 50 Hz.


In operation 13, a three-dimensional (3D) submap and a global map are constructed. In an embodiment, the 3D submap is constructed, based on images from the camera, using visual SLAM. Reference of visual SLAM can be made to, for example, “ORB-SLAM: a versatile and accurate monocular SLAM system” by Raul Mur-Artal et al., IEEE Transactions on Robotics 31.5 (2015): 1147-1163, or to “LSD-SLAM: Large-scale direct monocular SLAM” by Jakob Engel et al., European Conference on Computer Vision, Springer International Publishing, 2014. Further, in an embodiment, the global map is constructed, based on data from the LiDAR, using LiDAR mapping. The global map includes a 3D city-scale map.


In operation 14, features from the 3D submap and the global map are extracted. In an embodiment, the features include structured features and unstructured features. The structured features may include, for example, planes, straight lines and curved lines, and the unstructured features may include sparse 3D points.


Next, in operation 15, the features extracted from the 3D submap are matched against the features extracted from the global map so that in operation 16 invalid feature correspondences are removed. In an embodiment, if a distance between a feature in the 3D submap and a corresponding feature in the global map is larger than a threshold, the feature in the 3D submap is determined to be an invalid feature correspondence.


Subsequently, in operation 17, location of the 3D submap is iteratively estimated until a distance between corresponding features is minimized.


As far as existing approaches are concerned, visual/LiDAR SLAM methods suffer a significant drift over long time. In addition, image retrieval methods may only achieve decimeter-level accuracy. Also, methods of localization based on 3D feature points are likely to fail in a textureless environment. In contrast, the method 10 according to the present disclosure achieves localization precision in the order of few centimeters substantially free from the above-mentioned drawbacks in some existing approaches. Details of the method 10 of localization with centimeter-level accuracy will be further discussed with reference to FIGS. 2 to 5.



FIG. 2 is a flow diagram showing a method 20 of localization in 3D submap reconstruction and coarse alignment, in accordance with some embodiments.


Given data collected in operation 12 of FIG. 1, referring to FIG. 2, in operation 21, a 3D submap is constructed based on images from a camera and vehicle poses from an inertial navigation module. In an embodiment, the 3D submap is constructed by means of visual SLAM.


In operation 22, a 3D global map is constructed based on data from the LiDAR and vehicle poses from the inertial navigation module. The global map includes a city-scale map.


Next, in operation 23, location of the 3D submap in the global map is calculated by using the inertial navigation module. Specifically, the 3D submap's location in the global map is calculated by means of the GNSS or GPS of the inertial navigation module. In an embodiment, the 3D submap's location includes center position (latitude, longitude and altitude) of the 3D submap. In addition, a coordinate of the 3D submap, for example, a GPS coordinate, is transformed to a coordinate of the global map. As a result, a coarse location of the 3D submap in the global map is obtained.


Subsequently, in operation 24, the 3D submap is aligned with the global map. The coarse alignment in operation 24 facilitates refinement of feature correspondence, as will be further discussed.



FIG. 3 is a flow diagram showing a method 30 of localization in extracting features from a 3D submap and a global map, in accordance with some embodiments.


After a 3D submap and a global map are constructed in operation 13 of FIG. 1, referring to FIG. 3, in operation 31, both of the 3D submap and the global map are voxelized into voxels. In an embodiment, each voxel has a predetermined size.


In operation 32, distribution of 3D points within the voxels is estimated. In an embodiment, the distribution is estimated by means of a probabilistic model.


Next, in operation 33, features are extracted from the 3D submap and the global map. The extracted features include structured features such as planes, straight lines and curved lines, and unstructured features such as sparse 3D points.


Subsequently, in operation 34, the extracted features from the 3D submap and the global map are classified into classes. Extraction and classification of features from a 3D submap and a global map facilitate feature matching, refinement of feature correspondence and refinement of submap in operations 15, 16 and 17 of FIG. 1, respectively.



FIG. 4 is a flow diagram showing a method 40 of localization in feature matching and feature correspondence refinement, in accordance with some embodiments.


After features from a 3D submap and a global map are extracted in operation 14 of FIG. 1, referring to FIG. 4, in operation 41, for features classified in a same class, a matching score between a feature in the 3D submap and a feature in the global map corresponding to the submap feature is computed based on the distribution of 3D points.


In operation 42, for each feature in the 3D submap, a corresponding feature in a same class with the highest matching score is selected from the global map.


Next, in operation 43, a feature correspondence is determined to be invalid if distance between corresponding features is larger than a threshold. In an embodiment, distance between corresponding features is determined by a trained classifier.


Subsequently, in operation 44, the invalid feature correspondence is filtered.



FIG. 5 is a flow diagram showing a method 50 of localization in refining position of a 3D submap, in accordance with some embodiments.


Referring to FIG. 5, in operation 51, position of a 3D submap is obtained. In an embodiment, the position of the 3D submap includes center position (latitude, longitude and altitude) of the 3D submap.


In operation 52, coordinate of the 3D submap is transformed to coordinate of the global map.


In operation 53, the 3D submap is aligned with the global map.


In operation 54, features are extracted from the 3D submap and the global map.


In operation 55, the extracted features are classified in classes.


In operation 56, for features classified in a same class, correspondence of corresponding features between the 3D submap and the global map is established.


In operation 57, based on the alignment in operation 53, invalid feature correspondences are removed.


In operation 58, based on the position of the 3D submap in operation 51, an iterative estimation of location of the 3D submap is performed until distance between corresponding features reaches a predetermined value.



FIG. 6 is a block diagram of a system 60 for localization, in accordance with some embodiments.


Referring to FIG. 6, the system 60 includes a processor 61, a computer server 62, a network interface 63, an input and output (I/O) device 65, a storage device 67, a memory 69, and a bus or network 68. The bus 68 couples the network interface 63, the I/O device 65, the storage device 67 and the memory 69 to the processor 61.


Accordingly, the processor 61 is configured to enable the computer server 62, e.g., Internet server, to perform specific operations disclosed herein. It is to be noted that the operations and techniques described herein may be implemented, at least in part, in hardware, software, firmware, or any combination thereof. For example, various aspects of the described embodiments, e.g., the processor 61, the computer server 62, or the like, may be implemented within one or more processing units, including one or more microprocessing units, digital signal processing units (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or any other equivalent integrated or discrete logic circuitry, as well as any combinations of such components.


The term “processing unit” or “processing circuitry” may generally refer to any of the foregoing logic circuitry, alone or in combination with other logic circuitry, or any other equivalent circuitry. A control unit including hardware may also perform one or more of the techniques of the present disclosure.


In some embodiments in accordance with the present disclosure, the computer server 62 is configured to utilize the I/O port 65 communicate with external devices via a network 68, such as a wireless network. In certain embodiments, the I/O port 65 is a network interface component, such as an Ethernet card, an optical transceiver, a radio frequency transceiver, or any other type of device that can send and receive data from the Internet. Examples of network interfaces may include Bluetooth®, 3G and WiFi® radios in mobile computing devices as well as USB. Examples of wireless networks may include WiFi®, Bluetooth®, and 3G. In some embodiments, the internet server 62 is configured to utilize the I/O port 65 to wirelessly communicate with a client device 64, such as a mobile phone, a tablet PC, a portable laptop or any other computing device with internet connectivity. Accordingly, electrical signals are transmitted between the computer server 62 and the client device 64.


In some embodiments in accordance with the present disclosure, the computer server 62 is a virtual server capable of performing any function a regular server has. In certain embodiments, the computer server 62 is another client device of the system 60. In other words, there may not be a centralized host for the system 60, and the client devices 64 in the system are configured to communicate with each other directly. In certain embodiments, such client devices 64 communicate with each other on a peer-to-peer (P2P) basis.


The processor 61 is configured to execute program instructions that include a tool module configured to perform a method as described and illustrated with reference to FIGS. 1 to 5. Accordingly, in an embodiment in accordance with the method 10 illustrated in FIG. 1, the tool module is configured to execute the operations including: performing data alignment, analyzing data collected in an environment using sensors including a camera, a LiDAR and an inertial navigation module, constructing at least one 3D submap and a global map, extracting features from the 3D submap and the global map, matching features extracted from the 3D submap against those from the global map, refining feature correspondence and refining the 3D submap.


In an embodiment in accordance with the method 20 illustrated in FIG. 2, the tool module is configured to execute the operations including: constructing at least one 3D submap based on images from a camera and vehicle poses from an inertial navigation module, constructing a 3D global map based on data from the LiDAR and vehicle poses from the inertial navigation module, computing location of the 3D submap in the global map, using the inertial navigation module, and aligning the 3D submap with the global map.


In an embodiment in accordance with the method 30 illustrated in FIG. 3, the tool module is configured to execute the operations including: voxelizing a 3D submap and a global map into voxels, each voxel having a predetermined size, estimating distribution of 3D points within the voxels, using a probabilistic model, extracting structured features and unstructured features from the 3D submap and the 3D global map and classifying the extracted features into classes.


In an embodiment in accordance with the method 40 illustrated in FIG. 4, the tool module is configured to execute the operations including: computing, for each feature in a same class, matching scores between corresponding features between a 3D submap and a global map, selecting, for each feature in the 3D submap, a corresponding feature with the highest matching score from global map, determining feature correspondences to be invalid if a distance between corresponding features is larger than a threshold, which distance is determined by a trained classifier, and removing the invalid feature correspondences.


In an embodiment in accordance with the method 50 illustrated in FIG. 5, the tool module is configured to execute the operations including: obtaining center position of a 3D submap, transforming coordinate of the 3D submap into coordinate of the global map, aligning the 3D submap with the global map, extracting features from the 3D submap and the global map, classifying the extracted features in classes, establishing correspondence of features in a same class between the 3D submap and the global map, removing, based on the alignment, invalid feature correspondences, and performing an iterative estimation, based on the center position of the 3D submap, of a location of the 3D submap.


The network interface 63 is configured to access program instructions and data accessed by the program instructions stored remotely through a network (not shown).


The I/O device 65 includes an input device and an output device configured for enabling user interaction with the system 60. In some embodiments, the input device comprises, for example, a keyboard, a mouse, and other devices. Moreover, the output device comprises, for example, a display, a printer, and other devices.


The storage device 67 is configured for storing program instructions and data accessed by the program instructions. In some embodiments, the storage device 67 comprises, for example, a magnetic disk and an optical disk.


The memory 69 is configured to store program instructions to be executed by the processor 61 and data accessed by the program instructions. In some embodiments, the memory 69 comprises a random access memory (RAM) and/or some other volatile storage device and/or read only memory (ROM) and/or some other non-volatile storage device including other programmable read only memory (PROM), erasable programmable read only memory (EPROM), electronically erasable programmable read only memory (EEPROM), flash memory, a hard disk, a solid state drive (SSD), a compact disc ROM (CD-ROM), a floppy disk, a cassette, magnetic media, optical media, or other computer readable media. In certain embodiments, the memory 69 is incorporated into the processor 61.



FIG. 7 is a block diagram of a processor 61 in the system 60 illustrated in FIG. 6 for localization, in accordance with some embodiments.


Referring to FIG. 7, the processor 61 includes a computing module 71, a selecting module 73, a determining module 75 and a filtering module 77. The computing module 71 is configured to, in response to features 703 extracted from a 3D submap and features 704 extracted from a global map, compute matching score between corresponding features of a same class between the 3D submap and the global map. The selecting module 73 is configured to select, for each feature in the 3D submap, a corresponding feature with the highest matching score from the global map. The determining module 75 is configured to determining a feature correspondence to be invalid if a distance between corresponding features is larger than a threshold. The filtering module 77 is configured to remove the invalid feature correspondence.


Thus, specific embodiments and applications have been disclosed. It should be apparent, however, to those skilled in the art that many more modifications besides those already described are possible without departing from the disclosed concepts herein. The embodiment, therefore, is not to be restricted except in the spirit of the appended claims. Moreover, in interpreting both the specification and the claims, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms “comprises” and “comprising” should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, or utilized, or combined with other elements, components, or steps that are not expressly referenced. Insubstantial changes from the claimed subject matter as viewed by a person with ordinary skill in the art, now known or later devised, are expressly contemplated as being equivalent within the scope of the claims. Therefore, obvious substitutions now or later known to one with ordinary skill in the art are defined to be within the scope of the defined elements. The claims are thus to be understood to include what is specifically illustrated and described above, what is conceptually equivalent, what can be obviously substituted and also what essentially incorporates the essential idea of the embodiment,

Claims
  • 1. A system for localization, the system comprising: a memory;one or more processing units; andone or more programs stored in the memory, the one or more programs configured to cause the one or more processing units to perform at least: extracting first features from a 3D submap, wherein the 3D submap is generated using images from a camera;extracting second features from a global map, wherein the global map is generated from a data from a LiDAR; andgenerating matching scores by comparing the first features to the second features, wherein each matching score represents a correspondence between one of the first features and one of the second features, and wherein each matching score comprises a distance between the one of the first features and the one of the second features.
  • 2. The system according to claim 1, further comprising: constructing the 3D submap; andconstructing the global map.
  • 3. The system according to claim 2, wherein the constructing the 3D submap comprises: obtaining the images from the camera; andconstructing the 3D submap based on the images using visual simultaneous localization and mapping (SLAM).
  • 4. The system according to claim 2, wherein the constructing the global map comprises: obtaining the data from the LiDAR; andconstructing a city-scale 3D map based on the data from the LiDAR using LiDAR mapping.
  • 5. The system according to claim 1, wherein the extracting the first features from the 3D submap and the extracting the second features from the global map comprises: extracting structured features and unstructured features from the 3D submap and the global map.
  • 6. The system according to claim 5, wherein the structured features comprise at least one of planes, straight lines, and curved lines, and the unstructured features comprise sparse 3D points.
  • 7. The system according to claim 1, wherein the extracting the first features from the 3D submap and the extracting the second features from global map comprises: voxelizing the 3D submap and the global map into voxels; andestimating a distribution of 3D points within the voxels using a probabilistic model.
  • 8. The system according to claim 1, wherein the extracting the first features from the 3D submap and the extracting the second features from the global map comprises: classifying the extracted features into classes.
  • 9. The system according to claim 1, further comprising: removing one or more correspondences between the first features and the second features for one or more matching scores that are larger than a threshold value.
  • 10. The system according to claim 1, wherein the global map is further generated from a vehicle pose information from an inertial navigation module, wherein the vehicle pose information includes vehicle position and orientation information.
  • 11. The system according to claim 1, further comprising: determining, based on information from an inertial navigation module, a location for the 3D submap.
  • 12. The system according to claim 1, further comprising: aligning the 3D submap with the global map.
  • 13. A non-transitory computer-readable medium storing a program causing a computer to execute a process, the process comprising: extracting first features from a 3D submap, wherein the 3D submap is generated using images from a camera;extracting second features from a global map, wherein the global map is generated from the data from a LiDAR; andgenerating matching scores from comparing the first features to the second features, wherein each matching score represents a correspondence between one of the first features and one of the second features, and wherein each matching score comprises a distance between the one of the first features and the one of the second features.
  • 14. The non-transitory computer-readable medium of claim 13, wherein the distance between corresponding features is determined by a trained classifier.
  • 15. The non-transitory computer-readable medium of claim 13 further comprising: refining a location of the 3D submap, wherein the refining the location of the 3D submap comprises performing an iterative estimation of the location of the 3D submap until a first distance between corresponding features reaches a predetermined value or less.
  • 16. A non-transitory computer-readable medium storing a program causing a computer to execute a process, the process comprising: computing, in response to features from a 3D submap and features from a global map, matching scores between corresponding features of a same class within the 3D submap and the global map;determining a correspondence is invalid because a distance between the corresponding features is larger than a threshold;removing the invalid correspondence; andrefining a location of the 3D submap, wherein the refining the location of the 3D submap comprises performing an iterative estimation of the location of the 3D submap until a first distance between corresponding features reaches a predetermined value.
  • 17. The non-transitory computer-readable medium of claim 16, comprising: constructing the 3D submap based on images from a camera using visual simultaneous localization and mapping (SLAM); andconstructing the global map using LiDAR mapping.
  • 18. The non-transitory computer-readable medium of claim 17, further comprising: extracting structured features and unstructured features from the 3D submap and the global map.
  • 19. The non-transitory computer-readable medium of claim 18, wherein the extracting the features from the 3D submap and the global map comprises: voxelizing the 3D submap and the global map into voxels; andestimating a distribution of 3D points within the voxels using a probabilistic model.
  • 20. The non-transitory computer-readable medium of claim 18, wherein the extracting the features from the 3D submap and the global map comprises: classifying the extracted features into classes.
US Referenced Citations (222)
Number Name Date Kind
6084870 Wooten et al. Jul 2000 A
6263088 Crabtree et al. Jul 2001 B1
6594821 Banning et al. Jul 2003 B1
6777904 Degner et al. Aug 2004 B1
6975923 Spriggs Dec 2005 B2
7103460 Breed Sep 2006 B1
7689559 Canright et al. Mar 2010 B2
7742841 Sakai et al. Jun 2010 B2
7783403 Breed Aug 2010 B2
7844595 Canright et al. Nov 2010 B2
8041111 Wilensky Oct 2011 B1
8064643 Stein et al. Nov 2011 B2
8082101 Stein et al. Dec 2011 B2
8164628 Stein et al. Apr 2012 B2
8175376 Marchesotti et al. May 2012 B2
8271871 Marchesotti Sep 2012 B2
8346480 Trepagnier et al. Jan 2013 B2
8378851 Stein et al. Feb 2013 B2
8392117 Dolgov et al. Mar 2013 B2
8401292 Park et al. Mar 2013 B2
8412449 Trepagnier et al. Apr 2013 B2
8478072 Aisaka et al. Jul 2013 B2
8553088 Stein et al. Oct 2013 B2
8706394 Trepagnier et al. Apr 2014 B2
8718861 Montemerlo et al. May 2014 B1
8788134 Litkouhi et al. Jul 2014 B1
8908041 Stein et al. Dec 2014 B2
8917169 Schofield et al. Dec 2014 B2
8963913 Baek Feb 2015 B2
8965621 Urmson et al. Feb 2015 B1
8981966 Stein et al. Mar 2015 B2
8983708 Choe et al. Mar 2015 B2
8993951 Schofield et al. Mar 2015 B2
9002632 Emigh Apr 2015 B1
9008369 Schofield et al. Apr 2015 B2
9025880 Perazzi et al. May 2015 B2
9042648 Wang et al. May 2015 B2
9081385 Ferguson et al. Jul 2015 B1
9088744 Grauer et al. Jul 2015 B2
9111444 Kaganovich Aug 2015 B2
9117133 Barnes et al. Aug 2015 B2
9118816 Stein et al. Aug 2015 B2
9120485 Dolgov Sep 2015 B1
9122954 Srebnik et al. Sep 2015 B2
9134402 Sebastian et al. Sep 2015 B2
9145116 Clarke et al. Sep 2015 B2
9147255 Zhang et al. Sep 2015 B1
9156473 Clarke et al. Oct 2015 B2
9176006 Stein Nov 2015 B2
9179072 Stein et al. Nov 2015 B2
9183447 Gdalyahu et al. Nov 2015 B1
9185360 Stein et al. Nov 2015 B2
9191634 Schofield et al. Nov 2015 B2
9214084 Grauer et al. Dec 2015 B2
9219873 Grauer et al. Dec 2015 B2
9233659 Rosenbaum et al. Jan 2016 B2
9233688 Clarke et al. Jan 2016 B2
9248832 Huberman Feb 2016 B2
9248835 Tanzmeister Feb 2016 B2
9251708 Rosenbaum et al. Feb 2016 B2
9277132 Berberian Mar 2016 B2
9280711 Stein Mar 2016 B2
9282144 Tebay et al. Mar 2016 B2
9286522 Stein et al. Mar 2016 B2
9297641 Stein Mar 2016 B2
9299004 Lin et al. Mar 2016 B2
9315192 Zhu et al. Apr 2016 B1
9317033 Ibanez-guzman et al. Apr 2016 B2
9317776 Honda et al. Apr 2016 B1
9330334 Lin et al. May 2016 B2
9342074 Dolgov et al. May 2016 B2
9347779 Lynch May 2016 B1
9355635 Gao et al. May 2016 B2
9365214 Shalom et al. Jun 2016 B2
9399397 Mizutani et al. Jul 2016 B2
9418549 Kang et al. Aug 2016 B2
9428192 Schofield et al. Aug 2016 B2
9436880 Bos et al. Sep 2016 B2
9438878 Niebla, Jr. et al. Sep 2016 B2
9443163 Springer Sep 2016 B2
9446765 Shalom et al. Sep 2016 B2
9459515 Stein Oct 2016 B2
9466006 Duan Oct 2016 B2
9476970 Fairfield et al. Oct 2016 B1
9483839 Kwon et al. Nov 2016 B1
9490064 Hirosawa et al. Nov 2016 B2
9494935 Okumura et al. Nov 2016 B2
9507346 Levinson et al. Nov 2016 B1
9513634 Pack et al. Dec 2016 B2
9531966 Stein et al. Dec 2016 B2
9535423 Debreczeni Jan 2017 B1
9538113 Grauer et al. Jan 2017 B2
9547985 Tuukkanen Jan 2017 B2
9549158 Grauer et al. Jan 2017 B2
9555803 Pawlicki et al. Jan 2017 B2
9568915 Berntorp et al. Feb 2017 B1
9587952 Slusar Mar 2017 B1
9599712 Van Der Tempel et al. Mar 2017 B2
9600889 Boisson et al. Mar 2017 B2
9602807 Crane et al. Mar 2017 B2
9612123 Levinson et al. Apr 2017 B1
9620010 Grauer et al. Apr 2017 B2
9625569 Lange Apr 2017 B2
9628565 Stenneth et al. Apr 2017 B2
9649999 Amireddy et al. May 2017 B1
9652860 Maali et al. May 2017 B1
9669827 Ferguson et al. Jun 2017 B1
9672446 Vallespi-gonzalez Jun 2017 B1
9690290 Prokhorov Jun 2017 B2
9701023 Zhang et al. Jul 2017 B2
9712754 Grauer et al. Jul 2017 B2
9720418 Stenneth Aug 2017 B2
9723097 Harris et al. Aug 2017 B2
9723099 Chen et al. Aug 2017 B2
9723233 Grauer et al. Aug 2017 B2
9726754 Massanell et al. Aug 2017 B2
9729860 Cohen et al. Aug 2017 B2
9738280 Rayes Aug 2017 B2
9739609 Lewis Aug 2017 B1
9746550 Nath et al. Aug 2017 B2
9753128 Schweizer et al. Sep 2017 B2
9753141 Grauer et al. Sep 2017 B2
9754490 Kentley et al. Sep 2017 B2
9760837 Nowozin et al. Sep 2017 B1
9766625 Boroditsky et al. Sep 2017 B2
9769456 You et al. Sep 2017 B2
9773155 Shotton et al. Sep 2017 B2
9779276 Todeschini et al. Oct 2017 B2
9785149 Wang et al. Oct 2017 B2
9805294 Liu et al. Oct 2017 B2
9810785 Grauer et al. Nov 2017 B2
9823339 Cohen Nov 2017 B2
9953236 Huang et al. Apr 2018 B1
10147193 Huang et al. Dec 2018 B2
10223806 Luo et al. Mar 2019 B1
10223807 Luo et al. Mar 2019 B1
10410055 Wang et al. Sep 2019 B2
10565457 Luo Feb 2020 B2
20030114980 Klausner et al. Jun 2003 A1
20030174773 Comaniciu et al. Sep 2003 A1
20040264763 Mas et al. Dec 2004 A1
20070183661 Ei-Maleh et al. Aug 2007 A1
20070183662 Wang et al. Aug 2007 A1
20070230792 Shashua et al. Oct 2007 A1
20070286526 Abousleman et al. Dec 2007 A1
20080249667 Horvitz et al. Oct 2008 A1
20090040054 Wang et al. Feb 2009 A1
20090087029 Coleman et al. Apr 2009 A1
20100049397 Liu et al. Feb 2010 A1
20100111417 Ward et al. May 2010 A1
20100226564 Marchesotti et al. Sep 2010 A1
20100281361 Marchesotti Nov 2010 A1
20110142283 Huang et al. Jun 2011 A1
20110206282 Aisaka et al. Aug 2011 A1
20110247031 Jacoby Oct 2011 A1
20120041636 Johnson et al. Feb 2012 A1
20120105639 Stein et al. May 2012 A1
20120140076 Rosenbaum et al. Jun 2012 A1
20120274629 Baek Nov 2012 A1
20120314070 Zhang et al. Dec 2012 A1
20130051613 Bobbitt et al. Feb 2013 A1
20130083959 Owechko et al. Apr 2013 A1
20130155058 Golparvar-fard et al. Jun 2013 A1
20130182134 Grundmann et al. Jul 2013 A1
20130204465 Phillips et al. Aug 2013 A1
20130266187 Bulan et al. Oct 2013 A1
20130329052 Chew Dec 2013 A1
20140072170 Zhang et al. Mar 2014 A1
20140104051 Breed Apr 2014 A1
20140142799 Ferguson et al. May 2014 A1
20140143839 Ricci May 2014 A1
20140145516 Hirosawa et al. May 2014 A1
20140177928 Bangay Jun 2014 A1
20140198184 Stein et al. Jul 2014 A1
20140321704 Partis Oct 2014 A1
20140334668 Saund Nov 2014 A1
20150062304 Stein et al. Mar 2015 A1
20150269438 Samarasekera et al. Sep 2015 A1
20150310370 Burry et al. Oct 2015 A1
20150331111 Newman et al. Nov 2015 A1
20150353082 Lee et al. Dec 2015 A1
20160008988 Kennedy et al. Jan 2016 A1
20160026787 Nairn et al. Jan 2016 A1
20160037064 Stein et al. Feb 2016 A1
20160054409 Wager et al. Feb 2016 A1
20160094774 Li et al. Mar 2016 A1
20160118080 Chen Apr 2016 A1
20160129907 Kim et al. May 2016 A1
20160165157 Stein et al. Jun 2016 A1
20160209846 Eustice et al. Jul 2016 A1
20160210528 Duan Jul 2016 A1
20160275766 Venetianer et al. Sep 2016 A1
20160321381 English et al. Nov 2016 A1
20160334230 Ross et al. Nov 2016 A1
20160342837 Hong et al. Nov 2016 A1
20160347322 Clarke et al. Dec 2016 A1
20160375907 Erban Dec 2016 A1
20170053169 Cuban et al. Feb 2017 A1
20170061632 Lindner et al. Mar 2017 A1
20170124476 Levinson et al. May 2017 A1
20170134631 Zhao et al. May 2017 A1
20170177951 Yang et al. Jun 2017 A1
20170301104 Qian et al. Oct 2017 A1
20170305423 Green Oct 2017 A1
20170318407 Meister et al. Nov 2017 A1
20180151063 Pun et al. May 2018 A1
20180158197 Dasgupta et al. Jun 2018 A1
20180260956 Huang et al. Sep 2018 A1
20180283892 Behrendt et al. Oct 2018 A1
20180373980 Huval Dec 2018 A1
20190025853 Julian et al. Jan 2019 A1
20190065863 Luo et al. Feb 2019 A1
20190066329 Luo et al. Feb 2019 A1
20190066330 Luo et al. Feb 2019 A1
20190108384 Wang et al. Apr 2019 A1
20190132391 Thomas et al. May 2019 A1
20190132392 Liu et al. May 2019 A1
20190210564 Han et al. Jul 2019 A1
20190210613 Sun et al. Jul 2019 A1
20190236950 Li et al. Aug 2019 A1
20190266420 Ge et al. Aug 2019 A1
20200184232 Luo et al. Jun 2020 A1
Foreign Referenced Citations (37)
Number Date Country
106340197 Jan 2017 CN
106781591 May 2017 CN
108010360 May 2018 CN
2608513 Sep 1977 DE
0890470 Jan 1999 EP
1754179 Feb 2007 EP
2448251 May 2012 EP
2463843 Jun 2012 EP
2761249 Aug 2014 EP
2946336 Nov 2015 EP
2993654 Mar 2016 EP
3081419 Oct 2016 EP
100802511 Feb 2008 KR
1991009375 Jun 1991 WO
2005098739 Oct 2005 WO
2005098751 Oct 2005 WO
2005098782 Oct 2005 WO
2010109419 Sep 2010 WO
2013045612 Apr 2013 WO
2014111814 Jul 2014 WO
2014166245 Oct 2014 WO
2014201324 Dec 2014 WO
2015083009 Jun 2015 WO
2015103159 Jul 2015 WO
2015125022 Aug 2015 WO
2015186002 Dec 2015 WO
2016090282 Jun 2016 WO
2016135736 Sep 2016 WO
2017013875 Jan 2017 WO
2017079349 May 2017 WO
2017079460 May 2017 WO
2019040783 Feb 2019 WO
2019040800 Feb 2019 WO
2019084491 May 2019 WO
2019084494 May 2019 WO
2019140277 Jul 2019 WO
2019168986 Sep 2019 WO
Non-Patent Literature Citations (62)
Entry
Carle et al., [“Global Rover Localization by Matching Lidar and Orbital 3D Maps”], 2010.
Caselitz et al., Monocular Camera Localization in 3D LiDAR Maps, Germany.
Mur-Artal et al., ORB-SLAM: A Versatile and Accurate Monocular SLAM System, IEEE Transactions on Robotics, Oct. 2015, pp. 1147-1163, vol. 31, No. 5, Spain.
Sattler et al., Are Large-Scale 3D Models Really Necessary for Accurate Visual Localization?, CVPR, IEEE, 2017, pp. 1-10.
Engel et al., LSD-SLAM: Large-Scale Direct Monocular SLAM, pp. 1-16, Munich.
International Application No. PCT/US18/53795, International Search Report and Written Opinion dated Dec. 31, 2018.
International Application No. PCT/US18/57848, International Search Report and Written Opinion dated Jan. 7, 2019.
International Application No. PCT/US19/12934, International Search Report and Written Opinion dated Apr. 29, 2019.
International Application No. PCT/US19/25995, International Search Report and Written Opinion dated Jul. 9, 2019.
International Application No. PCT/US2018/047608, International Search Report and Written Opinion dated Dec. 28, 2018.
International Application No. PCT/US2018/047830, International Search Report and Written Opinion dated Dec. 28, 2018.
International Application No. PCT/US2018/057851, International Search Report and Written Opinion dated Feb. 1, 2019.
International Application No. PCT/US2019/013322, International Search Report and Written Opinion dated Apr. 2, 2019.
International Application No. PCT/US2019/019839, International Search Report and Written Opinion dated May 23, 2019.
International Search Report and Written Opinion for International Patent Application No. PCT/US2018/047808, dated Jan. 2, 2019.
Luo, Yi et al. U.S. Appl. No. 15/684,389 Notice of Allowance, dated Oct. 9, 2019.
Office Action for Chinese Application No. 201810025516.X, dated Sep. 3, 2019.
Ahn, Kyoungho , et al., “The Effects of Route Choice Decisions on Vehicle Energy Consumption and Emissions”, Virginia Tech Transportation Institute, date unknown.
Athanasiadis, Thanos , et al., “Semantic Image Segmentation and Object Labeling”, IEEE Transactions on Circuits and Systems for Video Technology, 17(3).
Barth, Matthew , et al., “Recent Validation Efforts for a Comprehensive Modal Emissions Model”, Transportation Research Record 1750, Paper No. 1-0326, College of Engineering, Center for Environmental Research and Technology, University of California, Riverside, CA 92521da1e unknown.
Cordts, Marius , et al., “The Cityscapes Dataset for Semantic Urban Scene Understanding”, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas.
Dai, Jifeng , et al., “Instance-aware Semantic Segmentation via Multi-task Network Cascades”, Microsoft Research, CVPR, 10 pp.
Gao, Yanbbin , et al., “INS/GPS/LiDAR Integrated Navigation System for Urban and Indoor Environments Using Hybrid Scan Matching Algorithm”, Sensors 2015, ISSN 1424-8220<URL: https://www.mdpi.com/1424-8220/15/9/23286>.
Geiger, Andreas , et al., “Automatic Camera and Range Sensor Calibration using a single Shot”, Robotics and Automation (ICRA), IEEE International Conference, 1-8.
Guarneri, P. , et al., “A Neural-Network-Based Model for the Dynamic Simulation of the Tire/Suspension System While Traversing Road Irregularities”, IEEE Transactions on Neural Networks, 19(9), 1549-1563.
Hillel, Aharon B., et al., “Recent Progress in Road and Late Detection—A Survey”.
Hoang, Thang , et al., “Localisation using LiDAR and Camera”, Department of Electrical Engineering Chalmers University of Technology, Gothenburg, Sweden<URL: http://publications.lib.chalmers.se/records/fulltext/250431/250431.pdf>.
Hou, Xiaodi , et al., “Image Signature: Highlighting Sparse Salient Regions”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(1), 194-201.
Hou, Xiaodi , et al., “A Mela-Theory of Boundary Detection Benchmarks”, arXiv preprint arXiv:1302.5985, 2013.
Hou, Xiaodi , et al., “A Time-Dependent Model of Information Capacity of Visual Attention”, International Conference on Neural Information Processing, Springer Berlin Heidelberg, 127-136.
Hou, Xiaodi , et al., “Boundary Detection Benchmarking: Beyond F-Measures”, Computer Vision and Pattern Recognition, CVPR'13, IEEE, 1-8.
Hou, Xiaodi , et al., “Color Conceptualization”, Proceedings of the 15th ACM International Conference on Multimedia, ACM, 265-268.
Hou, Xiaodi , “Computational Modeling and Psychophysics in Low and Mid-Level Vision”, California Institute of Technology.
Hou, Xiaodi , et al., “Dynamic Visual Attention: Searching for Coding Length Increments”, Advances in Neural Information Processing Systems, 21, 681-688.
Hou, Xiaodi , et al., “Saliency Detection: A Spectral Residual Approach”, Computer Vision and Pattern Recognition, CVPR'07—IEEE Conference, 1-8.
Hou, Xiaodi , et al., “Thumbnail Generation Based on Global Saliency”, Advances in Cognitive Neurodynamics, ICCN 2007, Springer Netherlands, 999-1003.
Huval, Brody , et al., “An Empirical Evaluation of Deep Learning on Highway Driving”, arXiv:1504.01716v3 [cs.RO], 7 pp.
Jain, Suyong Dutt , et al., “Active Image Segmentation Propagation”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas.
Kendall, Alex , et al., “What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision”, arXiv:1703.04977v1 [cs.CV].
Levinson, Jesse , et al., “Unsupervised Calibration for Multi-beam lasers”, 12th Ed., Oussama Khatib, Vijay Kumar, Gaurav Sukhatme (Eds.) Springer-Verlag Berlin Heidelberg, 179-194.
Li, Tian , “Proposal Free Instance Segmentation Based on Instance-aware Metric”, Department of Computer Science, Cranberry-Lemon University, Pittsburgh, PA, date unknown.
Li, Yanghao , et al., “Demystifying Neural Style Transfer”, arXiv preprint arXiv:1701.01036.
Li, Yanghao , et al., “Factorized Bilinear Models for Image Recognition”, arXiv preprint arXiv:1611.05709.
Li, Yanghao , et al., “Revisiting Batch Normalization for Practical Domain Adaptation”, arXiv preprint arXiv:1603.04779.
Li, Yin , et al., “The Secrets of Salient Object Segmentation”, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 280-287.
Macaodha, Oisin , et al., “Hierarchical Subquery Evaluation for Active Learning on a Graph”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
Norouzi, Mohammad , et al., “Hamming Distance Metric Learning”, Departments of Computer Science and Statistics, University of Toronto, date unknown.
Paszke, Adam , et al., “Enet: A deep neural network architecture for real-time semantic segmentation”, CoRR, abs/1606.02147.
Ramos, Sebastian , et al., “Detecting Unexpected Obstacles for Self-Driving Cars: Fusing Deep Learning and Geometric Modeling”, arXiv:1612.06573v1 [cs.CV], 8 pp.
Richter, Stephen , et al., “Playing for Data: Ground Truth from Computer Games”, Intel Labs, European Conference on Computer Vision (ECCV), Amsterdam, the Netherlands.
Schindler, Andreas , et al., “Generation of high precision digital maps using circular arc splines”, 2012 IEEE Intelligent Vehicles Symposium, Alcala de Henares10. I 109/IVS.2012.6232124, 246-251.
Schroff, Florian , et al., “FaceNet: A Unified Embedding for Face Recognition and Clustering”, Google, CVPR, 10 pp.
Somani, Adhiraj , et al., “DESPOT: Online POMDP Planning with Regularization”, Department of Computer Science, National University of Singapore, date unknown.
Spinello, Luciano , et al., “Multiclass Multimodal Detection and Tracking in Urban Environments”, Sage Journals, 29(12)Article first published online: Oct. 7, 2010; Issue published: Oct. 1, 2010, 1498-1515.
Szeliski, Richard , “Computer Vision: Algorithms and Applications”, http://szeliski.org/Book/.
Wang, Panqu , et al., “Understanding Convolution for Semantic Segmentation”, arXiv preprint arXiv:1702.08502.
Wei, Junqing , et al., “A Prediction- and Cost Function-Based Algorithm for Robust Autonomous Freeway Driving”, 2010 IEEE Intelligent Vehicles Symposium, University of California, San Diego, CA, USA.
Welinder, Peter , et al., “The Multidimensional Wisdom of Crowds”, http://www.vision.caltech.edu/visipedia/papers/WelinderEtalNIPS10.pdf.
Yang, C. , “Neural Network-Based Motion Control of an Underactuated Wheeled Inverted Pendulum Model”, IEEE Transactions on Neural Networks and Learning Systems, 25(11), 2004-2016.
Yu, Kai , et al., “Large-scale Distributed Video Parsing and Evaluation Platform”, Center for Research on Intelligent Perception and Computing, Institute of Automation, Chinese Academy of Sciences, China, arXiv:1611.09580v1 [cs.CV].
Zhang, Z , et al., “A Flexible new technique for camera calibration”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, Issue: 11.
Zhou, Bolei , et al., “A Phase Discrepancy Analysis of Object Motion”, Asian Conference on Computer Vision, Springer Berlin Heidelberg, 225-238.
Related Publications (1)
Number Date Country
20200184232 A1 Jun 2020 US
Continuations (1)
Number Date Country
Parent 15684389 Aug 2017 US
Child 16792129 US