Method and apparatus for shelf feature and object placement detection from shelf images

Information

  • Patent Grant
  • 10726273
  • Patent Number
    10,726,273
  • Date Filed
    Monday, May 1, 2017
    7 years ago
  • Date Issued
    Tuesday, July 28, 2020
    4 years ago
Abstract
A method of detecting a back of a shelf for supporting objects includes: obtaining an image depicting a shelf having a shelf edge and a support surface extending from the shelf edge to a shelf back; decomposing the image into a plurality of patches; for each patch: generating a feature descriptor; based on the feature descriptor, assigning one of a shelf back classification and a non-shelf back classification to the patch; generating a mask corresponding to the image, the mask containing an indication of the classification assigned to each of the patches; and presenting the mask.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to U.S. Provisional Application No. 62/492,670 entitled “Product Status Detection System,” filed on May 1, 2017, by Perrella et al., which is incorporated herein by reference in its entirety.


BACKGROUND

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





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

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



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



FIG. 2 is a block diagram of certain internal hardware components of the server in the system of FIG. 1.



FIG. 3 is a flowchart of a method of gap detection.



FIG. 4 is a flowchart of a method of back of shelf detection.



FIG. 5 is an example image obtained in the performance of the method of FIG. 4.



FIG. 6 illustrates decomposed and scaled versions of the image of FIG. 5.



FIGS. 7A and 7B are a back of shelf score mask and a back of shelf mask following application of a score threshold, respectively.



FIGS. 8-10B illustrate certain operations performed on the mask of FIG. 7B in the performance of the method of FIG. 3.



FIG. 11 is a gap mask resulting from the performance of the method of FIG. 3.





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


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


DETAILED DESCRIPTION

Environments such as warehouses, retail locations (e.g. grocery stores) and the like typically contain a wide variety of products supported on shelves, for selection and purchase by customers. As a result, the composition of the set of products supported by any given shelf module varies over time, as products are removed and, in some cases, replaced by customers. Products that have been partially or fully depleted typically require restocking, and products that have been incorrectly replaced (referred to as “plugs”) typically require relocation to the correct position on the shelves. The detection of restocking or plug issues is conventionally performed by human employees, via visual assessment of the shelves and manual barcode scanning. This form of detection is labor-intensive and therefore costly, as well as error-prone.


Attempts to automate the detection of product status issues such as those mentioned above are complicated by the fluid nature of the environment in which an autonomous data capture system is required to operate. Among other difficulties, digital images of the shelves vary in quality depending on the available lighting, the presence of visual obstructions, and the like. Further, the breadth of products present on the shelves and the variations in their positioning on the shelves reduces the accuracy of machine-generated status detection.


Examples disclosed herein are directed to a method of detecting a back of a shelf for supporting objects, comprising: obtaining an image depicting a shelf having a shelf edge and a support surface extending from the shelf edge to a shelf back; decomposing the image into a plurality of patches; for each patch: generating a feature descriptor; based on the feature descriptor, assigning one of a shelf back classification and a non-shelf back classification to the patch; generating a mask corresponding to the image, the mask containing an indication of the classification assigned to each of the patches; and presenting the mask.



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 mobile device 105 via communication links 107, illustrated in the present example as including wireless links. The system 100 is deployed, in the illustrated example, in a retail environment including a plurality of shelf modules 110 each supporting a plurality of products 112. The shelf modules 110 are typically arranged in a plurality of aisles, each of which includes a plurality of modules aligned end-to-end. More specifically, the apparatus 103 is deployed within the retail environment, and communicates with the server 101 (via the link 107) to navigate, either fully or partially autonomously, the length of at least a portion of the shelves 110. The apparatus 103 is equipped with a plurality of navigation and data capture sensors 104, such as image sensors (e.g. one or more digital cameras), and depth sensors (e.g. one or more Light Detection and Ranging (LIDAR) sensors), structured light sensors, ultrasonic sensors, among others, and is further configured to employ the sensors to capture shelf data. In the present example, the apparatus 103 is configured to capture a series of digital images of the shelves 110, as well as a series of depth measurements, each describing the distance and direction between the apparatus 103 and one or more points on a shelf 110, such as the shelf itself or the product disposed on the shelf.


The server 101 includes a special purpose imaging controller, such as a processor 120, specifically designed to control the mobile automation apparatus 103 to capture data, obtain the captured data via the communications interface 124 and store the captured data in a repository 132 in the memory 122. The server 101 is further configured to perform various post-processing operations on the captured data and to detect the status of the products 112 on the shelves 110. When certain status indicators are detected by the imaging processor 120, the server 101 is also configured to transmit status notifications (e.g. notifications indicating that products are out-of-stock, low stock or misplaced) to the mobile device 105. 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 identifying back of shelf regions and gaps from captured image data, as discussed in further detail below. The memory 122 includes a combination of volatile (e.g. Random Access Memory or RAM) and non-volatile memory (e.g. read only memory or ROM, Electrically Erasable Programmable Read Only Memory or EEPROM, flash memory). The processor 120 and the memory 122 each comprise one or more integrated circuits. In an embodiment, the processor 120, further includes one or more central processing units (CPUs) and/or graphics processing units (GPUs). In an embodiment, a specially designed integrated circuit, such as a Field Programmable Gate Array (FPGA), is designed to perform the identification of back of shelf regions and gaps from captured image data discussed herein, either alternatively or in addition to the imaging controller/processor 120 and memory 122. As those of skill in the art will realize, the mobile automation apparatus 103 also includes one or more controllers or processors and/or FPGAs, in communication with the controller 120, specifically configured to control navigational and/or data capture aspects of the apparatus 103 either alternatively or in addition to the functionality of the controller 120 discussed herein.


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 and the mobile device 105—via the links 107. The links 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, a wireless local-area network is implemented within the retail environment via the deployment of one or more wireless access points. The links 107 therefore include both wireless links between the apparatus 103 and the mobile device 105 and the above-mentioned access points, and a wired link (e.g. an Ethernet-based link) between the server 101 and the access point.


The memory 122 stores a plurality of applications, each including a plurality of computer readable instructions executable by the processor 120. The execution of the above-mentioned instructions by the processor 120 configures the server 101 to perform various actions discussed herein. The applications stored in the memory 122 include a control application 128, which may also be implemented as a suite of logically distinct applications. In general, via execution of the control application 128 or subcomponents thereof, the processor 120 is configured to implement various functionality. The processor 120, as configured via the execution of the control application 128, is also referred to herein as the controller 120. As will now be apparent, some or all of the functionality implemented by the controller 120 described below may also be performed by preconfigured hardware elements (e.g. one or more ASICs) rather than by execution of the control application 128 by the processor 120.


In the present example, in particular, the server 101 is configured via the execution of the control application 128 by the processor 120, to process image and depth data captured by the apparatus 103 to identify portions of the captured data depicting a back of a shelf 110, and to detect gaps between the products 112 based on those identified portions.


Turning now to FIG. 2, before describing the operation of the application 128 to identify back of shelf regions and gaps from captured image data, certain components of the application 128 will be described in greater detail. As will be apparent to those skilled in the art, in other examples the components of the application 128 may be separated into distinct applications, or combined into other sets of components. Some or all of the components illustrated in FIG. 2 may also be implemented as dedicated hardware components, such as one or more Application-Specific Integrated Circuits (ASICs) or FPGAs. For example, in one embodiment, to improve reliability and processing speed, at least some of the components of FIG. 2 are programmed directly into the imaging controller 120, which may be an FPGA or an ASIC having circuit and memory configuration specifically designed to optimize image processing of high volume of sensor data received from the mobile automation apparatus 103. In such an embodiment, some or all of the control application 128, discussed below, is an FPGA or an ASIC chip.


The control application 128 includes a back of shelf detector 200 (also referred to herein simply as a detector 200), as well as a gap detector 204. In brief, the detector 200 is configured to process input image data captured by the apparatus 103 to detect areas of the image data that depict a back of the shelves 110. The gap detector 204, meanwhile, is configured to receive the output of the detector 200 in the form of a back-of-shelf mask, and to identify portions of the back-of-shelf mask that correspond to gaps between products 112 on the shelves 110.


More specifically, the detector 200 includes a pre-processor 210 configured to decompose input image data; a feature generator 212 configured to generate feature descriptors for the decomposed image data generated by the pre-processor 120; a classifier 214 configured to assign back of shelf or non-back of shelf classifications to the decomposed image data based on the feature descriptors; and a mask generator 216 configured to generate a back of shelf mask based on the decomposed image data and the output of the classifier 214.


The gap detector 204 includes a shelf edge detector 220 configured to detect or otherwise obtain a location of a shelf edge relative to the input image data; a region segmentor 224 configured to select, based in part of the shelf edge location, areas of the back of shelf mask which may correspond to gaps between the products 112; a mask generator 228 configured to process the segmented back of shelf mask to generate a gap mask; and a validator 232 configured to validate the gap mask based on depth measurements obtained from the apparatus 103.


Turning to FIG. 3, a method 300 of detecting gaps in an image of a shelf having a shelf edge and a support surface for supporting objects extending from the shelf edge to a shelf back is shown. The method 300 will be described in conjunction with its performance on the system 100 as described above.


As will be apparent, the shelves 110 typically include substantially horizontal (when installed for use) support surfaces extending between a shelf edge and a shelf back. The support surfaces support the products 112, and the shelf back may be visible in between the products 112, as well as over top of the products 112. At block 305, the server 101 is configured to obtain a back of shelf mask generated from an image of a shelf 110 (e.g. captured by the apparatus 103) and containing, for each of a plurality of areas of the mask, indications of a classification assigned to the area and selected from a shelf back classification and a non-shelf back classification. In other words, the back of shelf mask obtained at block 305 identifies areas of an imaged shelf 110 in which the back of the shelf 110 is visible.


In the present example, the back of shelf mask is obtained by generating the back of shelf mask at the server 101, and in particular with the back of shelf detector 200. Turning to FIG. 4, a method of generating a back of shelf mask is illustrated. In other examples, block 305 of method 300 can be performed by the gap detector 204, by retrieving a previously generated back of shelf mask from the memory 122.


Referring to FIG. 4, the generation of a back of shelf mask begins at block 405, at which the detector 200 is configured to obtain a digital image of the shelf 110, for example captured by the apparatus 103 and stored in the repository 132. An example image 500 is illustrated in FIG. 5, depicting a portion of a shelf 110. In particular, the image 500 depicts a shelf edge 504 and a shelf back 508, as well as a support surface 512 extending the between the shelf edge 504 and the shelf back 508 and supporting products 112. The shelf edge 504 abuts one side of the support surface 512 extending along a horizontal plane of the shelf 110 and defines a vertical surface that is parallel to the shelf back 508. As illustrated in FIG. 5, the shelf back 508 is patterned; as will be apparent, the shelf back may have a wide variety of appearances.


Returning to FIG. 4, at block 410 the detector 200 is configured to decompose the image 500 obtained at block 405. More specifically, in the present example the pre-processor 210 is configured to decompose the image into a plurality of patches. When the image 500 is in color, the pre-processor 210 can also convert the image 500 to greyscale, and may also normalize contrast in the image 500. In addition, in the present example, the pre-processor 210 is configured to generate a plurality of scaled versions of the image 500, and to decompose each scaled version into a plurality of patches. The generation of scaled versions of the image 500 (that is, versions of the image depicting the same region of the shelf 100 but at a differing resolutions; in other words, at different pixel densities) allows subsequent processing to account for varying distance between the apparatus 103 and the shelf 100 at the time of capture. The generation of scaled versions may be omitted in other examples.


Turning to FIG. 6, three scaled versions of the image 500 are illustrated, following decomposition into patches, each patch containing a fragment of the original image. In particular, a first set of patches 600 results from the decomposition of a full-scale version of the image 500. A second set of patches 604 results from the decomposition of a downsampled version of the image 500, and a third set of patches 608 results from the decomposition of a further downsampled version of the image 500. In other examples, a number of scales greater or smaller than three may be generated. The second and third sets of patches have been illustrated without the content of the image 500 for simplicity.


As shown in FIG. 6, the patches have the same resolution at each scale, and therefore different scales are decomposed into different numbers of patches. In the present example, each patch (at every scale) has a resolution of 32×32 pixels. The patches may have other resolutions in other examples; in general, the pre-processor 210 is preconfigured with a patch size determined (e.g. empirically) to be sufficiently large to encompass recognizable (as will be discussed below) features of the shelf back 508, and sufficiently small to avoid capturing both back of shelf areas and other areas of the image 500 in a majority of the patches.


Although not illustrated in FIG. 6, in some examples the patches overlap with one another. For example, the above-mentioned 32×32 pixel patches may overlap with adjacent patches by a preconfigured distance (e.g. 5 pixels).


Returning to FIG. 4, at block 415 the detector 200 is configured to determine whether all scales (if scaled versions of the image 500 are being employed) have been processed. In this example performance of the method 305, no processing has been performed, and the determination at block 415 is therefore negative. Following a negative determination at block 415, the performance of the method 305 proceeds to block 420.


At block 420, the feature generator 212 is configured to generate a feature descriptor for each of the patches generated at block 410. Various feature descriptors may be employed. In the present example, the feature descriptor is a histogram of oriented gradients (HOG) descriptor. To generate the HOG descriptors, the feature generator 212 divides each patch into cells (e.g. 8×8 pixel cells). For each pixel (64 per cell, in the present example) of each cell, the feature generator 212 then generates a gradient vector indicating the angle of the greatest change in intensity between the pixel and its neighbors, as well as the magnitude of the change in intensity. Having obtained the above-mentioned vectors, the feature generator 212 is configured to build a histogram, with bins corresponding to ranges of angles (e.g. 9 bins each accounting for an unsigned range of 20 degrees). The magnitude of each vector is added to the bin encompassing the vector's angle; in some example implementations, vectors with angles near the boundary between two adjacent bins may have their magnitudes divided between those bins. The resulting histogram for each cell is thus a 1×N vector, where N is the number of histogram bins (9 in the present example, though other numbers of bins may also be employed), containing the magnitudes assigned to each of the bins.


The feature generator 212 is then configured to concatenate the feature vectors of the cells for each patch into a single vector. Thus, in the example mentioned above, in which each 32×32 patch is divided into sixteen 8×8 cells, the feature generator 212 generates a 1×144 feature descriptor. In some examples, additional processing is performed on the cell-specific vectors mentioned above before concatenation. Specifically, in such examples the feature generator 212 is configured to perform a normalization operation on each of a plurality of cell blocks encompassing multiple cells (e.g. 2×2 cells). The normalization operation compensates for lighting and contrast variations throughout the image, and includes stacking the vectors for each cell (thus, resulting in a 36-element vector in this example). The feature generator 212 is then configured to determine the magnitude, also referred to as the L2 norm, of the stacked vector, which is the square root of the sum of the squares of each vector element. The feature generator 212 is configured to divide each of the elements in the stacked vector by the above-mentioned magnitude.


The feature generator 212 is configured to repeat the above-mentioned normalization process for each of a plurality of additional blocks of cells. In the present example, the blocks of cells overlap with each other by a width and/or height of one cell. The resulting descriptor for each patch when block normalization is employed as discussed above is 1×324: with 32×32 pixel patches, each patch is divided into a grid of 4×4 cells, which are grouped into a grid of 3×3 overlapping blocks. Each of the nine blocks yields a 36-element vector, for a total of (9×36)=324 elements.


Following the generation of feature descriptors as discussed above, at block 425, a classification is assigned to each patch for a given scale. The classification is one of a back of shelf classification and a non-back of shelf classification, and may be assigned in a variety of ways. In the present example, the feature generator 212 is configured to stack the feature descriptors for each patch into a single M×144 descriptor (or a M×324 descriptor when block normalization is employed as described above) corresponding to the entire image, where M is the number of patches. The stacked descriptor is provided as an input to the classifier 214. In the present example, the classifier is a trained neural network, which accepts the stacked descriptor as input and generates, as an output, a pair of scores for each patch. The pair of scores includes a back of shelf score indicating a level of confidence that the relevant patch depicts the shelf back 508, and a non-back of shelf score indicating a level of confidence that the relevant patch does not depict the shelf back 508. The classifier 214 is configured, in the present example, to select the greatest of the scores for presentation as output to the mask generator 216. More specifically, when the greater score corresponds to the back of shelf classification, the score is selected for further processing. When the greater score corresponds to the non-back of shelf classification, the score is selected and subtracted from one before being presented for further processing, such that all the scores employed downstream of classification represent the confidence of a back of shelf classification for their respective patches.


Once the patch classification for a given image scale is complete, the performance of method 305 returns to block 415. Thus, the feature descriptor generation and classification is repeated for each set of patches shown in FIG. 6, following which the determination at block 415 is affirmative.


In response to an affirmative determination at block 415, the performance of the method 305 proceeds to block 430. At block 430, the mask generator 216 is configured to combine the patch classifications from each scaled version of the image into a single score mask. The generation of classification scores for the patches at each scale results in a grid of patch scores, for example with the score being assigned as an intensity value to a point located at the center of the patch. At block 430, the mask generator 216 is configured to return the score grids from each scale to a single common scale (e.g. the original scale of the image obtained at block 405). FIG. 7A illustrates an example of a score mask generated at block 430, in which the lighter areas represent a greater degree of confidence that the corresponding areas of the original image depict the shelf back 508.


The mask generator 216 is then configured to apply a threshold to the score mask shown in FIG. 7A, to convert the score mask into a binary mask indicating whether each pixel depicts the shelf back 508 or does not depict the shelf back 508. Any pixels in the score mask that do not meet the threshold are set to a low intensity, and any pixels that do meet the threshold are set to a high intensity. FIG. 7B depicts the result of applying the score threshold to the score mask of FIG. 7A. When the back of shelf mask has been generated, performance of the method 300 continues.


Returning to FIG. 3, the performance of block 305 is completed when the gap detector 204 obtains the back of shelf mask from the detector 200. As discussed above, the back of shelf mask contains indications (in the form of high or low intensity values), for each of a plurality of areas of the back of shelf mask, of a classification assigned to the area and selected from a shelf back classification and a non-shelf back classification. Referring briefly to FIG. 7B, the white areas are those having the back of shelf classification, while the black areas are those having the non-back of shelf classification.


At block 310, the gap detector 204, having obtained the back of shelf mask, is configured to obtain a location of the shelf edge 504 relative to the back of shelf mask. In some examples, the shelf edge location is stored in the memory 122, and at block 310 the gap detector 204 is configured to retrieve the shelf edge location from memory. For example, the shelf edge location may be stored in a frame of reference corresponding to the retail environment itself. In such examples, the image obtained at block 405 may be registered to the common frame of reference by another component of the control application 128 (for example, using navigational data generated by the apparatus 103), and thus the back of shelf mask is also registered to the common frame of reference.


In other examples, the gap detector obtains the location of the shelf edge by detecting the shelf edge location from depth measurements obtained by the apparatus 103 corresponding to the image obtained at block 405. The depth measurements are registered to the images obtained by the apparatus 103, and thus the location of each depth measurement relative to the original image and the back of shelf mask is known. At block 310, in such examples, the shelf edge detector 220 is configured to detect the shelf edge from the depth measurements, for example by identifying a contiguous set of depth measurements located within a threshold distance of a particular plane. The shelf edge, when detected, may be overlaid on the back of shelf mask as a bounding box, as shown in FIG. 8, in which the shelf edge is illustrated as an overlay 800.


At block 315, the region segmentor 224 is configured to select an area of the back of shelf mask, classified as back of shelf, that is adjacent to the shelf edge location (i.e. to the overlay 800, in the present example). In particular, the region segmentor 224 is configured to locate any back of shelf areas of the mask that are within a preconfigured threshold distance of the upper side of the shelf edge bounding box 800. As shown in FIG. 8, the area surrounded by the bounding box 804 satisfies the threshold distance, and the region segmentor 224 is therefore configured to select the area 804 at block 315. The area 804, and any other areas satisfying the distance threshold, may be selected using a variety of mechanisms. As illustrated in FIG. 8, the area 804 is selected as the rectangular area extending away from the overlay 800 until a non-back of shelf area is reached. In other examples, the region segmentor 224 is instead configured to adjust the selected area to maximize the area covered by the selection. In the example of FIG. 8, such a selection would include a rectangular area with a narrower base and a greater height. In further examples, the region segmentor 224 is configured to select more complex shapes than the illustrated rectangular bounding box 804.


As will now be apparent, other areas, such as the area 808, are also within the threshold distance of the shelf edge overlay 800. However, the segmentor 224 is configured, in the present example, to disregard any areas portions of the mask having areas below a threshold. Such small portions may indicate, for example, an incorrect classification of a product 112 as depicting the shelf back 508 due to lighting or other image capture artifacts.


The region segmentor 224 is also configured, at block 315, to disregard any portions of the mask below the shelf edge overlay 800, as well as any portions beyond (e.g. left or right of) the ends of a shelf edge overlay, when the shelf edge overlay does not traverse the entire mask. Thus, in the present example, the region 812 of the mask is disregarded during the performance of block 315. Regions of the mask that are disregarded can be deleted (reducing the size of the mask), or simply assigned a non-gap classification without further analysis. Regions such as the region 812 are disregarded because, in the absence of a shelf edge overlay below the region 812, there is too little information available to the gap detector 204 to determine whether the region 812 is adjacent to the upper side of a shelf edge. The region 812 is instead assessed during a further performance of the method 300, beginning with an image of a different portion of the shelf 110 (specifically, a portion below that resulting in the mask shown in FIG. 8).


At block 320, the region segmentor 224 is configured to generate a joining area between the shelf edge overlay 800 and the selected area 804. Referring to FIG. 9, a joining area 900 is illustrated, extending from the shelf edge overlay 800 to the selected area 804. The joining area 900, as will be seen below, serves to classify the shelf support surface, if visible in the image, as back of shelf (and thus as a gap).


The selected area 804 and the joining area 900 are assigned a gap classification by the mask generator 228. In the present example, the mask generator 228 is also configured to expand the selected area 804. As seen in FIG. 9, a portion of the back of shelf mask classified as back of shelf extends up from the selected area, as well as towards the right along the top of the mask. The mask generator 228 is configured to perform a region growth operation beginning at the centroid of the selected area 804. As will be apparent to those skilled in the art, the region growth operation determines, for each point outwards from the starting point, whether to include the point in a region (e.g. based on the intensity of the point under consideration and its neighbors). The region growth operation serves to join discrete (i.e. separated from each other) back of shelf-classified areas that are likely to represent contiguous portions of the shelf back 508, but were not classified as such due to imaging artifacts.


Turning to FIG. 10A, a gap mask 1000 is illustrated following the completion of the region growth operation. As illustrated, a contiguous area 1004 is classified as a gap, encompassing both the area 804 and the joining area 900, as well as several areas classified as back of shelf that were previously distinct (as shown in FIGS. 8 and 9). As also shown in FIG. 10A, the mask generator 228 is configured to assign the previously discussed disregarded areas a non-gap classification (a low intensity, in the present example).


Referring again to FIG. 3, at block 325 the gap detector 204 is configured to perform a depth-based sensor validation of the gap mask illustrated in FIG. 10A. In particular, the validator 232 is configured to divide the gap mask into a plurality of vertical slices. Two example slices 1008 and 1012 are illustrated in FIG. 10A, and are shown in isolation in FIG. 10B. In the present example, the slices generated from the gap mask are 100 pixels in width; however, in other embodiments another suitable slice width can be employed. The slices can also overlap in some examples. The height of the slices is selected by the validator 232 to extend substantially from the shelf edge location (not shown in FIG. 10A) to the upper edge of the gap mask 1000. In other examples, in which more than one shelf is depicted in the initial image, the height of the vertical slices is selected by the validator 232 to extend from the upper side of one shelf edge location to the lower side of the adjacent shelf edge location. In other words, a plurality of sets of vertical slices are generated, each corresponding to the area adjacent and above a particular shelf.


For each slice, the validator 232 is configured to determine a proportion of the point depths corresponding to that slice that exceed a median point depth for the slice. In other words, the validator 232 is configured to assess whether the depth measurements corresponding to a given slice are concentrated near or on a plane corresponding to the shelf back 508, or whether the depth measurements are dispersed at various depths between the shelf back 508 and the shelf edge 504 (indicating the presence of a product 112 in the slice).


In the present example, the validator 232 determines a median of the subset of depth sensor measurements (obtained earlier and registered to the mask as discussed above) within each slice, and further determines what proportion of the depth measurements exceed the median. For example, the validator 232 is configured to generate a histogram of the depth measurements within each slice and determine the number of depth measurements that are allocated to histogram bins representing depths greater than the median. If the proportion is greater than a predetermined depth distribution threshold (specifying a proportion of depth measurements exceeding the median), any gap represented in the slice is likely to result from an area of the shelf back 508 visible above a product 112, rather than from a true gap (i.e. an absence of product 112 on the shelf). The validator 232 is therefore configured to assign a non-gap classification to the entirety of any slice exceeding the above-mentioned threshold. Slices that do not exceed the threshold are preserved without modification. FIG. 11 illustrates the mask 1000 after performance of depth-based validation as described above. As seen in FIG. 11, a gap-classified area 1100 remains in the gap mask, and the remaining areas classified as gaps in FIG. 10A have been reclassified as non-gap areas following depth sensor validation.


Following the performance of block 325, the gap detector 204 is configured to present the gap mask. The presentation of the gap mask can be implemented in a variety of ways. In the present example, the gap detector 204 is configured to generate bounding box coordinates (e.g. in the common frame of reference mentioned earlier) corresponding to each gap area indicated in the mask. In other examples, the gap detector 204 is configured to render the gap mask on a display, in addition to or instead of the generation of gap bounding boxes.


As will now be apparent, some images captured by the apparatus 103 may depict more than one shelf. The process of identifying a shelf edge location in relation the image, segmenting the image and assigning gap classifications to areas of the image (i.e. blocks 310-320 of the method 300) may be repeated for each shelf edge in the image, and the result overlaid at block 325.


In certain examples, the images captured by the apparatus 103 may overlap, and thus a plurality of images may be obtained that represent the same portion of a shelf 110. In such examples, each image can be processed independently. In some examples, however, the server 101 is configured to identify sections of the images that do not overlap with adjacent images, and to process only those sections as described above. In other words, only the section of an image that depicts a portion of the shelf 110 not depicted by any other images is processed in such examples.


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


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


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

Claims
  • 1. A method of detecting a back of a shelf for supporting objects, comprising: obtaining, by an imaging controller, an image depicting a shelf having a shelf edge and a support surface extending from the shelf edge to a shelf back;decomposing, by the imaging controller, the image into a plurality of patches;for each patch: generating a feature descriptor;based on the feature descriptor, assigning one of a shelf back classification and a non-shelf back classification to the patch;generating a mask corresponding to the image, the mask containing an indication of the classification assigned to each of the patches, wherein the indication of the classification assigned to each of the patches comprises one of a plurality of intensity values; andpresenting the mask to a gap detector for detection of gaps from the mask.
  • 2. The method of claim 1, wherein assigning the classification to each patch includes determining a confidence value corresponding to the assigned classification.
  • 3. The method of claim 2, wherein generating the mask comprises, for each patch: assigning one of two intensity values to each patch based on the confidence value and a confidence threshold.
  • 4. The method of claim 1, further comprising: prior to decomposing the image, converting the image to greyscale.
  • 5. The method of claim 1, further comprising: prior to decomposing the image, performing a contrast normalization operation on the image.
  • 6. The method of claim 1, further comprising: generating a plurality of scaled versions of the image;repeating the decomposing, generating a feature descriptor, and assigning a classification for each scaled version; andwherein generating the mask includes generating a sub-mask corresponding to each scaled version, and combining the sub-masks.
  • 7. The method of claim 1, wherein the feature descriptor is a histogram of oriented gradients (HOG) descriptor.
  • 8. The method of claim 1, further comprising: obtaining, by the imaging controller, a location of the shelf edge within the mask;generating, by the imaging controller, a gap mask identifying a subset of the areas having shelf back classifications as gaps on the shelf, by: selecting an area of the mask within a predetermined distance of the shelf edge location and having the shelf back classification; andgenerating a joining area between the selected area and the shelf edge location; andassigning a gap classification to the selected area and the joining area; andpresenting the gap mask.
  • 9. A method of detecting, by an imaging controller, gaps in an image of a shelf having a shelf edge and a support surface for supporting objects extending from the shelf edge to a shelf back, the method comprising: obtaining, by the imaging controller, a mask generated from the image and containing indications, for each of a plurality of areas of the mask, of a classification assigned to the area and selected from a shelf back classification and a non-shelf back classification;obtaining, by the imaging controller, a location of the shelf edge within the mask;generating, by the imaging controller, a gap mask identifying a subset of the areas having shelf back classifications as gaps on the shelf, by: selecting an area of the mask within a predetermined distance of the shelf edge location and having the shelf back classification; andgenerating a joining area between the selected area and the shelf edge location; andassigning a gap classification to the selected area and the joining area; andpresenting the gap mask.
  • 10. The method of claim 9, wherein generating the gap mask further comprises: discarding a portion of the mask having a preconfigured position relative to the shelf edge location.
  • 11. The method of claim 10, wherein the preconfigured position includes below the shelf edge location.
  • 12. The method of claim 10, wherein the preconfigured position includes horizontally spaced beyond an end of the shelf edge location.
  • 13. The method of claim 9, wherein generating the gap mask further comprises: comparing each area having a shelf back classification to a preconfigured area threshold, and discarding any areas that do not meet the threshold.
  • 14. The method of claim 9, wherein generating the gap mask further comprises: performing a region growth operation on the selected area with the joining area; andassigning the gap classification to a grown region resulting from the region growth operation.
  • 15. The method of claim 9, further comprising: obtaining depth data captured by a depth sensor and indicating a point depth for each of a plurality of points in the gap mask;dividing the gap mask into a plurality of vertical slices;for each vertical slice of the gap mask: determining a proportion of the point depths that exceed a median point depth for the vertical slice; andassigning a non-gap classification to the vertical slice when the proportion does not meet a preconfigured depth distribution threshold.
  • 16. The method of claim 9, wherein obtaining the mask comprises: obtaining, by the imaging controller, the image;decomposing, by the imaging controller, the image into a plurality of patches;for each patch: generating a feature descriptor;based on the feature descriptor, assigning one of the shelf back classification and the non-shelf back classification to the patch; andgenerating the mask corresponding to the image, the mask containing an indication of the classification assigned to each of the patches.
  • 17. A server for detecting a back of a shelf for supporting objects, comprising: a memory storing an image depicting a shelf having a shelf edge and a support surface extending from the shelf edge to a shelf back; andan imaging controller comprising: a pre-processor configured to decompose the image into a plurality of patches;a back of shelf detector configured to: (a) for each patch: generate a feature descriptor;based on the feature descriptor, assign one of a shelf back classification and a non-shelf back classification to the patch;(b) generate a mask corresponding to the image, the mask containing an indication of the classification assigned to each of the patches, wherein the indication of the classification assigned to each of the patches comprises one of a plurality of intensity values;the back of shelf detector further configured to present the mask.
  • 18. A server for detecting gaps in an image of a shelf having a shelf edge and a support surface for supporting objects extending from the shelf edge to a shelf back, the system comprising: a memory storing a mask generated from the image, the mask containing indications, for each of a plurality of areas of the mask, of a classification assigned to the area and selected from a shelf back classification and a non-shelf back classification; andan imaging controller comprising: a shelf edge detector configured to obtain a location of the shelf edge within the mask;a gap generator configured to generate a gap mask identifying a subset of the areas having shelf back classifications as gaps on the shelf, by: selecting an area of the mask within a predetermined distance of the shelf edge location and having the shelf back classification; andgenerating a joining area between the selected area and the shelf edge location; andassigning a gap classification to the selected area and the joining area; andthe gap generator further configured to present the gap mask.
  • 19. The method of claim 1 wherein the mask is a binary intensity mask.
  • 20. The method of claim 1, wherein patches that do not meet a back of shelf confidence threshold are assigned a first intensity value and patches that meet the back of shelf confidence threshold are assigned a second intensity value.
US Referenced Citations (363)
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
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
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
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
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
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
9549125 Goyal et al. Jan 2017 B1
9562971 Shenkar et al. Feb 2017 B2
9565400 Curlander et al. Feb 2017 B1
9600731 Yasunaga et al. Mar 2017 B2
9600892 Patel et al. Mar 2017 B2
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
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
9980009 Jiang et al. May 2018 B2
9994339 Colson et al. Jun 2018 B2
10019803 Venable et al. Jul 2018 B2
10111646 Nycz et al. Oct 2018 B2
10127438 Fisher 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
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
10394244 Song et al. Aug 2019 B2
20010041948 Ross et al. Nov 2001 A1
20020006231 Jayant et al. Jan 2002 A1
20020097439 Braica Jul 2002 A1
20020158453 Levine Oct 2002 A1
20020164236 Fukuhara et al. Nov 2002 A1
20030003925 Suzuki Jan 2003 A1
20030174891 Wenzel et al. Sep 2003 A1
20040021313 Gardner et al. Feb 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
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
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 Jul 2008 A1
20080164310 Dupuy Jul 2008 A1
20080175513 Lai et al. Jul 2008 A1
20080181529 Michel et al. 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
20090323121 Valkenburg et al. Dec 2009 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
20100171826 Hamilton et al. Jul 2010 A1
20100208039 Setettner Aug 2010 A1
20100214873 Somasundaram et al. Aug 2010 A1
20100241289 Sandberg Sep 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
20110254840 Halstead Oct 2011 A1
20110286007 Pangrazio et al. Nov 2011 A1
20110288816 Thierman Nov 2011 A1
20110310088 Adabala et al. Dec 2011 A1
20120019393 Wolinsky et al. Jan 2012 A1
20120022913 Volkmann et al. Jan 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
20120287249 Choo et al. Nov 2012 A1
20120323620 Hofman Dec 2012 A1
20130030700 Miller et al. Jan 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 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 Ahem et al. Sep 2013 A1
20130235165 Gharib 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
20140002597 Taguchi et al. Jan 2014 A1
20140003655 Gopalakrishnan Jan 2014 A1
20140003727 Lortz et al. Jan 2014 A1
20140016832 Kong 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
20140156133 Cullinane 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
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
20140300637 Fan et al. Oct 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 Jan 2015 A1
20150029339 Kobres et al. Jan 2015 A1
20150039458 Reid Feb 2015 A1
20150088618 Basir 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
20150245358 Schmidt Aug 2015 A1
20150262116 Katircioglu Sep 2015 A1
20150279035 Wolski et al. Oct 2015 A1
20150298317 Wang et al. Oct 2015 A1
20150352721 Wicks et al. Dec 2015 A1
20150363625 Wu et al. Dec 2015 A1
20150363758 Wu et al. Dec 2015 A1
20150379704 Chandrasekar et al. Dec 2015 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
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
20160253735 Scudillo Sep 2016 A1
20160313133 Zang et al. Oct 2016 A1
20160328618 Patel 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
20170032311 Rizzolo et al. Feb 2017 A1
20170041553 Cao et al. Feb 2017 A1
20170066459 Singh Mar 2017 A1
20170074659 Giurgiu et al. Mar 2017 A1
20170150129 Pangrazio May 2017 A1
20170193434 Shah et al. Jul 2017 A1
20170219338 Brown et al. Aug 2017 A1
20170219353 Alesiani Aug 2017 A1
20170227645 Swope et al. Aug 2017 A1
20170227647 Baik Aug 2017 A1
20170228885 Baumgartner Aug 2017 A1
20170261993 Venable et al. Sep 2017 A1
20170262724 Wu et al. Sep 2017 A1
20170280125 Brown et al. Sep 2017 A1
20170286773 Skaff Oct 2017 A1
20170286901 Skaff Oct 2017 A1
20170323376 Glaser Nov 2017 A1
20180001481 Shah et al. Jan 2018 A1
20180005035 Bogolea Jan 2018 A1
20180005176 Williams 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
20180101813 Paat et al. Apr 2018 A1
20180114183 Howell Apr 2018 A1
20180143003 Clayton et al. May 2018 A1
20180174325 Fu et al. Jun 2018 A1
20180204111 Zadeh Jul 2018 A1
20180281191 Sinyayskiy et al. Oct 2018 A1
20180293442 Fridental 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
20190057588 Savvides et al. Feb 2019 A1
20190065861 Savvides et al. Feb 2019 A1
20190073554 Rzeszutek Mar 2019 A1
20190180150 Taylor et al. Jun 2019 A1
20190197728 Yamao Jun 2019 A1
Foreign Referenced Citations (34)
Number Date Country
2835830 Nov 2012 CA
3028156 Jan 2018 CA
104200086 Dec 2014 CN
107067382 Aug 2017 CN
0766098 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
101234798 Jan 2009 KR
1020190031431 Mar 2019 KR
WO 9923600 May 1999 WO
WO 2003002935 Jan 2003 WO
2003025805 Mar 2003 WO
2006136958 Dec 2006 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
2014181323 Nov 2014 WO
WO 2015127503 Sep 2015 WO
WO 2016020038 Feb 2016 WO
WO 2018018007 Jan 2018 WO
WO 2019023249 Jan 2019 WO
Non-Patent Literature Citations (91)
Entry
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.
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).
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).
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).
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).
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).
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).
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, Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1417218.3 (2 pages).
United Kingdom Intellectual Property Office, Combined Search and Examination Report dated Jan. 22, 2016 for GB Patent Application No. 1521272.3 (6 pages).
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. 15/211,103 dated Apr. 5, 2017.
Notice of allowance for U.S. Appl. No. 14/518,091 dated Apr. 12, 2017.
U.S. Appl. No. 15/583,717, filed May 1, 2017.
U.S. Appl. No. 15/583,801, filed May 1, 2017.
U.S. Appl. No. 15/583,680, filed May 1, 2017.
U.S. Appl. No. 15/583,759, filed May 1, 2017.
U.S. Appl. No. 15/583,773, filed May 1, 2017.
U.S. Appl. No. 15/583,786, filed May 1, 2017.
International Patent Application Serial No. PCT/CN2017/083143 filed May 5, 2017.
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 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. PCTAJS2019/025859 dated Jul. 3, 2019.
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/US2019/025870 dated Jun. 21, 2019.
International Search Report and Written Opinion from International Patent Application No. PCT/US2018/030363 dated Jul. 9, 2018.
International Search Report and Written Opinion from International Patent Application No. PCT/US2019/025849 dated Jul. 9, 2019.
Jadhav et al. “Survey on Spatial Domain dynamic template matching technique for scanning linear barcode,” International Journal of scieve 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).
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.
Ni et al., “Edge Detection and Feature Line Tracing in 3D-Point Clouds by Analyzing Geometric Properties of Neighborhoods,” Remote Sensing, V8 19, pp. 1-20 (2016).
Norriof et al., “Experimental comparison of some classical iterative learning control algorithms”, IEEE Transactions on Robotics and Automation, Jun. 2002, pp. 636-641.
Olson, Clark F., etal. “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-181.
Park et al., “Autonomous mobile robot navigation using passiv 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).
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=pdf, pp. 1-6.
United Kingdom Intellectual Property Office, “Combined Search and Examination Report” for GB Patent Application No. 1813580.6 dated Feb. 21, 2019.
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.
“Fair Billing with Automatic Dimensioning” pp. 1-4, undated, Copyright Mettler-Toledo International Inc.
“Plane Detection in Point Cloud Data” dated Jan. 25, 2010 by Michael Ying Yang and Wolfgang Forstner, Technical Report 1, 2010, University of Bonn.
“Swift Dimension” Trademark Omniplanar, Copyright 2014.
Ajmal S. Mian et al., “Three-Dimensional Model Based Object Recognition and Segmentation in Cluttered Scenes”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, No. 10, Oct. 2006.
Batalin et al., “Mobile robot navigation using a sensor network,” IEEE, International Conference on robotics and automation, Apr. 26, May 1, 2004, pp. 636-641.
Bazazian et al., “Fast and Robust Edge Extraction in Unorganized Point clouds,” IEEE, 2015 International Conference on Digital Image Computing: Techniques and Applicatoins (DICTA), Nov. 23-25, 2015, pp. 1-8.
Biswas et al. “Depth Camera Based Indoor Mobile Robot Localization and Navigation” Robotics and Automation (ICRA), 2012 IEEE International Conference on IEEE, 2012.
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 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), p. 88-93, 2527, Sep. 25-27, 2013.
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.
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.
Related Publications (1)
Number Date Country
20180315173 A1 Nov 2018 US