Parallax-tolerant panoramic image generation

Information

  • Patent Grant
  • 11593915
  • Patent Number
    11,593,915
  • Date Filed
    Wednesday, October 21, 2020
    4 years ago
  • Date Issued
    Tuesday, February 28, 2023
    2 years ago
Abstract
A method for generating a parallax-tolerant panoramic image includes obtaining a point cloud captured by a depth sensor, the point cloud representing a support structure bearing a set of objects; obtaining a set of images of the support structure and the set of objects, the set of images captured by an image sensor from a plurality of positions alongside a length of the support structure; generating a mesh structure using the point cloud, the mesh structure including a plurality of patches and representing a surface of the support structure and the set of objects; for each patch in the mesh structure, selecting an image from the set of images and projecting the selected image to the mesh patch; and generating an orthographic projection of the mesh structure onto a shelf plane of the support structure.
Description
BACKGROUND

Environments in which objects are managed, such as retail facilities, warehousing and distribution facilities, and the like, may store such objects in regions such as aisles of shelf modules or the like. For example, a retail facility may include objects such as products for purchase, and a distribution facility may include objects such as parcels or pallets. A mobile automation apparatus may be deployed within such facilities to perform tasks at various locations. For example, a mobile automation apparatus may be deployed to capture data representing support structures in a retail facility for use in detecting product status information. The mixed depth of objects on the support structures may vary along the aisle, however, which may complicate image stitching when generating a panoramic image of the support structure and reduce the accuracy of status information detected from the captured data.





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. 2 is a side view of a mobile automation apparatus in the system of FIG. 1.



FIG. 3 is a block diagram of certain internal components of the server of FIG. 1.



FIG. 4 is a diagram of a shelf module, shown in perspective and from the side.



FIG. 5 is a flowchart of a method of generating a panoramic image of a support structure.



FIG. 6 is a diagram illustrating data captured via an example performance of blocks 505 and 510 of the method of FIG. 5.



FIG. 7 is a diagram illustrating data obtained via a performance of block 515 of the method of FIG. 5.



FIG. 8 is a flowchart of a method of performing block 520 of the method of FIG. 5.



FIG. 9 is a flowchart of a method of performing block 520 of the method of FIG. 5.



FIG. 10 is a diagram illustrating an example performance of block 525 of the method of FIG. 5.



FIG. 11 is a diagram illustrating an orthographic projection generated at block 535 of the method of FIG. 5.





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, comprising: obtaining a point cloud captured by a depth sensor, the point cloud representing a support structure bearing a set of objects; obtaining a set of images of the support structure and the set of objects, the set of images captured by an image sensor from a plurality of positions alongside a length of the support structure; generating a mesh structure using the point cloud, the mesh structure including a plurality of cells and representing a surface of the support structure and the set of objects; for each cell in the mesh structure, selecting an image from the set of images and projecting the selected image to the cell; and generating an orthographic projection of the mesh structure onto a shelf plane of the support structure.


Additional examples disclosed herein are directed to a computing device, comprising: a memory; a processor interconnected with the memory, the processor configured to: obtain a point cloud representing a support structure bearing a set of objects; obtain a set of images of the support structure and the set of objects, the set of images captured from a plurality of positions alongside a length of the support structure; generate a mesh structure using the point cloud, the mesh structure including a plurality of cells and representing a surface of the support structure and the set of objects; for each cell in the mesh structure, select an image from the set of images and project the selected image to the cell; and generate an orthographic projection of the mesh structure onto a shelf plane of the support structure.



FIG. 1 depicts a mobile automation system 100 in accordance with the teachings of this disclosure. 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 104 via communication links 105, illustrated in the present example as including wireless links. In the present example, the links 105 are provided by a wireless local area network (WLAN) deployed via one or more access points (not shown). In other examples, the server 101, the client device 104, or both, are located remotely (i.e. outside the environment in which the apparatus 103 is deployed), and the links 105 therefore include wide-area networks such as the Internet, mobile networks, and the like. The system 100 also includes a dock 106 for the apparatus 103 in the present example. The dock 106 is in communication with the server 101 via a link 107 that in the present example is a wired link. In other examples, however, the link 107 is a wireless link.


The client computing device 104 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 104 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 104 in communication with the server 101 via respective links 105.


The system 100 is deployed, in the illustrated example, in a retail facility including a plurality of support structures such as shelf modules 110-1, 110-2, 110-3 and so on (collectively referred to as shelf modules 110 or shelves 110, and generically referred to as a shelf module 110 or shelf 110—this nomenclature is also employed for other elements discussed herein). 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. A variety of other support structures may also be present in the facility, such as pegboards and the like.


The shelf modules 110 (also referred to as sub-regions of the facility) are typically arranged in a plurality of aisles (also referred to as regions of the facility), 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 facility, 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 the support surface 117-3 and to 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 apparatus 103 is equipped with a plurality of navigation and data capture sensors 108, 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 is deployed within the retail facility and, via communication with the server 101 and use of the sensors 108, navigates autonomously or partially autonomously along a length 119 of at least a portion of the shelves 110.


While navigating among the shelves 110, the apparatus 103 can capture images, depth measurements and the like, representing the shelves 110 (generally referred to as shelf data or captured data). Navigation may be performed according to a frame of reference 102 established within the retail facility. The apparatus 103 therefore tracks its pose (i.e. location and orientation) in the frame of reference 102.


The server 101 includes a special purpose 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 is interconnected with a non-transitory computer readable storage medium, such as a memory 122, having stored thereon computer readable instructions for performing various functionality, including control of the apparatus 103 to navigate the modules 110 and capture shelf data, as well as post-processing of the shelf data. The memory 122 can also store data for use in the above-mentioned control of the apparatus 103, such as a repository 123 containing a map of the retail environment and any other suitable data (e.g. operational constraints for use in controlling the apparatus 103, data captured by the apparatus 103, and the like).


The memory 122 includes a combination of volatile memory (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 a 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 104 and the dock 106—via the links 105 and 107. The links 105 and 107 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 facility via the deployment of one or more wireless access points. The links 105 therefore include either or both wireless links between the apparatus 103 and the mobile device 104 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 processor 120 can therefore obtain data captured by the apparatus 103 via the communications interface 124 for storage (e.g. in the repository 123) 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 maintains, in the memory 122, an application 125 executable by the processor 120 to perform such subsequent processing. In particular, as discussed in greater detail below, the server 101 is configured, via execution of the instructions of the application 125 by the processor 120, to generate a panoramic image of a shelf structure, such as one of the shelf modules 110 along the length 119.


The server 101 may also transmit status notifications (e.g. notifications indicating that products are out-of-stock, in low stock or misplaced) to the client device 104 responsive to the determination of product status data. The client device 104 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.


Turning now to FIG. 2, the mobile automation apparatus 103 is shown in greater detail. The apparatus 103 includes a chassis 201 containing a locomotive assembly 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 108 mentioned earlier. In particular, the sensors 108 include at least one imaging sensor 207, such as a digital camera. In the present example, the mast 205 supports seven digital cameras 207-1 through 207-7 oriented to face the shelves 110.


The mast 205 also supports at least one depth sensor 209, such as a 3D digital camera capable of capturing both depth data and image data. The apparatus 103 also includes additional depth sensors, such as LIDAR sensors 211. In the present example, the mast 205 supports two LIDAR sensors 211-1 and 211-2. As shown in FIG. 2, the cameras 207 and the LIDAR sensors 211 are arranged on one side of the mast 205, while the depth sensor 209 is arranged on a front of the mast 205. That is, the depth sensor 209 is forward-facing (i.e. captures data in the direction of travel of the apparatus 103), while the cameras 207 and LIDAR sensors 211 are side-facing (i.e. capture data alongside the apparatus 103, in a direction perpendicular to the direction of travel). In other examples, the apparatus 103 includes additional sensors, such as one or more RFID readers, temperature sensors, and the like.


The mast 205 also supports a plurality of illumination assemblies 213, configured to illuminate the fields of view of the respective cameras 207. The illumination assemblies 213 may be referred to collectively as an illumination subsystem. That is, the illumination assembly 213-1 illuminates the field of view of the camera 207-1, and so on. The cameras 207 and lidars 211 are oriented on the mast 205 such that the fields of view of the sensors each face a shelf 110 along the length 119 of which the apparatus 103 is traveling. The apparatus 103 is configured to track a pose of the apparatus 103 (e.g. a location and orientation of the center of the chassis 201) in the frame of reference 102, permitting data captured by the apparatus 103 to be registered to the frame of reference 102 for subsequent processing.


Turning to FIG. 3, certain components of the application 125 are illustrated. As will be apparent to those skilled in the art, the application 125 can also be implemented as a suite of distinct applications in other examples. Further, some or all of the modules described below can be implemented via distinct control hardware such as one or more ASICs and/or FPGAs.


The application 125 includes a mesh structure generator 304 that is configured to generate a mesh structure or a tessellation based on the point cloud data. The mesh structure is a plurality of polygonal cells which represent the surface profile of the support structure and the objects on the support structure captured by the point cloud data.


The application 125 also includes an image selector 308 that is configured to select an image for projection onto a cell or a group of cells of the mesh. In particular, the image selector 308 may use the point cloud data to obtain the 3D coordinates of the cell or group of cells, and use the image data to identify one or more images which map to the identified 3D coordinates of the cell or group of cells. For example, the image selector 308 may use a mapping of the 2D images onto the 3D point cloud (e.g., determined by another component of the server 101 or a separate computing device) to select images to map to the cell or group of cells. In particular, the image selector 308 selects a single image for each cell or group of cells, for example, based on the projection area of the cell within the image, the number of cells covered by the image, reduction of glare or other image defects, or the like. The image selector 308 may additionally project the selected image onto the cell or group of cells.


The application 125 also includes an orthographic projector 312 that is configured to generate an orthographic projection of the mesh structure. In particular, once each cell of the mesh structure has an image projected onto it, the orthographic projection may represent a panoramic image of the support structure. That is, when the orthographic projector projects the mesh structure onto a shelf plane, such as a plane corresponding to the shelf back of the support structure, a plane including the shelf edges of shelves of the support structure, or another plane parallel to the XZ-plane, as defined by the frame of reference 102, the resulting orthographic projection represents a panoramic image of the shelf structure as viewed from the aisle along the length of the support structure. Notably, by the nature of the orthographic projection, depth and perspective effects are lost (i.e., objects further away will appear the same size as closer objects).



FIG. 4 illustrates a module 410 including two shelves. As discussed in connection with the modules 110 in FIG. 1, the shelves of the module 410 includes support surfaces 417-1 and 417-2 extending from a shelf back 416 to respective shelf edges 418-1 and 418-2. The shelf edge 418-2 supports two labels 420-1 and 420-2, corresponding to products 412-1 and 412-2, respectively. The shelf edge 418-1, meanwhile, supports a label 420-3 corresponding to products 412-3, of which three (412-3a, 412-3b, and 412-3c) are depicted.



FIG. 4 also includes a side view of the module 410, showing that the shelf edges 418-1 and 418-2 are at a different depth (i.e. position along the Y axis of the frame of reference 102) than the shelf edge 418-3. Additionally, the products 412-1, 412-2 and 412-3 are at different depths from one another, and the products 412-3 are at different depths amongst themselves. The different depths of the shelf edges 418 and the products 412 can negatively affect the accuracy of image stitching because the difference in depths can cause a parallax effect based on the different apparent distances between objects when viewed from different angles.


Some solutions may use grid distortion to align images for parallax-tolerant image stitching, however the grid distortion is particularly visible in straight lines, such as shelves and other salient structures, and hence is impractical to generate a panoramic image to be used for object detection.


The server 101 is therefore configured, as described below in greater detail, to generate a panoramic image using image projection onto a mesh structure and an orthographic projection to reduce parallax effects of the panoramic image generation while avoiding grid distortion.



FIG. 5 shows a flowchart of a method 500 of generating a panoramic image of a support structure, such as the module 410. The method 500 as described below is performed by the server 101, and in particular by the application 125. In other examples, however, at least some of the functionality implemented via the method 500 can be performed by another computing device, such as the apparatus 103.


At block 505, the server 101 is configured to obtain depth data (i.e., one or more point clouds) representing a support structure. The point cloud includes a plurality of points with coordinates defined in three dimensions, e.g. according to the frame of reference 102, captured by the apparatus 103 e.g. while traversing an aisle including support structures such as the module 410. A plurality of individual point clouds can be obtained at block 505, however in the discussion below a single point cloud will be discussed for clarity of illustration. The single point cloud can be produced from multiple individual point cloud captures by the apparatus 103. The point cloud obtained at block 505 may be retrieved from the repository 123, for example.


At block 510, the server is configured to obtain image data representing the support structures. The image data includes a plurality of 2D images previously captured by the apparatus 103, during the above-mentioned traversal of the support structures. That is, the plurality of images is captured from a plurality of positions in the aisle, alongside a length of the module 410. In particular, the plurality of images may include multiple views of the module 410 such that each object is shown in more than one image, including from different angles.



FIG. 6 illustrates an example point cloud 600 and an example set 604 of images obtained at block 505. As is evident from FIG. 6, the point cloud 600 depicts the module 410. The labels 420 are not shown in the point cloud 600, because they are coplanar with the shelf edges 418 in this example, and therefore may not be distinguishable from the shelf edges 418 from the point cloud 600 alone. The set 604 of images also depict the module 410, with each image corresponding to a particular portion of the module 410 as the apparatus traverses the length of the module 410. An example portion corresponding to the first image 608-1 in the set 604 is illustrated. As seen in FIG. 6, the images 608-1 and 608-2 overlap, such that each object (e.g., products 412) are shown in more than one image. Further, as can be seen, different portions of the products 412 are visible in each of the images, at different angles and with different perspectives. The perspective further affects the apparent distance d1 and d2 between the products 412-3a and 412-3c. When panoramic images are created by stitching together the images 608-1 and 608-2, the differences between the apparent distances d1 and d2 creates a parallax effect in the panoramic image.


Returning to FIG. 5, following acquisition of the set of images and the point cloud, at block 515, the server 101 and in particular the mesh generator 304 is configured to use the point cloud to generate a mesh structure (also referred to interchangeably as a tessellation or a surface reconstruction). The mesh structure may be defined by a series vertices, edges and faces. In particular, the faces may be polygonal cells. The mesh structure generally represents the surfaces of the support structure (e.g., the module 410) and the objects supported on the support structure (e.g., the products 412). The polygonal cells may be triangles, quadrilaterals, or other suitable polygons. In some examples, the mesh generator 304 may employ a surface reconstruction algorithm specifically optimized for orthographic projections. For example, the mesh generator 304 may apply a Poisson reconstruction or a mean least squares (MLS) reconstruction. In other examples, the mesh generator 304 may generate a depth map, subdivide it into N×N pixel squares, and define two triangular cells from each square.



FIG. 7 illustrates an example mesh structure 700. The mesh structure 700 may be derived from the point cloud 600 and depicts the module 410. The mesh structure represents the surfaces of the module 410, including the surfaces of the products 412, the shelves 417, including the shelf edges 418, and the shelf back 416. As with the point cloud 600, the labels 420 are not shown because they are coplanar with the shelf edges 418 and therefore may not be distinguishable from the shelf edges 418. The mesh structure 700 may employ suitable polygonal shapes, including irregular shapes, to represent the surfaces of the module 410 and the products 412.


Returning again to FIG. 5, at block 520, the server 101, and in particular the image selector 308, is configured to select a polygonal cell of the mesh structure which does not yet have an image mapped to it and select an image to apply to the cell. In some examples, the server 101 may identify a plurality of neighboring cells of the selected cell in the mesh structure which form group of cells representing at least a portion of a surface. The server 101 may then select a single image to apply to the group of cells. The server 101 may select the image to apply based on the projection area of the selected cell in the image, the pose of the image sensor during capture of the image (i.e., to determine whether the cell is visible in the image), the sharpness of the image, the number of cells covered by the image, reduction of glare or other image defects, or the like.


For example, FIG. 8 illustrates a method 800 of selecting an image to map to a cell of the mesh structure.


At block 805, having selected a cell to map an image to, the server 101 is configured to obtain the 3D coordinates of the cell using the point cloud. For example, the since the mesh structure may define the vertices of each cell by their respective 3D coordinates, the server 101 may simply retrieve the 3D coordinates defined in the mesh structure.


At block 810, the server 101 is configured to identify a subset of the images captured by the apparatus 103 which correspond to the 3D coordinates of the cell, as defined by the mesh structure. For example, the server 101 may map the set 604 of images onto the 3D point cloud and store an association between the images and portions of the images and the 3D point cloud. Accordingly, the mapping may be retrieved from the repository 123, for example. An image may then be determined to correspond to the 3D coordinates of the cell when the image is mapped to the 3D coordinates of the cell (i.e., includes image data for the cell).


At block 815, the server 101 selects the image having the largest projection area for the region corresponding to the selected cell. This may generally correspond to an image captured from an angle substantially perpendicular to the cell. For example, for a cell corresponding to an outward facing surface of a product, the image with the largest projection area may correspond to an image captured at a position substantially directly in front of the product. Additionally, an image captured from a closer distance to the cell may generally have a larger projection area for a given cell than an image captured from a further distance from the cell.


At block 820, the server 101 determines whether the selected image has glare or other unwanted image artifacts or distortions (e.g., discoloration, blur, or the like) within the region corresponding to the selected cell.


If the determination at block 820 is affirmative, the server 101 returns to block 815 to select the image having the next largest projection area for the region corresponding to the selected cell. The server 101 may therefore iterate through the images to select the image with the largest projection area with few to no distortions in the region corresponding to the selected cell. In some examples, if all the images have some distortions, the server 101 may be configured to select the image with the least amount of distortion.


If the determination at block 820 is negative, the server 101 proceeds to block 825 to select the image. Thus, when the resulting panoramic image is generated, each cell may be represented by the image with the largest projection area of the cell and fewest artifacts or other distortions to allow for more robust processing of the products and the labels on the support structure. Having selected the image, the server 101 may proceed to block 525 of the method 500.


In some examples, rather than selecting an image for a single cell, the server 101 may be configured to select an image to be applied to a group of cells to increase continuity of an image on a particular surface. For example, FIG. 9 illustrates a method 900 of selecting an image for a group of cells of the mesh structure.


The method 900 is initiated at block 905 after selecting a cell to map an image to at block 520. At block 905, the server 101 may be configured to identify a group of neighboring cells for the selected cell. The group of cells may generally correspond to a surface or a portion of a surface represented by the selected cell. For example, if the cell selected at block 520 corresponds to a region of a front surface of one of the products 412-3, the group of cells identified at block 905 may correspond to a larger region of or substantially the entire front surface of the product 412-3. In particular, based on the image selection, as described below, the group of cells may be grouped on a surface to minimize jumps in image selection and maximize image quality for each of the cells in the group. The group of cells may be selected from cells in the mesh structure which do not yet have a mapped image.


At block 910, the server 101 selects an image to map to the group of cells. For example, the server 101 may select an image based on by combining independently selected optimal images for each cell in the group of cells. For example, the server 101 may independently identify, for each cell in the group, one or more suitable images for use in mapping. The server 101 may then select the image which is identified as a suitable image for the highest proportion of cells in the group (i.e., the highest voted image). That is, the server 101 may obtain the 3D coordinates of each of the cells in the group of cells and select the image which corresponds to the highest proportion of the cells based on the 3D coordinates and the image mapping to the point cloud. In other examples, the voting may be weighted for each cell based on a ranking of the suitable images and/or the presence of undesirable artifacts or distortions.


As will be appreciated, in some examples, the selection of the group of cells at block 905 and the selection of the image to map at block 910 may be performed simultaneously and in consideration of one another, for example via the Potts model. For example, after independently identifying, for each cell in the group, one or more suitable images for use in mapping, including a highest ranked (e.g., an image having the largest projection area for the particular cell), the server 101 may apply a regularization term that penalizes jumps (i.e., different image selections) between adjacent cells. Thus, the selected group of cells may be tuned so that a maximum number of cells is covered by the image and jumps of selected images between cells is minimized. Thus, the server 101 may obtain a global solution to optimize image quality for each individual cell while providing regularization in the image selection between cells.


Returning to FIG. 5, at block 525, the server 101, and in particular the image selector 308, is configured to project the image onto the selected cell. The projection of the selected image onto the selected cell allows the server 101 to identify a portion of the image corresponding to the cell. The portion of the image corresponding to the cell may then be stored in association with the cell. That is, the mesh structure may be updated to define the vertices, edges, and face of each cell, as well as image data for the portion of the image projected onto the cell.


For example, FIG. 10 illustrates an example performance of the selection of an image for a cell at block 520 and the projection of the image onto the cell at block 525 is depicted.


In particular, a portion 1000 of the mesh structure 700 is depicted. The portion 1000 includes sub-portions 1004-1, 1004-2 and 1004-3 corresponding to each of the products 412-2a, 412-2b and 412-2c, respectively.


For example, the server 101 may select a cell corresponding to the sub-portion 1004-1. Based on a correspondence of the 3D coordinates of the cell, the server 101 may identify a group of cells corresponding to a front face 1008-1 of the sub-portion 1004-1 as a group of cells to be mapped together. That is, since the group of cells corresponding to the front face 1008-1 represent a single continuous surface, it may be advantageous to map a single image to as many of them as possible for continuity of the image on the surface (e.g., to minimize the number of jumps between adjacent cells). The server 101 may identify the front face 1008-1 as corresponding to the front face of the product 412-2a. Accordingly, the server 101 may select the image 608-2 which includes the entirety of the front face of the product 412-2a as the selected image to map to the front face 1008-1. The server 101 may then project the portion of the image 608-2 corresponding to the front face 1008-1 onto the front face 1008-1. The server 101 may update the mesh structure to be defined not only by the edges, vertices and faces of the cells corresponding to the front face 1008-1, but also by the portion of the image 608-2 projected onto the group of cells. That is, the mesh structure may be updated with a mapped portion 1012-1 defined by the group of cells of the front face 1008-1 and the image projected thereon.


Similarly, the server 101 may select a cell corresponding to the sub-portion 1004-3 and based on the correspondence of the 3D coordinates of the cell, the server 101 may identify a group of cells corresponding to a front face 1008-3 of the sub-portion 1004-3 as a group of cells to be mapped together. The server 101 may then select the image 608-2 which corresponds to a more direct view of the front face of the product 412-2c as the selected image to map to the front face 1008-3. The server 101 may additionally identify glare or another image artifact in the image 608-2 and hence may additionally select the image 608-1 for a portion of the group of cells corresponding to the front face 1008-3 (e.g., on a further iteration of the method 500). Accordingly, the server 101 may update the mesh structure to include mapped portions 1012-2 and 1012-3 defined by the groups of cells and having portions of both of the images 608 projected thereon.


Returning again to FIG. 5, at block 530, the server 101 determines whether any blank or unmapped cells remain in the mesh structure. If the determination at block 530 is affirmative, the server 101 returns to block 520 to select another unmapped cell and select an image.


If the determination at block 530 is negative, the server 101 proceeds to block 535. At block 535, the server 101, and in particular the orthographic projector 312 generates an orthographic projection. Since the mesh structure is generated based on point cloud data taken along the length of the support structure, the entire support structure is captured in the mesh structure. Accordingly, the orthographic projector 312 may project the mesh structure onto a shelf plane (i.e., a plane parallel to the XZ-plane) to similarly capture the entirety of the support structure along its length. Further, since the mesh structure is updated with image data corresponding to each cell of the mesh structure, the orthographic projection includes the image data for the support structure, and therefore forms a panoramic image of the support structure along its length.


In some examples, prior to generating the orthographic projection, the server 101 may apply color adjustments, balancing, smoothing of seams or other image processing filters on the mapped mesh structure (i.e., the mesh structure with the images projected thereon) to improve the quality of the resulting orthographic projection.


For example, FIG. 11 shows an orthographic projection 1100 of the mapped mesh structure of the module 410. Notably, since the panoramic image of the support structure is generated using an orthographic projection, perspective effects are lost. That is, the two visible products 412-3 which are at different depths on the shelf 417-1 may appear to be the same size. Further, since the panoramic image does not stitch together images which depict different apparent distances between objects viewed from different angles, the panoramic image does not encounter ghosting artifacts due to parallax. That is, the distances between objects are in the panoramic image generated by the presently described method are objectively determined based on the point cloud and the orthographic projection, rather than being dependent on the angle of the image capture, which provides a parallax-tolerant panoramic image of the support structure.


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, comprising: obtaining a point cloud captured by a depth sensor, the point cloud representing a support structure bearing a set of objects;obtaining a set of images of the support structure and the set of objects, the set of images captured by an image sensor from a plurality of positions alongside a length of the support structure;generating a mesh structure using the point cloud, the mesh structure including a plurality of cells and representing a surface of the support structure and the set of objects;for each cell in the mesh structure, selecting an image from the set of images and projecting the selected image to the cell; andgenerating an orthographic projection of the mesh structure onto a shelf plane of the support structure,wherein selecting the image comprises: obtaining 3D coordinates of the cell,identifying a subset of the images which correspond to the 3D coordinates of the cell, andselecting the image from the subset of the images.
  • 2. The method of claim 1, wherein selecting the image from the subset comprises selecting the image having a largest projection area for a region corresponding to the selected cell.
  • 3. The method of claim 1, wherein selecting the image from the subset comprises: obtaining a first image from the subset;determining whether the first image includes image artifacts within a region corresponding to the cell;when the first image includes image artifacts within the region corresponding to the cell, selecting a second image from the subset;when the first image does not include image artifacts within the region corresponding to the cell, selecting the first image.
  • 4. The method of claim 1, further comprising: identifying a group of cells corresponding to at least a portion of a surface represented by the selected cell;wherein selecting the image comprises selecting the image for the group of cells.
  • 5. The method of claim 4, wherein selecting the image comprises: determining 3D coordinates of each of the cells in the group of cells; andselecting the image corresponding to a highest proportion of the cells based on the 3D coordinates of the cells.
  • 6. The method of claim 1, wherein projecting the image onto the cell comprises updating the mesh structure to store a portion of the image corresponding to the cell in association with the cell.
  • 7. The method of claim 1, wherein the mesh structure is optimized for the orthographic projection.
  • 8. The method of claim 1, wherein the shelf plane represents a shelf back of the support structure.
  • 9. The method of claim 1, wherein the shelf plane includes shelf edges of a set of shelves of the support structure.
  • 10. A computing device comprising: a memory;a processor interconnected with the memory, the processor configured to: obtain a point cloud representing a support structure bearing a set of objects;obtain a set of images of the support structure and the set of objects, the set of images captured from a plurality of positions alongside a length of the support structure;generate a mesh structure using the point cloud, the mesh structure including a plurality of cells and representing a surface of the support structure and the set of objects;for each cell in the mesh structure, select an image from the set of images and project the selected image to the cell; andgenerate an orthographic projection of the mesh structure onto a shelf plane of the support structure,wherein, to select the image, the processor is configured to: obtain 3D coordinates of the cell,identify a subset of the images which correspond to the 3D coordinates of the cell, andselect the image from the subset of the images.
  • 11. The computing device of claim 10, wherein, to select the image from the subset, the processor is configured to select the image having a largest resolution for a region corresponding to the selected cell.
  • 12. The computing device of claim 10, wherein, to select the image from the subset, the processor is configured to: obtain a first image from the subset;determine whether the first image includes image artifacts within a region corresponding to the cell;when the first image includes image artifacts within the region corresponding to the cell, select a second image from the subset;when the first image does not include image artifacts within the region corresponding to the cell, select the first image.
  • 13. The computing device of claim 10, wherein the processor is further configured to: identify a group of cells corresponding to at least a portion of a surface represented by the selected cell;wherein select the image comprises selecting the image for the group of cells.
  • 14. The computing device of claim 13, wherein to select the image, the processor is configured to: determine 3D coordinates of each of the cells in the group of cells; andselect the image corresponding to a highest proportion of the cells based on the 3D coordinates of the cells.
  • 15. The computing device of claim 10, wherein to project the image onto the cell, the processor is configured to update the mesh structure to store a portion of the image corresponding to the cell in association with the cell.
  • 16. The computing device of claim 10, wherein the mesh structure is optimized for the orthographic projection.
  • 17. The computing device of claim 10, wherein the computing device is a server.
  • 18. The computing device of claim 10, wherein the computing device is a mobile apparatus.
  • 19. The computing device of claim 18, wherein the mobile apparatus further comprises: a depth sensor configured to capture the point cloud; and an image sensor configured to capture the set of images.
US Referenced Citations (497)
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 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
9517767 Kentley et al. Dec 2016 B1
9542746 Wu et al. Jan 2017 B2
9547838 Larsen Jan 2017 B2
9549125 Goyal et al. Jan 2017 B1
9562971 Shenkar 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
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 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 Ahern 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
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 Plagemann et al. 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 Flohr et al. 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 Wu et al. 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 Jul 2015 A1
20150212521 Pack et al. Jul 2015 A1
20150235157 Avegliano et al. Aug 2015 A1
20150243073 Chen 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
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 Versteeg et al. 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 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 Jun 2017 A1
20170178310 Gornish Jun 2017 A1
20170193434 Shah et al. Jul 2017 A1
20170205892 Petrovskaya 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 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
20190034864 Skaff 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 Paschall II et al. May 2019 A1
20190178436 Mao et al. Jun 2019 A1
20190180150 Taylor 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 Feb 2020 A1
20200111267 Stauber et al. Apr 2020 A1
20200118064 Perrella et al. Apr 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 Jan 2021 A1
20210233305 Garcia Jul 2021 A1
Foreign Referenced Citations (47)
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
2015127246 Aug 2015 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 (112)
Entry
Rusu et al. “Towards 3D Point cloud based object maps for household environments,” Science Direct. vol. 56, Issue 11, pp. 927-947. https://www.sciencedirect.com/science/article/pii/S0921889008001140#fig4. Nov. 30, 2008. (Year: 2008).
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. [hal-01097361].
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), pg. 88-93, 2527, 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. 19.
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.
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 37, 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.
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.
“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 Recongnition and Segmentation in Cluttered Scences”, 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 Applications (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çade 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.
International Search Report and Written Opinion for International Patent Application No. PCT/IB2021/060948 dated Feb. 4, 2022.
Ni et al., “Edge Detection and Feature Line Tracing in 3D-Point Clouds by Analyzing Geometric Properties of Neighborhoods,” Remote Sensing, V8 I9, 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 dated Sep. 23, 2014.
Notice of allowance for U.S. Appl. No. 13/693,503 dated Mar. 11, 2016.
Notice of allowance for U.S. Appl. No. 14/068,495 dated 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”, IEEE/RSJ International Conference on Intelligent robots and Systems, Nov. 2013, pp. 176.
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, v2n10, 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”, Jan. 1, 2001, 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].
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=rep1&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 dated Feb. 21, 2019.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1521272.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Mar. 11, 2015 for GB Patent Application No. 1417218.3.
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated 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.
A Gruen et al., Automatic Reconstruction and Visualization of a Complex Buddha Tower of Bayon, Angkor, Cambodia, Sep. 2001, pp. 289-301.
Alshwabkeh Y. et al., “Automatic Muiti-Image Photo-Texturing of Compiex 3D Scenes”, CIPA 2005 XX International Symposium; Sep. 26, 2005, pp. 1-6.
Related Publications (1)
Number Date Country
20220122220 A1 Apr 2022 US