Method, system and apparatus for support structure depth determination

Information

  • Patent Grant
  • 11506483
  • Patent Number
    11,506,483
  • Date Filed
    Friday, October 5, 2018
    6 years ago
  • Date Issued
    Tuesday, November 22, 2022
    2 years ago
  • CPC
  • Field of Search
    • CPC
    • G06T7/62
    • G06T7/0008
    • G06T2207/20076
    • G06T2207/10028
    • G01B11/22
    • G01B11/24
  • International Classifications
    • G01B11/22
    • Term Extension
      986
Abstract
A method of determining a support structure depth of a support structure having a front and a back separated by the support structure depth includes: obtaining a point cloud of the support structure, and a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure; selecting, from the point cloud, an initial set of points located within a field of view originating at the capture pose; selecting, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates; retrieving, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; and based on the depth measurements in the unoccluded subset and the retrieved confidence levels, determining the support structure depth.
Description
BACKGROUND

Environments in which inventories of objects are managed, such as products for purchase in a retail environment, may be complex and fluid. For example, a given environment may contain a wide variety of objects with different attributes (size, shape, price and the like). Further, the placement and quantity of the objects in the environment may change frequently. Still further, imaging conditions such as lighting may be variable both over time and at different locations in the environment. These factors may reduce the accuracy with which information concerning the objects may be collected within the environment.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The accompanying figures, where like reference numerals refer to identical or functionally similar elements throughout the separate views, together with the detailed description below, are incorporated in and form part of the specification, and serve to further illustrate embodiments of concepts that include the claimed invention, and explain various principles and advantages of those embodiments.



FIG. 1 is a schematic of a mobile automation system.



FIG. 2A depicts a mobile automation apparatus in the system of FIG. 1.



FIG. 2B is a block diagram of certain internal hardware components of the mobile automation apparatus in the system of FIG. 1.



FIG. 3 is a flowchart of a method for determining a support structure depth.



FIG. 4A is a diagram of a point cloud and shelf plane obtained at block 305 of the method of FIG. 3.



FIG. 4B is a diagram of example images captured by the apparatus of the system of FIG. 1, and obtained at block 310 of the method of FIG. 3.



FIG. 5A is a diagram illustrating one of the images of FIG. 4B in greater detail.



FIG. 5B is a diagram illustrating an example back of shelf mask corresponding to the image of FIG. 5A.



FIG. 6A is a flowchart of a method for performing block 315 of the method of FIG. 3.



FIG. 6B is a diagram illustrating the performance of the method of FIG. 6A in connection with the point cloud of FIG. 4A.



FIG. 7A is a flowchart of a method of performing block 320 of the method of FIG. 3.



FIG. 7B is a diagram illustrating the performance of the method of FIG. 7A in connection with the image of FIG. 5A.



FIGS. 8A and 8B are diagrams illustrating an example performance of block 325 of the method of FIG. 3.



FIG. 8C is a diagram illustrating a further example performance of block 325 of the method of FIG. 3.



FIG. 9 is a diagram illustrating a support structure depth determined via performance of the method of FIG. 3.





Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of embodiments of the present invention.


The apparatus and method components have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present invention so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.


DETAILED DESCRIPTION

Examples disclosed herein are directed to a method of determining a support structure depth of a support structure having a front and a back separated by the support structure depth, the method comprising: obtaining (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure; selecting, from the point cloud, an initial set of points located within a field of view originating at the capture pose; selecting, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates; retrieving, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; and based on the depth measurements in the unoccluded subset and the retrieved confidence levels, determining the support structure depth.


Additional examples disclosed herein are directed to a computing device for determining a support structure depth of a support structure having a front and a back separated by the support structure depth, the computing device comprising: a memory storing (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure; an imaging controller connected to the memory and configured to: select, from the point cloud, an initial set of points located within a field of view originating at the capture pose; select, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates; retrieve, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; and based on the depth measurements in the unoccluded subset and the retrieved confidence levels, determine the support structure depth.


Further examples disclosed herein are directed to a computer-readable medium storing computer-readable instructions executable by a processor of a server, wherein execution of the computer-readable instructions causes the server to: obtain (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure; select, from the point cloud, an initial set of points located within a field of view originating at the capture pose; select, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates; retrieve, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; and based on the depth measurements in the unoccluded subset and the retrieved confidence levels, determine the support structure depth.



FIG. 1 depicts a mobile automation system 100 in accordance with the teachings of this disclosure. The system 100 is illustrated as being deployed in a retail environment, but in other embodiments can be deployed in a variety of other environments, including warehouses, hospitals, and the like. The system 100 includes a server 101 in communication with at least one mobile automation apparatus 103 (also referred to herein simply as the apparatus 103) and at least one client computing device 105 via communication links 107, illustrated in the present example as including wireless links. In the present example, the links 107 are provided by a wireless local area network (WLAN) deployed within the retail environment by one or more access points (not shown). In other examples, the server 101, the client device 105, or both, are located outside the retail environment, and the links 107 therefore include wide-area networks such as the Internet, mobile networks, and the like. The system 100 also includes a dock 108 for the apparatus 103 in the present example. The dock 108 is in communication with the server 101 via a link 109 that in the present example is a wired link. In other examples, however, the link 109 is a wireless link.


The client computing device 105 is illustrated in FIG. 1 as a mobile computing device, such as a tablet, smart phone or the like. In other examples, the client device 105 is implemented as another type of computing device, such as a desktop computer, a laptop computer, another server, a kiosk, a monitor, and the like. The system 100 can include a plurality of client devices 105 in communication with the server 101 via respective links 107.


The system 100 is deployed, in the illustrated example, in a retail environment including a plurality of support structures such as shelf modules 110-1, 110-2, 110-3 and so on (collectively referred to as shelves 110, and generically referred to as a shelf 110—this nomenclature is also employed for other elements discussed herein). In other examples, additional types of support structures may also be present, such as pegboards. Each shelf module 110 supports a plurality of products 112. Each shelf module 110 includes a shelf back 116-1, 116-2, 116-3 and a support surface (e.g. support surface 117-3 as illustrated in FIG. 1) extending from the shelf back 116 to a shelf edge 118-1, 118-2, 118-3.


The shelf modules 110 are typically arranged in a plurality of aisles, each of which includes a plurality of modules 110 aligned end-to-end. In such arrangements, the shelf edges 118 face into the aisles, through which customers in the retail environment as well as the apparatus 103 may travel. As will be apparent from FIG. 1, the term “shelf edge” 118 as employed herein, which may also be referred to as the edge of a support surface (e.g., the support surfaces 117) refers to a surface bounded by adjacent surfaces having different angles of inclination. In the example illustrated in FIG. 1, the shelf edge 118-3 is at an angle of about ninety degrees relative to each of the support surface 117-3 and the underside (not shown) of the support surface 117-3. In other examples, the angles between the shelf edge 118-3 and the adjacent surfaces, such as the support surface 117-3, is more or less than ninety degrees. The shelf edges 118 define a front of the shelves 110, separated from the shelf backs 116 by a shelf depth. A common frame of reference 102 is illustrated in FIG. 1. In the present example, the shelf depth is defined in the Y dimension of the frame of reference 102, while the shelf backs 116 and shelf edges 118 are shown as being parallel to the XZ plane.


The apparatus 103 is deployed within the retail environment, and communicates with the server 101 (e.g. via the link 107) to navigate, autonomously or partially autonomously, along a length 119 (illustrated in FIG. 1 as being parallel to the X axis of the frame of reference 102) of at least a portion of the shelves 110. The apparatus 103, autonomously or in conjunction with the server 101, is configured to continuously determine its location within the environment, for example with respect to a map of the environment. The apparatus 103 may also be configured to update the map (e.g. via a simultaneous mapping and localization, or SLAM, process).


The apparatus 103 is equipped with a plurality of navigation and data capture sensors 104, such as image sensors (e.g. one or more digital cameras) and depth sensors (e.g. one or more Light Detection and Ranging (LIDAR) sensors, one or more depth cameras employing structured light patterns, such as infrared light, or the like). The apparatus 103 can be configured to employ the sensors 104 to both navigate among the shelves 110 (e.g. according to the paths mentioned above) and to capture shelf data, such as point cloud and image data, during such navigation.


The server 101 includes a special purpose imaging controller, such as a processor 120, specifically designed to control and/or assist the mobile automation apparatus 103 to navigate the environment and to capture data. The processor 120 can be further configured to obtain the captured data via a communications interface 124 for storage in a repository 132 and subsequent processing (e.g. to detect objects such as shelved products in the captured data, and detect status information corresponding to the objects). The server 101 may also be configured to transmit status notifications (e.g. notifications indicating that products are out-of-stock, low stock or misplaced) to the client device 105 responsive to the determination of product status data. The client device 105 includes one or more controllers (e.g. central processing units (CPUs) and/or field-programmable gate arrays (FPGAs) and the like) configured to process (e.g. to display) notifications received from the server 101.


The processor 120 is interconnected with a non-transitory computer readable storage medium, such as the above-mentioned memory 122, having stored thereon computer readable instructions for performing various functionality, including control of the apparatus 103 to capture shelf data, post-processing of the shelf data, and generating and providing certain navigational data to the apparatus 103, such as target locations at which to capture shelf data. The memory 122 includes a combination of volatile (e.g. Random Access Memory or RAM) and non-volatile memory (e.g. read only memory or ROM, Electrically Erasable Programmable Read Only Memory or EEPROM, flash memory). The processor 120 and the memory 122 each comprise one or more integrated circuits. In some embodiments, the processor 120 is implemented as one or more central processing units (CPUs) and/or graphics processing units (GPUs).


The server 101 also includes the above-mentioned communications interface 124 interconnected with the processor 120. The communications interface 124 includes suitable hardware (e.g. transmitters, receivers, network interface controllers and the like) allowing the server 101 to communicate with other computing devices—particularly the apparatus 103, the client device 105 and the dock 108—via the links 107 and 109. The links 107 and 109 may be direct links, or links that traverse one or more networks, including both local and wide-area networks. The specific components of the communications interface 124 are selected based on the type of network or other links that the server 101 is required to communicate over. In the present example, as noted earlier, a wireless local-area network is implemented within the retail environment via the deployment of one or more wireless access points. The links 107 therefore include either or both wireless links between the apparatus 103 and the mobile device 105 and the above-mentioned access points, and a wired link (e.g. an Ethernet-based link) between the server 101 and the access point.


The memory 122 stores a plurality of applications, each including a plurality of computer readable instructions executable by the processor 120. The execution of the above-mentioned instructions by the processor 120 configures the server 101 to perform various actions discussed herein. The applications stored in the memory 122 include a control application 128, which may also be implemented as a suite of logically distinct applications. In general, via execution of the application 128 or subcomponents thereof and in conjunction with the other components of the server 101, the processor 120 is configured to implement various functionality related to controlling the apparatus 103 to navigate among the shelves 110 and capture data, as well as to obtain the captured data and perform various post-processing operations on the captured data. In the present example, as discussed below in greater detail, execution of the application 128 configures the server 101 to determine a shelf depth for one or more of the shelves 110, based on captured data (e.g. obtained from the apparatus 103) including point cloud and image data representing the shelves 110.


The processor 120, as configured via the execution of the control application 128, is also referred to herein as the controller 120. As will now be apparent, some or all of the functionality implemented by the controller 120 described below may also be performed by preconfigured special purpose hardware controllers (e.g. one or more logic circuit arrangements specifically configured to optimize the speed of image processing, for example via FPGAs and/or Application-Specific Integrated Circuits (ASICs) configured for this purpose) rather than by execution of the control application 128 by the processor 120.


Turning now to FIGS. 2A and 2B, the mobile automation apparatus 103 is shown in greater detail. The apparatus 103 includes a chassis 201 containing a locomotive mechanism 203 (e.g. one or more electrical motors driving wheels, tracks or the like). The apparatus 103 further includes a sensor mast 205 supported on the chassis 201 and, in the present example, extending upwards (e.g., substantially vertically) from the chassis 201. The mast 205 supports the sensors 104 mentioned earlier. In particular, the sensors 104 include at least one imaging sensor 207, such as a digital camera, as well as at least one depth sensor 209, such as a 3D digital camera. The apparatus 103 also includes additional depth sensors, such as LIDAR sensors 211. In other examples, the apparatus 103 includes additional sensors, such as one or more RFID readers, temperature sensors, and the like.


In the present example, the mast 205 supports seven digital cameras 207-1 through 207-7, and two LIDAR sensors 211-1 and 211-2. The mast 205 also supports a plurality of illumination assemblies 213, configured to illuminate the fields of view of the respective cameras 207. That is, the illumination assembly 213-1 illuminates the field of view of the camera 207-1, and so on. The sensors 207 and 211 are oriented on the mast 205 such that the fields of view of each sensor face a shelf 110 along the length 119 of which the apparatus 103 is travelling. The apparatus 103 is configured to track a location of the apparatus 103 (e.g. a location of the center of the chassis 201) in the common frame of reference 102 previously established in the retail facility, permitting data captured by the mobile automation apparatus 103 to be registered to the common frame of reference.


The mobile automation apparatus 103 includes a special-purpose controller, such as a processor 220, as shown in FIG. 2B, interconnected with a non-transitory computer readable storage medium, such as a memory 222. The memory 222 includes a combination of volatile (e.g. Random Access Memory or RAM) and non-volatile memory (e.g. read only memory or ROM, Electrically Erasable Programmable Read Only Memory or EEPROM, flash memory). The processor 220 and the memory 222 each comprise one or more integrated circuits. The memory 222 stores computer readable instructions for execution by the processor 220. In particular, the memory 222 stores a control application 228 which, when executed by the processor 220, configures the processor 220 to perform various functions related to the navigation of the apparatus 103 and capture of data for subsequent processing, e.g. by the server 101. In some embodiments, such subsequent processing can be performed by the apparatus 103 itself via execution of the application 228. The application 228 may also be implemented as a suite of distinct applications in other examples.


The processor 220, when so configured by the execution of the application 228, may also be referred to as an imaging controller 220. Those skilled in the art will appreciate that the functionality implemented by the processor 220 via the execution of the application 228 may also be implemented by one or more specially designed hardware and firmware components, including logic circuit configurations optimized for image and/or depth sensor data processing, such as via specifically configured FPGAs, ASICs and the like in other embodiments.


The memory 222 may also store a repository 232 containing, for example, one or more maps representing the environment in which the apparatus 103 operates, for use during the execution of the application 228. The apparatus 103 may communicate with the server 101, for example to receive instructions to navigate to specified locations and initiate data capture operations, via a communications interface 224 over the link 107 shown in FIG. 1. The communications interface 224 also enables the apparatus 103 to communicate with the server 101 via the dock 108 and the link 109.


As will be apparent in the discussion below, other examples, some or all of the processing performed by the server 101 may be performed by the apparatus 103, and some or all of the processing performed by the apparatus 103 may be performed by the server 101. That is, although in the illustrated example the application 128 resides in the server 101, in other embodiments some or all of the actions described below to determine the shelf depth of the shelves 110 from captured data may be performed by the processor 220 of the apparatus 103, either in conjunction with or independently from the processor 120 of the server 101. As those of skill in the art will realize, distribution of such computations between the server 101 and the mobile automation apparatus 103 may depend upon respective processing speeds of the processors 120 and 220, the quality and bandwidth of the link 107, as well as criticality level of the underlying instruction(s).


The functionality of the application 128 will now be described in greater detail. In particular, the support structure depth determination mentioned above will be described as performed by the server 101. Turning to FIG. 3, a method 300 of determining support structure depth is shown. The method 300 will be described in conjunction with its performance by the server 101, with reference to the components illustrated in FIG. 1.


At block 305, the server 101 is configured to obtain a point cloud of the support structure, as well as a plane definition corresponding to the front of the support structure. In the present example, in which the support structures are shelves such as the shelves 110 shown in FIG. 1, the point cloud obtained at block 305 therefore represents at least a portion of a shelf module 110 (and may represent a plurality of shelf modules 110), and the plane definition corresponds to a shelf plane that corresponds to the front of the shelf modules 110. In other words, the plane definition defines a plane that contains the shelf edges 118.


The point cloud and plane definition obtained at block 305 can be retrieved from the repository 132. For example, the server 101 may have previously received captured data from the apparatus 103 including a plurality of lidar scans of the shelf modules 110, and generated a point cloud from the lidar scans. Each point in the point cloud represents a point on a surface of the shelves 110, products 112, and the like (e.g. a point that the scan line of a lidar sensor 211 impacted), and is defined by a set of coordinates (X, Y and Z) in the frame of reference 102. The plane definition may also be previously generated by the server 101 and stored in the repository 132, for example from the above-mentioned point cloud. For example, the server 101 can be configured to process the point cloud, the raw lidar data, image data captured by the cameras 207, or a combination thereof, to identify shelf edges 118 according to predefined characteristics of the shelf edges 118. Examples of such characteristics include that the shelf edges 118 are likely to be substantially planar, and are also likely to be closer to the apparatus 103 as the apparatus 103 travels the length 119 of a shelf module 110) than other objects (such as the shelf backs 116 and products 112). The plane definition can be obtained in a variety of suitable formats, such as a suitable set of parameters defining the plane. An example of such parameters includes a normal vector (i.e. a vector defined according to the frame of reference 102 that is perpendicular to the plane) and a depth (indicating the distance along the normal vector from the origin of the frame of reference 102 to the plane).


Referring to FIG. 4A, a point cloud 400 is illustrated, depicting the shelf module 110-3. The shelf back 116-3, as well as the shelf 117-3 and shelf edge 118-3 are therefore shown in the point cloud 400. Also shown in FIG. 4A is a plane definition 404 corresponding to the front of the shelf module 110-3 (that is, the plane definition 404 contains the shelf edges 118-3). The point cloud 400 and the plane definition 404 need not be obtained in the graphical form shown in FIG. 4A. As will be apparent to those skilled in the art, the point cloud may be obtained as a list of coordinates, and the plane definition 404 may be obtained as the above-mentioned parameters.


Returning to FIG. 3, at block 310 the server 101 is configured to obtain at least one image of the support structure, as captured (e.g. by the apparatus 103) from a capture pose. The capture pose is a position and orientation of capture device such as a camera 207, within the frame of reference. The apparatus 103, as noted above, is configured to traverse one or more shelf modules 110 and capture images of the shelf modules 110. As will now be apparent, each image capture occurs at a certain position and orientation of the apparatus 103. Further, the apparatus 103 includes a plurality of cameras 207, as shown in FIG. 2A, each with a predefined physical position and orientation on the apparatus 103. Thus, at each pose (i.e. position and orientation) of the apparatus 103, a plurality of images may be captured, one for each camera 207. Each image thus corresponds to a specific capture pose, meaning the physical position of the camera 207 according to the frame of reference 102.



FIG. 4B illustrates the capture of two example images 408-1, 408-2 by the apparatus 103 as the apparatus 103 traverses the shelf module 110-3 in a travel direction 406. In particular, at a first apparatus pose 412-1, the apparatus 103 controls the camera 207-1 to capture the first image 408-1. The position and orientation of the camera 207-1 at the time of capture of the first image 408-1 thus corresponds to a first capture pose. Later during the traverse of the shelf module 110-3, at a second apparatus pose 412-2, the apparatus 103 controls the camera 207-1 to capture the second image 408-2. As will now be apparent, the second image 408-2 corresponds to a second capture pose defined by the apparatus pose 412-2 and the physical orientation of the camera 207-1 relative to the apparatus 103. Each of the other cameras 207 may also be controlled to capture images at each apparatus pose 412. The images captured by those other cameras 207 correspond to yet more capture poses.


Returning to FIG. 3, at block 310 the server 101 is also configured to obtain, for example by retrieval from the repository 132, a mask also referred to as a back of shelf (BoS) mask or a BoS map. The mask corresponds to the at least one image mentioned above. That is, for each image obtained at block 310, one corresponding mask can also be obtained. The mask is derived from the corresponding image, and indicates, for each of a plurality of portions of the image, a confidence level that the portion depicts the shelf back 116. The portions can be individual pixels, if the mask has the same resolution as the image. In other examples, the mask has a lower resolution than the image, and each confidence level in the mask therefore corresponds to a portion of the image that contains multiple pixels.



FIG. 5A illustrates the image 408-1 shown in FIG. 4A. As shown in FIG. 5A, a portion 500 of the image 408-1 depicts the shelf back 116-3. Portions 504-1, 504-2 and 504-3, meanwhile, depict products 112, and a portion 508 depicts the shelf edge 118-3. FIG. 5B illustrates a mask 512 derived from the image 408-1. Various mechanisms can be employed for generating the mask. For example, the image 408-1 can be decomposed into patches of a predefined size (e.g. 5×5 pixels), and each patch can be classified by a suitable classification operation to generate a confidence level, indicating a degree to which the patch matches a reference image of shelf back 116-3. The mask 512 can then be constructed by combining the confidence levels assigned to each patch.


In FIG. 5B, the confidence levels of the mask 512 are represented in grayscale. Darker regions of the mask 512 indicate lower confidence that the corresponding portion of the image 408-1 depicts the shelf back 116-3 (or, in other words, higher confidence that the corresponding portion of the image 408-1 does not depict the shelf back 116-3) and lighter regions of the mask 512 indicate higher confidence that the corresponding portion of the image 408-1 depicts the shelf back 116-3. For example, a region 516 indicates a confidence level of zero that the portion 508 of the image 408-1 depicts the shelf back 116-3. Another region 520 of the mask 512 indicates a maximum confidence level (e.g. 100%) that the corresponding portion of the image 408-1 depicts the shelf back 116-3. Other regions of the mask 512 indicate intermediate confidence levels. For example, a region 524 indicates a confidence level of about 50%, because the pattern shown on the product 112 depicted in the portion 504-3 of the image 408-1 resembles the shelf back 116-3. The region 528 of the mask 512, meanwhile, indicates a confidence level of about 30%.


Various other mechanisms for storing the confidence levels of the mask 512 are contemplated, beyond the grayscale image shown in FIG. 5B. For example, the confidence levels may be stored in a list, with associated sets of image coordinates indicating which portion of the image 408-1 corresponds to each confidence level.


Having obtained the point cloud, plane definition, image(s) and mask(s) at blocks 305 and 310, the server 101 is then configured to identify a subset of the points in the point cloud for which corresponding confidence levels exist in the mask 512. That is, the server 101 identifies points in the point cloud that were visible to the camera 207 at the time that the image was captured. The server 101 is then configured to use the depths of such points relative to the shelf plane in conjunction with the corresponding confidence levels from the mask 512, to determine a depth of the shelf back 116 relative to the shelf plane. The above functionality will be discussed below in greater detail.


Returning to FIG. 3, at block 315 the server 101 is configured to select an initial set of points from the point cloud, that fall within a field of view established by the capture pose mentioned above. Referring briefly to FIG. 4B, the field of view of the camera 207-2 is shown in dashed lines at each capture pose 412. The capture pose is defined according to the frame of reference 102, and according to predefined operational parameters (e.g. focal length) of the camera 207, the position and extent of the field of view within the frame of reference 102 can also be defined.


The server 101 can be configured, at block 315, to assess each point of the point cloud to determine whether the point falls within the field of view corresponding to the image obtained at block 310. For example, the server 101 can be configured to define the field of view as a volume within the frame of reference 102, and to determine whether each point of the point cloud falls within the defined volume. Points falling within the defined volume are selected for the initial set. In some examples, however, the server 101 is configured to perform a tree-based search to generate the initial set of points, as discussed below in connection with FIG. 6.


Turning to FIG. 6A, a method 600 of selecting the initial set of points at block 315. At block 605, the server 101 is configured to generate a tree data structure, such as a k-d (k-dimensional) tree, an octree or the like. In the present example, a k-d tree is generated at block 605. The tree data structure contains, for each point in the point cloud, first and second dimension coordinates orthogonal to the depth of the point. That is, each point is represented in the tree by its X and Z coordinates according to the frame of reference 102, with the Y coordinate being omitted for the selection of the initial set (the Y coordinates are employed later in the method 300, as will be discussed below).


As will be understood by those skilled in the art, the k-d tree can be constructed by determining the median of one of the two dimensions mentioned above (e.g. the X dimension). Any points with an X coordinate below the median are allocated to a first branch of the tree, while the remaining points are allocated to a second branch. For each branch, the median of the other coordinate (Z, in the present example) is determined and the points allocated to the branch are again subdivided depending on whether their Z coordinates are above or below the Z median. This process is repeated, further subdividing the points between pairs of branches based on alternating dimensional medians (i.e. one division based on the X dimension, followed by one divisional based on the Z dimension, followed by a further division based on the X dimension, and so on), until each node of the tree contains a single point.


At block 610, the server 101 is configured to determine coordinates of a center of the field of view, in the two dimensions represented in the tree. As noted above, the volume defined by the field of view is determined from operational parameters of the camera 207 and the capture pose. Referring to FIG. 6B, a field of view 602 of the camera 207-2 at the apparatus pose 412-1 is illustrated. The center of the field of view 602, in three dimensions, is defined by the line 604. To determine two-dimensional coordinates of the center of the field of view in two dimensions (i.e. in the X and Z dimensions), the server 101 is configured to select a predefined depth and to determine the coordinates at which the center line 604 intersects the predefined depth. The predefined depth can be stored in the memory 122 as a depth to be added to the depth of the shelf plane obtained at block 305. In other examples, the point cloud, shelf plane, capture poses and the like can be transformed to a frame of reference whose origin lies on the shelf plane itself (e.g. whose XZ plane is on the shelf plane), to simplify the computations discussed herein. As shown in FIG. 6B, the center line 604 intersects the predefined depth at a FOV center 608. The predefined depth is preferably selected to exceed the depth of the shelf back 116 (though the depth of the shelf back 116 may not be known precisely).


At block 615, the server 101 is configured to select points for the set by retrieving points from the tree that are within a predefined radius of the center 608. FIG. 6B illustrates a predefined radius 612 extending from the center 608. As will now be apparent to those skilled in the art, various mechanisms are available for conducting radius-based searches in trees such as a k-d trees. In the present example, as illustrated in FIG. 6B, points retrieved at block 615 include the example points 616, while other points 618 are not retrieved, as they are further from the center 608 than the radius 612.


At block 620, the server 101 can be configured to verify that the three-dimensional position of each point retrieved at block 615 falls within the FOV 602, as the predefined radius 612 may extend beyond the actual bounds of the FOV 602. In other examples, block 620 can be omitted. The verification at block 620, when conducted, may employ a transformation matrix, also referred to as a camera calibration matrix, configured to transform 3-dimensional coordinates from the point cloud into two-dimensional coordinates in an image frame of reference (e.g. pixel coordinates within the image 408-1). The verification at block 620 can therefore include, for each point retrieved at block 615, generating the corresponding image coordinates and determining whether the image coordinates are within the bounds of the image 408-1.


Returning to FIG. 3, having selected the initial set of points 616 within the FOV 602, at block 320 the server 101 is configured to select an unoccluded set of depth measurements from the points in the initial set. The initial set of points selected at block 315, although falling within the FOV 602, may nevertheless include points that were not imaged by the camera 207 because they are occluded from view by the camera 207 by other objects. For example, referring again to FIG. 6B, the point 616a, although within the FOV 602, corresponds to a portion of the shelf 117 that the camera 207-2 cannot image from the capture pose shown in FIG. 6B because a product 112 is between the camera 207-2 and the point 616a. The point 616a may appear in the point cloud because a lidar scanner is positioned differently than the camera 207-2, because a lidar scan captured the point 616a from a subsequent apparatus pose 412, or the like. The point 616a, in other words, is an occluded point for which the image 408-1 and the mask 512 have no corresponding data. At block 320, the server 101 is configured to remove such occluded points from further consideration, and retain data for unoccluded points, such as the point 616b.


In general, the selection at block 320 operates on an assumption that for any occluded point from the point cloud, an unoccluded point will also be present in the point cloud corresponding to the object responsible for the occlusion. It is further assumed at block 320 that the unoccluded point mentioned above is visible to the camera 207, and is therefore represented in the image 408-1. Turning to FIG. 7A, an example method 700 of selecting the unoccluded subset of depth measurements is illustrated.


At block 705, the server 101 is configured to determine the image coordinates for each point in the initial set selected at block 315. As noted above, image coordinates can be obtained by use of the camera calibration matrix in a process also referred to as forward projection (i.e. projecting a point in three dimensions “forward” into a captured image, as opposed to back projection, referred to projecting a point in an image “back” into the point cloud). FIG. 7B illustrates the results of block 705 for the points 616a and 616b discussed earlier. The points 616a and 616b correspond to image coordinates defined according to an image frame of reference 702 (which in the present example is parallel with the XZ plane of the frame of reference 102). As seen in FIG. 7B, the depth measurements in the frame of reference 102 associated with the points 616 are also retained through the performance of the method 700, although they are not directly represented in the image coordinates (which are two-dimensional). The depth measurements may be maintained in a list 704 or other suitable format, in association with the image coordinates. Additional example points 706, 708, 709, 712 and 714 are also illustrated. As shown in the list 704 of depth measurements, the point 708 is located on the surface of a product, while the point 709 is behind the product, e.g. on the shelf back 116 (at a depth of 528 mm, compared to a depth of 235 mm for the point 708). The points 712 and 714 are also located on the shelf back 116, and have associated depths of 530 mm and 522 mm, respectively.


At block 710, the server 101 is configured to generate a tree data structure, such as a further k-d tree, containing the image coordinates determined at block 705. At block 715, the server 101 is configured to select neighbor groups of points. Specifically, for a selected point in the tree, the server 101 is configured to retrieve the nearest neighbors of that point (e.g. a predefined number of neighbors, neighbors within a predefined radius, or a combination of the above). The server 101 is further configured to select, from the nearest neighbors retrieved at block 715, the neighbor with the smallest depth. Thus, referring again to FIG. 7B and beginning with the point 616a, the nearest neighbor is the point 616b, and the lowest depth between the points 616a and 616b is the depth associated with the point 616b. The depth measurement (as well as the corresponding image coordinates) of the point 616b is therefore retained for inclusion in the unoccluded subset of depth measurements, while the point 616a is discarded. The performance of block 715 is repeated for each remaining point in the initial set, until a determination at block 720 indicates that no points remain to be processed. For the example points shown in FIG. 7B,


When all points from the initial set have been processed and the subset of unoccluded depth measurements has been selected, the server 101 returns to block 325 of the method 300. At block 325, the server 101 can optionally be configured to select a final subset of depth measurements from the unoccluded subset of depth measurements. For example, taking the points shown in FIG. 7B, the unoccluded subset of depth measurements obtained therefrom is shown in FIG. 8A, in which it is seen that the points 616a and 709 have been discarded from the unoccluded subset 800. At block 325, the server 101 can be configured to perform one or more additional filtering operations to excluded further points from the unoccluded subset.


A first example of a filtering operation applied at block 325 is to discard any points with a BoS confidence level from the mask 512 that is below a predetermined threshold. The predetermined threshold, in the present example, is 55% (although it will be understood that various other thresholds may be applied instead). FIG. 8B illustrates the mask 512 with confidence levels 816b, 806, 808, 812 and 814 corresponding to the image coordinates of the points 616b, 706, 708, 712 and 714, respectively. In the present example, it is assumed that the confidence levels 816b, 806, 808, 812 and 814 are 30%, 0%, 50%, 100% and 90%, respectively. The points having confidence levels below 55% (that is, the points 616b, 706 and 708) are therefore discarded, and the final subset of depth measurements includes the depth measurements for the points 712 and 714, as well as their associated image coordinates.


Other examples of filtering performed at block 325 includes discarding points with depth measurements that exceed a predefined maximum depth threshold. FIG. 8C illustrates another example image 818 taken from a different apparatus pose (and therefore a different capture pose) than the pose at which the image 418-1 was captured. In the image 818, an edge 819 of the shelf module 110-3 is visible, and certain points in both the image 818 and the point cloud therefore correspond to areas of the facility beyond the shelf module 110-3. For example, the point 820 may have an associated depth measurement of 2500 mm. The maximum threshold mentioned above may be selected as a maximum known shelf depth throughout the facility (e.g. 700 mm). The point 820 may therefore be discarded at block 325.


Returning to FIG. 3, at block 330, the depth measurements of the final subset are weighted according to the corresponding confidence levels from the mask 512. Thus, in the present example, the depth measurements for the points 712 and 714 are weighted according to their respective confidence levels (100% and 90%, respectively). For example, the depths may be multiplied by their respective weights (e.g. 530×1 and 522×0.9). At block 335, the shelf depth is determined from the weighted depths. That is, the shelf depth determined at block 335 is a weighted average of the depth measurements in the final subset from block 325. In the present example, the weighted average of the depth measurements for the points 712 and 714 is obtained by summing the weighted depths, and dividing the result by the sum of the weights (i.e. 1.9 or 190%), yielding a result of 526.2 mm. FIG. 9 illustrates the determined shelf depth as a dashed line 900 extending from the shelf plane 404 (and perpendicular to the shelf plane 404).


At block 340, the server 101 is configured to determine whether any capture poses remain to be processed (i.e. whether additional apparatus poses for the current camera remain, or whether any additional cameras remain at the current apparatus pose). When the determination at block 340 is affirmative, the performance of the method 300 is repeated for any subsequent images and corresponding masks. When the determination at block 340 is negative, the performance of the method 300 ends. In some examples, block 335 is performed only following a negative determination at block 340, and uses the plurality of weighted final sets of depth measurements from each performance of block 330 to determine a single shelf depth for the shelf module 110. The shelf depth determined via performance of the method 300 can be returned, for example, to a further application of the server 101 (or to another computing device), for use in identifying gaps in the shelves 110 or other object status data.


In the foregoing specification, specific embodiments have been described. However, one of ordinary skill in the art appreciates that various modifications and changes can be made without departing from the scope of the invention as set forth in the claims below. Accordingly, the specification and figures are to be regarded in an illustrative rather than a restrictive sense, and all such modifications are intended to be included within the scope of present teachings.


The benefits, advantages, solutions to problems, and any element(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential features or elements of any or all the claims. The invention is defined solely by the appended claims including any amendments made during the pendency of this application and all equivalents of those claims as issued.


Moreover in this document, relational terms such as first and second, top and bottom, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms “comprises,” “comprising,” “has”, “having,” “includes”, “including,” “contains”, “containing” or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises, has, includes, contains a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. An element proceeded by “comprises . . . a”, “has . . . a”, “includes . . . a”, “contains . . . a” does not, without more constraints, preclude the existence of additional identical elements in the process, method, article, or apparatus that comprises, has, includes, contains the element. The terms “a” and “an” are defined as one or more unless explicitly stated otherwise herein. The terms “substantially”, “essentially”, “approximately”, “about” or any other version thereof, are defined as being close to as understood by one of ordinary skill in the art, and in one non-limiting embodiment the term is defined to be within 10%, in another embodiment within 5%, in another embodiment within 1% and in another embodiment within 0.5%. The term “coupled” as used herein is defined as connected, although not necessarily directly and not necessarily mechanically. A device or structure that is “configured” in a certain way is configured in at least that way, but may also be configured in ways that are not listed.


It will be appreciated that some embodiments may be comprised of one or more specialized processors (or “processing devices”) such as microprocessors, digital signal processors, customized processors and field programmable gate arrays (FPGAs) and unique stored program instructions (including both software and firmware) that control the one or more processors to implement, in conjunction with certain non-processor circuits, some, most, or all of the functions of the method and/or apparatus described herein. Alternatively, some or all functions could be implemented by a state machine that has no stored program instructions, or in one or more application specific integrated circuits (ASICs), in which each function or some combinations of certain of the functions are implemented as custom logic. Of course, a combination of the two approaches could be used.


Moreover, an embodiment can be implemented as a computer-readable storage medium having computer readable code stored thereon for programming a computer (e.g., comprising a processor) to perform a method as described and claimed herein. Examples of such computer-readable storage mediums include, but are not limited to, a hard disk, a CD-ROM, an optical storage device, a magnetic storage device, a ROM (Read Only Memory), a PROM (Programmable Read Only Memory), an EPROM (Erasable Programmable Read Only Memory), an EEPROM (Electrically Erasable Programmable Read Only Memory) and a Flash memory. Further, it is expected that one of ordinary skill, notwithstanding possibly significant effort and many design choices motivated by, for example, available time, current technology, and economic considerations, when guided by the concepts and principles disclosed herein will be readily capable of generating such software instructions and programs and ICs with minimal experimentation.


The Abstract of the Disclosure is provided to allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in various embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separately claimed subject matter.

Claims
  • 1. A method of determining a support structure depth of a support structure having a front and a back separated by the support structure depth, the method comprising: obtaining (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure;selecting, from the point cloud, an initial set of points located within a field of view originating at the capture pose;selecting, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates;retrieving, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; andbased on the depth measurements in the unoccluded subset and the retrieved confidence levels, determining the support structure depth.
  • 2. The method of claim 1, further comprising: obtaining a further mask corresponding to a further image of the support structure captured from a further capture pose;selecting a further initial set of points;selecting a further unoccluded set of depth measurements;retrieving a further confidence level for each of the depth measurements in the further unoccluded subset.
  • 3. The method of claim 2, further comprising: determining the support structure depth based on the depth measurements in the unoccluded subset, the depth measurements in the further unoccluded subset, the confidence levels and the further confidence levels.
  • 4. The method of claim 1, wherein a capture pose defines a camera position and orientation within a common frame of reference.
  • 5. The method of claim 1, wherein selecting the initial set of points comprises: generating a tree data structure containing, for each point in the point cloud, first and second dimensions orthogonal to the support structure depth;determining a field of view center in the first and second dimensions; andretrieving, from the tree data structure, the initial set of points within a predefined radius of the field of view center.
  • 6. The method of claim 1, wherein selecting the unoccluded subset of depth measurements comprises: determining image coordinates corresponding to each of the initial set of points;identifying neighbor groups of the image coordinates; andfor each neighbor group, selecting the image coordinate corresponding to the smallest depth measurement.
  • 7. The method of claim 1, wherein determining the support structure depth comprises: obtaining a plane definition corresponding to the front of the support structure;transforming each depth measurement of the unoccluded subset of depth measurements to a depth relative to the plane definition;weighting each transformed depth measurement according to the retrieved confidence levels; anddetermining an average of the weighted depth measurements.
  • 8. The method of claim 1, further comprising: prior to determining the support structure depth, discarding depth measurements for which the retrieved confidence levels are below a minimum confidence threshold.
  • 9. The method of claim 1, further comprising: prior to determining the support structure depth, discarding depth measurements exceeding a maximum depth threshold.
  • 10. A computing device for determining a support structure depth of a support structure having a front and a back separated by the support structure depth, the computing device comprising: a memory storing (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure;an imaging controller connected to the memory and configured to: select, from the point cloud, an initial set of points located within a field of view originating at the capture pose;select, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates;retrieve, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; andbased on the depth measurements in the unoccluded subset and the retrieved confidence levels, determine the support structure depth.
  • 11. The computing device of claim 10, wherein the imaging controller is further configured to: obtain a further mask corresponding to a further image of the support structure captured from a further capture pose;select a further initial set of points;select a further unoccluded set of depth measurements;retrieve a further confidence level for each of the depth measurements in the further unoccluded subset.
  • 12. The computing device of claim 11, wherein the imaging controller is further configured to: determine the support structure depth based on the depth measurements in the unoccluded subset, the depth measurements in the further unoccluded subset, the confidence levels and the further confidence levels.
  • 13. The computing device of claim 10, wherein a capture pose defines a camera position and orientation within a common frame of reference.
  • 14. The computing device of claim 10, wherein the imaging controller is further configured, to select the initial set of points, to: generate a tree data structure containing, for each point in the point cloud, first and second dimensions orthogonal to the support structure depth;determine a field of view center in the first and second dimensions; andretrieve, from the tree data structure, the initial set of points within a predefined radius of the field of view center.
  • 15. The computing device of claim 10, wherein the imaging controller is further configured, to select the unoccluded subset of depth measurements, to: determine image coordinates corresponding to each of the initial set of points;identify neighbor groups of the image coordinates; andfor each neighbor group, select the image coordinate corresponding to the smallest depth measurement.
  • 16. The computing device of claim 10, wherein the imaging controller is further configured, to determine the support structure depth, to: obtain a plane definition corresponding to the front of the support structure;transform each depth measurement of the unoccluded subset of depth measurements to a depth relative to the plane definition;weight each transformed depth measurement according to the retrieved confidence levels; anddetermine an average of the weighted depth measurements.
  • 17. The computing device of claim 10, wherein the imaging controller is further configured to: prior to determining the support structure depth, discard depth measurements for which the retrieved confidence levels are below a minimum confidence threshold.
  • 18. The computing device of claim 10, wherein the imaging controller is further configured to: prior to determining the support structure depth, discard depth measurements exceeding a maximum depth threshold.
  • 19. A computer-readable medium having stored thereon computer-executable instructions, the instructions comprising: obtaining (i) a point cloud of the support structure, and (ii) a mask indicating, for a plurality of portions of an image of the support structure captured from a capture pose, respective confidence levels that the portions depict the back of the support structure;selecting, from the point cloud, an initial set of points located within a field of view originating at the capture pose;selecting, from the initial set of points, an unoccluded subset of depth measurements, the depth measurements in the unoccluded subset corresponding to respective image coordinates;retrieving, from the mask, a confidence level for each of the depth measurements in the unoccluded subset; andbased on the depth measurements in the unoccluded subset and the retrieved confidence levels, determining the support structure depth.
  • 20. The computer-readable medium of claim 19, the instructions further comprising: determining the support structure depth based on the depth measurements in the unoccluded subset, the depth measurements in the further unoccluded subset, the confidence levels and the further confidence levels.
US Referenced Citations (506)
Number Name Date Kind
5209712 Ferri May 1993 A
5214615 Bauer May 1993 A
5408322 Hsu et al. Apr 1995 A
5414268 McGee May 1995 A
5423617 Marsh et al. Jun 1995 A
5534762 Kim Jul 1996 A
5566280 Fukui et al. Oct 1996 A
5704049 Briechle Dec 1997 A
5953055 Huang et al. Sep 1999 A
5988862 Kacyra et al. Nov 1999 A
6026376 Kenney Feb 2000 A
6034379 Bunte et al. Mar 2000 A
6075905 Herman et al. Jun 2000 A
6115114 Berg et al. Sep 2000 A
6141293 Amorai-Moriya et al. Oct 2000 A
6304855 Burke Oct 2001 B1
6442507 Skidmore et al. Aug 2002 B1
6549825 Kurata Apr 2003 B2
6580441 Schileru-Key Jun 2003 B2
6711293 Lowe Mar 2004 B1
6721723 Gibson et al. Apr 2004 B1
6721769 Rappaport et al. Apr 2004 B1
6836567 Silver et al. Dec 2004 B1
6995762 Pavlidis et al. Feb 2006 B1
7090135 Patel Aug 2006 B2
7137207 Armstrong et al. Nov 2006 B2
7245558 Willins et al. Jul 2007 B2
7248754 Cato Jul 2007 B2
7277187 Smith et al. Oct 2007 B2
7373722 Cooper et al. May 2008 B2
7474389 Greenberg et al. Jan 2009 B2
7487595 Armstrong et al. Feb 2009 B2
7493336 Noonan Feb 2009 B2
7508794 Feather et al. Mar 2009 B2
7527205 Zhu et al. May 2009 B2
7605817 Zhang et al. Oct 2009 B2
7647752 Magnell Jan 2010 B2
7693757 Zimmerman Apr 2010 B2
7726575 Wang et al. Jun 2010 B2
7751928 Antony et al. Jul 2010 B1
7783383 Eliuk et al. Aug 2010 B2
7839531 Sugiyama Nov 2010 B2
7845560 Emanuel et al. Dec 2010 B2
7885865 Benson et al. Feb 2011 B2
7925114 Mai et al. Apr 2011 B2
7957998 Riley et al. Jun 2011 B2
7996179 Lee et al. Aug 2011 B2
8009864 Linaker et al. Aug 2011 B2
8049621 Egan Nov 2011 B1
8091782 Cato et al. Jan 2012 B2
8094902 Crandall et al. Jan 2012 B2
8094937 Teoh et al. Jan 2012 B2
8132728 Dwinell et al. Mar 2012 B2
8134717 Pangrazio et al. Mar 2012 B2
8189855 Opalach et al. May 2012 B2
8199977 Krishnaswamy et al. Jun 2012 B2
8207964 Meadow et al. Jun 2012 B1
8233055 Matsunaga et al. Jul 2012 B2
8260742 Cognigni et al. Sep 2012 B2
8265895 Willins et al. Sep 2012 B2
8277396 Scott et al. Oct 2012 B2
8284988 Sones et al. Oct 2012 B2
8423431 Rouaix et al. Apr 2013 B1
8429004 Hamilton et al. Apr 2013 B2
8463079 Ackley et al. Jun 2013 B2
8479996 Barkan et al. Jul 2013 B2
8520067 Ersue Aug 2013 B2
8542252 Perez et al. Sep 2013 B2
8571314 Tao et al. Oct 2013 B2
8599303 Stettner Dec 2013 B2
8630924 Groenevelt et al. Jan 2014 B2
8660338 Ma et al. Feb 2014 B2
8743176 Stettner et al. Jun 2014 B2
8757479 Clark et al. Jun 2014 B2
8812226 Zeng Aug 2014 B2
8923893 Austin et al. Dec 2014 B2
8939369 Olmstead et al. Jan 2015 B2
8954188 Sullivan et al. Feb 2015 B2
8958911 Wong et al. Feb 2015 B2
8971637 Rivard Mar 2015 B1
8989342 Liesenfelt et al. Mar 2015 B2
9007601 Steffey et al. Apr 2015 B2
9037287 Grauberger et al. May 2015 B1
9064394 Trundle Jun 2015 B1
9070285 Ramu et al. Jun 2015 B1
9072929 Rush et al. Jul 2015 B1
9120622 Elazary et al. Sep 2015 B1
9129277 MacIntosh Sep 2015 B2
9135491 Morandi et al. Sep 2015 B2
9159047 Winkel Oct 2015 B2
9171442 Clements Oct 2015 B2
9247211 Zhang et al. Jan 2016 B2
9329269 Zeng May 2016 B2
9349076 Liu et al. May 2016 B1
9367831 Besehanic Jun 2016 B1
9380222 Clayton et al. Jun 2016 B2
9396554 Williams et al. Jul 2016 B2
9400170 Steffey Jul 2016 B2
9424482 Patel et al. Aug 2016 B2
9460524 Curlander Oct 2016 B1
9517767 Kentley et al. Dec 2016 B1
9542746 Wu et al. Jan 2017 B2
9549125 Goyal et al. Jan 2017 B1
9562971 Shenkar et al. Feb 2017 B2
9565400 Curlander et al. Feb 2017 B1
9589353 Mueller-Fischer et al. Mar 2017 B2
9600731 Yasunaga et al. Mar 2017 B2
9600892 Patel et al. Mar 2017 B2
9612123 Levinson et al. Apr 2017 B1
9639935 Douady-Pleven et al. May 2017 B1
9697429 Patel et al. Jul 2017 B2
9766074 Roumeliotis et al. Sep 2017 B2
9778388 Connor Oct 2017 B1
9779205 Namir Oct 2017 B2
9791862 Connor Oct 2017 B1
9805240 Zheng et al. Oct 2017 B1
9811754 Schwartz Nov 2017 B2
9827683 Hance et al. Nov 2017 B1
9880009 Bell Jan 2018 B2
9928708 Lin et al. Mar 2018 B2
9953420 Wolski et al. Apr 2018 B2
9980009 Jiang et al. May 2018 B2
9994339 Colson et al. Jun 2018 B2
9996818 Ren et al. Jun 2018 B1
10019803 Venable et al. Jul 2018 B2
10111646 Nycz et al. Oct 2018 B2
10121072 Kekatpure Nov 2018 B1
10127438 Fisher et al. Nov 2018 B1
10133951 Mendonca et al. Nov 2018 B1
10197400 Jesudason et al. Feb 2019 B2
10210603 Venable et al. Feb 2019 B2
10229386 Thomas Mar 2019 B2
10248653 Blassin et al. Apr 2019 B2
10262294 Hahn et al. Apr 2019 B1
10265871 Hance et al. Apr 2019 B2
10289990 Rizzolo et al. May 2019 B2
10336543 Sills et al. Jul 2019 B1
10349031 DeLuca Jul 2019 B2
10352689 Brown et al. Jul 2019 B2
10373116 Medina et al. Aug 2019 B2
10394244 Song et al. Aug 2019 B2
10429487 Fowe Oct 2019 B1
10699421 Cherevatsky Jun 2020 B1
10783656 Korobov Sep 2020 B2
11003188 Scott et al. May 2021 B2
20010031069 Kondo et al. Oct 2001 A1
20010041948 Ross et al. Nov 2001 A1
20020006231 Jayant et al. Jan 2002 A1
20020059202 Hadzikadic et al. May 2002 A1
20020097439 Braica Jul 2002 A1
20020146170 Rom Oct 2002 A1
20020158453 Levine Oct 2002 A1
20020164236 Fukuhara et al. Nov 2002 A1
20030003925 Suzuki Jan 2003 A1
20030094494 Blanford et al. May 2003 A1
20030174891 Wenzel et al. Sep 2003 A1
20040021313 Gardner et al. Feb 2004 A1
20040084527 Bong et al. May 2004 A1
20040131278 Imagawa et al. Jul 2004 A1
20040240754 Smith et al. Dec 2004 A1
20050016004 Armstrong et al. Jan 2005 A1
20050114059 Chang et al. May 2005 A1
20050128195 Houston et al. Jun 2005 A1
20050174351 Chang Aug 2005 A1
20050213082 Dibernardo et al. Sep 2005 A1
20050213109 Schell et al. Sep 2005 A1
20050237320 Itoh et al. Oct 2005 A1
20060032915 Schwartz Feb 2006 A1
20060045325 Zavadsky et al. Mar 2006 A1
20060064286 Fink et al. Mar 2006 A1
20060106742 Bochicchio et al. May 2006 A1
20060279527 Zehner et al. Dec 2006 A1
20060285486 Roberts et al. Dec 2006 A1
20070036398 Chen Feb 2007 A1
20070074410 Armstrong et al. Apr 2007 A1
20070272732 Hindmon Nov 2007 A1
20080002866 Fujiwara Jan 2008 A1
20080025565 Zhang et al. Jan 2008 A1
20080027591 Lenser et al. Jan 2008 A1
20080077511 Zimmerman Mar 2008 A1
20080159634 Sharma et al. Jul 2008 A1
20080164310 Dupuy et al. Jul 2008 A1
20080175513 Lai et al. Jul 2008 A1
20080181529 Michel et al. Jul 2008 A1
20080183730 Enga Jul 2008 A1
20080238919 Pack Oct 2008 A1
20080294487 Nasser Nov 2008 A1
20090009123 Skaff Jan 2009 A1
20090024353 Lee et al. Jan 2009 A1
20090057411 Madej et al. Mar 2009 A1
20090059270 Opalach et al. Mar 2009 A1
20090060349 Linaker et al. Mar 2009 A1
20090063306 Fano et al. Mar 2009 A1
20090063307 Groenovelt et al. Mar 2009 A1
20090074303 Filimonova et al. Mar 2009 A1
20090088975 Sato et al. Apr 2009 A1
20090103773 Wheeler et al. Apr 2009 A1
20090125350 Lessing et al. May 2009 A1
20090125535 Basso et al. May 2009 A1
20090152391 McWhirk Jun 2009 A1
20090160975 Kwan Jun 2009 A1
20090192921 Hicks Jul 2009 A1
20090206161 Olmstead Aug 2009 A1
20090236155 Skaff Sep 2009 A1
20090252437 Li et al. Oct 2009 A1
20090287587 Bloebaum et al. Nov 2009 A1
20090323121 Valkenburg et al. Dec 2009 A1
20100017407 Beniyama et al. Jan 2010 A1
20100026804 Tanizaki et al. Feb 2010 A1
20100070365 Siotia et al. Mar 2010 A1
20100082194 Yabushita et al. Apr 2010 A1
20100091094 Sekowski Apr 2010 A1
20100118116 Tomasz et al. May 2010 A1
20100131234 Stewart et al. May 2010 A1
20100141806 Uemura et al. Jun 2010 A1
20100161569 Schreter Jun 2010 A1
20100171826 Hamilton et al. Jul 2010 A1
20100208039 Setettner Aug 2010 A1
20100214873 Somasundaram et al. Aug 2010 A1
20100235033 Yamamoto et al. Sep 2010 A1
20100241289 Sandberg Sep 2010 A1
20100257149 Cognigni et al. Oct 2010 A1
20100295850 Katz et al. Nov 2010 A1
20100315412 Sinha et al. Dec 2010 A1
20100326939 Clark et al. Dec 2010 A1
20110047636 Stachon et al. Feb 2011 A1
20110052043 Hyung et al. Mar 2011 A1
20110093306 Nielsen et al. Apr 2011 A1
20110137527 Simon et al. Jun 2011 A1
20110168774 Magal Jul 2011 A1
20110172875 Gibbs Jul 2011 A1
20110188759 Filimonova et al. Aug 2011 A1
20110216063 Hayes Sep 2011 A1
20110242286 Pace et al. Oct 2011 A1
20110246503 Bender et al. Oct 2011 A1
20110254840 Halstead Oct 2011 A1
20110286007 Pangrazio et al. Nov 2011 A1
20110288816 Thierman Nov 2011 A1
20110310088 Adabala et al. Dec 2011 A1
20120017028 Tsirkin Jan 2012 A1
20120019393 Wolinsky et al. Jan 2012 A1
20120022913 Volkmann et al. Jan 2012 A1
20120051730 Cote et al. Mar 2012 A1
20120069051 Hagbi et al. Mar 2012 A1
20120075342 Choubassi et al. Mar 2012 A1
20120133639 Kopf et al. May 2012 A1
20120307108 Forutanpour Jun 2012 A1
20120169530 Padmanabhan et al. Jul 2012 A1
20120179621 Moir et al. Jul 2012 A1
20120185112 Sung et al. Jul 2012 A1
20120194644 Newcombe et al. Aug 2012 A1
20120197464 Wang et al. Aug 2012 A1
20120201466 Funayama et al. Aug 2012 A1
20120209553 Doytchinov et al. Aug 2012 A1
20120236119 Rhee et al. Sep 2012 A1
20120249802 Taylor Oct 2012 A1
20120250978 Taylor Oct 2012 A1
20120269383 Bobbitt et al. Oct 2012 A1
20120278782 Pal et al. Nov 2012 A1
20120287249 Choo et al. Nov 2012 A1
20120323620 Hofman et al. Dec 2012 A1
20130030700 Miller et al. Jan 2013 A1
20130076586 Karhuketo et al. Mar 2013 A1
20130090881 Janardhanan et al. Apr 2013 A1
20130119138 Winkel May 2013 A1
20130132913 Fu et al. May 2013 A1
20130134178 Lu May 2013 A1
20130138246 Gutmann et al. May 2013 A1
20130138534 Herwig May 2013 A1
20130142421 Silver et al. Jun 2013 A1
20130144565 Miller Jun 2013 A1
20130154802 O'Haire et al. Jun 2013 A1
20130156292 Chang et al. Jun 2013 A1
20130162806 Ding et al. Jun 2013 A1
20130169681 Rasane et al. Jul 2013 A1
20130176398 Bonner et al. Jul 2013 A1
20130178227 Vartanian et al. Jul 2013 A1
20130182114 Zhang et al. Jul 2013 A1
20130226344 Wong et al. Aug 2013 A1
20130228620 Ahem et al. Sep 2013 A1
20130232039 Jackson et al. Sep 2013 A1
20130235165 Gharib et al. Sep 2013 A1
20130235206 Smith et al. Sep 2013 A1
20130236089 Litvak et al. Sep 2013 A1
20130278631 Border et al. Oct 2013 A1
20130299306 Jiang et al. Nov 2013 A1
20130299313 Baek, IV et al. Nov 2013 A1
20130300729 Grimaud Nov 2013 A1
20130303193 Dharwada et al. Nov 2013 A1
20130321418 Kirk Dec 2013 A1
20130329013 Metois et al. Dec 2013 A1
20130341400 Lancaster-Larocque Dec 2013 A1
20130342363 Paek et al. Dec 2013 A1
20140002597 Taguchi et al. Jan 2014 A1
20140003655 Gopalkrishnan et al. Jan 2014 A1
20140003727 Lortz et al. Jan 2014 A1
20140006229 Birch et al. Jan 2014 A1
20140016832 Kong et al. Jan 2014 A1
20140019311 Tanaka Jan 2014 A1
20140025201 Ryu et al. Jan 2014 A1
20140028837 Gao et al. Jan 2014 A1
20140047342 Breternitz et al. Feb 2014 A1
20140049616 Stettner Feb 2014 A1
20140052555 MacIntosh Feb 2014 A1
20140086483 Zhang et al. Mar 2014 A1
20140088761 Shamlian et al. Mar 2014 A1
20140098094 Neumann et al. Apr 2014 A1
20140100813 Shaowering Apr 2014 A1
20140104413 McCloskey et al. Apr 2014 A1
20140112537 Frank et al. Apr 2014 A1
20140129027 Schnittman May 2014 A1
20140133740 The Board Of Trustees Of The Leland Stanford Junior University May 2014 A1
20140156133 Cullinane et al. Jun 2014 A1
20140161359 Magri et al. Jun 2014 A1
20140192050 Qiu et al. Jul 2014 A1
20140195095 Elbit Systems Ltd Jul 2014 A1
20140195374 Bassemir et al. Jul 2014 A1
20140214547 Signorelli et al. Jul 2014 A1
20140214600 Argue et al. Jul 2014 A1
20140267614 Ding et al. Sep 2014 A1
20140267688 Aich et al. Sep 2014 A1
20140277691 Jacobus et al. Sep 2014 A1
20140277692 Buzan et al. Sep 2014 A1
20140279294 Field-Darragh et al. Sep 2014 A1
20140300637 Fan et al. Oct 2014 A1
20140316875 Tkachenko et al. Oct 2014 A1
20140330835 Boyer Nov 2014 A1
20140344401 Varney et al. Nov 2014 A1
20140351073 Murphy et al. Nov 2014 A1
20140369607 Patel et al. Dec 2014 A1
20150015602 Beaudoin Jan 2015 A1
20150019391 Kumar et al. Jan 2015 A1
20150029339 Kobres et al. Jan 2015 A1
20150032304 Nakamura et al. Jan 2015 A1
20150039458 Reid Feb 2015 A1
20150052029 Xerox Corporation Feb 2015 A1
20150088618 Basir et al. Mar 2015 A1
20150088701 Desmarais et al. Mar 2015 A1
20150088703 Yan Mar 2015 A1
20150092066 Geiss et al. Apr 2015 A1
20150106403 Haverinen et al. Apr 2015 A1
20150117788 Patel et al. Apr 2015 A1
20150139010 Jeong et al. May 2015 A1
20150154467 Feng et al. Jun 2015 A1
20150161793 Takahashi Jun 2015 A1
20150170256 Pettyjohn et al. Jun 2015 A1
20150181198 Baele et al. Jun 2015 A1
20150195491 Shaburov et al. Jul 2015 A1
20150212521 Pack et al. Jul 2015 A1
20150235157 Avegliano et al. Aug 2015 A1
20150243073 Chen et al. Aug 2015 A1
20150245358 Schmidt Aug 2015 A1
20150262116 Katircioglu et al. Sep 2015 A1
20150279035 Wolski et al. Oct 2015 A1
20150298317 Wang et al. Oct 2015 A1
20150310348 Dessouky et al. Oct 2015 A1
20150310601 Rodriguez et al. Oct 2015 A1
20150332368 Vartiainen et al. Nov 2015 A1
20150352721 Wicks et al. Dec 2015 A1
20150353280 Brazeau et al. Dec 2015 A1
20150355639 Battelle Energy Alliance Llc Dec 2015 A1
20150363625 Wu et al. Dec 2015 A1
20150363758 Wu et al. Dec 2015 A1
20150365660 Wu et al. Dec 2015 A1
20150379704 Chandrasekar et al. Dec 2015 A1
20160026253 Bradski et al. Jan 2016 A1
20160042223 Suh et al. Feb 2016 A1
20160044862 Kocer Feb 2016 A1
20160061591 Pangrazio et al. Mar 2016 A1
20160070981 Sasaki et al. Mar 2016 A1
20160092943 Vigier et al. Mar 2016 A1
20160012588 Taguchi et al. Apr 2016 A1
20160104041 Bowers et al. Apr 2016 A1
20160107690 Oyama et al. Apr 2016 A1
20160112628 Super et al. Apr 2016 A1
20160114488 Mascorro Medina et al. Apr 2016 A1
20160129592 Saboo et al. May 2016 A1
20160132815 Itoko et al. May 2016 A1
20160150217 Popov May 2016 A1
20160156898 Ren et al. Jun 2016 A1
20160163067 Williams et al. Jun 2016 A1
20160171336 Schwartz Jun 2016 A1
20160171429 Schwartz Jun 2016 A1
20160171707 Schwartz Jun 2016 A1
20160185347 Lefevre et al. Jun 2016 A1
20160191759 Somanath et al. Jun 2016 A1
20160224927 Pettersson Aug 2016 A1
20160253735 Scudillo et al. Sep 2016 A1
20160253844 Petrovskaya et al. Sep 2016 A1
20160259329 High et al. Sep 2016 A1
20160260051 Wu et al. Sep 2016 A1
20160260054 High et al. Sep 2016 A1
20160271795 Vicenti Sep 2016 A1
20160290805 Irish et al. Oct 2016 A1
20160313133 Zeng et al. Oct 2016 A1
20160328618 Patel et al. Nov 2016 A1
20160328767 Bonner et al. Nov 2016 A1
20160353099 Thomson et al. Dec 2016 A1
20160364634 Davis et al. Dec 2016 A1
20170004649 Collet Romea et al. Jan 2017 A1
20170011281 Dijkman et al. Jan 2017 A1
20170011308 Sun et al. Jan 2017 A1
20170030538 Geisler et al. Feb 2017 A1
20170032311 Rizzolo et al. Feb 2017 A1
20170041553 Cao et al. Feb 2017 A1
20170054965 Raab et al. Feb 2017 A1
20170066459 Singh Mar 2017 A1
20170074659 Giurgiu et al. Mar 2017 A1
20170083774 Solar et al. Mar 2017 A1
20170084037 Barajas Hernandez et al. Mar 2017 A1
20170109940 Guo et al. Apr 2017 A1
20170147966 Aversa et al. May 2017 A1
20170150129 Pangrazio May 2017 A1
20170178060 Schwartz Jun 2017 A1
20170178227 Gornish Jun 2017 A1
20170178301 Moraleda et al. Jun 2017 A1
20170178310 Gornish Jun 2017 A1
20170193434 Shah et al. Jul 2017 A1
20170205892 Petrovskaya et al. Jul 2017 A1
20170219338 Brown et al. Aug 2017 A1
20170219353 Alesiani Aug 2017 A1
20170227645 Swope et al. Aug 2017 A1
20170227647 Baik Aug 2017 A1
20170228885 Baumgartner Aug 2017 A1
20170261993 Venable et al. Sep 2017 A1
20170262724 Wu et al. Sep 2017 A1
20170280125 Brown et al. Sep 2017 A1
20170286773 Skaff et al. Oct 2017 A1
20170286901 Skaff et al. Oct 2017 A1
20170297478 Sherman et al. Oct 2017 A1
20170323253 Enssle et al. Nov 2017 A1
20170323376 Glaser et al. Nov 2017 A1
20170337508 Bogolea et al. Nov 2017 A1
20180001481 Shah et al. Jan 2018 A1
20180005035 Bogolea et al. Jan 2018 A1
20180005176 Williams et al. Jan 2018 A1
20180020145 Kotfis et al. Jan 2018 A1
20180051991 Hong Feb 2018 A1
20180053091 Savvides et al. Feb 2018 A1
20180053305 Gu et al. Feb 2018 A1
20180075403 Mascorro Medina et al. Mar 2018 A1
20180089613 Chen et al. Mar 2018 A1
20180101813 Paat et al. Apr 2018 A1
20180108120 Venable et al. Apr 2018 A1
20180108134 Venable et al. Apr 2018 A1
20180114183 Howell Apr 2018 A1
20180129201 Douglas et al. May 2018 A1
20180130011 Jacobsson May 2018 A1
20180143003 Clayton et al. May 2018 A1
20180174325 Fu et al. Jun 2018 A1
20180190160 Bryan et al. Jul 2018 A1
20180197139 Hill Jul 2018 A1
20180201423 Drzewiecki et al. Jul 2018 A1
20180204111 Zadeh et al. Jul 2018 A1
20180218218 Madan et al. Aug 2018 A1
20180251253 Taira et al. Sep 2018 A1
20180276596 Murthy et al. Sep 2018 A1
20180281191 Sinyayskiy et al. Oct 2018 A1
20180293442 Fridental et al. Oct 2018 A1
20180293543 Tiwari Oct 2018 A1
20180306958 Goss et al. Oct 2018 A1
20180313956 Rzeszutek et al. Nov 2018 A1
20180314260 Jen et al. Nov 2018 A1
20180314908 Lam Nov 2018 A1
20180315007 Kingsford et al. Nov 2018 A1
20180315065 Zhang et al. Nov 2018 A1
20180315173 Phan et al. Nov 2018 A1
20180315865 Haist et al. Nov 2018 A1
20180321692 Castillo-Effen et al. Nov 2018 A1
20180370727 Hance et al. Dec 2018 A1
20190025838 Artes et al. Jan 2019 A1
20190034854 Borodow et al. Jan 2019 A1
20190049962 Ouellette et al. Feb 2019 A1
20190057588 Savvides et al. Feb 2019 A1
20190065861 Savvides et al. Feb 2019 A1
20190073554 Rzeszutek Mar 2019 A1
20190073559 Rzeszutek et al. Mar 2019 A1
20190073627 Nakdimon et al. Mar 2019 A1
20190077015 Shibasaki et al. Mar 2019 A1
20190087663 Yamazaki et al. Mar 2019 A1
20190094876 Moore et al. Mar 2019 A1
20190108606 Komiyama Apr 2019 A1
20190108678 Hazeghi et al. Apr 2019 A1
20190160675 Paschal, II et al. May 2019 A1
20190178436 Mao et al. Jun 2019 A1
20190180150 Taylor et al. Jun 2019 A1
20190197439 Wang Jun 2019 A1
20190197728 Yamao Jun 2019 A1
20190236530 Cantrell et al. Aug 2019 A1
20190271984 Kingsford Sep 2019 A1
20190304132 Yoda et al. Oct 2019 A1
20190392212 Sawhney et al. Dec 2019 A1
20200049511 Sithiravel et al. Feb 2020 A1
20200053325 Deyle et al. Feb 2020 A1
20200068126 Fink et al. Feb 2020 A1
20200111267 Stauber et al. Apr 2020 A1
20200118064 Perrella et al. Apr 2020 A1
20200150655 Artes et al. May 2020 A1
20200192388 Zhang et al. Jun 2020 A1
20200314333 Liang et al. Oct 2020 A1
20200341151 Yoshida Oct 2020 A1
20200410766 Swaminathan Dec 2020 A1
20210019939 Hu et al. Jan 2021 A1
20210163068 Zhu et al. Jun 2021 A1
20210233305 Garcia et al. Jul 2021 A1
20210271238 Ko et al. Sep 2021 A1
Foreign Referenced Citations (46)
Number Date Country
2835830 Nov 2012 CA
3028156 Jan 2018 CA
102214343 Oct 2011 CN
104200086 Dec 2014 CN
105989512 Oct 2016 CN
107067382 Aug 2017 CN
206952978 Feb 2018 CN
766098 Apr 1997 EP
1311993 May 2007 EP
2309378 Apr 2011 EP
2439487 Apr 2012 EP
2472475 Jul 2012 EP
2562688 Feb 2013 EP
2662831 Nov 2013 EP
2693362 Feb 2014 EP
3400113 Nov 2018 EP
3001567 Aug 2014 FR
2323238 Sep 1998 GB
2330265 Apr 1999 GB
2014170431 Sep 2014 JP
2016194834 Nov 2016 JP
2017016539 Jan 2017 JP
101234798 Jan 2009 KR
1020190031431 Mar 2019 KR
WO 9923600 May 1999 WO
WO 2003002935 Jan 2003 WO
WO 2003025805 Mar 2003 WO
WO 2006136958 Dec 2006 WO
WO 2007042251 Apr 2007 WO
WO 2008057504 May 2008 WO
WO 2008154611 Dec 2008 WO
WO 2012103199 Aug 2012 WO
WO 2012103202 Aug 2012 WO
WO 2012154801 Nov 2012 WO
WO 2013165674 Nov 2013 WO
WO 2014066422 May 2014 WO
WO 2014092552 Jun 2014 WO
WO 2014181323 Nov 2014 WO
WO 2015127503 Sep 2015 WO
WO 2016020038 Feb 2016 WO
WO 2017175312 Oct 2017 WO
WO 2017187106 Nov 2017 WO
WO 2018018007 Jan 2018 WO
WO 2018204308 Nov 2018 WO
WO 2018204342 Nov 2018 WO
WO 2019023249 Jan 2019 WO
Non-Patent Literature Citations (113)
Entry
International Search Report and Written Opinion for International Application No. PCT/US2019/049761 dated Nov. 15, 2019.
Zeng et al. Multi-view Self-supervised Deep Learning for 6D Pose Estimation in the Amazon Picking Challenge, May 7, 2017, retrieved from the Internet at <URL:https://arxiv.org/pdf/1609.09475.pdf> on Oct. 16, 2019.
N.D.F. Campbell et al. “Automatic 3D Object Segmentation in Multiple Views using Volumetric Graph-Cuts”, Journal of Image and Vision Computing, vol. 28, Issue 1, Jan. 2010, pp. 14-25.
Ni et al., “Edge Detection and Feature Line Tracing in 3D-Point Clouds by Analyzing Geometric Properties of Neighborhoods,” Remote Sensing, V8 19, pp. 1-20 (2016).
Norriof et al., “Experimental comparison of some classical iterative learning control algorithms”, IEEE Transactions on Robotics and Automation, Jun. 2002, pp. 636-641.
Notice of allowance for U.S. Appl. No. 13/568,175 mailed on Sep. 23, 2014.
Notice of allowance for U.S. Appl. No. 13/693,503 mailed on Mar. 11, 2016.
Notice of allowance for U.S. Appl. No. 14/068,495 mailed on Apr. 25, 2016.
Notice of allowance for U.S. Appl. No. 14/518,091 dated Apr. 12, 2017.
Notice of allowance for U.S. Appl. No. 15/211,103 dated Apr. 5, 2017.
Olson, Clark F., et al. “Wide-Baseline Stereo Vision for terrain Mapping” in Machine Vision and Applications, Aug. 2010.
Oriolo et al., “An iterative learning controller for nonholonomic mobile Robots”, the international Journal of Robotics Research, Aug. 1997, pp. 954-970.
Ostafew et al., “Visual Teach and Repeat, Repeat, Repeat: Iterative learning control to improve mobile robot path tracking in challenging outdoor environment”, 1 EEE/RSJ International Conference on Intelligent robots and Systems, Nov. 2013, p. 176-181.
Park et al., “Autonomous mobile robot navigation using passive rfid in indoor environment,” IEEE, Transactions on industrial electronics, vol. 56, issue 7, pp. 2366-2373 (Jul. 2009).
Perveen et al. (An overview of template matching methodologies and its application, International Journal of Research in Computer and Communication Technology, v2nl0, Oct. 2013) (Year: 2013).
Pivtoraiko et al., “Differentially constrained mobile robot motion planning in state lattices”, journal of field robotics, vol. 26, No. 3, 2009, pp. 308-333.
Pratt W K Ed: “Digital Image processing, 10-image enhancement, 17-image segmentation”, 2001-01-01, Digital Image Processing: PIKS Inside, New York: John Wily & Sons, US, pp. 243-258, 551.
Puwein, J., et al.“Robust Multi-view camera calibration for wide-baseline camera networks,”in IEEE Workshop on Applications of computer vision (WACV), Jan. 2011.
Rusu, et al. “How to incrementally register pairs of clouds,” PCL Library, retrieved from internet on Aug. 22, 2016 [http://pointclouds.org/documentation/tutorials/pairwise_incremental_registration.php.
Rusu, et al. “Spatial Change detection on unorganized point cloud data,” PCL Library, retrieved from internet on Aug. 19, 2016 [http://pointclouds.org/documentation/tutorials/octree_change.php].
Rusu, et al. “Towards 3D Point cloud based object maps for household environments,” Science Direct, vol. 56, issue 11, pp. 927-947 [http://www.sciencedirect.com/science/article/pii/S0921889008001140], Nov. 30, 2008. Retrieved from the internet on Jun. 15, 2022.
Schnabel et al. “Efficient RANSAC for Point-Cloud Shape Detection”, vol. 0, No. 0, pp. 1-12 (1981).
Senthilkumaran, et al., “Edge Detection Techniques for Image Segmentation-A Survey of Soft Computing Approaches”, International Journal of Recent Trends in Engineering, vol. 1, No. 2 (May 2009).
Szeliski, “Modified Hough Transform”, Computer Vision. Copyright 2011, pp. 251-254. Retrieved on Aug. 17, 2017 [http://szeliski.org/book/drafts/SzeliskiBook_20100903_draft.pdf].
Tahir, Rabbani, et al., “Segmentation of point clouds using smoothness constraint,”International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences 36.5 (Sep. 2006): 248-253.
Trevor et al., “Tables, Counters, and Shelves: Semantic Mapping of Surfaces in 3D,” Retrieved from Internet Jul. 3, 2018 @ http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.703.5365&rep=repl&type=p.
Tseng, et al., “A Cloud Removal Approach for Aerial Image Visualization”, International Journal of Innovative Computing, Information & Control, vol. 9, No. 6, pp. 2421-2440 (Jun. 2013).
Uchiyama, et al., “Removal of Moving Objects from a Street-View Image by Fusing Multiple Image Sequences”, Pattern Recognition, 2010, 20th International Conference On, IEEE, Piscataway, NJ pp. 3456-3459 (Aug. 23, 2010).
United Kingdom Intellectual Property Office, “Combined Search and Examination Report” for GB Patent Application No. 1813580.6 mailed on Feb. 21, 2019.
United Kingdom Intellectual Property Office, Combined Search and Examination Report mailed Jan. 22, 2016 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report mailed Jan. 22, 2016 for GB Patent Application No. 1521272.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report mailed Mar. 11, 2015 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report mailed May 13, 2020 for GB Patent Application No. 1917864.9.
Varol Gul et al: “Product placement detection based on image processing”, 2014 22nd Signal Processing and Communication Applications Conference (SIU), IEEE, Apr. 23, 2014.
Varol Gul et al.: “Toward Retail product recognition on Grocery shelves”, Visual Communications and image processing; Jan. 20, 2004; San Jose, (Mar. 4, 2015).
Weber et al., “Methods for Feature Detection in Point clouds,” visualization of large and unstructured data sets—IRTG Workshop, pp. 90-99 (2010).
Zhao Zhou et al.: “An Image contrast Enhancement Algorithm Using PLIP-based histogram Modification”, 2017 3rd IEEE International Conference on Cybernetics (Cybcon), IEEE, (Jun. 21, 2017).
Ziang Xie et al., “Multimodal Blending for High-Accuracy Instance Recognition”, 2013 IEEE Rsj International Conference on Intelligent Robots and Systems, p. 2214-2221.
Fan Zhang et al., “Parallax-tolerant Image Stitching”, 2014 Computer Vision Foundation, pp. 4321-4328.
Kaimo Lin et al., “SEAGULL: Seam-guided Local Alignment for Parallax-tolerant Image Stitching”, Retrieved on Nov. 16, 2020 [http://publish.illinois.edu/visual-modeling-and-analytics/files/2016/08/Seagull.pdf].
Julio Zaragoza et al., “As-Projective-As-Possible Image Stitching with Moving DLT”, 2013 Computer Vision Foundation, pp. 2339-2346.
Zeng et al., Multi-view Self Supervised Deep Learning for 6D Pose Estimation in the Amazon Picking Challenge, May 7, 2017. Retrieved on Nov. 16, 2019 [https://arxiv.org/pdf/1609.09475.pdf].
Zhang et al., “Mobile computing and industrial augmented reality for real-time data access”, Emerging Technologies and Factory Automation, 2001, 8th IEEE International Conference on Oct. 15-18, 2001, pp. 583-588, vol. 2.
“Fair Billing with Automatic Dimensioning” pp. 1-4, undated, Copyright Mettler-Toledo International Inc.
“Plane Detection in Point Cloud Data” dated Jan. 25, 2010 by Michael Ying Yang and Wolfgang Forstner, Technical Report 1, 2010, University of Bonn.
“Swift Dimension” Trademark Omniplanar, Copyright 2014.
Ajmal S. Mian et al., “Three-Dimensional Model Based Object Recognition and Segmentation in Cluttered Scenes”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, No. 10, Oct. 2006.
Batalin et al., “Mobile robot navigation using a sensor network,” IEEE, International Conference on robotics and automation, Apr. 26, May 1, 2004, pp. 636-641.
Bazazian et al., “Fast and Robust Edge Extraction in Unorganized Point clouds,” IEEE, 2015 International Conference on Digital Image Computing: Techniques and Applicatoins (DICTA), Nov. 23-25, 2015, pp. 1-8.
Boden, “French retail chain to roll out NFC shelf edge labels to six hypermarkets” (Sep. 19, 2018), pp. 1-7.
Biswas et al. “Depth Camera Based Indoor Mobile Robot Localization and Navigation” Robotics and Automation (ICRA), 2012 IEEE International Conference on IEEE, 2012.
Bohm, Multi-Image Fusion for Occlusion-Free Façde Texturing, International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, pp. 867-872 (Jan. 2004).
Bristow et al., “A Survey of Iterative Learning Control”, IEEE Control Systems, Jun. 2006, pp. 96-114.
Buenaposada et al. “Realtime tracking and estimation of plane pose” Proceedings of the ICPR (Aug. 2002) vol. II, IEEE pp. 697-700.
Carreira et al., “Enhanced PCA-based localization using depth maps with missing data,” IEEE, pp. 1-8, Apr. 24, 2013.
Castorena et al., “Autocalibration of lidar and optical cameras via edge alignment”, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (Mar. 20, 2016).
Chen et al. “Improving Octree-Based Occupancy Maps Using Environment Sparsity with Application to Aerial Robot Navigation” Robotics and Automation (ICRA), 2017 IEEE International Conference on IEEE, pp. 3656-3663, 2017.
Clark, “Casino to open world's first NFC-enabled supermarket”, (Sep. 19, 2018), pp. 1-7.
Clark, “Jogtek launches passive NFC shelf-edge labels”, (Sep. 19, 2018), pp. 1-6.
Cleveland Jonas et al: “Automated System for Semantic Object Labeling with Soft-Object Recognition and Dynamic Programming Segmentation”, IEEE Transactions on Automation Science and Engineering, IEEE Service Center, New York, NY (Apr. 1, 2017).
Cook et al., “Distributed Ray Tracing” ACM SIGGRAPH Computer Graphics, vol. 18, No. 3, ACM pp. 137-145, 1984.
Datta, A., et al. “Accurate camera calibration using iterative refinement of control points,” in Computer Vision Workshops (ICCV Workshops), 2009.
Deschaud, et al., “A Fast and Accurate Place Detection algoritm for large noisy point clouds using filtered normals and voxel growing,” 3DPVT, May 2010, Paris, France.
Douillard, Bertrand, et al. “On the segmentation of 3D Lidar point clouds.” Robotics and Automation (ICRA), 2011 IEEE International Conference on IEEE, 2011.
Dubois, M., et al., 'A comparison of geometric and energy-based point cloud semantic segmentation methods, European Conference on Mobile Robots (ECMR), pp. 88-93, 25-27, Sep. 2013.
Duda, et al., “Use of the Hough Transformation to Detect Lines and Curves in Pictures”, Stanford Research Institute, Menlo Park, California, Graphics and Image Processing, Communications of the ACM, vol. 15, No. 1 (Jan. 1972).
F.C.A. Groen et al., “The smallest box around a package,” Pattern Recognition, vol. 14, No. 1-6, Jan. 1, 1981, pp. 173-176, XP055237156, GB, ISSN: 0031-3203, DOI: 10.1016/0031-3203(81(90059-5 p. 176-p. 178.
Federico Tombari et al. “Multimodal cue integration through Hypotheses Verification for RGB-D object recognition and 6DOF pose estimation”, IEEE International Conference on Robotics and Automation, Jan. 2013.
Flores, et al., “Removing Pedestrians from Google Street View Images”, Computer Vision and Pattern Recognition Workshops, 2010 IEEE Computer Society Conference On, IEE, Piscataway, NJ, pp. 53-58 (Jun. 13, 2010).
Glassner, “Space Subdivision for Fast Ray Tracing.” IEEE Computer Graphics and Applications, 4.10, pp. 15-24, 1984.
Golovinskiy, Aleksey, et al. “Min-Cut based segmentation of point clouds.” Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on. IEEE, 2009.
Hackel et al., “Contour Detection in unstructured 3D point clouds,”IEEE, 2016 Conference on Computer vision and Pattern recognition (CVPR), Jun. 27-30, 2016, pp. 1-9.
Hao et al., “Structure-based object detection from scene point clouds,” Science Direct, V191, pp. 148-160 (2016).
Hu et al., “An improved method of discrete point cloud filtering based on complex environment,” International Journal of Applied Mathematics and Statistics, v48, i18 (2013).
International Search Report and Written Opinion for International Patent Application No. PCT/US2013/070996 dated Apr. 2, 2014.
International Search Report and Written Opinion for International Patent Application No. PCT/US2013/053212 dated Dec. 1, 2014.
International Search Report and Written Opinion for corresponding International Patent Application No. PCT/US2016/064110 dated Mar. 20, 2017.
International Search Report and Written Opinion for corresponding International Patent Application No. PCT/US2017/024847 dated Jul. 7, 2017.
International Search Report and Written Opinion for International Application No. PCT/CN2017/083143 dated Feb. 11, 2018.
International Search Report and Written Opinion for International Application No. PCT/US2018/030419 dated Aug. 31, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030345 dated Sep. 17, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030360 dated Jul. 9, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030363 dated Jul. 9, 2018.
International Search Report and Written Opinion for International Application No. PCT/US2019/025859 dated Jul. 3, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/025849 dated Jul. 9, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/049761 dated Nov. 15, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/051312 dated Nov. 15, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/054103 dated Jan. 6, 2020.
International Search Report and Written Opinion for International Patent Application No. PCT/US2019/057007 dated Jan. 14, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/064020 dated Feb. 19, 2020.
International Search Report and Written Opinion for International Patent Application No. PCT/US2020/027948 dated Jul. 16, 2020.
International Search Report and Written Opinion for International Patent Application No. PCT/US2020/028133 dated Jul. 24, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/029134 dated Jul. 27, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/028183 dated Jul. 24, 2020.
International Search Report and Written Opinion from International Patent Application No. PCT/US2020/035285 dated Aug. 27, 2020.
International Search Report and Written Opinion for International Patent Application No. PCT/US2021/024805 dated Aug. 2, 2021.
International Search Report and Written Opinion for International Patent Application No. PCT/US2021/057388 dated Feb. 2, 2022.
International Search Report and Written Opinion for International Patent Application No. PCT/IB2021/060948 dated Feb. 4, 2022.
Jadhav et al. “Survey on Spatial Domain dynamic template matching technique for scanning linear barcode,” International Journal of science and research v 5 n 3, Mar. 2016)(Year: 2016).
Jian Fan et al: “Shelf detection via vanishing point and radial projection”, 2014 IEEE International Conference on image processing (ICIP), IEEE, (Oct. 27, 2014), pp. 1575-1578.
Kaikai Liu et al., “Enabling Context-Aware Indoor Augmented Reality via Smartphone Sensing and Vision Tracking”, ACM Transactions on Multimedia Computing Communications and Applications, Association for Computer Machinery, US, vol. 12, No.
Kang et al., “Kinematic Path-Tracking of Mobile Robot Using Iterative learning Control”, Journal of Robotic Systems, 2005, pp. 111-121.
Kay et al. “Ray Tracing Complex Scenes.” ACM SIGGRAPH Computer Graphics, vol. 20, No. 4, ACM, pp. 269-278, 1986.
Kelly et al., “Reactive Nonholonomic Trajectory Generation via Parametric Optimal Control”, International Journal of Robotics Research, vol. 22, No. 7-8, pp. 583-601 (Jul. 30, 2013).
Lari, Z., et al., “An adaptive approach for segmentation of 3D laser point cloud.” International Archives of the Photogrammertry, Remote sensing and spatial information Sciences, vol. XXXVIII-5/W12, 2011, ISPRS Calgary 2011 Workshop, Aug. 29-31, 2011, Calgary, Canada.
Lecking et al.: “Localization in a wide range of industrial environments using relative 3D ceiling features”, IEEE, pp. 333-337 (Sep. 15, 2008).
Lee et al. “Statistically Optimized Sampling for Distributed Ray Tracing.” ACM SIGGRAPH Computer Graphics, vol. 19, No. 3, ACM, pp. 61-67, 1985.
Li et al., “An improved RANSAC for 3D Point cloud plane segmentation based on normal distribution transformation cells,” Remote sensing, V9: 433, pp. 1-16 (2017).
Likhachev, Maxim, and Dave Ferguson. “Planning Long dynamically feasible maneuvers for autonomous vehicles.” The international journal of Robotics Reasearch 28.8 (2009): 933-945. (Year:2009).
Marder-Eppstein et al., “The Office Marathon: robust navigation in an indoor office environment,” IEEE, 2010 International conference on robotics and automation, May 3-7, 2010, pp. 300-307.
McNaughton, Matthew, et al. “Motion planning for autonomous driving with a conformal spatiotemporal lattice.” Robotics and Automation (ICRA), 2011 IEEE International Conference on. IEEE, 2011. (Year: 2011).
Meyersohn, “Walmart turns to robots and apps in stores”, https://www.cnn.com/2018/12/07/business/walmart-robot-janitors-dotcom-store/index.html, Oct. 29, 2019.
Mitra et al., “Estimating surface normals in noisy point cloud data,” International Journal of Computational geometry & applications, Jun. 8-10, 2003, pp. 322-328.
Related Publications (1)
Number Date Country
20200109939 A1 Apr 2020 US