Method, system and apparatus for detecting item facings

Information

  • Patent Grant
  • 11107238
  • Patent Number
    11,107,238
  • Date Filed
    Friday, December 13, 2019
    5 years ago
  • Date Issued
    Tuesday, August 31, 2021
    3 years ago
Abstract
A method by an imaging controller of detecting item facings from image sensor data includes: obtaining, at the imaging controller, the image sensor data corresponding to a support structure containing at least one item; identifying, by a feature detector of the imaging controller, a set of matched keypoint pairs from keypoints of the image sensor data; determining, by a peak detector of the imaging controller, a separation distance between the keypoints of each matched keypoint pair; detecting, by the peak detector, a count of item instances represented in the image sensor data based on the separation distances; and presenting item facing detection output including the count of item instances.
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 an aisle and corresponding products in a retail facility. However, the variability of the products in the facility, as well as variations in data capture conditions (e.g. lighting and the like) can prevent the accurate detection of individual products and their status from such 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 depicts a mobile automation apparatus in the system of FIG. 1.



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



FIG. 4 is a flowchart of a method of detecting product facings in the system of FIG. 1.



FIG. 5 is a diagram illustrating input data to the method of FIG. 4.



FIG. 6 is a diagram illustrating detection of image keypoints at block 410 of the method of FIG. 4.



FIG. 7 is a diagram illustrating an example performance of block 415 of the method of FIG. 4.



FIG. 8 is a diagram illustrating an example performance of block 420 of the method of FIG. 4.



FIG. 9 is a flowchart of a method for allocating keypoints to clusters at block 425 of the method of FIG. 4.



FIG. 10 is a diagram illustrating a performance of blocks 425 and 430 of the method of FIG. 4.



FIG. 11 is a diagram illustrating sequential performances of block 420 of the method of FIG. 4 in different dimensions.





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 by an imaging controller of detecting item facings from image sensor data includes: obtaining, at the imaging controller, the image sensor data corresponding to a support structure containing at least one item; identifying, by a feature detector of the imaging controller, a set of matched keypoint pairs from keypoints of the image sensor data; determining, by a peak detector of the imaging controller, a separation distance between the keypoints of each matched keypoint pair; detecting, by the peak detector, a count of item instances represented in the image sensor data based on the separation distances; and presenting item facing detection output including the count of item instances.


Additional examples disclosed herein are directed to a computing device, comprising: a feature detector configured to: obtain image sensor data corresponding to a support structure containing at least one item; and identify a set of matched keypoint pairs from keypoints of the image sensor data; a peak detector configured to: determine a separation distance between the keypoints of each matched keypoint pair; detect a count of item instances represented in the image sensor data based on the separation distances; and a boundary generator configured to present item facing detection output including the count of item instances.


Further examples disclosed herein are directed to a non-transitory computer-readable medium storing instructions executable by an imaging controller to configure the imaging controller to: obtain image sensor data corresponding to a support structure containing at least one item; identify a set of matched keypoint pairs from keypoints of the image sensor data; determine a separation distance between the keypoints of each matched keypoint pair; detect a count of item instances represented in the image sensor data based on the separation distances; and present item facing detection output including the count of item instances.



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). The support structures can have various other forms in some examples, including tables, peg boards and the like. Each shelf module 110 supports a plurality of items such as 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 (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 (also referred to as image sensor data), 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 also specifically designed, as will be discussed in detail herein, to process image data and/or depth measurements captured by the apparatus 103 representing the shelf modules 110, in order to detect product facings on the shelf modules 110. As will be apparent to those skilled in the art, a product facing is a single instance of a product facing into the aisle. Thus, if a support surface 117 carries three identical products adjacent to one another, the products represent three distinct facings. The resulting detected product facings can be provided to product status detection mechanisms (which may also be implemented by the processor 120 itself).


The processor 120 is interconnected with a non-transitory computer readable storage medium, such as a memory 122. 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 memory 122 stores computer readable instructions for performing various actions, including control of the apparatus 103 to navigate the shelf modules 110 and capture shelf data, as well as post-processing of the shelf data. 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 an item facing detection application 124 (also simply referred to as the application 124). In general, via execution of the application 124 or subcomponents thereof and in conjunction with other components of the server 101, the processor 120 performs various actions to detect, in image data and depth measurements representing the shelves 110 (e.g. data captured by the apparatus 103), individual product facings, for use in downstream processing to detect product status information (e.g. whether products are out of stock, misplaced or the like).


Certain example components of the application 124 are shown in FIG. 1, including a feature detector 126, a peak detector 128, and a boundary generator 130. The feature detector 126 selects keypoints from image data depicting the products (e.g. distinct, repeatably identifiable regions in the image) and identifies pairs of such keypoints with matching properties. That is, the feature detector 126 detects portions of the image that appear to depict similar features of distinct instances of a given product 112. The peak detector 128 detects a count of the instances of the above-mentioned product 112 appearing in the image data, based on the output of the feature detector 126. The boundary generator 130, in turn, employs the output of either or both of the feature detector 126 and the peak detector 128 to generate boundaries for each instance of the product 112 in the image data.


In other embodiments, the application 124 may be implemented as a suite of logically distinct application, each implementing a suitable portion of the functionality discussed below. For example, the detectors 126 and 128, as well as the boundary generator 130, may be implemented as separate applications.


The memory 122 can also store data for use in the above-mentioned control of the apparatus 103, such as a repository 132 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 processor 120, as configured via the execution of the application 124, is also referred to herein as an imaging controller 120, or simply as a controller 120. As will now be apparent, some or all of the functionality implemented by the imaging 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 application 124 by the processor 120.


The server 101 also includes a communications interface 134 interconnected with the processor 120. The communications interface 134 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 134 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 134 for storage (e.g. in the repository 132) and subsequent processing, e.g. via execution of the application 124 to detect product facings, as noted above). 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. In other examples, the mast 205 can support additional LIDAR sensors 211 (e.g. four LIDARs 211). 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. 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. As noted earlier, 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.


Referring to FIG. 3, certain components of the mobile automation apparatus 103 are shown, in addition to the cameras 207, depth sensor 209, LIDARs 211, and illumination assemblies 213 mentioned above. The apparatus 103 includes a special-purpose controller, such as a processor 300, interconnected with a non-transitory computer readable storage medium, such as a memory 304. The memory 304 includes a suitable 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 300 and the memory 304 each comprise one or more integrated circuits.


The memory 304 stores computer readable instructions for execution by the processor 300. In particular, the memory 304 stores an apparatus control application 308 which, when executed by the processor 300, configures the processor 300 to perform various functions related to navigating the facility and controlling the sensors 108 to capture data, e.g. responsive to instructions from the server 101. Those skilled in the art will appreciate that the functionality implemented by the processor 300 via the execution of the application 308 may also be implemented by one or more specially designed hardware and firmware components, such as FPGAs, ASICs and the like in other embodiments.


The memory 304 may also store a repository 312 containing, for example, a map of the environment in which the apparatus 103 operates, for use during the execution of the application 308. The apparatus 103 also includes a communications interface 316 enabling the apparatus 103 to communicate with the server 101 (e.g. via the link 105 or via the dock 106 and the link 107), for example to receive instructions to navigate to specified locations and initiate data capture operations.


The actions performed by the server 101, and specifically by the processor 120 as configured via execution of the application 124, to detect product facings from captured data representing the shelves 110 (e.g. images and depth measurements captured by the apparatus 103) will now be discussed in greater detail with reference to FIG. 4.



FIG. 4 illustrates a method 400 of detecting product facings. The method 400 will be described in conjunction with its performance in the system 100, and in particular by the server 101, with reference to the components illustrated in FIG. 1. As will be apparent in the discussion below, in other examples, some or all of the processing described below as being performed by the server 101 may alternatively be performed by the apparatus 103.


At block 405, the server 101, and particularly the feature detector 126, obtains at least an image corresponding to an area of a shelf 110 that contains at least one product 112. In particular, the area in the examples discussed below can contain as few as one product 112 of a given type, or multiple contiguous products 112 of that type. As will be apparent to those skilled in the art, products 112 that are arranged contiguously (i.e. immediately adjacent to one another on the shelf module 110, including being in physical contact with one another) may be difficult to segment by processing image and/or depth data according to other techniques such as edge detection.


The area mentioned above may also be referred to as a facing block, in that the image represents a block of at least one instance of a product 112, up to an unknown number of instances of the product 112. The server 101 may also obtain, at block 405, a set of depth measurements corresponding to the facing block. The depth measurements can be, for example, a plurality of sets of coordinates in the frame of reference 102. The image and depth data noted above may have been previously acquired by the apparatus 103 and provided to the server 101 for further processing.


The image data and depth data obtained at block 405 can be obtained in various ways. For example, turning to FIG. 5, the server 101 can extract the image and depth data from a larger data set based on a region of interest indicator defining the facing block area. In particular, FIG. 5 illustrates a point cloud 500 containing a plurality of depth measurements representing a shelf module 110 supporting various products 112. In particular, the point cloud 500 depicts three facings of a first product 112a, two facings of a second product 112b, and three facings of a third product 112c.



FIG. 5 also illustrates an image 504 of the shelf module 110 depicted by the point cloud 500. The image may be, for example, an RGB image captured by the apparatus 103 substantially simultaneously with the capture of the point cloud 500. The image 504 also depicts (albeit in two dimensions, rather than three dimensions) the shelf edges 118, shelf back 116, and products 112a, 112b and 112c as the point cloud 500. Finally, FIG. 5 illustrates a set of ROI indicators, or facing block areas, 508a, 508b and 508c indicating positions of product blobs detected, e.g. by the server 101 or another computing device. Detection of the ROI indicators can be performed based on any suitable combination of depth measurements and images, including the point cloud 500 and the image 504. The ROI indicators are illustrated in two dimensions, but can also be defined in three dimensions, according to the frame of reference 102. As is evident from FIG. 5, the ROI indicators 508 correspond to the respective positions of the products 112a, 112b and 112c, but do not distinguish between the individual product facings shown in the point cloud 500 and the image 504. The spaces between products 112 on the shelves 110 may be small enough that detecting individual product facings, in the absence of the processing techniques described below, is inaccurate or overly computationally expensive.


From the input data set out above, at block 405 the server can extract an image of a particular facing block for further processing. For example, an image 512 corresponding to the facing block 508a (i.e. the ROI indicator 508a) is shown separately from the image 504. The process described below can later be repeated for the other facing block areas 508. In other examples, the above processing to extract the relevant image and depth data can be performed previously, or by another computing device, such that at block 405 the server 101 simply retrieves the image 512, e.g. from the repository 132.


Returning to FIG. 4, at block 410 the server 101, and in particular the feature detector 126, is configured to generate feature descriptors for a set of keypoints, or interest points, of the image 512. The server 101 can implement any of a wide variety of keypoint selection and feature descriptor generation mechanisms. Examples of such mechanisms include an Oriented FAST and Rotated BRIEF (ORB) feature generator, a Scale Invariant Feature Transform (SIFT) feature generator, and the like. In general, such mechanisms select certain points in the image 512 that have sufficiently distinctive surrounding regions (a surrounding region can be a patch of 10×10 pixels centered on the keypoint, for example; various other surrounding region shapes and sizes may also be employed) that the keypoint can be readily identified in another image or another portion of the same image. The nature of the feature descriptors generated at block 410 varies with the mechanism implemented by the server 101. For example, if the server 101 implements an ORB feature generator at block 410, the feature descriptors are, for each keypoint, a one-dimensional binary vector of configurable length (e.g. 128 bits).


Turning to FIG. 6, the image 512 is shown, with several example keypoints 604 (specifically, eight sample keypoints 604-1 through 604-8). For each keypoint 604, the server 101 generates a feature descriptor 608, such as the above-mentioned vector 608. Thus, eight feature descriptors 608-1 through 608-8 are shown in FIG. 6. As will be apparent to those skilled in the art, the process of identifying keypoints and generating feature descriptors may yield a greater number of keypoints and corresponding feature descriptors than the set of eight shown in FIG. 6.


Referring again to FIG. 4, having generated feature descriptors at block 410, at block 415 the server 101 identifies a set of matched keypoint pairs based on the feature descriptors. Returning to FIG. 6, it will be apparent that several of the keypoints 604 depict repeating image features. For example, the keypoints 604-1, 604-2 and 604-3 each correspond to the apex of the letter “A” on separate instances of a product 112a. Similarly, the keypoints 604-4, 604-5 and 604-6 correspond to distinct instances of the same image feature, as do the keypoints 604-7 and 604-8. The feature descriptors 608 of such keypoints are therefore expected to be similar (although not necessarily identical).


At block 415, the feature detector 126 is configured to identify pairs of feature descriptors that are equal or sufficiently similar, and store (e.g. in the memory 122 the pairs for further processing. Various search mechanisms can be employed to identify matched pairs of keypoints 604. For example, the feature detector 126 can select each feature descriptor 608 in turn and generate a difference metric between the selected feature descriptor 608 and every other feature descriptor 608. An example of a difference metric that may be employed with ORB feature descriptors is the Hamming distance.


In the example illustrated in FIG. 6, therefore, seven difference metrics can be computed for each feature descriptor 608. Matches can be selected for a given feature descriptor 608 by selecting the other feature descriptor 608 having the lowest difference metric. Because the method 400 seeks to identify multiple instances of a product 112, however, more than one pairing may exist for each feature descriptor 608. The server 101 can therefore select not only the single other feature descriptor 608 with the lowest difference metric, but a configurable number of other feature descriptors 608. For example, the server 101 can select, for each feature descriptor 608, the three closest feature descriptors 608 and therefore store three matched keypoint pairs.


Various optimizations can be applied to the performance of block 415. For example, rather than performing the above-mentioned brute force search, the server 101 may generate a k-d tree containing the feature descriptors 608 and perform searches for matching feature descriptors 608 using the k-d tree.


In addition, referring to FIG. 7, the server 101 can apply a threshold to the difference metric. FIG. 7 provides a graphical representation of the identification of matching feature descriptors 608 for the feature descriptor 608-1. Each other feature descriptor 608 is shown along with a graphical representation of a difference metric 700 between that feature descriptor 608 and the feature descriptor 608-1. Longer representations of difference metrics 700 indicate that the relevant feature descriptors 608 are less similar.



FIG. 7 also illustrates a selection threshold 704, presented as a circular region centered on the feature descriptor 608-1. The server 101 can be configured to select, as matches for the feature descriptor 608-1, up to three (or any other preconfigured number, e.g. selected to meet or exceed the maximum potential number of product instances in the image 512) nearest neighbors, based on the difference metrics, with the condition that any selected matching feature descriptor 608 has a difference metric 700 below the threshold 704. Therefore, in the present example, the feature descriptors 608-3 and 608-2 are selected as matches to the feature descriptor 608-1. In other words, two matched keypoint pairs are produced from the selection shown in FIG. 7: the pair consisting of the feature descriptors 608-1 and 608-2, and the pair consisting of the feature descriptors 608-1 and 608-3. The above process can be repeated to identify matches for each other feature descriptor 608.


The performance of block 415, therefore, results in a number of matched keypoint pairs. In the example shown in FIG. 6, the matched keypoint pairs resulting from block 415 may include: [604-1, 604-2], [604-1, 604-3], [604-4, 604-5], [604-4, 604-6], [604-7, 604-8]. As will be seen from FIG. 6, a third instance of the image feature corresponding to the keypoints 604-7 and 604-8 was not selected at block 410. Lighting conditions, image capture artifacts, or the like, may result in certain instances of repeating image features not being detected.


At block 420, the server 101 is configured to determine distances between the matched keypoint pairs from block 415, and to detect a number of product instances in the image from block 405 based on those distances. The distances determined at block 420 can be physical distances, for example based on the depth measurements obtained at block 405. That is, the peak detector 128 of the server 101 can be configured to register (e.g. via back-projection) each of the keypoints 604 to the depth measurements in the point cloud 500, to determine a three-dimensional location of each keypoint 604 according to the frame of reference 604. In the present example, the distances determined at block 420 are horizontal distances (e.g. distances along the X axis of the frame of reference 102 as shown in FIG. 1), reflecting the expectation that repeating instances of products are arranged substantially horizontally along the shelf modules 110. That is, to the extent that a given pair of matched keypoints 604 are not at the same elevation (i.e. position on the Z axis of the frame of reference 102), differences in elevation may be ignored at block 420 in the present example. Depth-wise spacing (i.e. along the Y axis shown in FIG. 1) may also be ignored at block 420.


Referring to FIG. 8, distances 800a and 800b are shown for the matched keypoint pairs [604-1, 604-2] and [604-1, 604-3]. To detect a number of product instances at block 420, the peak detector 128 can be configured to generate a histogram of distances. Specifically, the histogram can include a plurality of bins each corresponding to a selected range of distances. For example, the total width (in the X direction) of the area represented by the image 512 can be determined, and divided into a predefined number of bins. For each distance from the block 420, the corresponding bin is identified (i.e. the bin whose range encompasses the distance), and a score associated with that bin is incremented by one. For example, FIG. 8 illustrates an incomplete histogram 804 having ten bins corresponding to ten segments of the width of the image 512. The score associated with the third bin has been incremented by one for the distance 800a, and the score associated with the seventh bin has been incremented by one for the distance 800b.


The process shown in FIG. 8 for the distances 800a and 800b is repeated for each other matched keypoint pair identified at block 415. An example completed histogram 808 is also shown in FIG. 8, in which a greater number of keypoints than the sample set shown in FIGS. 6-8 have been matched and allocated to bins. To complete the performance of block 420, the peak detector 128 is configured to detect peaks in the histogram 808. Peak detection can be performed by implementing a suitable local maximum detection mechanism. Via such a local maximum detection mechanism, the peak detector 128 can detect peaks at the bins 812-1 and 812-2 in the illustrated example.


The number of product instances detected at block 420 is the number of peaks detected, increased by one. As will now be apparent, each peak indicates a recurring distance between matched keypoint pairs. That is, each peak indicates the presence of multiple matched keypoint pairs with similar spacing. For example, the matched keypoint pairs [604-1, 604-3] and [604-7, 604-8], as seen in FIG. 6, are separated by substantially the same horizontal distance. In other words, a peak in the histogram 808 indicates two distinct product instances. The total of two peaks in the histogram 808 indicates three distinct product instances.


The peak detector 128 can also apply a minimum threshold to peak detection, such that a local maximum is only identified as a peak if the score exceeds the threshold. In the event that the image data from block 405 depicts a single product instance, the feature detector 126 may detect few or no matched keypoint pairs, and the histogram generated at block 420 may therefore include scores that only represent a small proportion of the total number of identified keypoints. Under such conditions, local maxima in the histogram may still exist due to features matched within the same product instance, but such local maxima are likely to be smaller (i.e. have lower scores) than peaks resulting from repeated product instances. By applying a magnitude threshold to the peaks identified at block 420, the peak detector 128 may avoid detecting peaks that result from matches within a product instance rather than peaks that are indicative of distinct products instances.


Referring again to FIG. 4, at block 425 the boundary generator 130 of the server 101 is configured to allocate each keypoint 604 to one of a set of clusters equal in number to the count of product instances detected at block 420. The clusters may then, as will be discussed below, be employed to generate boundaries (e.g. bounding boxes in the frame of reference 102) for each product instance depicted in the image 512.


Allocation of keypoints 604 to clusters may be performed by the boundary generator 130 according to a suitable clustering mechanism, such as k-means clustering or the like. The count of product instances (three, in the present example performance of the method 400) detected at block 420 is provided to the clustering mechanism as an input. That is, the boundary generator 130 is configured to allocate the keypoints 604 to a specific number of clusters, given by the result of block 420.


In some examples, the allocation of keypoints 604 to clusters is based not only on the count of product instances detected at block 420, but also on the distances determined at block 420 and the results of block 415 (indicating which keypoints 604 are paired). In the present example, clustering of the keypoints 604 is performed at block 425 by implementing a spectral clustering algorithm, such as that described in Ng, A. Y. & Jordan, M. & Weiss, Y. (2001). On Spectral Clustering: Analysis and an Algorithm. Proceedings Adv. Neural Inf. Process Syst. 14. The spectral clustering mechanism accepts as inputs an expected number of clusters (i.e. the detected count of product instances from block 420), and an affinity matrix. The affinity matrix indicates a degree of similarity between each pair of keypoints 604 (not only the matched keypoint pairs mentioned above). That is, an affinity value may be assigned to each pair of keypoints, such as a value between zero and one.


In general, a pair of keypoints 604 with a greater affinity value (e.g. closer to one) are more likely to be placed in the same cluster, while a pair of keypoints with a smaller affinity value (e.g. closer to zero) are more likely to be placed in different clusters. When the boundary generator 130 implements spectral clustering at block 425, the affinity matrix can be initialized based on the results of blocks 415 and 420.


In particular, referring to FIG. 9, a method 900 is illustrated of initializing affinity values for use in spectral clustering at block 425. At block 905, the boundary generator 130 selects a pair of keypoints 604. The performance of the method 900 is repeated for every pair of keypoints 604, and not only for the matched keypoint pairs discussed earlier.


At block 910, the server 101 determines whether the selected pair of keypoints 604 is a matched pair, according to the results of block 415. For example, the determination at block 910 is affirmative for the keypoints 604-1 and 604-3. The server 101 therefore proceeds to block 915, at which the affinity value corresponding to the selected pair is set to zero. In other words, if the selected pair of keypoints 604 is a matched pair, the matched pair is assumed to depict two instances of the same product feature. Therefore, each member of the matched pair is associated with a different product instance, and is to be placed in a different cluster. Setting the affinity measurement to zero increases the likelihood that the keypoints 604 will be assigned to distinct clusters.


When the determination at block 910 is negative, as in the example of the keypoints 604-2 and 604-7, the server 101 proceeds to block 920 rather than block 915. At block 920, an affinity value is set for the selected pair of keypoints 604 based on the distance separating the selected keypoints 604. Specifically, the affinity value set at block 920 is inversely proportional to the distance separating the selected pair of keypoints 604, reflecting an assumption that keypoints 604 that are more distant from one another are more likely to correspond to distinct product instances.



FIG. 10 illustrates an example set of keypoints 604 following a performance of block 425. In particular, the keypoints 604 shown in short dashed lines have been assigned to a first cluster, the keypoints 604 shown in solid lines have been assigned to a second cluster, and the keypoints 604 shown in long dashed lines have been assigned to a third cluster. The server 101 can store, in association with each keypoint 604, a cluster identifier indicating which cluster the keypoint 604 was allocated to.


At block 430, the server 101 can be configured to generate item boundaries corresponding to detected product instances, based on the results of block 430. In particular, the boundary generator 130 can be configured to fit a boundary (e.g. a rectangular boundary, although other shapes of boundary may also be generated in other examples. Various boundary fitting mechanisms (e.g. RANSAC-based fitting, Minimum Volume Bounding Box, or the like) can be implemented by the boundary generator 130 at block 430 to generate the boundaries, for example as three-dimensional bounding boxes defined according to the frame of reference 102.


Referring again to FIG. 10, three example boundaries 1000-1, 1000-2 and 1000-3 are shown as having been generated based on the keypoints 604 in each of the above-mentioned clusters. As will be apparent from FIG. 10, the boundaries 1000 indicate the presence, and the detected positions, of three distinct product instances, corresponding to the three products 112a shown in the image 512.


At block 435, the server 101 is configured to present item facing detection output, e.g. via a display connected to the server 101, and/or by transmitting output to the client device 104, and/or by providing the output to another component of the server 101 itself for further processing, or the like. The item facing detection output can include at least one of the count of item instances detected at block 420 and the boundaries generated at block 430. The item facing detection output can also be stored, e.g. in the memory 122.


Variations to the functionality described above are contemplated. For example, the server 101 can be configured to detect vertically stacked products 112 as well as horizontally arranged products 112 such as those shown in the image 512. In particular, as shown with a dashed line in FIG. 4 extending from block 430 to block 415, the performance of blocks 415-430 can be repeated for two physical dimensions associated with the support structures 110. More specifically, the server 101 can perform blocks 415-430 for a first physical dimension, such as the horizontal direction (e.g. the X axis of the frame of reference 102), and then repeat the performance of blocks 415-430 for a second physical dimension, such as the vertical direction (e.g. the Z axis of the frame of reference 102).


The performance of block 415 in such examples may be constrained to match keypoints separated by a minimum distance in the dimension currently being processed in the image sensor data. In addition, processing for the second physical dimension may include multiple performances of blocks 415-430, once for each cluster identified at block 430 for the first physical dimension. For example, a first performance of blocks 415-430 may segment the image sensor data into three horizontally-arranged clusters. Blocks 415-430 are then repeated three times, restricting each performance to the image sensor data within a respective horizontal cluster. In other examples, the above-mentioned order of processed dimensions can be reversed.


Turning to FIG. 11, an image 1100 is shown depicting six product instances, arranged in two contiguous stacks of three items each. Via a first performance of block 420, a histogram 1104 corresponding to the horizontal dimension is generated. As will be apparent from the image 1100, a peak 1108 in the histogram 1104 corresponds to matching keypoint pairs from horizontally-spaced items in the image 1100. Further, a peak 1112 corresponds to matching keypoint pairs from vertically-spaced items in the image 1100. Such matching keypoint pairs may have small or null horizontal distances separating them. The server 101 can therefore be configured to ignore the peak 1112 (or indeed any peak below a minimum distance threshold).


Additionally, a second iteration of block 420 yields a histogram 1116, in which a first peak 1120 results from matching keypoint pairs for horizontally-spaced items (which therefore have small vertical separation distances). The peak 1120, as with the peak 1112, may be ignored. In addition, the histogram 1116 presents two peaks 1124 and 1128. To generate a total count of item instances, the server 101 may multiply a detected horizontal count (two) by a detected vertical count (three).


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 by an imaging controller of detecting item facings from image sensor data, the method comprising: obtaining, at the imaging controller, the image sensor data corresponding to a support structure containing at least one item;identifying, by a feature detector of the imaging controller, a set of matched keypoint pairs from keypoints of the image sensor data;determining, by a peak detector of the imaging controller, a separation distance between the keypoints of each matched keypoint pair;detecting, by the peak detector, a count of item instances represented in the image sensor data based on the separation distances; andpresenting item facing detection output including the count of item instances.
  • 2. The method of claim 1, further comprising: obtaining point cloud data corresponding to the image sensor data;wherein determining the separation distance includes registering the matched keypoint pairs to the point cloud data.
  • 3. The method of claim 1, wherein identifying the matched keypoint pairs comprises: generating, by the feature detector of the imaging controller, respective feature descriptors for a plurality of keypoints from the image sensor data; andcomparing the feature descriptors.
  • 4. The method of claim 3, wherein identifying the matched keypoint pairs further comprises, for each of a plurality of keypoint pairs: determining a difference metric; andwhen the difference metric is below a threshold, identifying the keypoint pair as a matched keypoint pair.
  • 5. The method of claim 1, further comprising: allocating, by a boundary generator of the imaging controller, each keypoint to a cluster; andgenerating an item boundary corresponding to the cluster;wherein the item facing detection output includes the item boundary.
  • 6. The method of claim 5, wherein the allocating comprises: assigning an affinity value to each of a plurality of pairs of the keypoints based on (i) whether the pair is a matched keypoint pair, and (ii) the separation distance between the pair.
  • 7. The method of claim 1, wherein detecting the count of item instances comprises: for each separation distance, incrementing a corresponding one of a set of histogram scores; anddetecting at least one peak in the set of histogram scores.
  • 8. The method of claim 1, wherein the separation distance is a separation distance in a first physical dimension associated with the support structure.
  • 9. The method of claim 8, further comprising: determining, by the peak detector, a further separation distance for each matched keypoint pair in a second physical dimension associated with the support structure; anddetecting, by the peak detector, a count of item instances represented in the image sensor data based on the separation distances in the first and second physical dimensions.
  • 10. A computing device, comprising: a feature detector configured to: obtain image sensor data corresponding to a support structure containing at least one item; andidentify a set of matched keypoint pairs from keypoints of the image sensor data;a peak detector configured to: determine a separation distance between the keypoints of each matched keypoint pair;detect a count of item instances represented in the image sensor data based on the separation distances; anda boundary generator configured to present item facing detection output including the count of item instances.
  • 11. The computing device of claim 10, wherein the feature detector is further configured to: obtain point cloud data corresponding to the image sensor data; andin order to determine the separation distance, register the matched keypoint pairs to the point cloud data.
  • 12. The computing device of claim 10, wherein the feature detector is configured, in order to identify the matched keypoint pairs, to: generate respective feature descriptors for a plurality of keypoints from the image sensor data; andcompare the feature descriptors.
  • 13. The computing device of claim 12, wherein the feature detector is further configured, in order to identify the matched keypoint pairs, to: for each of a plurality of keypoint pairs, determine a difference metric; andwhen the difference metric is below a threshold, identify the keypoint pair as a matched keypoint pair.
  • 14. The computing device of claim 10, wherein the boundary generator is further configured to: allocate each keypoint to a cluster; andgenerate an item boundary corresponding to the cluster;wherein the item facing detection output includes the item boundary.
  • 15. The computing device of claim 14, wherein the boundary generator is further configured, in order to allocate each keypoint to a cluster, to: assign an affinity value to each of a plurality of pairs of the keypoints based on (i) whether the pair is a matched keypoint pair, and (ii) the separation distance between the pair.
  • 16. The computing device of claim 10, wherein the peak detector is further configured, in order to detect the count of item instances, to: for each separation distance, increment a corresponding one of a set of histogram scores; anddetect at least one peak in the set of histogram scores.
  • 17. The computing device of claim 10, wherein the separation distance is a separation distance in a first physical dimension associated with the support structure.
  • 18. The computing device of claim 17, wherein the peak detector is further configured to: determine a further separation distance for each matched keypoint pair in a second physical dimension associated with the support structure; anddetect a count of item instances represented in the image data based on the separation distances in the first and second physical dimensions.
  • 19. A non-transitory computer-readable medium storing computer executable instructions that when executed by a processor cause the processor to perform the operations of: obtaining image sensor data corresponding to a support structure containing at least one item;identifying a set of matched keypoint pairs from keypoints of the image sensor data;determining a separation distance between the keypoints of each matched keypoint pair;detecting a count of item instances represented in the image sensor data based on the separation distances; andpresenting item facing detection output including the count of item instances.
  • 20. The non-transitory computer-readable medium of claim 19, wherein the instructions further comprise: for each separation distance, incrementing a corresponding one of a set of histogram scores; anddetecting at least one peak in the set of histogram scores.
US Referenced Citations (477)
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
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
9015072 Wu 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
9443164 Sulc Sep 2016 B2
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
9984451 Gormish 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
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 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
10453046 Wu Oct 2019 B2
10565548 Skaff Feb 2020 B2
10769582 Williams Sep 2020 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
20050174351 Chang Aug 2005 A1
20050213082 DiBernardo et al. Sep 2005 A1
20050213109 Schell et al. Sep 2005 A1
20060032915 Schwartz Feb 2006 A1
20060045325 Zavadsky 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 Mar 2009 A1
20090074303 Filimonova et al. Mar 2009 A1
20090088975 Sato et al. Apr 2009 A1
20090094140 Kwan 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
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
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
20120287249 Choo et al. Nov 2012 A1
20120307108 Forutanpour Dec 2012 A1
20120308123 Jo Dec 2012 A1
20120323620 Hofman 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
20130142421 Silver et al. Jun 2013 A1
20130144565 Miller et al. 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
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
20130279751 Bruna 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
20140002597 Taguchi et al. Jan 2014 A1
20140003655 Gopalakrishnan 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
20140025420 Joshi 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 Showering Apr 2014 A1
20140104413 McCloskey et al. Apr 2014 A1
20140129027 Schnittman May 2014 A1
20140156133 Cullinane et al. Jun 2014 A1
20140161359 Magri et al. Jun 2014 A1
20140192050 Qiu 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
20150052027 Pavani 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 Apr 2015 A1
20150139010 Jeong et al. May 2015 A1
20150146989 Shiiyama 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
20150193909 Maayan Jul 2015 A1
20150212521 Pack et al. Jul 2015 A1
20150235157 Avegliano et al. Aug 2015 A1
20150245358 Schmidt Aug 2015 A1
20150248592 Wang Sep 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
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
20160012588 Taguchi et al. Jan 2016 A1
20160026253 Bradski et al. Jan 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
20160104041 Bowers et al. Apr 2016 A1
20160107690 Oyama et al. Apr 2016 A1
20160112628 Super et al. Apr 2016 A1
20160119540 Wu 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
20160180533 Pavani 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
20160260054 High et al. Sep 2016 A1
20160271795 Vicenti Sep 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
20160379083 Sala 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
20170032311 Rizzolo Feb 2017 A1
20170041553 Cao et al. Feb 2017 A1
20170054965 Raab et al. Feb 2017 A1
20170061416 Morate Mar 2017 A1
20170066459 Singh Mar 2017 A1
20170074659 Giurgiu et al. Mar 2017 A1
20170109940 Guo et al. Apr 2017 A1
20170147966 Aversa et al. May 2017 A1
20170150129 Pangrazio May 2017 A1
20170177969 Zaremski Jun 2017 A1
20170178060 Schwartz Jun 2017 A1
20170178227 Gornish Jun 2017 A1
20170178310 Gornish Jun 2017 A1
20170193434 Shah 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 Sep 2017 A1
20170280125 Brown et al. Sep 2017 A1
20170286773 Skaff et al. Oct 2017 A1
20170286901 Skaff 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
20170358089 Miyazato Dec 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
20180096555 Schtein Apr 2018 A1
20180101813 Paat Apr 2018 A1
20180108134 Venable Apr 2018 A1
20180114183 Howell Apr 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
20180201423 Drzewiecki et al. Jul 2018 A1
20180204111 Zadeh et al. Jul 2018 A1
20180251253 Taira et al. Sep 2018 A1
20180260772 Chaubard Sep 2018 A1
20180276596 Murthy et al. Sep 2018 A1
20180281191 Sinyavskiy 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
20180330175 Corcoran Nov 2018 A1
20180370727 Hance et al. Dec 2018 A1
20190019030 Cansizoglu Jan 2019 A1
20190019293 Woodroffe Jan 2019 A1
20190034864 Skaff Jan 2019 A1
20190057588 Savvides 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
20190156273 Fisher May 2019 A1
20190156275 Fisher 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
20190304132 Yoda et al. Oct 2019 A1
20190392212 Sawhney et al. Dec 2019 A1
20200058129 Guo Feb 2020 A1
20200314333 Liang et al. Oct 2020 A1
20200379111 Kimura Dec 2020 A1
20200385012 Maruyama Dec 2020 A1
Foreign Referenced Citations (37)
Number Date Country
2835830 Nov 2012 CA
3028156 Jan 2018 CA
104200086 Dec 2014 CN
107067382 Aug 2017 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
2323238 Sep 1998 GB
2330265 Apr 1999 GB
2014170431 Sep 2014 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 2018018007 Jan 2018 WO
WO 2018204308 Nov 2018 WO
WO 2018204342 Nov 2018 WO
WO 2019023249 Jan 2019 WO
Non-Patent Literature Citations (98)
Entry
“Using image analytics to monitor retail store shelves”; M. Marder, IBM Journal of Research and Development (vol. 59, Issue: 2/3, pp. 3:1-3:11) (Year: 2015).
“Improved library shelf reading using color feature matching of book-spine images”; Fowers, S.G., 2010 11th International Conference on Control Automation Robotics & Vision (pp. 2160-2165) (Year: 2010).
“Supervised learning for Out-of-Stock detection in panoramas of retail shelves”; Luis Rosado, 2016 IEEE International Conference on Imaging Systems and Techniques (IST) (pp. 406-411) (Year: 2016).
“Toward real-time grocery detection for the visually impaired”; Winlock, T., 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition—Workshops (pp. 49-56) (Year: 2010).
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/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/051312 dated Nov. 15, 2019.
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/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.
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, (2014-10-27), pp. 1575-1578.
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.
N.D.F. Campbell et al. “Automoatic 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 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. 16/561,175 dated Sep. 23, 2014.
Notice of allowance for U.S. Appl. No. 13/695.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”, 1EEE/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, v2n10, Oct. 2013) (Year: 2013).
Pivtoraiko et al., “Differentially constrained mobile robots 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 imcrementally 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 (1081).
Senthilkumaran, et al., “Edge Detection Techniques for Image Segmentation-A Survery 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 Arches of Photogrammetry, Remote Sensing and Spatial Information Sciences 36.5 (Sep. 2006): 248-253.
Trevor et al., “Tables, Counter, 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 Visulation”, 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 histrogram 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.
“Plane Detection in Point Cloud Data” dated 2010-01-25 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.
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 Facade 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.
Chen et al. “Improving Octree-Based Occupancy Maps Using Environment Sparsity with Application to Aerial Robot Navigation” Robotics and Automation (ICRA), 2017 IEEE.
Cleveland Jones 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.” Robotic 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), p. 88-93, Sep. 25-27, 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).
Related Publications (1)
Number Date Country
20210183095 A1 Jun 2021 US