Three-dimensional (3D) point clouds can be used to determine dimensions of various objects. In the context of moving freight, point clouds can capture freight and a freight-moving vehicle in motion. Dimensions of the freight can be improved by stopping the freight-moving vehicle and setting down the freight; this, however, leads to delays in moving the freight.
Accordingly, there is a need for methods and systems for processing point-cloud data with a line scanner.
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.
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.
One embodiment takes the form of a method that includes receiving a 3D (three-dimensional) point cloud that is representative of a freight-moving vehicle having loaded freight; using at least one line scanner that is oriented to scan in a vertical plane and positioned to identify a lower bound of the loaded freight; and dimensioning the loaded freight based on points in the point cloud, wherein each of the points in the point cloud that are used for dimensioning the loaded freight is at or above the identified lower bound.
Another embodiment takes the form of a system that includes a communication interface, a processor, and data storage containing instructions executable by the processor for carrying out at least the functions described in the preceding paragraph.
In at least one embodiment the at least one line scanner comprises at least one LIDAR (Light Detection and Ranging) line scanner.
In at least one embodiment the line scanner is affixed to a fixed structure such that the line scanner can capture the bottom most portion of a loaded freight.
In at least one embodiment, the at least one line scanner is oriented to scan in the vertical plane between a first angle below horizontal and a second angle above horizontal positioned such that the line scanner can capture the bottom most portion of a loaded freight.
In at least one embodiment, the at least one line scanner is one line scanner.
In at least one embodiment, the at least one line scanner includes two line scanners that are positioned on substantially opposite sides of the loaded freight positioned such that the line scanner can capture the bottom most portion of a loaded freight.
In at least one embodiment, the lower bound is a lower point.
In at least one embodiment, the lower bound is a lower contour, wherein identifying the lower bound of the loaded freight is further based on positioning information regarding one or both of the freight-moving vehicle and the loaded freight.
In at least one embodiment, using the at least one line scanner to identify the lower bound of the loaded freight is carried out responsive to detecting a triggering event. In one such embodiment, the triggering event comprises receiving an indication from a motion sensor.
In at least one embodiment, dimensioning the loaded freight based on points in the point cloud comprises: generating a reduced point cloud at least in part by removing from the received point cloud all points lower than the identified lower bound; and dimensioning the loaded freight using the reduced point cloud.
In at least one embodiment, the method further comprises using at least one upper-bound line scanner that is oriented to scan in a vertical plane to identify an upper bound of the loaded freight, and dimensioning the loaded freight based on points in the point cloud comprises dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound and not above the identified upper bound. In one such embodiment, the method further comprises using at least one side-bound line scanner that is oriented to scan in a horizontal plane to identify a side bound of the loaded freight, and dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound comprises dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound and inside the identified side bound.
In at least one embodiment, using the at least one line scanner to identify the lower bound of the loaded freight comprises operating the at least one line scanner between an upper scan limit and a lower scan limit. In one such embodiment, at least one of the upper scan limit and the lower scan limit is configurable; in another such embodiment, the method further comprises setting the upper scan limit based on a maximum height of the 3D point cloud; in another such embodiment, the method further comprises setting the lower scan limit based on a minimum height of the 3D point cloud.
In at least one embodiment, using the at least one line scanner to identify the lower bound of the loaded freight comprises operating the at least one line scanner below an upper scan limit.
In at least one embodiment, the method comprises: receiving a 3D point cloud that is representative of an object; using one or more line scanners to identify one or more respective outer bounds of the object; and dimensioning the object based on points in the point cloud, wherein each of the points in the point cloud that are used for dimensioning the object is at or inside every identified outer bound.
Moreover, any of the variations and permutations described herein can be implemented with respect to any embodiments, including with respect to any method embodiments and with respect to any system embodiments. Furthermore, this flexibility and cross-applicability of embodiments is present in spite of the use of slightly different language (e.g., process, method, steps, functions, set of functions, and the like) to describe and or characterize such embodiments.
Before proceeding with this detailed description, it is noted that the entities, connections, arrangements, and the like that are depicted in—and described in connection with—the various figures are presented by way of example and not by way of limitation. As such, any and all statements or other indications as to what a particular figure “depicts,” what a particular element or entity in a particular figure “is” or “has,” and any and all similar statements—that may in isolation and out of context be read as absolute and therefore limiting—can only properly be read as being constructively preceded by a clause such as “In at least one embodiment . . . .” And it is for reasons akin to brevity and clarity of presentation that this implied leading clause is not repeated ad nauseum in this detailed description.
At step 102, the received 3D point cloud is representative of an object. The 3D point cloud may be generated from a depth sensor, or an array of depth sensors.
At step 104, one or more line scanners are used to identify one or more respective outer bounds of the object. The line scanners may be LIDAR (Light Detection and Ranging) line scanners and be capable of scanning a plane to determine an outer bound of an object. Example outer bounds may be any one of a lower bound, an upper bound, side bounds, front bounds, or rear bounds.
At step 106, the object is dimensioned based on points in the point cloud, wherein each of the points in the point cloud that is used for dimensioning the object is at or inside every identified outer bound. The dimensioning may occur by filtering out points in the point cloud that are outside of the identified outer bounds, resetting the point cloud values to the identified outer bounds, deleting points in the point cloud that are outside of the identified outer bounds, and the like.
At step 202, the received 3D point cloud is representative of a freight-moving vehicle. The 3D point cloud may be generated from a depth sensor, or an array of depth sensors. The depth sensor may be installed over the freight-moving vehicle and be configured to generate the point cloud as the freight-moving vehicle drives past, or under, the depth sensor.
At step 204, a line scanner, oriented to scan in a vertical plan and positioned to capture the bottom portion of the freight, identifies a lower bound of the loaded freight. The line scanners may be LIDAR line scanners and be capable of scanning the vertical plane to determine the lower bound of the freight. To determine the lower bound, the LIDAR line scanner scans the vertical plane and returns depth values. Based on a known location of the LIDAR line scanner and a known position of the freight-moving vehicle, a lower bound of the freight can be identified.
One method to determine the lower bound is to identify a step-change in returned depth values, and identifying the lower bound as the point where the depth readings from the LIDAR line scanner step from being close to far.
At step 206, the loaded freight is dimensioned based on points in the point cloud, wherein each of the points in the point cloud that is used for dimensioning the object is at or above the identified lower bound. Similar to step 106 of method 100, the dimensioning may occur by filtering out points in the point cloud that are below the identified lower bound, resetting the point cloud values of points below the identified lower bound to the identified lower bound, deleting points in the point cloud that are below the identified lower bound, and the like.
In at least one embodiment, dimensioning the loaded freight based on points in the point cloud includes generating a reduced point cloud at least in part by removing from the received point cloud all points lower than the identified lower bound and dimensioning the loaded freight using the reduced point cloud.
The dimension of freight can be output to another server for use in tracking of the freight. Example methods of tracking include calculating a volume of the freight, a density of the freight, and the like.
The computer processing system 300 may be found in portions of the disclosed invention, to include the depth sensor, the line scanner, the freight-dimensioning module, or the like. Not all elements depicted as part of the computer processing system 300 are required in all elements. As just one example, the computer processing system in one of the LIDAR line scanners may be equipped with a transceiver 304 if it connects wirelessly to a freight-dimensioning module, however in some embodiments, the LIDAR line scanner may be wired to the freight dimensioning module and the transceiver 304 is not required.
As stated above, the communication interface 302 includes the transceiver 304. The transceiver 304 may be configured (e.g., tuned) to receive and transmit on one of a set of channels. The transceiver 304 may be a single component, or realized as a separate transmitter and receiver, as known by those with skill in the art. The communication interface 302 may be configured to be operable for communication according to one or more wireless-communication protocols, some examples of which include LMR, LTE, APCO P25, ETSI DMR, TETRA, Wi-Fi, Bluetooth, and the like. The communication interface 302 may also include one or more wired-communication interfaces (for communication according to, e.g., Ethernet, USB, and/or one or more other protocols.) The communication interface 302 may include any necessary hardware (e.g., chipsets, antennas, Ethernet interfaces, etc.), any necessary firmware, and any necessary software for conducting one or more forms of communication with one or more other entities as described herein.
The data storage 306 may take the form of any non-transitory computer-readable medium or combination of such media, some examples including flash memory, read-only memory (ROM), and random-access memory (RAM) to name but a few, as any one or more types of non-transitory data-storage technology deemed suitable by those of skill in the relevant art could be used. As depicted in
The processor 312 may include one or more processors of any type deemed suitable by those of skill in the relevant art, some examples including a general-purpose microprocessor and a dedicated digital signal processor (DSP).
The user interface 314 may include one or more input devices (a.k.a. components and the like) and/or one or more output devices (a.k.a. components and the like.) With respect to input devices, the user interface 314 may include one or more touchscreens, buttons, switches, microphones, and the like. With respect to output devices, the user interface 314 may include one or more displays, speakers, light emitting diodes (LEDs), and the like. Moreover, one or more components (e.g., an interactive touchscreen and display) of the user interface 314 could provide both user-input and user-output functionality. Other user interface components could also be present, as known to those of skill in the art.
The peripherals 316 may include any computing device accessory, component, or the like, that is accessible to and useable by the computing device during operation. Example peripherals 316 include a GPS receiver, an altimeter, an RSSI sensor, a motion sensor and the like.
In an embodiment, the various components of the computer processing system 300 are all communicatively coupled with one another via a communication bus 318 (or other suitable communication network, or the like.)
The system 400 may be configured to perform the method 100 or 200. For example, the depth sensor 402 may perform either the step 102 or step 202 to receive a 3D point cloud of the object or freight-loaded vehicle, respectively. The line scanner 404 may perform either step 104 or 204 to identify an outer bound or lower bound, respectively. The dimensioning module 406 may perform either step 106 or 206 to dimension the object or the loaded freight, respectively. The above components are connected via the system bus 408.
The line scanner 404 may be at least one line scanner configured to identify a bound, such as an outer bound or a lower bound.
The depth sensor 402 is configured to generate a 3D point cloud of objects in the 3D point cloud field of view 502. While the depth sensor 402 is depicted as a single depth sensor, it may also be an array of depth sensors in different positions. Data from the array of depth sensors may be fused together into a single 3D point cloud representative of the objects in the field of view.
The line scanner 404 is configured to scan in the vertical plane 504. The freight-moving vehicle 506 carrying the freight 508 drives through the vertical plane 504. The line scanner 404 scans in the vertical plane 504 as the freight 508 passes through the vertical plane 504 to identify the lower bound of the freight.
In some embodiments, the line scanner 404 comprises at least one LIDAR line scanner. In another embodiment, the line scanner 404 is affixed to a structure, such a wall, a door frame, or a bump post. In yet another embodiment, the line scanner 404 is one line scanner.
In some embodiments, the lower bound is a lower point. The lower point may be set by the lowest detected point of the freight, the closest point to the floor, an average of the data points of several line scanner readings as the freight passes the line scanner, or other similar manner. When dimensioning the loaded freight based on points in the point cloud, each of the points in the point cloud that are used for dimensioning the loaded freight is at or above the identified lower point.
In some embodiments, the lower bound is a lower contour, and identifying the lower bound of the loaded freight is further based on positioning information regarding one or both of the freight-moving vehicle and the loaded freight. In such an embodiment, positioning information of either the freight-moving vehicle or the loaded freight is used to identify the lower contour. As the freight-moving vehicle passes through the vertical plane in front of the line scanner, the line scanner performs scans of the vertical plane to identify a lower bound. The lower contour may be a line between a first identified lower bound at the front of the freight and a second identified lower bound at the back of the freight. The lower contour may also be non-linear and based on several different readings from the line scanner as the freight moves past the line scanner.
In one embodiment, using the at least one line scanner to identify the lower bound of the loaded freight is carried out response to detecting a triggering event. Example triggering events include receiving an indication from a motion sensor, detecting the identity of a freight-moving vehicle from an optical or RFID (Radio Frequency Identification) scanner, or a location-based trigger based on the known location of the freight-moving vehicle.
The lower protrusion 552 can be from irregularly shaped freight, portions of freight that protrude down when lifted, portions of damaged freight, and the like. As the freight 508, with the lower protrusion 552, and the freight-moving vehicle 506 drive past the line scanner 404 and the vertical plane 504, a lower bound of the freight 508 is identified. In an embodiment where the lower bound is a lower contour, the shape of the lower contour is based on the line scanner's detection of the lower protrusion 552.
In one embodiment, the line scanner 404 is oriented to scan the vertical plane 504 between the first angle 604 below the horizontal plane 602 and the second angle 606 above the horizontal plane 602. Either one or both of the upper and lower scan limits may be configurable. For example, the upper scan limit may be based on a maximum height of the 3D point cloud and the lower scan limit may be based on a minimum height of the 3D point cloud.
In another embodiment, using the at least one line scanner to identify the lower bound of the loaded freight includes operating the at least one line scanner below an upper scan limit.
In one embodiment, using the at least one line scanner to identify the lower bound of the loaded freight includes operating the at least one line scanner between an upper scan limit and a lower scan limit. For example, the lower scan limit may be set by limiting the first angle 604 to a set value and the upper scan limit may be set by limiting the second angle 606.
The line scanners 404A and 404B are similar to the line scanner 404 depicted in
In one embodiment, the method further includes using at least one upper-bound line scanner that is oriented to scan in a vertical plane to identify an upper bound of the loaded freight, and dimensioning the loaded freight based on points in the point cloud includes dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound and not above the identified upper bound.
Similar to the configuration 500 depicted in
In one embodiment, dimensioning the freight may further comprise using at least one side-bound line scanner that is oriented to scan in a horizontal plane to identify a side bound of the loaded freight. In such an embodiment, dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound comprises dimensioning the loaded freight based on points in the point cloud that are above the identified lower bound and inside the identified side bound.
In one embodiment, dimensioning the loaded freight includes rotating the 3D point cloud. Rotation of the 3D point cloud may be advantageous if the freight-moving vehicle is not carrying the freight on level. For example, the freight may be tilted backwards towards the forklift. In such an embodiment, rotation of the 3D point cloud may be based on the identified lower bound. In one rotation example, the identified lower bound is a lower contour in the shape of a line that is on a 5-degree incline, meaning the freight is inclined 5 degrees off a horizontal floor. The 3D point cloud may be rotated by 5 degrees to counter the incline imposed on the freight by the freight-moving vehicle, thus leveling the 3D point cloud. In another rotation example, the 3D point cloud may be rotated by identifying a minimum (i.e., lowest) point of the lower contour and rotating the 3D point cloud such that all points of the lower contour are at the height of the identified minimum point.
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.
Number | Name | Date | Kind |
---|---|---|---|
5408322 | Hsu et al. | Apr 1995 | A |
5988862 | Kacyra et al. | Nov 1999 | A |
6115114 | Berg | Sep 2000 | A |
6995762 | Pavlidis et al. | Feb 2006 | B1 |
7137207 | Armstrong et al. | Nov 2006 | 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 |
7527205 | Zhu et al. | May 2009 | B2 |
7605817 | Zhang et al. | Oct 2009 | B2 |
7647752 | Magnell | Jan 2010 | B2 |
7726575 | Wang et al. | Jun 2010 | B2 |
8094937 | Teoh et al. | Jan 2012 | B2 |
8132728 | Dwinell et al. | Mar 2012 | B2 |
8134717 | Pangrazio et al. | Mar 2012 | B2 |
8199977 | Krishnaswamy et al. | Jun 2012 | B2 |
8265895 | Willins et al. | Sep 2012 | B2 |
8284988 | Sones et al. | Oct 2012 | B2 |
8463079 | Ackley et al. | Jun 2013 | B2 |
8479996 | Barkan et al. | Jul 2013 | B2 |
8542252 | Perez et al. | Sep 2013 | B2 |
8599303 | Stettner | Dec 2013 | 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 |
8989342 | Liesenfelt et al. | Mar 2015 | B2 |
9007601 | Steffey et al. | Apr 2015 | B2 |
9070285 | Ramu | Jun 2015 | B1 |
9129277 | MacIntosh | Sep 2015 | B2 |
9329269 | Zeng | May 2016 | B2 |
9396554 | Williams et al. | Jul 2016 | B2 |
9400170 | Steffey | Jul 2016 | B2 |
9549125 | Goyal et al. | Jan 2017 | B1 |
9562971 | Shenkar et al. | Feb 2017 | B2 |
9600892 | Patel et al. | Mar 2017 | B2 |
9778388 | Connor | Oct 2017 | B1 |
9791862 | Connor | Oct 2017 | B1 |
20010041948 | Ross et al. | Nov 2001 | A1 |
20020164236 | Fukuhara et al. | Jul 2002 | A1 |
20020158453 | Levine | Oct 2002 | A1 |
20040240754 | Smith et al. | Feb 2004 | A1 |
20050016004 | Armstrong et al. | Jan 2005 | A1 |
20050114059 | Chang et al. | May 2005 | A1 |
20060106742 | Bocchicchio et al. | May 2006 | A1 |
20070074410 | Armstrong et al. | Apr 2007 | A1 |
20070272732 | Hindmon | Nov 2007 | A1 |
20080238919 | Pack | Oct 2008 | A1 |
20090088975 | Sato et al. | Apr 2009 | A1 |
20090103773 | Wheeler et al. | Apr 2009 | A1 |
20090152391 | McWhirk | Jun 2009 | A1 |
20090323121 | Valkenburg et al. | Dec 2009 | A1 |
20100026804 | Tanizaki et al. | Feb 2010 | A1 |
20100091094 | Sekowski | Apr 2010 | A1 |
20100118116 | Tomasz | May 2010 | A1 |
20100131234 | Stewart et al. | May 2010 | A1 |
20100208039 | Stettner | Aug 2010 | A1 |
20100295850 | Katz | Nov 2010 | A1 |
20100315412 | Sinha et al. | Dec 2010 | A1 |
20110047636 | Stachon et al. | Feb 2011 | A1 |
20110052043 | Hung | Mar 2011 | A1 |
20110137527 | Simon et al. | Jun 2011 | A1 |
20110168774 | Magal | Jul 2011 | A1 |
20110172875 | Gibbs | Jul 2011 | A1 |
20110216063 | Hayes | Sep 2011 | A1 |
20110286007 | Pangrazio | Nov 2011 | A1 |
20110310088 | Adabala et al. | Dec 2011 | A1 |
20120075342 | Choubassi et al. | Mar 2012 | A1 |
20120179621 | Moir et al. | Jul 2012 | A1 |
20120185112 | Sung et al. | Jul 2012 | A1 |
20120209553 | Doytchinov et al. | Aug 2012 | A1 |
20120236119 | Rhee | Sep 2012 | A1 |
20120249802 | Taylor | Oct 2012 | A1 |
20120250978 | Taylor | Oct 2012 | A1 |
20120287249 | Choo et al. | Nov 2012 | A1 |
20130144565 | Miller | Jun 2013 | A1 |
20130156292 | Chang et al. | Jun 2013 | A1 |
20130162806 | Ding et al. | Jun 2013 | A1 |
20130228620 | Ahern et al. | Sep 2013 | A1 |
20130236089 | Litvak et al. | Sep 2013 | A1 |
20130299306 | Jiang et al. | Nov 2013 | A1 |
20130299313 | Baek, IV 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 | Jan 2014 | A1 |
20140028837 | Gao et al. | Jan 2014 | A1 |
20140049616 | Stettner | Feb 2014 | A1 |
20140098094 | Neumann | Apr 2014 | A1 |
20140100813 | Showering | Apr 2014 | A1 |
20140104413 | McCloskey et al. | Apr 2014 | A1 |
20140192050 | Qiu | Jul 2014 | A1 |
20140267614 | Ding et al. | Sep 2014 | A1 |
20140267688 | Aich et al. | Sep 2014 | A1 |
20140300637 | Fan et al. | Oct 2014 | A1 |
20140351073 | Murphy et al. | Nov 2014 | A1 |
20150015602 | Beaudoin | Jan 2015 | A1 |
20150088618 | Basir et al. | Mar 2015 | A1 |
20150092066 | Geiss et al. | Apr 2015 | A1 |
20150106403 | Haverinen et al. | Apr 2015 | A1 |
20150154467 | Feng | Jun 2015 | A1 |
20150161793 | Takahashi | Jun 2015 | A1 |
20150181198 | Baele et al. | Jun 2015 | A1 |
20150379704 | Chandrasekar et al. | Dec 2015 | A1 |
20160044862 | Kocer | Feb 2016 | A1 |
20160061591 | Pangrazio | Mar 2016 | A1 |
20160070981 | Sasaki et al. | Mar 2016 | A1 |
20160012588 | Taguchi | Apr 2016 | A1 |
20160107690 | Oyama et al. | Apr 2016 | A1 |
20160150217 | Popov | May 2016 | A1 |
20160156898 | Ren et al. | Jun 2016 | A1 |
20160163067 | Williams | Jul 2016 | A1 |
20170004649 | Collet Romea et al. | Jan 2017 | A1 |
20170041553 | Cao et al. | Feb 2017 | A1 |
20170150129 | Pangrazio | May 2017 | A1 |
20170227647 | Balk | Aug 2017 | A1 |
20170228885 | Baumgartner | Aug 2017 | A1 |
Number | Date | Country |
---|---|---|
2835830 | Nov 2012 | CA |
104200086 | Dec 2014 | CN |
2439487 | Apr 2012 | EP |
2562688 | Feb 2013 | EP |
2693362 | Feb 2014 | EP |
2003002935 | Jan 2003 | WO |
2008057504 | May 2008 | WO |
2008154611 | Dec 2008 | WO |
2013165674 | Nov 2013 | WO |
2014092552 | Jun 2014 | WO |
2015127503 | Sep 2015 | WO |
2016020038 | Feb 2016 | WO |
Entry |
---|
“Fair Billing with Automatic Dimensioning” pp. 1-4, undated, Copyright Mettler-Toledo International Inc. |
“Swift Dimension” Trademark Omniplanar, Copyright 2014. |
“Plane Detection in Point Cloud Data” dated Jan. 25, 2010 by Michael Ying Yang and Wolfgang Forstner, Technical Report 1, 2010, University of Bonn. |
Brown et al., U.S. Appl. No. 15/078,074, filed Mar. 23, 2016. |
Brown et al., U.S. Appl. No. 15/008,710, filed Jan. 28, 2016. |
Lecking et al., “Localization in a wide range of industrial environments using relative 3D ceiling features,” IEEE, pp. 333-337, Sep. 15, 2008. |
Carreira et al., “Enhanced PCA-based localization using depth maps with missing data,” IEEE, pp. 1-8 Apr. 24, 2013. |
Clayton et al., U.S. Appl. No. 15/358,810, filed Nov. 22, 2016. |
Fu et al., U.S. Appl. No. 15/385,113, filed Dec. 20, 2016. |
Ziang Xie et al., “Multimodal Blending for High-Accuracy Instance Recognition”, 2013 IEEE/RSJ International—Conference on Intelligent Robots and Systems, pp. 2214-2221. |
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. |
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. |
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. |
Gu et al., U.S. Appl. No. 15/242,126, filed Aug. 19, 2016. |
Dubois, M., et al., “A comparison of geometric and energy-based point cloud semantic segmentation methods,” European Conference on Mobile Robots (ECMR), vol., no., pp. 88-93, Sep. 25-27, 2013. |
Lari, Z., et al., “An adaptive approach for segmentation of 3D laser point cloud.” International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXVIII-5/W12, 2011, ISPRS Calgary 2011 Workshop, Aug. 29-31, 2011, Calgary, Canada. |
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]. |
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. |
Golovinskiy, Aleksey, et al. “Min-cut based segmentation of point clouds.” Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on. IEEE, 2009. |
Douillard, Bertrand, et al. “On the segmentation of 3D LIDAR point clouds.”Robotics and Automation (ICRA), 2011 IEEE International Conference on. IEEE, 2011. |
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. |
Datta, A., et al., “Accurate camera calibration using iterative refinement of control points,” in Computer Vision Workshops (ICCV Workshops), 2009. |
Olson, Clark F., et al. “Wide-Baseline Stereo Vision for Terrain Mapping” in Machine Vision and Applications, Aug. 2010. |
Rusu, et al., “How to incrementally register pairs of clouds,” PCL Library, retrieved from the Internet on Aug. 22, 2016 from <http://pointclouds.org/documentation/tutorials/pairwise_incremental_registration.php>. |
Meng et al., U.S. Appl. No. 15/131,856, filed Apr. 18, 2016. |
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. |
Schnabel et al. “Efficient RANSAC for Point-Cloud Shape Detection”, vol. 0, No. 0, pp. 1-12. |
Buenaposada et al. “Real-time tracking and estimation of plane pose” Proceedings of the ICPR (Aug. 2002) vol. II, IEEE pp. 697-700. |
International Search Report and Written Opinion for International Patent Application No. PCT/US2017/024847 dated Jul. 7, 2017. |
International Search Report and Written Opinion for corresponding International Patent Application No. PCT/US2016/065519 dated Apr. 10, 2017. |
Number | Date | Country | |
---|---|---|---|
20170227645 A1 | Aug 2017 | US |