Patent Grant
9760752
Not applicable.
The present invention relates to code readers and more specifically to code readers that attempt to optimize decode processes to decode code candidates in a rapid succession of obtained images.
Automated identification of products using optical codes has been broadly implemented throughout industrial operations and in many other applications for many years. Optical codes are patterns composed of elements with different light reflectance or emission, assembled in accordance with predefined rules. The elements in the optical codes may be bars or spaces in a linear barcode, or the on/off pattern in a two-dimensional matrix code. The bar code or symbols can be printed on labels placed on product packaging, or directly on the product itself by direct part marking. The information encoded in a bar code or symbol can be decoded using optical readers in fixed-mount installations or in portable hand held devices. In the case of a fixed-mount device, often a transfer line or the like is provided that moves objects marked with codes or symbols by a device detector so that the detector can generate images of the codes.
At least some reader devices include a camera capable of generating two dimensional images of a field of view. For example, many systems currently employ a two dimensional CCD image sensor which obtains images and generates image data which is provided to a processor. The processor is programmed to examine image data to identify code candidates (e.g., bar code or symbol candidates) and attempt to decode the code candidates. At least some reader devices are programmed to obtain images of a FOV in rapid succession and to attempt to decode any code candidates in the obtained images as quickly as possible. To decode codes, the processor runs one or more decode algorithms.
Where objects are moved through a device's FOV via a transfer line or the like as images are obtained, in many cases a large number of images of the same object and applied code are obtained with the object and code in different locations along the direction of travel through the FOV. Here, some code candidates in an image will be new to the FOV (i.e., the candidates were located outside the FOV during previous images) and some will be exiting the FOV prior to generation of a subsequent image.
When obtaining an image of a code, the quality of the image depends on several factors including the angle of a sensor with respect to a surface on which the code is applied, the material and texture of the surface on which the code is applied, code marking quality or damage after marking, ambient and device lighting characteristics, distortion in the applied symbol, transfer line speed, distance from the surface on which the code is applied, optical blur, camera resolution, etc. Image quality affects the ability of a processor running a specific algorithm to decode a code. For example, in many cases a simple decoding algorithm will not be able to successfully decode codes in an image unless the circumstances surrounding image acquisition are substantially ideal.
To compensate for imperfect image acquisition, relatively more complex decode algorithms have been developed. For instance, several decode algorithms have been developed which can at least partially compensate for imperfect lighting, a curved surface that a code is applied to, imperfect sensor angle with respect to the surface that a code is applied to, etc.
While complex decode algorithms work well to compensate for imperfect images, one draw back is that complex algorithms often require a greater amount of processing power and a commensurate greater amount of time to perform. While more expensive algorithms are not an issue in some applications, in applications where images are obtained in rapid succession, expensive algorithms requiring long periods to complete can result in computational requirements that far exceed capabilities of reader processors. More specifically, in some cases, image sensors are capable of obtaining and providing images so quickly that a reader device processor cannot perform a complex algorithm on all code candidates in an image prior to receiving a next image.
Where a processor cannot keep up with the computational demands required to perform a complex algorithm for all code candidates in a rapid succession of images, one solution may be to forego analysis of candidates in next images until a reader device has attempted to decode all code candidates in a current image. Thus, for instance, where second through fourth images are obtained during the period required to attempt to decode all code candidates in a first image, the second through fourth images would be discarded when a fifth image is obtained and code candidates in the fourth image would be examined. While this solution ensures that the complex algorithm is applied to all candidates in a current or first image, this solution simply ignores code candidates in the second through fourth image while candidates in the first image are processed despite the fact that candidates in the subsequent images may be better suited to be decoded. In this case, the end result may be that some codes that pass through a field of view are never successfully decoded.
It has been recognized that code candidates in obtained images can be ordered in a candidate order for decode attempts as a function various factors including locations of candidates in an image currently being examined, locations of candidates in images previously obtained, the results of decode attempts in previous images, the direction of object/code travel through a field of view, the speed of travel through the field of view, whether or not candidates will likely appear in subsequent images, whether or not candidates are newly located within the field of view, and many other factors. Here, after a candidate order is established, a processor attempts to decode the candidates in the established order until a next image event occurs at which point the processor discards or at least stops attempting to decode candidates in the current image and commences processing of code candidates in the next image. Here, the next image event may be reception of a next image, the end of a timeout period, completion of a number of decode attempts selected to be able to be completed prior to the anticipated reception of a next image, completion of decoding attempts for all code candidates that likely have not been decoded in previous images, etc.
For instance, in at least some embodiments where a transfer line moves objects/codes through a device field of view in a direction of travel so that new images enter the field of view along an entry edge and exit along an exit edge, the processor may be programmed to order code candidates in obtained images so that the processor attempts to decode candidates closest to the entry edge first followed by candidates more distant from the entry edge until either the processor has attempted to decode all of the candidates or a next image event (e.g., a next image is obtained) occurs. When a next image event occurs prior to attempting to decode all candidates, the processor discards or foregoes processing candidates that the processor has not yet started to attempt to decode and, in at least some cases, may stop decoding candidates currently being decoded, and starts to process the next image.
As another instance, the processor may be programmed to order code candidates in obtained images so that the processor attempts to decode candidates closest to the exit edge first followed by candidates more distant from the exit edge until either the processor has attempted to decode all of the candidates or a next image event (e.g., a next image is obtained) occurs. In still other cases the processor may divide the FOV into different regions of interest (ROIs) and then attempt to decode candidates in the ROIs in a sequential order starting with candidates in a first ROI, followed by a second ROI and so on until all candidates have been attempted or until a next image event occurs.
In still other embodiments the processor may be programmed to identify candidates that likely will not appear in a next image based on travel direction, speed and locations of candidates in a current image or any subset of these factors and may order the candidates so that candidates that likely will not appear in a next image are processed early in the order.
In other embodiments the processor may be programmed to keep track of locations of successfully decoded candidates in prior images and to order candidates for decode attempts as a function of which code candidates in a current image were likely successfully decoded in prior images and which were not. For example, where two of ten candidates in a current image likely correspond to two successfully decoded candidates from prior images, the processor may order the other eight candidates first and only attempt to decode the two likely previously successfully decoded candidates last if there is time prior to obtaining a next image.
In yet other embodiments the processor may order candidates as a function of both whether or not the candidates will likely appear in subsequent images and whether or not the candidates were likely decoded in prior images as well as based on location of candidates in an image or other factors.
Some embodiments include a method for decoding codes applied to objects for use with a camera and a conveyor system wherein the camera includes an image sensor having a two dimensional field of view (FOV) and the conveyor system moves objects in a first direction of travel through the FOV such that objects enter the FOV along an entry edge and exit the FOV along an exit edge, the method comprising the steps of providing a processor programmed to perform the steps of, obtaining images of the FOV, for each image, identifying code candidates in at least portions of the image, ordering at least a subset of the code candidates for decoding in a candidate order wherein the candidate order is determined at least in part as a function of the first direction of travel through the FOV, attempting to decode code candidates in the order specified by the direction of travel and when a new image event occurs, foregoing attempts to decode at least a portion of the identified code candidates.
In some embodiments the step of ordering at least a subset of code candidates includes identifying at least first and second regions of interest (ROIs) in the FOV that are adjacent the entry edge and the exit edge of the FOV, respectively, identifying code candidates in each of the at least first and second ROIs, and ordering the code candidates in one of the first and second ROIs for processing prior to the code candidates in the other of the first and second ROIs. In some embodiments the code candidates in the first ROI are ordered prior to the code candidates in the second ROI in the candidate order. In some embodiments the code candidates in the second ROI are ordered prior to the code candidates in the first ROI in the candidate order.
In some embodiments the step of ordering at least a subset of the code candidates further includes the step of identifying code candidates that will likely be outside the FOV when a next image is obtained and ordering the code candidates that will likely be outside the FOV when the next image is obtained near the beginning of the candidate order. In some cases the step of identifying code candidates that will likely be outside the FOV further includes the step of, for code candidates that will likely be outside the FOV when the next image is obtained, identifying code candidates that have likely been decoded in prior images and code candidates that likely have not been decoded in prior images and ordering the code candidates that likely have not been decoded in prior images prior to the code candidates that have likely been decoded in prior images.
In some cases the step of ordering at least a subset of the code candidates further includes the steps of identifying code candidates that are likely new to the FOV and identifying code candidates that were likely in a prior image and that will likely be in the FOV when a subsequent image is obtained and ordering the code candidates that were likely in a prior image and that will likely be in the FOV when the subsequent image is obtained near the end of the candidate order and the code candidates that were likely in a prior image generally near the middle of the candidate order.
In some embodiments the step of ordering at least a subset of the code candidates includes identifying code candidates that likely are new to the FOV near the beginning of the candidate order. In some embodiments the step of ordering at least a subset of the code candidates includes, identifying code candidates that are likely to be outside the FOV when a next image is obtained and that have likely not been decoded in a prior image as a first candidate subset, identifying code candidates that are likely to be outside the FOV when a next image is obtained and that have likely been decoded in a prior image as a second candidate subset, identifying code candidates that are likely to be in the FOV when a next image is obtained and that have likely not been decoded in a prior image as a third candidate subset, identifying code candidates that are likely to be in the FOV when a next image is obtained and that have likely been decoded in a prior image as a fourth candidate subset and ordering the subsets so that the first candidate subset occurs prior to the second candidate subset, the second candidate subset occurs prior to the third candidate subset and the third candidate subset occurs prior to the fourth candidate subset.
In some cases, when a new image is obtained, the method further includes discarding code candidates in the candidate order for which no attempt to decode has occurred. In some cases the conveyor system conveys objects in the first direction of travel at a conveyor speed and wherein the candidate order is determined at least in part as a function of the conveyor speed. In some embodiments at least first and second different decode algorithms may be used to attempt to decode any of the code candidates, the method further including the step of assigning one of the first and second decode algorithms to each of at least a subset of the code candidates in the candidate order wherein the algorithm assigned to each candidate is at least in part a function of the candidate order.
Some embodiments further include the steps of identifying code candidates that were likely successfully decoded in prior images and code candidates that were likely not successfully decoded in prior images, the step of assigning first and second decode algorithms including assigning the decode algorithms at least in part as a function of whether or not code candidates were likely decoded in a prior image.
In some embodiments the first decode algorithm requires more time than the second decode algorithm to complete. In some cases a new image event occurs when a new image is obtained. In some embodiments a new image event occurs when an image acquisition period has lapsed.
A method for decoding codes applied to objects for use with a camera and a conveyor system wherein the camera includes an image sensor having a two dimensional field of view (FOV) and the conveyor system moves objects in a first direction of travel through the FOV such that objects enter the FOV along an entry edge and exit the FOV along an exit edge, the method comprising the steps of, providing a processor programmed to perform the steps of, identifying the first direction of travel through the FOV, obtaining images of the FOV, for each image, where an image most recently obtained is a current image, identifying code candidates in at least portions of the image, attempting to decode code candidates that are proximate the exit edge of the FOV, after attempting to decode code candidates that are proximate the exit edge of the FOV, attempting to decode code candidates that are proximate the entry edge of the FOV and when a new image event occurs, foregoing attempts to decode at least a portion of the identified code candidates.
Some embodiments include a method for decoding codes applied to objects for use with a camera and a conveyor system wherein the camera includes an image sensor having a two dimensional field of view (FOV) and the conveyor system moves objects in a first direction through the FOV such that objects enter the FOV along an entry edge and exit the FOV along an exit edge so that the sensor generates images having at least first and second different regions of interest that are adjacent the entry edge and the exit edge, respectively the method comprising the steps of providing a processor programmed to perform the steps of, obtaining an image of the FOV, for each image, identifying code candidates in at least portions of the image, identifying at least first and second different regions of interest (ROIs) in the obtained image, attempting to decode code candidates in the first ROI a first time, after attempting to decode candidates in the first ROI, attempting to decode code candidates in the second ROI, after attempting to decode candidates in the second ROI, attempting a second time to decode code candidates in the first ROI, and when a new image event occurs, foregoing attempts to decode at least a portion of the identified code candidates.
In some embodiments the step of attempting to decode code candidates in the first ROI a first time includes using a first decode algorithm and the step of attempting to decode code candidates in the first ROI a second time includes attempting to decode the code candidates using a second decode algorithm that is different than the first decode algorithm. In some embodiments the first ROI is proximate one of the entry and exit edges of the FOV and the second ROI is proximate the other of the entry and exit edges of the FOV.
Some embodiments further include the step of ordering code candidates within the first ROI in a candidate order, the step of attempting to decode code candidates in the first ROI a first time, including attempting to decode the code candidates in an order prescribed by the candidate order. Some cases further include the step of identifying code candidates in the first ROI that have likely been previously decoded in at least one prior image, the step of ordering the code candidates including order the code candidates at least in part as a function of which candidates have likely been previously decoded in at least one prior image,
Other embodiments include an apparatus for decoding codes applied to objects for use with a camera and a conveyor system wherein the camera includes an image sensor having a two dimensional field of view (FOV) and the conveyor system moves objects in a first direction of travel through the FOV such that objects enter the FOV along an entry edge and exit the FOV along an exit edge, the apparatus comprising a processor programmed to perform the steps of, obtaining images of the FOV, for each image, identifying code candidates in at least portions of the image, ordering at least a subset of the code candidates for decoding in a candidate order wherein the candidate order is determined at least in part as a function of the first direction of travel through the FOV, attempting to decode code candidates in the order specified by the direction of travel, and when a new image event occurs, foregoing attempts to decode at least a portion of the identified code candidates.
In some embodiments the processor is programmed to perform the step of ordering at least a subset of code candidates by identifying at least first and second regions of interest (ROIs) in the FOV that are adjacent the entry edge and the exit edge of the FOV, respectively, identifying code candidates in each of the at least first and second ROIs, and ordering the code candidates in one of the first and second ROIs for processing prior to the code candidates in the other of the first and second ROIs.
In some embodiments the processor is programmed to perform the step of ordering at least a subset of the code candidates by identifying code candidates that will likely be outside the FOV when a next image is obtained and ordering the code candidates that will likely be outside the FOV when the next image is obtained near the beginning of the candidate order. In some embodiments the processor is programmed to perform the step of ordering at least a subset of the code candidates by identifying code candidates that likely are new to the FOV near the beginning of the candidate order.
Still other embodiments include an apparatus for decoding codes applied to objects for use with a camera and a conveyor system wherein the camera includes an image sensor having a two dimensional field of view (FOV) and the conveyor system moves objects in a first direction of travel through the FOV such that objects enter the FOV along an entry edge and exit the FOV along an exit edge, the apparatus comprising a processor programmed to perform the steps of identifying the first direction of travel through the FOV, obtaining images of the FOV, for each image, where an image most recently obtained is a current image, identifying code candidates in at least portions of the image, attempting to decode code candidates that are proximate the exit edge of the FOV, after attempting to decode code candidates that are proximate the exit edge of the FOV, attempting to decode code candidates that are proximate the entry edge of the FOV and when a new image event occurs, foregoing attempts to decode at least a portion of the identified code candidates.
To the accomplishment of the foregoing and related ends, the invention, then, comprises the features hereinafter fully described. The following description and the annexed drawings set forth in detail certain illustrative aspects of the invention. However, these aspects are indicative of but a few of the various ways in which the principles of the invention can be employed. Other aspects, advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.
The various aspects of the subject invention are now described with reference to the annexed drawings, wherein like reference numerals correspond to similar elements throughout the several views. It should be understood, however, that the drawings and detailed description hereafter relating thereto are not intended to limit the claimed subject matter to the particular form disclosed. Rather, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the claimed subject matter.
As used herein, the terms “component,” “system” and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computer and the computer can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers or processors.
The word “exemplary” is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.
Furthermore, the disclosed subject matter may be implemented as a system, method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer or processor based device to implement aspects detailed herein. The term “article of manufacture” (or alternatively, “computer program product”) as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick). Additionally it should be appreciated that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a local area network (LAN). Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.
Referring now to the drawings wherein like reference numerals correspond to similar elements throughout the several views and, more specifically, referring to
Referring still to
Referring now to
Referring again to
It has been recognized that system processor 14 will have attempted to decode many of the code candidates within an obtained image in prior images at least once and in many cases several times. For example, referring once again to
Referring still to
Thus, in at least some embodiments, processor 14 may be programmed to effectively order code candidates within an obtained image for decoding in a candidate order where candidates new to the field of view 28 are attempted first followed by candidates that have been within the field of view 28 for a relatively longer period of time.
Referring now to
At block 50, processor 14 attempts to decode a next code candidate in the candidate order. The first time through block 50 for an image, processor attempts to decode the first code candidate within the candidate order, the second time through block 50 for an image, processor 14 attempts to decode the second code candidate within the order, and so on. At block 52, processor 14 determines whether or not the code candidate was successfully decoded. Where a code candidate has been successfully decoded, control passes to block 56 where processor 14 indicates that the decode attempt has been successful after which control passes to block 58.
Referring again to block 52, where the code candidate has not been successfully decoded, control passes to block 58. At block 58, processor 14 determines whether or not a next image has been obtained. Where a next image has been obtained, control passes back up to block 46 where processor 14 again identifies all code candidates within the obtained image and the process described above continues. Here, it should be appreciated that when a next image is obtained at block 58 prior to processor 14 attempting to decode all of the code candidates within the current image, candidates that the processor has not yet attempted to decode, in at least some embodiments, are simply discarded. Thus, for example, referring again to
In at least some embodiments, processor 14 may be programmed to, when a next image is obtained, stop decoding code candidates that the processor is currently attempting to decode. In other embodiments, where the processor is substantially done performing a decode algorithm, the processor may continue the current decoding process until complete.
Referring once again to
Consistent with another aspect of at least some embodiments of the present invention, it has been recognized that in any image of the field of view 28, at least some of the code candidates within the image will likely not appear in subsequent images and that, therefore, it may be advantageous to place code candidates that will likely not appear in subsequent images at the top or at least closer to the top of the candidate order. For example, referring again to
Thus, referring again to
In some embodiments, instead of generating a candidate order, the field of view may be divided into different regions of interest and code candidates within the different regions may be processed in an order that is a function of which region of interest they appear in. For example, referring once again to
Referring now to
Referring still to
Referring still to block 186, if a next image has yet to be obtained, control passes to block 184. At block 184, processor 14 determines whether or not the processor has attempted to decode all of the code candidates in the first region of interest. Where there are additional code candidates that have not been attempted in the first region of interest, control passes back up to block 178 where the process described above continues. Once all of the code candidates for the first region of interest have been attempted, control passes to block 188 where processor 14 next attempts to decode the next code candidate in the second region of interest. Here, the first time through block 188 for an image, processor 14 attempts to decode a first code candidate in the second region of interest 34, the second time through block 188, processor 14 attempts to decode a second code candidate in the region of interest, and so on.
Referring again to
Referring again to block 193, if a next image has not yet been obtained, control passes down to block 194 where processor 14 determines whether or not the processor has attempted to decode all of the code candidates in the second region of interest. Where there is at least one code candidate in the second region of interest that has not been attempted, control passes back up to block 188 where the process described above continues. Once all of the code candidates in the second region of interest have been attempted, control passes back up to block 172 where processor 14 waits to receive a next image from camera 22.
There are many different algorithms that can be used to attempt to decode code candidates within an obtained image. Some of the algorithms are relatively simple while others are relatively complex where the complex decode algorithms often are more successful at decoding candidates than are the simple algorithms. However, in many cases, complex algorithms are extremely computationally intensive and therefore require relatively more time to complete than the simple algorithms. In at least some embodiments it is contemplated that different decode algorithms may be used to attempt to decode code candidates in an image where the decode algorithms to be used may be a function of where codes appear within the obtained image, the direction of travel of code candidates through the field of view, the speed of travel, etc. For example, referring once again to
In at least some embodiments, processor 14 may be programmed to associate code candidates in an obtained image with code candidates in previously processed images and more specifically to associate code candidates in obtained images with previously successfully decoded candidates in prior images and may order candidates for attempted decoding as a function of which candidates have likely been previously decoded and which candidates have not likely been previously decoded. To this end, it has been recognized that when a code candidate in an obtained image has likely been previously decoded, another successful decode of that candidate will simply confirm the results of the previous successful decode. In at least some embodiments the processor is programmed to attempt to decode codes that have yet to be successfully decode in previous images prior to attempting to decode codes that have likely previously been decoded.
Referring now to
At decision block 258, processor 14 determines whether or not a next image has been obtained from camera 22. Where a next image has been obtained from the camera, control passes back up to block 244 where code candidates in the next image are identified and the process described above continues. At block 258, if a next image has not yet been obtained, control passes up to block 260 where processor 14 determines whether or not the processor has attempted to decode all code candidates that likely have not been decoded in previous images. Where the processor has not attempted to decode all code candidates that were likely not previously decoded in previous images, control passes back to block 250 where processor 14 attempts to decode a next code candidate that was not likely decoded and the process described above continues.
At block 260 if the processor has attempted to decode all code candidates likely not decoded in previous images, control passes down to block 262 where processor 14 attempts to decode a next code candidate that was likely decoded in a previous image. At decision block 264, processor 14 determines whether or not the code candidate has been successfully decoded. Where the code candidate is successfully decoded, control passes to block 266 where processor 14 stores the decoded candidate location and at block 268 processor 14 indicates a successful decode. At block 264, if the code candidate is not successfully decoded, control passes down to block 270.
At block 270, processor 14 determines whether or not a next image has been obtained from camera 22. Where a next image has been obtained, control passes back up to block 244 where the process described above continues. If a next image has not been obtained, control passes down to block 272 where processor 14 determines whether or not the processor has attempted to decode all of the code candidates likely decoded in previous images. Where the processor has attempted all likely previously decoded candidates, control passes back up to block 242 where the process described above continues. If there is at least one more code candidate that the processor has likely decoded in a previous image and that the processor has not attempted to decode in the current image, control passes back up to block 262 where the process described above continues.
Referring still to
Referring yet again to
In still other embodiments, processor 14 may be programmed to order code candidates as a function of both whether or not codes have likely been successfully decoded in prior images and whether or not code candidates will likely appear in subsequent images. To this end, referring to
Continuing at block 364, processor 14 attempts to decode the next Group 1 code candidate (i.e., the next code candidate likely not decoded in a previous image and that will likely not appear in a subsequent image). Here, the first time through block 364 for an image, processor 14 attempts to decode a first Group 1 candidate, the second time through block 364, processor 14 attempts to decode a second Group 1 candidate, and so on.
At block 366, processor 14 determines whether or not a code candidate has been successfully decoded. Where the code candidate has been successfully decoded, control passes to block 368 and then to block 370 where the processor 14 stores the decoded candidate location and indicates a successful decode. After block 370, control passes to block 372. At block 366, if the code candidate has not been successfully decoded, control passes down to block 372.
At block 372, processor 14 determines whether or not a next image has been obtained. Where a next image has been obtained, control passes back up to block 354 where the process described above is repeated. Here, where a next image is obtained at block 372, all code candidates in the current image that the processor has not attempted to decode are discarded. At block 372, if a next image has not been obtained, control passes to block 374 where processor 14 determines whether or not all Group 1 candidates have been attempted. Where all Group 1 candidates have not been attempted, control passes back up to block 364 where the process described above continues. At block 374, once all group candidates have been attempted, control passes to block 380 in
Referring now to
At block 388, processor 14 determines whether or not a next image has been obtained from camera 22. Where a next image has been obtained from the camera, control passes back up to block 354 in
At block 392, processor 14 attempts to decode the next Group 3 candidate. Here, the first time through block 392, processor 14 attempts to decode the first Group 3 candidate, the second time through block 392, processor 14 attempts to decode the second Group 3 candidate, and so on. At block 394, processor 14 determines whether or not the code candidate has been successfully decoded. Where the code candidate has been successfully decoded, control passes to blocks 396 and 398 where process 14 stores the decoded candidate location and indicates a successful decode. After block 398, control passes to block 400.
At block 400, processor 14 determines whether or not a next image has been obtained. If a next image has been obtained, control passes back up to block 354 in
At block 404, processor 14 attempts to decode the next Group 4 code candidate. Here, the first time through block 404, processor 14 attempts to decode the first Group 4 candidate, the second time through block 404, processor 14 attempts to decode the second Group 4 candidate and so on. At block 406, processor 14 determines whether or not the code candidate has been successfully decoded. Where the code candidate has been successfully decoded, control passes to blocks 408 and 410 where processor 14 stores the decoded candidate location and indicates a successful decode. After block 410, control passes to block 412. At block 406, if the code candidate has not been successfully decoded, control passes to block 412. At block 412, processor 14 determines whether or not a next image has been obtained from camera 22. Where a next image has been obtained, control passes to block 354 in
In some embodiments, it is contemplated that processor 14 may be programmed to attempt to decode a least a subset of the code candidates within an image using at least first and second different decode algorithms if possible prior to obtaining a next image. For instance, referring again to
In still other embodiments, processor 14 may be programmed to order code candidates in different candidate groups as a function of locations within the camera's field of view. For instance, in the process described above with respect to
In still other embodiments, it is contemplated that when a next image event occurs prior to a processor attempting to decode all code candidates in a current image, the code candidates that have not been attempted may be stored for subsequent consideration. For instance, assume that there are ten code candidates in a first image and that the processor is only able to attempt to decode four of the ten candidates prior to obtaining a second image (i.e., prior to a next image event) so that at least initially, the processor does not attempt to decode six of the ten candidates in the first image. Also assume that there are only two code candidates in the second image and that the processor completes decode attempts of the two candidates prior to obtaining a third image so that the processor would have time to attempt to decode additional code candidates in the first image prior to obtaining the third image. In this case, the processor may be programmed to retrieve at least a subset of the code candidates from the first image and attempt to decode those candidates prior to obtaining the third image.
The subset of candidates selected to attempt to decode in a prior image may be a function of candidates that appeared in a subsequent image. For instance, in the above example where only two code candidates appear in the second image, processor 14 may be programmed to correlate the two candidates from the second image with two of the six code candidates that were not attempted in the first image and may attempt to decode the two candidates from the first image prior to receiving the third image.
It should be appreciated that different embodiments of the present invention take into account different factors when ordering code candidates within an obtained image to be attempted to be decoded by a processor. For instance, a processor may be programmed to factor in any one or a subset of the locations of code candidates within an obtained image, the travel direction of code candidates through a camera's field of view, the speed of travel of code candidates through the field of view, prior attempts to decode candidates in previous images, previous successful decode attempts for candidates, whether or not code candidates are new within a field of view or will be exiting the field of view, etc.
While the embodiments described above each require that code candidates that a processor has not attempted to decode be discarded when a new image is obtained, in at least some embodiments it is contemplated that, in at least some cases, new images may not be received until the processor attempts to decode all code candidates in at least a subset of the code candidates that appear in an image. For example, referring again to
While many of the embodiments described above stop attempting to decode code candidates when a next image is obtained, other next image events may cause the processor to stop attempting to decode candidates. For example, instead of waiting for a next image to be obtained, the processor 14 may be programmed to time out a period after which decode attempts for an image are discarded. Here, the time out period may be calculated to be a period similar to or slightly less than the period likely required for obtaining a next image. As another example, the processor 14 may be programmed to only attempt to decode a maximum number of code candidates where the maximum number is calculated to be completed prior to a next image being obtained. Here, the time out period and the maximum number of candidates to decode as well as the acquisition of a next image will generally be referred to as next image events which operate as processor triggers to discard code candidates that the processor has not attempted to decode or to complete only a subset of code candidates prior to processing a next obtained image. Other next image events are contemplated.
While all of the embodiments described above include processor 14 sequentially attempting to decode code candidates one at a time, it should be appreciated that in at least some embodiments the processor 14 may be able to simultaneously process two or more code candidates. Here, for instance, in at least some embodiments, where code candidates are divided into different groups by their locations within different regions of interest or as a function of other characteristics, the processor 14 may simultaneously attempt to decode all candidates in one group followed by attempts to decode all candidates in subsequent groups in a simultaneous fashion.
Referring once again to
While at least some of the processes described above forego processing of code candidates that have likely been decoded in previous images, in other embodiments the processor may only forego decoding attempts for codes that have likely previously been decoded more than once. For instance, the processor 14 may be programmed to require that a code have been successfully decoded twice or more prior to foregoing attempts for the same code in subsequent images.
In still other embodiments processor 14 may be programmed to forego attempts to decode at least some instances of a code candidate in some images where the processor has attempted to decode and failed to decode the candidate in one or more previous images. For instance, assume that a first code candidate has appeared in first and second consecutive images and has not been successfully decoded. In this case, while the first code candidate may appear is third, fourth, fifth and sixth subsequent images, processor 14 may be programmed to forego attempts to decode the first code candidate in the third, fourth and fifth images so that the processor 14 attempts next to decode the first code candidate in the sixth image. Skipping decode attempts may be advantageous as candidates often appear in consecutive images with similar characteristics which change to a greater degree in subsequent images when the objects and codes are at different locations within the camera's field of view. Thus, often it is more likely that the instance of the first code candidate in the sixth image will be more suitable for decoding than the instance in the third image after the processor has failed to decode the instances in the first and second images.
The particular embodiments disclosed above are illustrative only, as the invention may be modified and practiced in different but equivalent manners apparent to those skilled in the art having the benefit of the teachings herein. Furthermore, no limitations are intended to the details of construction or design herein shown, other than as described in the claims below. It is therefore evident that the particular embodiments disclosed above may be altered or modified and all such variations are considered within the scope and spirit of the invention. Accordingly, the protection sought herein is as set forth in the claims below.
Thus, the invention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention as defined by the following appended claims.
This application is a continuation of U.S. patent application Ser. No. 13/288,104, titled “Method and Apparatus for Ordering Code Candidates in Image for Decoding Attempts,” filed on Nov. 3, 2011, the entire contents of which is hereby incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4751375 | Ravizza | Jun 1988 | A |
| 4988852 | Krishnan | Jan 1991 | A |
| 5512739 | Chandler et al. | Apr 1996 | A |
| 5592228 | Dachiku et al. | Jan 1997 | A |
| 5698833 | Skinger | Dec 1997 | A |
| 5770841 | Moed et al. | Jun 1998 | A |
| 5770848 | Oizumi et al. | Jun 1998 | A |
| 6494375 | Ishibashi et al. | Dec 2002 | B1 |
| 6778683 | Bonner et al. | Aug 2004 | B1 |
| 6880758 | Park et al. | Apr 2005 | B2 |
| 7104453 | Zhu et al. | Sep 2006 | B1 |
| 7121469 | Dorai et al. | Oct 2006 | B2 |
| 7181066 | Wagman | Feb 2007 | B1 |
| 7199385 | Wehrle et al. | Apr 2007 | B2 |
| 7254665 | Yee | Aug 2007 | B2 |
| 7331523 | Meier et al. | Feb 2008 | B2 |
| 7392951 | Ray et al. | Jul 2008 | B2 |
| 7466868 | Wilensky | Dec 2008 | B2 |
| 7545949 | Mirtich et al. | Jun 2009 | B2 |
| 7646887 | Goncalves et al. | Jan 2010 | B2 |
| 7721964 | Reichenbach et al. | May 2010 | B2 |
| 7852519 | Meier | Dec 2010 | B2 |
| 8542930 | Negro et al. | Sep 2013 | B1 |
| 20010006191 | Hecht et al. | Jul 2001 | A1 |
| 20020057852 | Durbin | May 2002 | A1 |
| 20060076415 | Reichenbach et al. | Apr 2006 | A1 |
| 20060091219 | Joseph et al. | May 2006 | A1 |
| 20060261167 | Ray et al. | Nov 2006 | A1 |
| 20070014542 | Poulsen | Jan 2007 | A1 |
| 20080029599 | Tskos et al. | Feb 2008 | A1 |
| 20090095047 | Patel et al. | Apr 2009 | A1 |
| 20100200660 | Moed et al. | Aug 2010 | A1 |
| 20110075156 | Patel et al. | Mar 2011 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20140361084 A1 | Dec 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13288104 | Nov 2011 | US |
| Child | 14191695 | US |
