Patent Grant
11943406
The present invention relates to printing, and more particularly to visual printing defect detection and analysis.
Generally speaking, both thermal direct and thermal transfer printers are the preferred technology for printing barcodes. However, printouts may exhibit visible printing defects that may impact the ANSI grading or visual output of the labels. For example, the produced output is often plagued by printing defects, such as “ribbon wrinkle,” “white banding,” “black banding,” “voids,” or “ink split.” Such problems may stem from media and printhead contamination, improper ribbon setup, printer wear and tear, uneven pressure, mechanical design margin, and other triggers that may not be related to thermal management algorithms. Printing defect degrades label print quality, and may lead to unusable media. Such issues may lead to equipment damage and supply waste.
Accordingly, the present invention embraces methods for visual printing defect detection.
In accordance with various embodiments of the preset invention, a method for printing defect detection is provided. The method comprises scanning an image with a verifier to generate a scanned image; processing the scanned image to obtain a difference image by comparing the scanned image to a reference image and match parameters of the scanned image to the reference image; analyzing the difference image to detect one or more printing defects; grouping the one or more detected printing defects in one or more groups; refining the grouping of the detected printing defects; assigning confidence level values to the one or more refined groups; and performing a confidence level analysis to determine if one or more servicing actions should be performed.
In some embodiments, refining the grouping includes performing image processing of the difference image to detect at least one bright pixel common for two or more groups.
In some embodiments, the method further comprises extracting and/or reassigning one or more pixels to a correct group.
In some embodiments, the confidence level is calculated based on a ratio of a total amount of bright pixels in a selected area over a total amount of pixels in that area.
In some embodiments, performing a confidence level analysis includes performing a confidence level history analysis.
In some embodiments, the method further comprises analyzing the scanned image to determine presence or absence of printhead, platen roller and/or media contamination.
In some embodiments, the method further comprises determining a type of a printing defect by comparing the assigned confidence level to a predetermined table of confidence levels.
In some embodiments, performing a confidence level analysis includes calculating confidence level values for one or more defect groups, and monitoring changes in the calculated values from one or more previous images to the current scanned image.
In some embodiments, scanning an image with a verifier includes scanning an image displaying a barcode symbol, text, and/or graphics.
In accordance with various embodiments of the preset invention, a method for printing defect analysis is provided. The method comprises capturing an image of a printout on a media; checking the captured image for one or more printing defects; analyzing evolution of the detected printing defects between the current captured image and one or more images of preceding printouts; and using results of the evolution analysis to determine if one or more predetermined corrective actions should be initiated.
In some embodiments, checking for printing defects includes generating and analyzing a difference image obtained by comparing the captured image to a reference image, and/or processing the captured image to detect printhead, platen roller and/or media contamination.
In some embodiments, generating a difference image includes comparing a binary version of the captured image to a binary version of the reference image.
In some embodiments, checking the captured image for one or more printing defects includes detecting at least one of ribbon wrinkles, printhead, platen roller and/or media contamination, black and/or white banding, and/or black and/or white ink split.
In some embodiments, analyzing evolution includes comparing one or more evolution characteristics of the defects to a predetermined threshold.
In some embodiments, the method further comprises verifying the one or more evolution characteristics when one or more characteristics are found to exceed the predetermined threshold, and determining if one or more predetermined corrective actions should be initiated.
In some embodiments, the method further comprises initiating one or more predetermined corrective actions when the one or more evolution characteristics are slowly rising without exceeding the predetermined threshold. In some embodiments, initiating corrective actions includes triggering an alert, producing an error message, stopping printer operation, and/or prescribing a recommended course of action.
In some embodiments, the method further comprises providing feedback to a self-learning defect database. In some embodiments, the method further comprises using the provided feedback to dynamically update one or more algorithms for checking the image for printing defects, and/or for analyzing evolution of the detected defects.
In some embodiments, capturing an image of a printout on a media includes scanning an image with a printer-verifier device.
In accordance with various embodiments of the preset invention, a method for generating a difference image is provided. The method comprises adjusting position, size, and luminance of a scanned image with respect to a reference image, such as aligning a scanned image with a reference image, scaling the scanned image to match a size of the reference image, and adjusting luminance of the scaled scanned image; conducting a pixel-to-pixel analysis between the scanned image and the reference image; and generating a difference image based on results of the pixel-to-pixel analysis.
In some embodiments, the method further comprises obtaining the scanned image with a printer-verifier device.
In some embodiments, the scanned image includes stretching or compressing the scanned image in a transverse direction and/or longitudinal direction. In some embodiments, the method further comprises analyzing the difference image to identify one or more printing errors.
In some embodiments, identifying printing errors includes detecting at least one of ribbon wrinkles, printhead and/or media contamination, platen roller contamination, black and/or white banding, and/or black and/or white ink split.
In accordance with various embodiments of the preset invention, a method for image processing is provided. The method comprises normalizing a size of a produced image to match a size of a reference image; normalizing a luminance of the produced image to match a luminance of the reference image; and producing a difference image by comparing the normalized produced image to the reference image.
In some embodiments, normalizing a luminance includes performing level adjustment to match white and/or black colors in the produced image and white and/or black colors in the reference image. In some embodiments, normalizing a luminance includes performing level adjustment to match red, green and/or blue colors in the produced image and red, green and/or blue colors in the reference image. In some embodiments, normalizing a size of a produced image includes adjusting a size of the produced image to align corners and/or edges of the produced image with corners and/or edges of the reference image. In some embodiments, normalizing a size of a produced image includes equalizing a distance between a rightmost printed area and a leftmost printed area of the image.
In some embodiments, comparing the normalized produced image to the reference image includes comparing information of the produced image to a print command string.
In some embodiments, the method further includes detecting one or more printing defects.
In some embodiments, detecting one or more printing defects includes detecting at least one of ribbon wrinkles, printhead and/or media contamination, black and/or white banding, and/or black and/or white ink split.
In some embodiments, the method further includes capturing the produced image with an integrated verifier device.
In accordance with various embodiments of the preset invention, a method for print defect detection is provided. The method comprises scanning an image with a verifier to generate a captured image; processing the captured image to match one or more parameters of the captured image to one or more parameters of a reference image; comparing the captured image to the reference image to detect one or more bright pixels; and detecting one or more print defects.
In some embodiments, processing the captured image includes scaling, rotating, adjusting luminance and/or adjusting one or more colors.
In some embodiments, comparing the captured image to the reference image includes comparing a binary version of the captured image to a binary version of the reference image.
In some embodiments, the mothed further comprises performing a bright pixel analysis. In some embodiments, performing a bright pixel analysis includes grouping and/or connecting bright pixels located within a predetermined distance from each other.
In some embodiments, capturing an image with a verifier includes capturing an image displaying a barcode symbol, text, and/or graphics.
In accordance with various embodiments of the preset invention, a method for determining an origin of printing distortion is provided. The method includes generating an image of a printed barcode symbol with a printer-verifier; processing the image to detect deviation of parameters of elements of the barcode symbol from a predetermined threshold; checking for a malfunction of heating elements; and determining an origin of printing distortion.
In some embodiments, wherein processing the image of the printed barcode symbol includes calculating widths of the one or more elements of the barcode symbol. In some embodiments, the method further comprises averaging the calculated widths for a group of the elements of the barcode symbol. In some embodiments, the method further comprises plotting the averaged widths.
In some embodiments, processing the image of the printed barcode symbol includes comparing the image with a reference image.
In some embodiments, checking for a malfunction of one or more heating elements includes checking for a burnout of one or more heating elements.
In some embodiments, processing the image of the printed barcode symbol includes processing the image of the printed barcode symbol with an image processor.
In accordance with various embodiments of the preset invention, the present invention embraces methods for automated detection of a contaminated printhead.
In accordance with various embodiments of the preset invention, a method for detecting a contaminated thermal printhead is provided. The method includes identifying a barcode symbol in a verifier image, and analyzing its scan lines; calculating element widths of the scan lines using a predetermined threshold; and analyzing the calculated element widths to detect contamination of a thermal printhead.
In some embodiments, identifying a barcode symbol in a verifier image includes identifying a barcode symbol in an image obtained from an integrated printer-verifier device.
In some embodiments, analyzing the calculated element widths includes plotting an average deviation within a group of the element widths.
In some embodiments, calculating element widths includes calculating widths of one or more narrow bars.
In some embodiments, calculating element widths includes calculating widths of one or more narrow spaces between bars of the barcode.
In some embodiments, the method further comprises issuing a notification reporting the detected contamination, and prescribing a recommended course of action.
In accordance with various embodiments of the preset invention, a method for detecting printhead contamination is provided. The method includes detecting one or more indicia in an image of a printed image; analyzing elements of the detected indicia; conducting a pattern match analysis between the detected indicia and a reference image to produce a difference image; and analyzing the difference image to detect a presence of printhead contamination.
In some embodiments, detecting one or more indicia in an image of a printed image includes detecting indicia using a verifier integrated into a thermal printer. In some embodiments, detecting one or more indicia includes detecting one or more 1D barcodes, 2D barcodes, graphics, and/or text.
In some embodiments, the method including reporting the presence of printhead contamination. In some embodiments, reporting the presence of printhead contamination includes sending a message to an entity responsible for printhead maintenance. In some embodiments, reporting the presence of printhead contamination includes printing a specifically formatted label.
In some embodiments, the method further comprises triggering one or more predetermined actions in response to the detected contamination, wherein the predetermined actions are selected based on user sensitivity to print quality.
In accordance with various embodiments of the preset invention, an image processing method is provided. The method includes capturing an image of a label; processing the captured image to produce a difference image having a plurality of bright pixels by comparing the captured image to a reference image; consecutively connecting the bright pixels located within a predetermined radius to form a line until there are no pixels within the radius left to connect; and iteratively connecting the pixels until all the pixels of the plurality of bright pixels having neighboring pixels within the predetermined radius are connected, and one or more lines are formed.
In some embodiments, consecutively connecting the pixels further includes monitoring a running average slope defining an orientation of the line being formed.
In some embodiments, monitoring a running average slope includes determining an angle of the slope with a point-slope technique.
In some embodiments, the method further comprises making a connection between two consecutive pixels when a resulting change in the running average slope does not exceed a predetermined angle threshold.
In some embodiments, the method further comprises making a connection between two consecutive pixels when a resulting change in the running average slope does not exceed a predetermined dynamic angle value.
In some embodiments, the method further comprises monitoring an average direction of the running average slope, and making a connection between two consecutive pixels when such connection follows a forward direction of the slope.
In accordance with various embodiments of the preset invention, a method for determining a ribbon wrinkle is provided. The method includes creating a difference image to locate one or more bright points by comparing a captured image of a media after printing to a reference image; grouping the bright points located near each other to form one or more primary lines characterized by a running average slope; and connecting the primary lines having a similar running average slope to form one or more secondary lines.
In some embodiments, the method further comprises assigning a confidence level value to the one or more primary and/or secondary lines. In some embodiments, the method further comprises requesting capturing an additional image to replace the captured image having one or more primary and/or secondary lines with low confidence level values.
In some embodiments, creating a difference image includes using the reference image stored in a self-learning database.
In some embodiments, using the reference image stored in a self-learning database includes using the reference image stored in an external database.
In some embodiments, comparing a captured image of a media includes comparing a captured image of a media displaying a barcode.
In accordance with various embodiments of the preset invention, a ribbon wrinkle detection method is provided. The method includes identifying a barcode symbol having a plurality of elements displayed on a media; surrounding the barcode symbol with a bounding box encompassing top and bottom parts and outer edges of the barcode symbol, and/or one or more finder patterns; locating one or more unprinted points located near the elements of the barcode symbol; connecting co-localized unprinted points to form one or more lines; determining an angle of the one or more lines relative to the bounding box; and verifying that each of the determined angles exceeds a predetermined threshold value.
In some embodiments, identifying a barcode symbol includes identifying a two-dimensional barcode symbol.
In some embodiments, the method further comprises determining a number of the one or more lines. In some embodiments, the method further comprises displaying a result of the angle verification.
In some embodiments, determining an angle includes determining an angle with a point-slope technique. In some embodiments, determining an angle includes determining an angle with a linear regression technique. In some embodiments, verifying that each of the determined angles exceeds a predetermined threshold value includes exceeding a predetermined dynamic angle value. In some embodiments, verifying that each of the determined angles exceeds a predetermined threshold value includes exceeding a predetermined fixed angle value.
In accordance with various embodiments of the preset invention, the present invention embraces methods of detecting platen roller contamination. In an embodiment, the method for determining a platen roller contamination can include creating a difference image to locate one or more bright points by comparing a captured image of a media after printing to a reference image, and grouping the bright points located near each other to form one or more voids. Additionally, the method can include analyzing the void pattern, and/or determining whether the contamination is on the platen roller or on the media and/or ribbon.
In accordance with various embodiments of the preset invention, a platen roller contamination detection method is provided. The method comprises capturing an image of a label; processing the captured image to produce a difference image having a plurality of bright pixels by comparing the captured image to a reference image; consecutively connecting the bright pixels located within a predetermined radius to form a cluster and detecting a void mark, until there are no pixels within the radius left to connect; and iteratively connecting the pixels until all the pixels of the plurality of bright pixels having neighboring pixels within the predetermined radius are connected, and one or more void marks are detected.
In some embodiments, consecutively connecting the bright pixels includes grouping each cluster of pixels depending on proximity between neighboring bright pixels, a slope change between clusters of pixels, and a void space existing between the clusters of pixels.
In some embodiments, the method further comprises determining a repeat pattern of the detected one or more void marks at a defined distance along a vertical line, wherein the defined distance corresponds to circumference of the platen roller.
In some embodiments, the method further comprises issuing a priority message of a first level for an operator in an instance when a count of the one or more void marks are less than a threshold value. In some embodiments, the method further comprises initiating a blast of compressed air in a defined proximity to the platen roller in an instance when the count of the one or more void marks exceed the threshold value.
In some embodiments, detecting the void mark includes identifying one or more areas of the bright pixels falling within a defined circular area, wherein in accordance with a first criteria, separation of two bright pixels is more than a defined threshold separation in an instance when a count of the bright pixels is one or more, wherein in accordance with a second criteria, no three bright pixels can lie on a straight line in an instance when the count of the bright pixels is within a first range, wherein in accordance with a third criteria, no group of five bright pixels can lie on the straight line when the count of the bright pixels is beyond the first range, wherein, in an instance when the first, second and third criteria are met, a printed label is deemed to have defects caused by a contaminated platen roller.
The foregoing illustrative summary, as well as other exemplary objectives and/or advantages of the invention, and the manner in which the same are accomplished, are further explained within the following detailed description and its accompanying drawings.
The description of the illustrative embodiments may be read in conjunction with the accompanying figures. It will be appreciated that for simplicity and clarity of illustration, elements illustrated in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements are exaggerated relative to other elements. Embodiments incorporating teachings of the present disclosure are shown and described with respect to the figures presented herein, in which:
In accordance with various embodiments of the present invention, methods, apparatuses, and systems for visual printing defect detection and analysis are provided.
Some embodiments of the present disclosure will now be described more fully hereinafter with reference to the accompanying drawings, in which some, but not all embodiments of the disclosure are shown. Indeed, these disclosures may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will satisfy applicable legal requirements. Like numbers refer to like elements throughout.
Unless the context requires otherwise, throughout the specification and claims which follow, the word “comprise” and variations thereof, such as, “comprises” and “comprising” are to be construed in an open sense, that is as “including, but not limited to.”
Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
The word “example” or “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any implementation described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other implementations.
If the specification states a component or feature “may,” “can,” “could,” “should,” “would,” “preferably,” “possibly,” “typically,” “optionally,” “for example,” “often,” or “might” (or other such language) be included or have a characteristic, that a specific component or feature is not required to be included or to have the characteristic. Such component or feature may be optionally included in some embodiments, or it may be excluded.
The headings provided herein are for convenience only and do not limit the scope or meaning of the claimed invention.
Various embodiments of the present invention will be described in relation to a thermal transfer printer. However, the present invention may be equally applicable to other types and styles of printers (inclusive of printer-verifiers) (e.g., a thermal direct printer, a laser toner printer, an ink drop printer, etc.).
As used herein, the terms “media” and “print media” include label stock, label, ribbon, card stock, and other materials used in a printing process, such as a thermal transfer printing process or a direct thermal printing process.
As used herein, the terms “target image,” “reference image,” and “buffer image” may be used interchangeably and considered synonymous depending on the context, unless further definition is provided.
As used herein, the terms “scanned image,” “produced image,” “blend image,” “verifier image,” and “captured image” may be used interchangeably and considered synonymous depending on the context, unless further definition is provided.
As used herein, the terms “pixel,” “dot,” and “point” may be used interchangeably and considered synonymous depending on the context, unless further definition is provided.
Generally speaking, thermal printing has become the dominant means of generating barcode labels on demand. Thermal printers can include any printing technology that utilizes a “print command string,” such as thermal direct, laser toner, ink drop, sublimation, impact dot matrix, and thermochromic and, by reverse image, phototypeset, screen, gravure and offset. Over time, printheads get contaminated, causing reduced print quality and increasing wear, which in turn can shorten printhead life. Preventative maintenance may be instituted; however, this can be wasteful when the printhead does not need cleaning, or worse, can be damaging when the printhead needs cleaning prior to the scheduled maintenance. Further, in many situations, proper cleaning is ignored until printer failure. Therefore, a need exists for an automated method of detecting a contaminated thermal printhead so that the issue could be resolved in a timely fashion.
Further, platen roller contamination can significantly affect print quality of labels, rendering them defective and unusable. For example, printing labels in industrial settings can lead to dust, grit and other airborne particulate getting into the printer components. Making matters worse, this contamination is often statically charged, causing it to be especially attracted to polymers, which form the basis of the media-moving assemblies (e.g., the platen rollers) in the printers. Therefore, a need exists for an automated method for detecting platen roller contamination to overcome this issue.
Moreover, media contamination can also lead to the printing quality reduction. Ribbon wrinkle may be caused by a setup of the printer and/or loading of media and/or ribbon. Additionally, the amount of heat applied or the appearance of the label pattern may also affect the printing quality. For example, printing only on the side of the label may cause the ribbon to pull unevenly and wrinkle. When the heat from the printhead does not adequately get to the media due to a wrinkle or contamination of printer parts (such as a platen roller) and/or media or ribbon contamination, a part of the intended image is not created. This can look like an unprinted dot, void or a line in an otherwise printed area. When the resulting label print quality is degraded due to such contamination or a ribbon wrinkle, these problems need to be identified and addressed. Therefore, a need exists for an automated method for detecting and correction of ribbon wrinkle.
In addition to printhead, platen roller, and media contamination described above, other issues may exist that may cause printing defects. To handle such issues more efficiently, the printing process should utilize an algorithm to automatically detect a wide variety of visual printing defects, followed by providing user notification, guidance and/or taking actions to resolve the detected issues.
Although some attempts have been made to create printing defect detection, none of the proposed methods combines determining a quality grading of a label immediately after printing with performing printing diagnostics not covered by the grading criteria, or focuses on creating an exact match to the reference image, or covers a reference image represented as a print command string.
Therefore, a need exists for a method capable of combining automatic detection of various visual printing defects (such as banding, void, ribbon wrinkle, ink split, and printhead, media and/or platen roller contamination) that may occur during the printout, alerting the user in real-time, and providing advice on the corrective actions.
Referring to
In an embodiment, at step 104, a contaminated thermal printhead may be automatically determined based on the printer-scanned image, as described in
In accordance with another embodiment, at step 106, the captured image may be compared with the reference image, such as a print command string for determining a difference image to detect one or more printing defects. The print command string (which is computer code) can be shown graphically (where a “to print” command is depicted as black and a “no-print” command is depicted as white) and then rearranged into rows and columns to mimic approximately what the printed image will look like. The graphically rearranged print command string can be referred to as the “reference image.” After printing a label or tag, the printed image can be optically scanned where light is reflected off the printed image and captured, using one or more photosensitive semiconductor elements producing a captured image of the printed matter.
The captured image may have a slight stretch/compression or a small tilt in the image compared to the reference image. In this case, the first step can include “re-aligning” the captured image with the reference image. A scaling/rotation algorithm may be used to ensure that the corners and edges of the images align with each other if the two images were to overlap. Width and length of the captured image may differ from the reference image by different factors.
The scaling algorithm that can be applied to the captured image in the horizontal (across the web) direction can be configured to compress the image so that the distance between the leftmost printed area and the rightmost printed area is equal. For example, the size of the reference image is known exactly because it maps directly into the dots of the printhead. A typical printhead may be described as having 300 dots per inch (dpi), whereas the actual size of the dots is 0.0833 mm (often referred to as 12 dots per mm). Optical scanner such as a verifier often differs from this number, and is typically 24 pixels per mm. Combined with optical distortions, this can yield a different value of the printing width. A horizontal scaling algorithm can be based on the following equations:
Processed captured image=Reference image dimension/Original captured image dimension*Every original captured image pixel;
Processed captured image=the above result digitized into 12 dots per mm.
The result is a pixel-to-pixel comparison between the captured and reference images. Similar scaling algorithm can be applied for the vertical direction (in the direction of the web motion), except that the captured image may be longer or shorter due to mechanical effects in addition to the optical effects. The determination of the difference image is further described in
In an embodiment, comparing the scanned image to the reference image may include comparing a binary version of the scanned image to a binary version of the reference image to detect bright pixels marking the areas where the two images do not match.
Based on the determination of the difference image, grouping of the detected bright pixels (also referred to as difference pixels) may be performed. In other words, the one or more the detected printing defects may be grouped. In an embodiment, grouping of the detected difference pixels may be performed for printhead contamination at step 104 (further described in
At step 114, the grouping data is then refined to ensure that bright pixels belong to correct defect types. The grouping data may be refined by performing image processing of the difference image to detect at least one bright pixel common for two or more groups. For example, a separate difference image can be created for each detected defect type (void, wrinkle, banding, ink split, etc.). Such difference images can be generated to have the same size (length and width), and consequently the same total number of pixels. Each difference image contains coordinates (unique x and y positions within the image) of each of the bright pixels detected. Thus, refining the grouping can include determining whether a particular bright pixel is common for any of the difference images obtained by comparing the scanned image to the reference image. For example, if a pixel in row 17, column 28 is defined as “bright” in the void difference image, but as “dark” in the wrinkle difference image, then it is not a common pixel. But if the pixel is defined as bright in both images, then it is a common pixel. The method 100 can further include extracting and/or reassigning one or more pixels to a correct group.
Step 114 is especially beneficial for defect analysis when multiple defects occur simultaneously and are overlapping with each other (for example, banding and wrinkle). By preventing pixels from being assigned to a wrong defect type, it can improve the quality of defect severity assessment. For instance, to detect ribbon wrinkles, neighboring bright pixels in the difference image can be consecutively connected to form one or more lines. To detect printhead and/or media contamination, bright pixels located within a predetermined radius in the difference image can be connected to form one or more voids. To detect uneven printout, such as banding or ink split, co-located bright pixels in the difference image can be assembled in groups. Secondary analysis can also be applied for further defect recognition.
At step 116, once all the bright pixels are assigned to proper defect groups, a confidence level (CL) value is assigned to each visual defect type (or refined groups), as described in Table 1 below. This value indicates how certain (“confident”) the algorithm is in detecting a particular defect type. In an embodiment, the confidence level can be calculated based on a ratio of a total amount of bright pixels in a selected area over a total amount of pixels in that area. Performing a confidence level analysis can include performing a confidence level history analysis. Additionally or alternatively, performing a confidence level analysis can include calculating confidence level values for one or more defect groups, and monitoring changes in the calculated values from one or more previous images to the current scanned image. The CL value can then be transmitted to a “history algorithm.”
At step 118, the history algorithm performs analysis for each defect type to detect how quickly the Confidence Level value evolved within one label (or from one label to another) as described in
At step 126, the processed data can then be transmitted to update a defect database (internal or external), and used to provide an alert and/or troubleshooting method more precisely and/or more quickly in case of a future event.
If, at step 120, no defect is detected, then the method 100 may proceed with printing the next label at step 128.
In addition to normalizing the captured image in size, the captured image's luminance, “Y,” can also be normalized to match luminance of the reference image. Luminance is a standardized value (which ranges between 0 and 1), where for a monochrome sensor 0 represents a pure black, and 1 a pure white. For a color sensor, each channel (red “R,” green “G,” and blue “B”) should be evaluated individually. For red, 0 is also a pure black, while 1 is a pure red. Similar logic is applied to the green and blue channels. The captured image is not likely to be as perfect as the reference image in terms of luminance and color. Some small deterioration may happen due to the media, heat setting, scanner element, etc., resulting in the white not being as pure white (very light grey) and the black not being as dark as it should be (dark grey color instead).
A “level adjustment” can be performed in order to match the white of the captured image with white of the reference image, and the black of the captured image with black of the reference image. The formula can be applied to estimate the luminance Y for black-and-white image, as well as to the RGB channels for color image. In the formula below, Y′ is the new value of the luminance, and Y is the original value. For RGB value, Y should be replaced with R, G or B based on:
Captured(Y′)={Captured(Y)−Captured(min(Y)}*{Reference(max(Y))−Reference(min(Y))}/{Captured(max(Y))−Captured(min(Y))}.
Once the captured image has been processed to resemble the reference image in terms of size and luminance (or RGB), the difference image can be rendered. A “difference” algorithm can be used to compare the reference image and the captured image to detect a visible difference between the two. For each pixel composing the two images, a simple formula can be applied to create a difference image:
Difference_pixel(Y,R,G,B)=|Reference_pixel_pixel(YR,G,B)−Captured_pixel(YR,G,B)|.
A “perfectly” printed label has had its size and luminance adjusted according to the present invention, and processed with the difference algorithm. A perfectly printed label will result in a perfectly black image. Any imperfections will be rendered in a grays cale range, where pure white will be a full mismatch in pixel comparison. This approach can be used to quantify printing errors beyond those simply evaluated according to a print quality standard (e.g., ISO/IEC 15415). It may be noted that the above color scheme is merely for exemplary purposes and should not be construed to limit the scope of the disclosure. Other color schemes, such as a color scheme inverse of the exemplary color scheme described above, or an entirely different color scheme may be implemented, without deviation from the scope of the disclosure.
In an embodiment, the method 300 can include obtaining the scanned image using a printer-verifier device. The scanned image can include an image of a printed media (e.g., a label or a tag), and may be generated by stitching together a series of consecutive linear images of the media. In an embodiment, the stitched images may be 2D in case a different imaging technology is used to acquire the images. The reference image can include a print command string, and be stored internally in the printer memory, or in an external database, such as a cloud database. The external database may be updated over time.
The method 300 can also include analyzing the difference image to identify one or more printing errors. For example, the method can include detecting at least one of ribbon wrinkles, printhead and/or media contamination, platen roller contamination, black and/or white banding, and/or black and/or white ink split. Scaling the scanned image at 304 can include stretching or compressing the scanned image in a transverse direction and/or longitudinal direction.
The method 400 can include capturing the produced image with an image scanning device, e.g., an integrated verifier device. Comparing the normalized produced image to the reference image at step 406 can include comparing information of the produced image to a print command string. The reference image can be stored internally, or in an external database, such as a cloud database. The database may be updated over time.
In an embodiment, normalizing a luminance at step 404 can include performing level adjustment to match white and/or black colors in the produced image and white and/or black colors in the reference image. Additionally or alternatively, normalizing a luminance at step 404 can include performing level adjustment to match red, green and/or blue colors in the produced image and red, green and/or blue colors in the reference image. Normalizing a size of a produced image at step 402 can include adjusting a size of the produced image to align corners and/or edges of the produced image with corners and/or edges of the reference image. Additionally or alternatively, normalizing a size of a produced image at step 402 can include equalizing a distance between a rightmost printed area and a leftmost printed area of the image.
In an embodiment, the method 400 can include detecting one or more printing defects. For example, the printing defects can include detecting at least one of ribbon wrinkles, printhead and/or media contamination, platen roller contamination, black and/or white banding, and/or black and/or white ink split. For instance, to detect ribbon wrinkles, neighboring bright pixels in the difference image can be consecutively connected to form one or more lines. To detect printhead and/or media contamination, bright pixels located within a predetermined radius in the difference image can be connected to form one or more voids. To detect uneven printout, such as banding or ink split, co-located bright pixels in the difference image can be assembled in groups. Secondary analysis can also be applied for further defect recognition.
In an embodiment, processing the captured image at step 504 can include scaling, rotating, adjusting luminance and/or adjusting one or more colors. Comparing the captured image to the reference image at step 506 can include comparing a binary version of the captured image to a binary version of the reference image. Capturing an image with a verifier at step 502 can include capturing an image displaying a barcode symbol, text, and/or graphics.
In an embodiment, the method 500 can include performing a bright pixel analysis. For example, performing a bright pixel analysis can include grouping and/or connecting bright pixels located within a predetermined distance from each other. For instance, neighboring bright pixels in the difference image can be consecutively connected to form one or more lines and/or voids. Additionally or alternatively, co-located bright pixels in the difference image can be assembled in groups. Secondary bright pixel analysis can be performed for further printing defect analysis.
In accordance with an embodiment, there are two primary indications of printhead contamination. The first is localized reduced heat conduction causing less ribbon color to be transferred for thermal transfer ribbon (TTR) printing or a lighter color for direct thermal (DT) printing (referred to as Case I herein). The second is when contamination causes the media to lose contact with the printhead and no localized color is printed (referred to as Case II herein).
When contamination slowly accumulates on the printhead (Case I), the heat transfer gradually becomes less efficient. At the early stage of Case I, this is difficult to detect in the printing and is not problematic. As contamination gets worse, the printing suffers specific distortions that can be detected with a verifier. This can be illustrated with barcodes printed in “ladder” configuration.
This type of printing distortion may not cause a noticeable drop in print quality grades (e.g., as measured according to widely accepted norms ISO/IEC 15415 for 2D barcodes and ISO/IEC 15416 for linear barcodes, often called “ANSI grading”). Because grading occurs along a number of scan paths that are perpendicular to the bars, even if one scan path hits the distortion, the other paths may average it out. Similarly, scanning performance is not adversely affected. Significant problems with this type of distortion may occur when barcode symbols are arranged in the “picket fence” configuration (e.g. where the bars are arranged perpendicular to the movement of the print media), as well as with text and/or graphics. As contamination lingers on the printhead, permanent printhead damage becomes more likely.
One algorithm for detecting this type of contamination can start with identifying a barcode symbol in a verifier image and analyzing “scan lines” parallel to the motion of the media (i.e., perpendicular to the bars in the example shown in
The algorithm can compute element widths of each scan line using a suitable threshold, e.g., (Rmax+Rmin)/2. Although the image shown in
Once the element widths of the narrow bars are averaged for every scan line in the image, they can be plotted. It is important to note that the printing distortion from a contaminated printhead is parallel to the media motion. Consequently, distortions that do not occur in the same place in every sequentially printed area are not caused by printhead contamination.
In other embodiments, narrow spaces may be used instead of narrow bars. Additionally, linear barcodes with more than two element widths can be analyzed. Most combination of small and large bars and spaces may be combined to provide a stable measurement of Case I and Case II contamination.
Another algorithm that can be used for detecting Case I distortions involves a pattern match between reference and what the verifier detects in the image. Such algorithm does not dependent on the type of printing.
In an embodiment, the reference may include a print command string, which is computer code that can be shown graphically (where a “to print” command is depicted as black and a “no-print” command is depicted as white). They are rearranged into rows and columns to mimic approximately what the printed image will look like. The graphically rearranged print command string can be referred to as a “reference” or “reference image.”
Case II contamination can occur in dusty environments and/or with inexpensive media, where a speck of material adheres to the printhead, causing a complete void in the printing. Case II contamination printing looks identical to label printed with a “burned out dot” (i.e., a dot that can no longer produce heat) in the printhead, and manifests itself as an unprinted line running from one end of the label to the other perpendicular to the printhead. This type of printhead contamination can be particularly damaging to the printhead.
Case II contamination can be detected using similar algorithms to Case I contamination. When an integrated printer-verifier is used, the printer may be configured to detect when a dot is “burned out” by measuring printhead resistance. Therefore, if the printer shows that no dots are “burned out,” and algorithms for detecting printing caused by burned out dots return a positive value, then the printer-verifier can conclude with a high degree of certainty that there is Case II printhead contamination.
Other Case II scenarios that can be detected by the present invention include but are not limited to: overheated media (some popular products on the market today may consistently fracture the thermal layer if overheated); preprinted or floodcoated direct thermal media (the inks will typically build up on the printhead more quickly than the base material); adhesives (aggressive, heavy coat weight, or cold-temperature adhesives that are prone to flow and build up on the printhead can be detected long before they become Case II contamination problems).
There are various actions that the printer can be configured to take when printhead contamination is detected. For low levels of Case I contamination, for instance, the printer can transmit a message (e.g., over Wi-Fi, network, or by other means of communication, such as cellular wireless communication, sounds, and/or flashing lights) to the IT department (or other departments responsible for maintenance, such as quality control or inventory) notifying that the printer should be cleaned at the next media roll change. For higher levels of Case I contamination (e.g., when the average narrow bar widths change by more than 5%), a message can be transmitted to the maintenance depai linent to perform a printhead cleaning process within a predetermined timeframe, such as the next hour for instance. Additionally or alternatively, a specially formatted printed label can notify the user to stop the print run and clean the printhead. For high levels of Case I contamination or when Case II contamination is detected, the printer can be configured to notify the IT department, print a label telling the user to clean the printhead immediately and/or stop the printer until the printhead is cleaned.
Additionally or alternatively, the algorithm may include modifying the thermal management (firing the dot earlier, longer, or hotter) to offset the effects of Case I contamination, while notifying the user/maintenance/IT about the need to clean the printhead. This may improve print quality prior to printhead cleaning, which may be particularly valuable for printing high ANSI-grade-mandated symbols in healthcare, retail (compliance labeling for major retailers), electronics (wireless phone distribution to major carriers), and other fields relying on high-quality symbols. Degraded-quality symbols may lead to penalties in the form of returned shipments or charge-backs for increased handling (required when the pallet label does not scan, and the retailer/carrier must manually scan each carton on the pallet).
Additionally, instead of an integrated printer-verifier, a stand-alone verifier (for example, as described below in connection with
The algorithms described herein can be implemented into a hand-held barcode scanner or scanner-enabled mobile terminal. In these cases, the scanner may be programmed to transmit the data to its host and perform a secondary transmission to the quality department, and/or to maintain a running file of printhead contamination for later use by the maintenance department at the end of a shift.
The resulting printer's capability to validate that the dot is firing normally can enable the printer to positively identify contamination versus a failed printhead, thereby saving the cost of an unnecessary replacement due to misdiagnosis. Additionally, the present invention can assist in defining appropriate cleaning protocols. The most common cleaning methodology is cleaning the printhead with a cloth, nonwoven card, or swab that is saturated with isopropyl alcohol. This combination may be rather inefficient for removing some common forms of buildup, such as Case II contamination, that may be better eliminated with very fine abrasive sheets. However, use of abrasive sheets on printheads without contamination will abrade the protective coatings on the printhead, leading these to be rarely recommended for fear of accelerating printhead wear. Positive identification of the type of buildup, and validating the effectiveness of cleaning methodologies, can enable a data-driven and optimized recommendation for printhead cleaning and maintenance, extending printhead life and reducing total cost of ownership.
In an embodiment, processing the image of the printed barcode symbol at 704 can include calculating widths of the one or more elements of the barcode symbol. The method 700 can further include averaging the calculated widths for a group of the elements of the barcode symbol. Additionally, the averaged widths can be plotted. Processing the image at 704 can also include comparing the image with a reference image. Additionally, processing the image can include processing the image with an image processor.
Checking for a malfunction of one or more heating elements can include checking for a burnout of one or more heating elements. For example, the method 700 can include sensing temperature and/or resistance of the thermal printhead.
In an embodiment, identifying a barcode symbol in a verifier image at step 802 can include identifying a barcode symbol in an image obtained from a verifier device, for example an integrated printer-verifier device. Analyzing the calculated element widths at step 808 can include plotting an average deviation within a group of the element widths. Calculating element widths at step 806 can include calculating widths of one or more narrow bars and/or narrow spaces between bars of the barcode. The method 800 can further include issuing a notification reporting the detected contamination, and prescribing a recommended course of action.
In an embodiment, detecting one or more indicia at step 902 can include detecting indicia using a verifier integrated into a thermal printer. Detecting indicia can include detecting one or more 1D barcodes, 2D barcodes, graphics, and/or text.
The method 900 can further include reporting the presence of printhead contamination. The reporting can include sending a message to an entity responsible for printhead maintenance and/or printing a specifically formatted label. The method 900 can further include triggering one or more predetermined actions in response to the detected contamination, wherein the predetermined actions are selected based on user sensitivity or preference to print quality. For example, some users may want to know only if there is a speck of contamination that impacts scannability, while others may be highly sensitive to minor fluctuations in print quality.
In an embodiment, consecutively connecting the pixels at step 1006 can further include monitoring a running average slope defining an orientation of the line being formed. Monitoring a running average slope can include determining an angle of the slope with a point-slope technique. Additionally, the method 1000 can include making a connection between two consecutive pixels when a resulting change in the running average slope does not exceed a predetermined angle threshold (such as a predetermined static and/or dynamic angle value). The method 1000 can further include monitoring an average direction of the running average slope, and making a connection between two consecutive pixels when such connection follows a forward direction of the slope.
A. Wrinkle Detection
In an embodiment, the method 1100 can include assigning a confidence level value to the one or more primary and/or secondary lines. Additionally, the method 1100 can include requesting capturing an additional image to replace the captured image having one or more primary and/or secondary lines with low confidence level values.
Creating a difference image at step 1102 can include using the reference image stored in a self-learning database. Depending on an embodiment, the database can be external or internal. Additionally, comparing a captured image of a media can include comparing a captured image of a media displaying a barcode.
In an embodiment, identifying a barcode symbol at step 1202 can include identifying a two-dimensional barcode symbol. For example,
In an embodiment, the difference image can be analyzed using the following algorithm to highlight the bright pixels: based on the (x; y) coordinate of each pixel, vectors between the pixels, their respective slopes, and an average distance between the pixels can be calculated. One can then connect each pixel depending on their proximity with their neighbors as well as the slope change from pixel to pixel, and the void space existing between the pixels.
In an embodiment, a connection algorithm can use the following pixel structure to analyze and group the pixels together during the analysis. Each pixel, noted “P,” can have three states:
In addition, each pixel can be assigned a group (1, 2, 3 . . . ) representing the number of an individual wrinkle line found. Hence, a pixel can be defined in a structure with the following information: P {x; y; state; group}. The starting pixel P can be chosen based on P(min(x);min(y)). Its group can then be assigned to 1 and its state can be set to Pused.
To connect the pixels based on distance, a radius variable can be defined to help determine if a bright pixel belongs to the same group. The algorithm can first check if there is any pixel within the predetermined radius to connect to. If none are present, then the pixel can be marked as Pbad, meaning that it is a random defect and that it should be ignored. For a pixel that has a neighbor within the vicinity, the algorithm can then check if there are still any pixels free. In this case, P can be connected to the nearest free pixel P′. Once the connection is done, P′ can then be assigned the same group number as P, and its state can be changed to Pused; P′ can become the new starting point, and the algorithm can then try to connect P′ to the next nearest pixel to form a line. In the case that all nearest pixels are used, the algorithm can jump to:
P″(max(x);max(y))∈Pused(P(group)),
and P″ can become a new starting point.
In the case where P″ has no more free neighbors (all marked Pused within the predetermined radius), the algorithm can mark the end of a line for the current wrinkle. The algorithm can then move to the next Pfree pixel, increasing the group number by one to detect a new wrinkle line. The algorithm can continue until there are no more free pixels; then the algorithm can end, as all or almost all wrinkles have been detected.
In an embodiment, when attempting to link a pixel, a ribbon wrinkle detection algorithm can also take into consideration a slope change when looking at the nearest pixel. The algorithm can calculate a running average slope to determine an orientation of the wrinkle being currently analyzed. If the slope change exceeds a predetermined threshold (+/−60 degrees, for example), then the connection may not be made unless the distance between P and P′:
dist(P,P′)<(Radius/k),
If the slope does not carry information on the direction of the line, the algorithm may also check if the connection to P′ is going “backward” from the existing average direction. Again, the connection may not be made in this case unless dist(P,P′)<(Radius/p) is a rational and positive number.
In some cases, some wrinkle lines have a similar slope, and are running on the similar average line (even though they appear disconnected at first because the edge of the wrinkle detected may be separated by more than the radius distance). The algorithm may connect such lines together to make them belong to the same group.
In an embodiment, the algorithm can also perform a defect analysis, by having the printer either access a database of defects stored internally in the printer memory, or access an external database, such as a cloud database. The external database may be updated to include a history of printing issues that can be found over time. During the defect analysis, the algorithm may also assign a confidence level (CL) value indicating how certain it is in detecting the current issue, for example a wrinkle. A high CL value can be given when the defect detected matches one or more criteria in the wrinkle database. In case of lower CL value, one or more additional printed samples may be required before triggering an error message. Additionally, the database can be self-learning based on the number of occurrence and frequency of the ribbon wrinkle issue in order to define the root cause and best solution more accurately over time.
B. Void/Platen Roller Contamination Detection
By comparing a computer memory image to be printed to an actual image of the label, one can determine the difference between the intended and the final printed label. As a result, everything that was the same in the intended graphic and the image of the printed label can be shown in black because of a subtractive process. Where there is a difference, any imperfections can be rendered in a grayscale range where pure white can refer to a full mismatch in pixel comparison.
In an embodiment, an algorithm can be created to determine whether the images in
In an embodiment, to highlight the bright pixels, the difference image may be analyzed using the following algorithm. Because each pixel has its own (x; y) coordinate, vectors between the pixels, their respective slopes, and an average distance between the pixels can be calculated. One can then connect each pixel (or group each cluster of pixels, in case of analyzing printing defects caused by dust, grit, etc., here referred to as “void analysis”) depending on their proximity with their neighbors as well as the slope change from pixel to pixel, and the void space existing between the pixels.
In an embodiment, a connection algorithm can use the following pixel structure to analyze and group the pixels together during the analysis. Each pixel, noted “P,” can have three states:
In addition, each pixel can be assigned a group (1, 2, 3 . . . ) representing the number of an individual void found. Hence a pixel can be defined in a structure with the following information: P{x; y; state; group}. The starting pixel P can be chosen based on P(min(x);min(y)). Its group can then be assigned to 1 and its state can be set to Pused.
To connect the pixels based on distance, a radius variable can be defined to help determine if a bright pixel belongs to the same group. The algorithm can first check if there is any pixel within the predetermined radius to connect to. If none are present then the pixel can be marked as Pbad, it is a random defect and should be ignored. For a pixel that has a neighbor within the vicinity, the algorithm can then check if there are still any pixels free. In this case, P can be connected to the nearest free pixel P′. Once the connection is done, P′ can then be assigned the same group number as P, and its state can be changed to Pused. P′ can become the new starting point, and the algorithm can then try to connect P′ to the next nearest pixel to form a cluster of pixels marking the void. In the case that all nearest pixels are used, the algorithm can jump to:
P″(max(x);max(y))∈Pused(P(group)),
In the case where P″ has no more free neighbors (all marked Pused within the predetermined radius), the algorithm can mark the end of a cluster for the current Void group. The algorithm can then move to the next Pfree pixel, increasing the group number by one to detect a new void mark. The algorithm can continue until there are no more free pixels; then the algorithm can end, as all or almost all voids have been detected.
In an embodiment, the algorithm can also perform a defect analysis by having the printer either access a database of defects stored internally in the printer memory, or access an external database, such as a cloud database. The external database may be updated to include a history of printing issues that can be found over time. During the defect analysis, the algorithm may also assign a confidence level (CL) value indicating how certain it is in detecting the current issue, for example a void. A high CL value can be given when the defect detected matches with different criteria of void detection when the comparison is performed with void database. In case of lower CL value, one or more additional printed samples may be required before triggering an error message. Additionally, the database can be self-learning based on the number of occurrence and frequency of the voiding issue, in order to define the root cause and best solution more accurately over time.
In an embodiment, an image processing method can include recognizing a void pattern. A void pattern can include following unique particularities: void points can be small, making the total ratio of bright spots in comparison black surface small; the groups of points indicating a void can be separated by distances much greater than the distances between individual void points. If any of these criteria are fulfilled, the method can ensure that the voids are detected.
Each group can be delimited by its own lowest pixel and highest pixel in the X, Y direction. Thus, a boundary can be made using P(min(x);min(y)) and P(max(x);max(y)) with both pixels belonging to the same Group j. Simple rectangular or circular boundaries can be formed.
In one embodiment, a method of checking for voids can include calculating the “ratio of coverage,” where the surface covered by the void over the label surface can be calculated, followed by checking if it is lower than a predefined ratio “VoidCoefficient” to detect a void:
TotalVoidSurface/LabelSurface<VoidCoefficient
In another embodiment, a method of checking for voids can include using the distance between each group, as the distance is likely to be rather large compared to a pixel/dot size. The algorithm can calculate the average distance between each group and compare it to a defined value “VoidDistance”:
AverageDistanceBetweenGroups>VoidDistance
In an embodiment, the method can include determining if the void is caused by contamination on the platen roller or media. To determine if one or more void marks are due to contamination on the platen roller or the media, the algorithm can check for a repeat pattern. The platen roller has a fixed circumference, which means that the majority of the void marks caused by platen roller contamination will repeat at a fixed distance approximately equal to the platen roller circumference.
For a long label, the repeat void group can be on the same X-axis while separated by a fixed Y distance equal to the platen roller circumference, plus or minus a small margin for measurement error.
In an embodiment, once it is determined that a platen roller or the media is contaminated, a printer-verifier can communicate to the user or to the host system the nature and extent of the contamination. For instance, if two or three bright points are found, the printer can issue a low priority message to clean the platen roller at the next media change. If the label similar to the one shown in
When more than one defect occurs within one label, refining the grouping is especially important. For example, a label printed with a combination of a void and banding defects is shown in
Once the difference image is produced, one or more defect detection algorithms can be applied to detect printing defects of various types (such as ribbon wrinkle, banding, ink split, etc.) by producing rendered images, where bright pixels are assigned to corresponding defect groups. Such rendered images can then be overlapped and analyzed to determine if any bright pixels are common to more than one output image. When such pixels are found in two or more images, additional image processing methods can be used to refine, extract and reassign each pixel to its correct defect group.
Each refined group is assigned a Confidence Level value. The Confidence Level (CL) value aims to indicate how certain the system is in detecting an error. Using the refined data, the algorithm can calculate such values as a ratio of bright pixels over the total number of pixels of the entire scanned image as well as within each group. Based on the ratio value for each defect type, the algorithm can either use a look-up table to retrieve the Confidence Level value, or it can calculate it by using one or more formulas. A simplified flow is described below for an ease of understanding; more components can be taken into account to improve the confidence level calculation.
For example, each group found can contain at least the following information obtained from a corresponding refined image output: the x-coordinate of the leftmost pixel defined by Group.n(min(x)); the x-coordinate of the rightmost pixel defined by Group.n(max(x)); the y-coordinate of the lower-most pixel defined by Group.n(min(y)); the y-coordinate of the upper-most pixel defined by Group.n(max(y)); the number of bright pixels within the group defined as Group.n(#bright pixels); and the surface area covered by the group in number of pixels, defined by:
Group.nTotalPix=Group.n(max(x)−min(x))×(max(y)−min(y)).
Using this information, the algorithm can calculate the ratio of bright pixels over total number of pixels in each group. For example,
In addition to the ratio within a group, the algorithm can calculate the ratio of bright pixels over total number of pixels for the entire image:
Several methods can be used to assign the Confidence Level values in the process of detecting visual print quality defects and identifying which defect is observed. For example, such methods can use the “imageW%ratio” and/or the “Group.nW%ratio” to compare to predefined values, which may be stored in a look-up table. Table 1 shows a simplified example of the look-up table. The values listed in Table 1 are provided for illustrative purposes only.
For example, if the ratio found is 17% based on the refined image for the void detection, then the CL value is 3, indicating a low chance that void is present. However, if the ratio is 1%, the CL value jumps to 60, showing an above average probability that void type contamination is present in the label.
Alternatively or additionally, assigning confidence level value to various defect types can involve other calculations. For example, the following equation can be used:
In an embodiment, the algorithm can be configured to determine what type of action, warning or error message to trigger in order to alert the user and solve the issue, based on the current and/or past CL data.
In cases when the detected CL value is high, an error message may be triggered immediately. However, some printing defects may be progressive in nature, and exhibit a stronger effect over time. For example, when a platen roller is wearing out, at first the effect in creating banding is minimal, and it can be difficult to determine whether it is a true issue or not. To overcome this kind of uncertainty, the history algorithm can be configured to monitor how the Confidence Level value varies over time, and determine whether to activate an error correction sequence.
At step 1902, the history algorithm 1900 collects CL.n values for each defect type. At step 1904, the history algorithm 1900 calculates the CL Slope, which shows how fast the CL values changes from previous image to current image. At step 1906, the history algorithm 1900 determines whether the CL Slope exceeds a certain threshold.
When the CL Slope does not exceed the threshold at step 1906, the algorithm 1900 can then check if there is a trend of a negative CL slope. For example, the algorithm 1900 may calculate the total value of negative slope as shown at step 1908, and determine whether the total value of negative slope exceeds a threshold (nolssueCnt) at step 1910. If this is the case, the Total CL value for the current defect can be reset to 0 at step 1912, and the next sample is collected at step 1914. If no, there is no reset of the Total CL value.
When the CL slope exceeds the defined threshold at step 1906, the algorithm 1900 can then verify the slope value at step 1916. Based on the result of verification, the algorithm 1900 can increase the CL.Total value at steps 1918 and 1920, and may additionally increasing the total value of positive slope observed at step 1918.
At step 1922, the CL.Total value can then be checked to verify if the Total Confidence Level has reached an error threshold to trigger the alarm and/or initiate corrective actions. If the CL.Total value exceeds the error threshold, then the algorithm 1900 determines whether error type makes printout unreadable at step 1928. If so, then the algorithm 1900 triggers error warning at step 1926. If error type does not make printout unreadable, the algorithm 1900 further determines whether the total value of positive slope exceeds a threshold (RapidErrorCnt) at step 1930. If so, then the algorithm 1900 may trigger an error warning at step 1926. If not, the algorithm 1900 may proceed with collecting the next sample at step 1914.
At step 1922, if the CL.Total value is increasing slowly and steadily without reaching the error threshold, the algorithm 1900 examine whether the total value of positive slope exceeds a safety limit at step 1924. If so, the algorithm 1900 can notify the user and/or mark the issue as highly probable to occur on a future label to be printed at step 1926. If not, the algorithm 1900 may proceed with collecting the next sample at step 1914.
Through the history algorithm, the system can be configured to trigger a corrective or preventative action (such as alert or error message) when a certain visual defect type is detected. There are various actions that the printing system can be configured to take when a printing defect is detected. For instance, the printer can transmit a message over Wi-Fi, network, or by other means of communication, such as cellular wireless communication, sounds, and/or flashing lights to the IT department or other departments responsible for maintenance, such as quality control or inventory. A message can also be transmitted to the maintenance department to perform a maintenance process within a predetermined timeframe, such as the next hour for instance. Based on the type of the defect, the printer can also provide guidance on how to resolve the issue. Additionally or alternatively, a specially formatted printed label can notify the user to stop the print run and/or take one or more predetermined actions to address the detected issue. The algorithm may also include modifying the thermal management setting, while notifying the user/maintenance/IT.
Additionally, error detection feedback can be provided to an internal and/or external database, and/or an external storage unit such as a cloud database. The external cloud database can be updated based not only on local data of onset printer, but also include history of visual printing defect issues that can be found over time and over a wide range of printers at various locations. The database can be self-learning, and take into account the frequency of occurrence of each detected issue, to improve determination of the root cause and/or issue resolution in the future.
Using previously obtained data, the database can be configured to dynamically update various algorithms, such as the CL value assignment and/or calculation. For example, if, for a certain defect, the Confidence Level value always (or often) slowly increases, and it takes about 50 labels to reach the threshold, then after detecting this trend enough times, certain actions can be taken during its next occurrence, such as lowering the threshold or boosting up the confidence level value assigned to it, so that it takes only 15 labels to reach the trigger level in the future. Additionally, the algorithm can be configured to provide an improved output rendered image to facilitate future defect detection.
In an embodiment, checking for printing defects at step 2004 can include generating and analyzing a difference image obtained by comparing the captured image to a reference image, and/or processing the captured image to detect printhead, platen roller and/or media contamination. Generating a difference image can include comparing a binary version of the captured image to a binary version of the reference image. Checking the captured image for one or more printing defects can include detecting at least one of ribbon wrinkles, printhead, platen roller and/or media contamination, black and/or white banding, and/or black and/or white ink split.
In an embodiment, analyzing evolution at step 2006 can include comparing one or more evolution characteristics (such as confidence level values) of the defects to a predetermined threshold. The method 2000 can further include verifying the one or more evolution characteristics when one or more characteristics are found to exceed the predetermined threshold, and determining if one or more predetermined corrective actions should be initiated. Additionally or alternatively, the method 2000 can further include initiating one or more predetermined corrective actions (such as preemptive maintenance) when the one or more evolution characteristics are slowly rising without exceeding the predetermined threshold. Initiating corrective actions can include (but are not limited to) triggering an alert, producing an error message, stopping printer operation, and/or prescribing a recommended course of action.
Additionally, the method 2000 can include providing feedback to a self-learning defect database. The provided feedback can then be used to dynamically update one or more algorithms for checking the image for printing defects, and/or for analyzing evolution of the detected defects. Capturing an image of a printout on a media at step 2002 can include scanning an image with a printer-verifier device.
In the specification and figures, typical embodiments of the invention have been disclosed. The present invention is not limited to such exemplary embodiments. The use of the term “and/or” includes any and all combinations of one or more of the associated listed items. The figures are schematic representations and so are not necessarily drawn to scale. Unless otherwise noted, specific terms have been used in a generic and descriptive sense and not for purposes of limitation.
Device and method components are meant to show only those specific details that are pertinent to understanding the embodiments of the present disclosure 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. In various embodiments, the sequence in which the elements of appear in exemplary embodiments disclosed herein may vary. Two or more method steps may be performed simultaneously or in a different order than the sequence in which the elements appear in the exemplary embodiments, unless indicated otherwise.
Various embodiments of the present invention may be implemented in a printer connected to a verifier, or a printer-verifier. The processor of the printer or the verifier may carry out steps of methods in accordance with various embodiments of the present invention.
Referring now to
In various embodiments, the printer-verifier 2100 is a thermal transfer printer-verifier that includes a ribbon supply spindle 2130 contained within the body 2118. A ribbon supply roll 2108 is configured to be disposed on the ribbon supply spindle 2130. The ribbon supply roll 2108 comprises ink ribbon 2102 wound on a ribbon supply spool 2104. The ink ribbon supplies the media (e.g., ink) that transfers onto the print media. The printer-verifier 2100 may further comprise a thermal printhead 2116 utilized to thermally transfer a portion of ink from the ink ribbon 2102 to the print media 2112 as the ink ribbon is unwound from the ribbon supply spool 2104 along a ribbon path (arrow B in
A media supply roll 2110 comprises the print media 2112 wound on the media supply spool 2114. A media supply spindle 2132 on which the media supply roll 2110 is configured to be disposed is contained within the body 2118. A ribbon rewind spindle 2134 on which unwound ribbon is wound up may also be contained within the body 2118. A ribbon take-up 2106 may be disposed on the ribbon rewind spindle 2134, although the ribbon take-up 2106 on the ribbon rewind spindle 2134 may not be necessary.
The printer-verifier 2100 may further comprise one or more motors for rotating the ribbon supply spindle 2130 and the ribbon supply roll 2108 disposed thereon (if present) in a forward (arrow A in
The printer-verifier 2100 may include a GUI 2122 for communication between a user and the printer-verifier 2100. The GUI 2122 may be communicatively coupled to the other components of the printer-verifier for displaying visual and/or auditory information and receiving information from the user (e.g., typed, touched, spoken, etc.). As depicted in
Referring now to
The central processing unit (CPU) (i.e., the processor 2120) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions as described above. The printer-verifier 2100 may be communicatively connected using the communications module 2142 to a computer or a network 2144 via a wired or wireless data link. In a wireless configuration, the communications module 2142 may communicate with a host device over the network 2144 via a variety of communication protocols (e.g., WI-FI®, BLUETOOTH®), CDMA, TDMA, or GSM). In accordance with various embodiments of the present invention, the memory 2140 is configured to store a print quality verification program 2146, a reference image 2148, an offset value 2150, and a drifting offset value 2152 as described above.
Still referring to
Referring now to
Similar to the printer-verifier 2100 described above in connection with
The verifier 2202 comprises imaging module 2236, a memory (a verifier memory 2214) communicatively coupled to the imaging module 2236 and a central processing unit (CPU) (herein a “verifier processor” 2210) communicatively coupled to the verifier memory 2214 and imaging module 2236. The verifier 2202 may further comprise an I/O module 2222 and a verifier communication module 2216.
The subsystems in the verifier 2202 of
While
The imaging module 2236 disposed in verifier 2202 is configured to capture the representation of the printed image (e.g., the printed barcode 2201 on the print media 2212 in
While a thermal transfer printer-verifier and printer are described, it is to be understood that various embodiments of the present invention may be used in other types of printers (e.g., ink-drop printer, laser-toner printer, etc.).
To supplement the present disclosure, this application incorporates entirely by reference the following commonly assigned patents, patent application publications, and patent applications:
U.S. Pat. Nos. 6,832,725; 7,128,266; 7,159,783; 7,413,127; 7,726,575; 8,294,969; 8,317,105; 8,322,622; 8,366,005; 8,371,507; 8,376,233; 8,381,979; 8,390,909; 8,408,464; 8,408,468; 8,408,469; 8,424,768; 8,448,863; 8,457,013; 8,459,557; 8,469,272; 8,474,712; 8,479,992; 8,490,877; 8,517,271; 8,523,076; 8,528,818; 8,544,737; 8,548,242; 8,548,420; 8,550,335; 8,550,354; 8,550,357; 8,556,174; 8,556,176; 8,556,177; 8,559,767; 8,599,957; 8,561,895; 8,561,903; 8,561,905; 8,565,107; 8,571,307; 8,579,200; 8,583,924; 8,584,945; 8,587,595; 8,587,697; 8,588,869; 8,590,789; 8,596,539; 8,596,542; 8,596,543; 8,599,271; 8,599,957; 8,600,158; 8,600,167; 8,602,309; 8,608,053; 8,608,071; 8,611,309; 8,615,487; 8,616,454; 8,621,123; 8,622,303; 8,628,013; 8,628,015; 8,628,016; 8,629,926; 8,630,491; 8,635,309; 8,636,200; 8,636,212; 8,636,215; 8,636,224; 8,638,806; 8,640,958; 8,640,960; 8,643,717; 8,646,692; 8,646,694; 8,657,200; 8,659,397; 8,668,149; 8,678,285; 8,678,286; 8,682,077; 8,687,282; 8,692,927; 8,695,880; 8,698,949; 8,717,494; 8,717,494; 8,720,783; 8,723,804; 8,723,904; 8,727,223; 8,740,082; 8,740,085; 8,746,563; 8,750,445; 8,752,766; 8,756,059; 8,757,495; 8,760,563; 8,763,909; 8,777,108; 8,777,109; 8,779,898; 8,781,520; 8,783,573; 8,789,757; 8,789,758; 8,789,759; 8,794,520; 8,794,522; 8,794,525; 8,794,526; 8,798,367; 8,807,431; 8,807,432; 8,820,630; 8,822,848; 8,824,692; 8,824,696; 8,842,849; 8,844,822; 8,844,823; 8,849,019; 8,851,383; 8,854,633; 8,866,963; 8,868,421; 8,868,519; 8,868,802; 8,868,803; 8,870,074; 8,879,639; 8,880,426; 8,881,983; 8,881,987; 8,903,172; 8,908,995; 8,910,870; 8,910,875; 8,914,290; 8,914,788; 8,915,439; 8,915,444; 8,916,789; 8,918,250; 8,918,564; 8,925,818; 8,939,374; 8,942,480; 8,944,313; 8,944,327; 8,944,332; 8,950,678; 8,967,468; 8,971,346; 8,976,030; 8,976,368; 8,978,981; 8,978,983; 8,978,984; 8,985,456; 8,985,457; 8,985,459; 8,985,461; 8,988,578; 8,988,590; 8,991,704; 8,996,194; 8,996,384; 9,002,641; 9,007,368; 9,010,641; 9,015,513; 9,016,576; 9,022,288; 9,030,964; 9,033,240; 9,033,242; 9,036,054; 9,037,344; 9,038,911; 9,038,915; 9,047,098; 9,047,359; 9,047,420; 9,047,525; 9,047,531; 9,053,055; 9,053,378; 9,053,380; 9,058,526; 9,064,165; 9,064,165; 9,064,167; 9,064,168; 9,064,254; 9,066,032; 9,070,032; 9,076,459; 9,079,423; 9,080,856; 9,082,023; 9,082,031; 9,084,032; 9,087,250; 9,092,681; 9,092,682; 9,092,683; 9,093,141; 9,098,763; 9,104,929; 9,104,934; 9,107,484; 9,111,159; 9,111,166; 9,135,483; 9,137,009; 9,141,839; 9,147,096; 9,148,474; 9,158,000; 9,158,340; 9,158,953; 9,159,059; 9,165,174; 9,171,543; 9,183,425; 9,189,669; 9,195,844; 9,202,458; 9,208,366; 9,208,367; 9,219,836; 9,224,024; 9,224,027; 9,230,140; 9,235,553; 9,239,950; 9,245,492; 9,248,640; 9,250,652; 9,250,712; 9,251,411; 9,258,033; 9,262,633; 9,262,660; 9,262,662; 9,269,036; 9,270,782; 9,274,812; 9,275,388; 9,277,668; 9,280,693; 9,286,496; 9,298,964; 9,301,427; 9,313,377; 9,317,037; 9,319,548; 9,342,723; 9,361,882; 9,365,381; 9,373,018; 9,375,945; 9,378,403; 9,383,848; 9,384,374; 9,390,304; 9,390,596; 9,411,386; 9,412,242; 9,418,269; 9,418,270; 9,465,967; 9,423,318; 9,424,454; 9,436,860; 9,443,123; 9,443,222; 9,454,689; 9,464,885; 9,465,967; 9,478,983; 9,481,186; 9,487,113; 9,488,986; 9,489,782; 9,490,540; 9,491,729; 9,497,092; 9,507,974; 9,519,814; 9,521,331; 9,530,038; 9,572,901; 9,558,386; 9,606,581; 9,646,189; 9,646,191; 9,652,648; 9,652,653; 9,656,487; 9,659,198; 9,680,282; 9,697,401; 9,701,140; U.S. Design Patent No. D702,237; U.S. Design Patent No. D716,285; U.S. Design Patent No. D723,560; U.S. Design Patent No. D730,357; U.S. Design Patent No. D730,901;U.S. Design Patent No. D730,902; U.S. Design Patent No. D734,339; U.S. Design Patent No. D737,321; U.S. Design Patent No. D754,205; U.S. Design Patent No. D754,206; U.S. Design Patent No. D757,009; U.S. Design Patent No. D760,719; U.S. Design Patent No. D762,604; U.S. Design Patent No. D766,244; U.S. Design Patent No. D777,166; U.S. Design Patent No. D771,631; U.S. Design Patent No. D783,601; U.S. Design Patent No. D785,617; U.S. Design Patent No. D785,636; U.S. Design Patent No. D790,505; U.S. Design Patent No. D790,546; International Publication No. 2013/163789; U.S. Patent Application Publication No. 2008/0185432; U.S. Patent Application Publication No. 2009/0134221; U.S. Patent Application Publication No. 2010/0177080; U.S. Patent Application Publication No. 2010/0177076; U.S. Patent Application Publication No. 2010/0177707; U.S. Patent Application Publication No. 2010/0177749; U.S. Patent Application Publication No. 2010/0265880; U.S. Patent Application Publication No. 2011/0202554; U.S. Patent Application Publication No. 2012/0111946; U.S. Patent Application Publication No. 2012/0168511; U.S. Patent Application Publication No. 2012/0168512; U.S. Patent Application Publication No. 2012/0193423; U.S. Patent Application Publication No. 2012/0194692; U.S. Patent Application Publication No. 2012/0203647; U.S. Patent Application Publication No. 2012/0223141; U.S. Patent Application Publication No. 2012/0228382; U.S. Patent Application Publication No. 2012/0248188; U.S. Patent Application Publication No. 2013/0043312; U.S. Patent Application Publication No. 2013/0082104; U.S. Patent Application Publication No. 2013/0175341; U.S. Patent Application Publication No. 2013/0175343; U.S. Patent Application Publication No. 2013/0257744; U.S. Patent Application Publication No. 2013/0257759; U.S. Patent Application Publication No. 2013/0270346; U.S. Patent Application Publication No. 2013/0292475; U.S. Patent Application Publication No. 2013/0292477; U.S. Patent Application Publication No. 2013/0293539; U.S. Patent Application Publication No. 2013/0293540; U.S. Patent Application Publication No. 2013/0306728; U.S. Patent Application Publication No. 2013/0306731; U.S. Patent Application Publication No. 2013/0307964; U.S. Patent Application Publication No. 2013/0308625; U.S. Patent Application Publication No. 2013/0313324; U.S. Patent Application Publication No. 2013/0332996; U.S. Patent Application Publication No. 2014/0001267; U.S. Patent Application Publication No. 2014/0025584; U.S. Patent Application Publication No. 2014/0034734; U.S. Patent Application Publication No. 2014/0036848; U.S. Patent Application Publication No. 2014/0039693; U.S. Patent Application Publication No. 2014/0049120; U.S. Patent Application Publication No. 2014/0049635; U.S. Patent Application Publication No. 2014/0061306; U.S. Patent Application Publication No. 2014/0063289; U.S. Patent Application Publication No. 2014/0066136; U.S. Patent Application Publication No. 2014/0067692; U.S. Patent Application Publication No. 2014/0070005; U.S. Patent Application Publication No. 2014/0071840; U.S. Patent Application Publication No. 2014/0074746; U.S. Patent Application Publication No. 2014/0076974; U.S. Patent Application Publication No. 2014/0097249; U.S. Patent Application Publication No. 2014/0098792; U.S. Patent Application Publication No. 2014/0100813; U.S. Patent Application Publication No. 2014/0103115; U.S. Patent Application Publication No. 2014/0104413; U.S. Patent Application Publication No. 2014/0104414; U.S. Patent Application Publication No. 2014/0104416; U.S. Patent Application Publication No. 2014/0106725; U.S. Patent Application Publication No. 2014/0108010; U.S. Patent Application Publication No. 2014/0108402; U.S. Patent Application Publication No. 2014/0110485; U.S. Patent Application Publication No. 2014/0125853; U.S. Patent Application Publication No. 2014/0125999; U.S. Patent Application Publication No. 2014/0129378; U.S. Patent Application Publication No. 2014/0131443; U.S. Patent Application Publication No. 2014/0133379; U.S. Patent Application Publication No. 2014/0136208; U.S. Patent Application Publication No. 2014/0140585; U.S. Patent Application Publication No. 2014/0152882; U.S. Patent Application Publication No. 2014/0158770; U.S. Patent Application Publication No. 2014/0159869; U.S. Patent Application Publication No. 2014/0166759; U.S. Patent Application Publication No. 2014/0168787; U.S. Patent Application Publication No. 2014/0175165; U.S. Patent Application Publication No. 2014/0191684; U.S. Patent Application Publication No. 2014/0191913; U.S. Patent Application Publication No. 2014/0197304; U.S. Patent Application Publication No. 2014/0214631; U.S. Patent Application Publication No. 2014/0217166; U.S. Patent Application Publication No. 2014/0231500; U.S. Patent Application Publication No. 2014/0247315; U.S. Patent Application Publication No. 2014/0263493; U.S. Patent Application Publication No. 2014/0263645; U.S. Patent Application Publication No. 2014/0270196; U.S. Patent Application Publication No. 2014/0270229; U.S. Patent Application Publication No. 2014/0278387; U.S. Patent Application Publication No. 2014/0288933; U.S. Patent Application Publication No. 2014/0297058; U.S. Patent Application Publication No. 2014/0299665; U.S. Patent Application Publication No. 2014/0332590; U.S. Patent Application Publication No. 2014/0351317; U.S. Patent Application Publication No. 2014/0362184; U.S. Patent Application Publication No. 2014/0363015; U.S. Patent Application Publication No. 2014/0369511; U.S. Patent Application Publication No. 2014/0374483; U.S. Patent Application Publication No. 2014/0374485; U.S. Patent Application Publication No. 2015/0001301; U.S. Patent Application Publication No. 2015/0001304; U.S. Patent Application Publication No. 2015/0009338; U.S. Patent Application Publication No. 2015/0014416; U.S. Patent Application Publication No. 2015/0021397; U.S. Patent Application Publication No. 2015/0028104; U.S. Patent Application Publication No. 2015/0029002; U.S. Patent Application Publication No. 2015/0032709; U.S. Patent Application Publication No. 2015/0039309; U.S. Patent Application Publication No. 2015/0039878; U.S. Patent Application Publication No. 2015/0040378; U.S. Patent Application Publication No. 2015/0049347; U.S. Patent Application Publication No. 2015/0051992; U.S. Patent Application Publication No. 2015/0053769; U.S. Patent Application Publication No. 2015/0062366; U.S. Patent Application Publication No. 2015/0063215; U.S. Patent Application Publication No. 2015/0088522; U.S. Patent Application Publication No. 2015/0096872; U.S. Patent Application Publication No. 2015/0100196; U.S. Patent Application Publication No. 2015/0102109; U.S. Patent Application Publication No. 2015/0115035; U.S. Patent Application Publication No. 2015/0127791; U.S. Patent Application Publication No. 2015/0128116; U.S. Patent Application Publication No. 2015/0133047; U.S. Patent Application Publication No. 2015/0134470; U.S. Patent Application Publication No. 2015/0136851; U.S. Patent Application Publication No. 2015/0142492; U.S. Patent Application Publication No. 2015/0144692; U.S. Patent Application Publication No. 2015/0144698; U.S. Patent Application Publication No. 2015/0149946; U.S. Patent Application Publication No. 2015/0161429; U.S. Patent Application Publication No. 2015/0178523; U.S. Patent Application Publication No. 2015/0178537; U.S. Patent Application Publication No. 2015/0178685; U.S. Patent Application Publication No. 2015/0181109; U.S. Patent Application Publication No. 2015/0199957; U.S. Patent Application Publication No. 2015/0210199; U.S. Patent Application Publication No. 2015/0212565; U.S. Patent Application Publication No. 2015/0213647; U.S. Patent Application Publication No. 2015/0220753; U.S. Patent Application Publication No. 2015/0220901; U.S. Patent Application Publication No. 2015/0227189; U.S. Patent Application Publication No. 2015/0236984; U.S. Patent Application Publication No. 2015/0239348; U.S. Patent Application Publication No. 2015/0242658; U.S. Patent Application Publication No. 2015/0248572; U.S. Patent Application Publication No. 2015/0254485; U.S. Patent Application Publication No. 2015/0261643; U.S. Patent Application Publication No. 2015/0264624; U.S. Patent Application Publication No. 2015/0268971; U.S. Patent Application Publication No. 2015/0269402; U.S. Patent Application Publication No. 2015/0288689; U.S. Patent Application Publication No. 2015/0288896; U.S. Patent Application Publication No. 2015/0310243; U.S. Patent Application Publication No. 2015/0310244; U.S. Patent Application Publication No. 2015/0310389; U.S. Patent Application Publication No. 2015/0312780; U.S. Patent Application Publication No. 2015/0327012; U.S. Patent Application Publication No. 2016/0014251; U.S. Patent Application Publication No. 2016/0025697; U.S. Patent Application Publication No. 2016/0026838; U.S. Patent Application Publication No. 2016/0026839; U.S. Patent Application Publication No. 2016/0040982; U.S. Patent Application Publication No. 2016/0042241; U.S. Patent Application Publication No. 2016/0057230; U.S. Patent Application Publication No. 2016/0062473; U.S. Patent Application Publication No. 2016/0070944; U.S. Patent Application Publication No. 2016/0092805; U.S. Patent Application Publication No. 2016/0101936; U.S. Patent Application Publication No. 2016/0104019; U.S. Patent Application Publication No. 2016/0104274; U.S. Patent Application Publication No. 2016/0109219; U.S. Patent Application Publication No. 2016/0109220; U.S. Patent Application Publication No. 2016/0109224; U.S. Patent Application Publication No. 2016/0112631; U.S. Patent Application Publication No. 2016/0112643; U.S. Patent Application Publication No. 2016/0117627; U.S. Patent Application Publication No. 2016/0124516; U.S. Patent Application Publication No. 2016/0125217; U.S. Patent Application Publication No. 2016/0125342; U.S. Patent Application Publication No. 2016/0125873; U.S. Patent Application Publication No. 2016/0133253; U.S. Patent Application Publication No. 2016/0171597; U.S. Patent Application Publication No. 2016/0171666; U.S. Patent Application Publication No. 2016/0171720; U.S. Patent Application Publication No. 2016/0171775; U.S. Patent Application Publication No. 2016/0171777; U.S. Patent Application Publication No. 2016/0174674; U.S. Patent Application Publication No. 2016/0178479; U.S. Patent Application Publication No. 2016/0178685; U.S. Patent Application Publication No. 2016/0178707; U.S. Patent Application Publication No. 2016/0179132; U.S. Patent Application Publication No. 2016/0179143; U.S. Patent Application Publication No. 2016/0179368; U.S. Patent Application Publication No. 2016/0179378; U.S. Patent Application Publication No. 2016/0180130; U.S. Patent Application Publication No. 2016/0180133; U.S. Patent Application Publication No. 2016/0180136; U.S. Patent Application Publication No. 2016/0180594; U.S. Patent Application Publication No. 2016/0180663; U.S. Patent Application Publication No. 2016/0180678; U.S. Patent Application Publication No. 2016/0180713; U.S. Patent Application Publication No. 2016/0185136; U.S. Patent Application Publication No. 2016/0185291; U.S. Patent Application Publication No. 2016/0186926; U.S. Patent Application Publication No. 2016/0188861; U.S. Patent Application Publication No. 2016/0188939; U.S. Patent Application Publication No. 2016/0188940; U.S. Patent Application Publication No. 2016/0188941; U.S. Patent Application Publication No. 2016/0188942; U.S. Patent Application Publication No. 2016/0188943; U.S. Patent Application Publication No. 2016/0188944; U.S. Patent Application Publication No. 2016/0189076; U.S. Patent Application Publication No. 2016/0189087; U.S. Patent Application Publication No. 2016/0189088; U.S. Patent Application Publication No. 2016/0189092; U.S. Patent Application Publication No. 2016/0189284; U.S. Patent Application Publication No. 2016/0189288; U.S. Patent Application Publication No. 2016/0189366; U.S. Patent Application Publication No. 2016/0189443; U.S. Patent Application Publication No. 2016/0189447; U.S. Patent Application Publication No. 2016/0189489; U.S. Patent Application Publication No. 2016/0192051; U.S. Patent Application Publication No. 2016/0202951; U.S. Patent Application Publication No. 2016/0202958; U.S. Patent Application Publication No. 2016/0202959; U.S. Patent Application Publication No. 2016/0203021; U.S. Patent Application Publication No. 2016/0203429; U.S. Patent Application Publication No. 2016/0203797; U.S. Patent Application Publication No. 2016/0203820; U.S. Patent Application Publication No. 2016/0204623; U.S. Patent Application Publication No. 2016/0204636; U.S. Patent Application Publication No. 2016/0204638; U.S. Patent Application Publication No. 2016/0227912; U.S. Patent Application Publication No. 2016/0232891; U.S. Patent Application Publication No. 2016/0292477; U.S. Patent Application Publication No. 2016/0294779; U.S. Patent Application Publication No. 2016/0306769; U.S. Patent Application Publication No. 2016/0314276; U.S. Patent Application Publication No. 2016/0314294; U.S. Patent Application Publication No. 2016/0316190; U.S. Patent Application Publication No. 2016/0323310; U.S. Patent Application Publication No. 2016/0325677; U.S. Patent Application Publication No. 2016/0327614; U.S. Patent Application Publication No. 2016/0327930; U.S. Patent Application Publication No. 2016/0328762; U.S. Patent Application Publication No. 2016/0330218; U.S. Patent Application Publication No. 2016/0343163; U.S. Patent Application Publication No. 2016/0343176; U.S. Patent Application Publication No. 2016/0364914; U.S. Patent Application Publication No. 2016/0370220; U.S. Patent Application Publication No. 2016/0372282; U.S. Patent Application Publication No. 2016/0373847; U.S. Patent Application Publication No. 2016/0377414; U.S. Patent Application Publication No. 2016/0377417; U.S. Patent Application Publication No. 2017/0010141; U.S. Patent Application Publication No. 2017/0010328; U.S. Patent Application Publication No. 2017/0010780; U.S. Patent Application Publication No. 2017/0016714; U.S. Patent Application Publication No. 2017/0018094; U.S. Patent Application Publication No. 2017/0046603; U.S. Patent Application Publication No. 2017/0047864; U.S. Patent Application Publication No. 2017/0053146; U.S. Patent Application Publication No. 2017/0053147; U.S. Patent Application Publication No. 2017/0053647; U.S. Patent Application Publication No. 2017/0055606; U.S. Patent Application Publication No. 2017/0060316; U.S. Patent Application Publication No. 2017/0061961; U.S. Patent Application Publication No. 2017/0064634; U.S. Patent Application Publication No. 2017/0083730; U.S. Patent Application Publication No. 2017/0091502; U.S. Patent Application Publication No. 2017/0091706; U.S. Patent Application Publication No. 2017/0091741; U.S. Patent Application Publication No. 2017/0091904; U.S. Patent Application Publication No. 2017/0092908; U.S. Patent Application Publication No. 2017/0094238; U.S. Patent Application Publication No. 2017/0098947; U.S. Patent Application Publication No. 2017/0100949; U.S. Patent Application Publication No. 2017/0108838; U.S. Patent Application Publication No. 2017/0108895; U.S. Patent Application Publication No. 2017/0118355; U.S. Patent Application Publication No. 2017/0123598; U.S. Patent Application Publication No. 2017/0124369; U.S. Patent Application Publication No. 2017/0124396; U.S. Patent Application Publication No. 2017/0124687; U.S. Patent Application Publication No. 2017/0126873; U.S. Patent Application Publication No. 2017/0126904; U.S. Patent Application Publication No. 2017/0139012; U.S. Patent Application Publication No. 2017/0140329; U.S. Patent Application Publication No. 2017/0140731; U.S. Patent Application Publication No. 2017/0147847; U.S. Patent Application Publication No. 2017/0150124; U.S. Patent Application Publication No. 2017/0169198; U.S. Patent Application Publication No. 2017/0171035; U.S. Patent Application Publication No. 2017/0171703; U.S. Patent Application Publication No. 2017/0171803; U.S. Patent Application Publication No. 2017/0180359; U.S. Patent Application Publication No. 2017/0180577; U.S. Patent Application Publication No. 2017/0181299; U.S. Patent Application Publication No. 2017/0190192; U.S. Patent Application Publication No. 2017/0193432; U.S. Patent Application Publication No. 2017/0193461; U.S. Patent Application Publication No. 2017/0193727; U.S. Patent Application Publication No. 2017/0199266; U.S. Patent Application Publication No. 2017/0200108; and U.S. Patent Application Publication No. 2017/0200275.
This application is a continuation application of U.S. patent application Ser. No. 17/301,259, filed Mar. 30, 2021, which is a continuation application of U.S. patent application Ser. No. 16/790,417, filed Feb. 13, 2020, which is a continuation application of U.S. patent application Ser. No. 16/240,140, filed Jan. 4, 2019 (now U.S. Pat. No. 10,834,283 issued Nov. 10, 2020), which claims the benefit of U.S. Provisional Patent Application No. 62/614,089, filed Jan. 5, 2018, the entire contents of which are incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4699531 | Ulinski et al. | Oct 1987 | A |
| 5051567 | Tedesco | Sep 1991 | A |
| 5218190 | Hardesty et al. | Jun 1993 | A |
| 5272322 | Nishida et al. | Dec 1993 | A |
| 5318938 | Hampl et al. | Jun 1994 | A |
| 5488223 | Austin et al. | Jan 1996 | A |
| 5488233 | Ishikawa et al. | Jan 1996 | A |
| 5521368 | Adachi | May 1996 | A |
| 5564841 | Austin et al. | Oct 1996 | A |
| 5761336 | Xu et al. | Jun 1998 | A |
| 5845008 | Katoh | Dec 1998 | A |
| 5914474 | Spitz | Jun 1999 | A |
| 6036091 | Spitz | Mar 2000 | A |
| 6042279 | Ackley | Mar 2000 | A |
| 6323949 | Lading et al. | Nov 2001 | B1 |
| 6511141 | Hasegawa et al. | Jan 2003 | B1 |
| 6535299 | Scherz | Mar 2003 | B1 |
| 6567530 | Keronen et al. | May 2003 | B1 |
| 6741727 | Hirasawa | May 2004 | B1 |
| 6763148 | Sternberg | Jul 2004 | B1 |
| 6832725 | Gardiner et al. | Dec 2004 | B2 |
| 6997627 | Chiu | Feb 2006 | B2 |
| 7128266 | Zhu et al. | Oct 2006 | B2 |
| 7159783 | Walczyk et al. | Jan 2007 | B2 |
| 7413127 | Ehrhart et al. | Aug 2008 | B2 |
| 7440123 | Chodagiri et al. | Oct 2008 | B2 |
| 7471331 | Kaneda | Dec 2008 | B2 |
| 7519222 | Kisilev | Apr 2009 | B2 |
| 7570788 | Tsukamoto et al. | Aug 2009 | B2 |
| 7600687 | Biss et al. | Oct 2009 | B2 |
| 7726575 | Wang et al. | Jun 2010 | B2 |
| 7869112 | Borchers et al. | Jan 2011 | B2 |
| 7877004 | Maruyama et al. | Jan 2011 | B2 |
| 7920283 | Shimazaki | Apr 2011 | B2 |
| 7936365 | Jeong | May 2011 | B2 |
| 8189229 | Mori | May 2012 | B2 |
| 8269836 | Zandifar et al. | Sep 2012 | B2 |
| 8294945 | Natori | Oct 2012 | B2 |
| 8294969 | Plesko | Oct 2012 | B2 |
| 8317105 | Kotlarsky et al. | Nov 2012 | B2 |
| 8322622 | Liu | Dec 2012 | B2 |
| 8355058 | Shirai | Jan 2013 | B2 |
| 8366005 | Kotlarsky et al. | Feb 2013 | B2 |
| 8371507 | Haggerty et al. | Feb 2013 | B2 |
| 8376233 | Horn et al. | Feb 2013 | B2 |
| 8381979 | Franz | Feb 2013 | B2 |
| 8390909 | Plesko | Mar 2013 | B2 |
| 8408464 | Zhu et al. | Apr 2013 | B2 |
| 8408468 | Van et al. | Apr 2013 | B2 |
| 8408469 | Good | Apr 2013 | B2 |
| 8424768 | Rueblinger et al. | Apr 2013 | B2 |
| 8448863 | Xian et al. | May 2013 | B2 |
| 8457013 | Essinger et al. | Jun 2013 | B2 |
| 8459557 | Havens et al. | Jun 2013 | B2 |
| 8469272 | Kearney | Jun 2013 | B2 |
| 8474712 | Kearney et al. | Jul 2013 | B2 |
| 8479992 | Kotlarsky et al. | Jul 2013 | B2 |
| 8482809 | Mikami | Jul 2013 | B2 |
| 8488181 | Wu et al. | Jul 2013 | B2 |
| 8490877 | Kearney | Jul 2013 | B2 |
| 8517271 | Kotlarsky et al. | Aug 2013 | B2 |
| 8523076 | Good | Sep 2013 | B2 |
| 8528818 | Ehrhart et al. | Sep 2013 | B2 |
| 8544737 | Gomez et al. | Oct 2013 | B2 |
| 8548420 | Grunow et al. | Oct 2013 | B2 |
| 8550335 | Samek et al. | Oct 2013 | B2 |
| 8550354 | Gannon et al. | Oct 2013 | B2 |
| 8550357 | Kearney | Oct 2013 | B2 |
| 8556174 | Kosecki et al. | Oct 2013 | B2 |
| 8556176 | Van et al. | Oct 2013 | B2 |
| 8556177 | Hussey et al. | Oct 2013 | B2 |
| 8559767 | Barber et al. | Oct 2013 | B2 |
| 8561895 | Gomez et al. | Oct 2013 | B2 |
| 8561903 | Sauerwein, Jr. | Oct 2013 | B2 |
| 8561905 | Edmonds et al. | Oct 2013 | B2 |
| 8565107 | Pease et al. | Oct 2013 | B2 |
| 8571307 | Li et al. | Oct 2013 | B2 |
| 8579200 | Samek et al. | Nov 2013 | B2 |
| 8583924 | Caballero et al. | Nov 2013 | B2 |
| 8584945 | Wang et al. | Nov 2013 | B2 |
| 8587595 | Wang | Nov 2013 | B2 |
| 8587697 | Hussey et al. | Nov 2013 | B2 |
| 8588869 | Sauerwein et al. | Nov 2013 | B2 |
| 8590789 | Nahill et al. | Nov 2013 | B2 |
| 8596539 | Havens et al. | Dec 2013 | B2 |
| 8596542 | Havens et al. | Dec 2013 | B2 |
| 8596543 | Havens et al. | Dec 2013 | B2 |
| 8599271 | Havens et al. | Dec 2013 | B2 |
| 8599957 | Peake et al. | Dec 2013 | B2 |
| 8600158 | Li et al. | Dec 2013 | B2 |
| 8600167 | Showering | Dec 2013 | B2 |
| 8602309 | Longacre et al. | Dec 2013 | B2 |
| 8608053 | Meier et al. | Dec 2013 | B2 |
| 8608071 | Liu et al. | Dec 2013 | B2 |
| 8611309 | Wang et al. | Dec 2013 | B2 |
| 8615487 | Gomez et al. | Dec 2013 | B2 |
| 8621123 | Caballero | Dec 2013 | B2 |
| 8622303 | Meier et al. | Jan 2014 | B2 |
| 8628013 | Ding | Jan 2014 | B2 |
| 8628015 | Wang et al. | Jan 2014 | B2 |
| 8628016 | Winegar | Jan 2014 | B2 |
| 8629926 | Wang | Jan 2014 | B2 |
| 8630030 | Chung et al. | Jan 2014 | B2 |
| 8630491 | Longacre et al. | Jan 2014 | B2 |
| 8635309 | Berthiaume et al. | Jan 2014 | B2 |
| 8636200 | Kearney | Jan 2014 | B2 |
| 8636212 | Nahill et al. | Jan 2014 | B2 |
| 8636215 | Ding et al. | Jan 2014 | B2 |
| 8636224 | Wang | Jan 2014 | B2 |
| 8638806 | Wang et al. | Jan 2014 | B2 |
| 8640958 | Lu et al. | Feb 2014 | B2 |
| 8640960 | Wang et al. | Feb 2014 | B2 |
| 8643717 | Li et al. | Feb 2014 | B2 |
| 8646692 | Meier et al. | Feb 2014 | B2 |
| 8646694 | Wang et al. | Feb 2014 | B2 |
| 8657200 | Ren et al. | Feb 2014 | B2 |
| 8659397 | Vargo et al. | Feb 2014 | B2 |
| 8668149 | Good | Mar 2014 | B2 |
| 8675266 | Watts | Mar 2014 | B2 |
| 8678285 | Kearney | Mar 2014 | B2 |
| 8678286 | Smith et al. | Mar 2014 | B2 |
| 8682077 | Longacre, Jr. | Mar 2014 | B1 |
| D702237 | Oberpriller et al. | Apr 2014 | S |
| 8687282 | Feng et al. | Apr 2014 | B2 |
| 8692927 | Pease et al. | Apr 2014 | B2 |
| 8695880 | Bremer et al. | Apr 2014 | B2 |
| 8698949 | Grunow et al. | Apr 2014 | B2 |
| 8717494 | Gannon | May 2014 | B2 |
| 8720783 | Biss et al. | May 2014 | B2 |
| 8723804 | Fletcher et al. | May 2014 | B2 |
| 8723904 | Marty et al. | May 2014 | B2 |
| 8727223 | Wang | May 2014 | B2 |
| 8736914 | French | May 2014 | B2 |
| 8740082 | Wilz, Sr. | Jun 2014 | B2 |
| 8740085 | Furlong et al. | Jun 2014 | B2 |
| 8746563 | Hennick et al. | Jun 2014 | B2 |
| 8750445 | Peake et al. | Jun 2014 | B2 |
| 8752766 | Xian et al. | Jun 2014 | B2 |
| 8756059 | Braho et al. | Jun 2014 | B2 |
| 8757495 | Qu et al. | Jun 2014 | B2 |
| 8760563 | Koziol et al. | Jun 2014 | B2 |
| 8763909 | Reed et al. | Jul 2014 | B2 |
| 8768102 | Ng et al. | Jul 2014 | B1 |
| 8777108 | Coyle | Jul 2014 | B2 |
| 8777109 | Oberpriller et al. | Jul 2014 | B2 |
| 8779898 | Havens et al. | Jul 2014 | B2 |
| 8781520 | Payne et al. | Jul 2014 | B2 |
| 8783573 | Havens et al. | Jul 2014 | B2 |
| 8789757 | Barten | Jul 2014 | B2 |
| 8789758 | Hawley et al. | Jul 2014 | B2 |
| 8789759 | Xian et al. | Jul 2014 | B2 |
| 8794520 | Wang et al. | Aug 2014 | B2 |
| 8794522 | Ehrhart | Aug 2014 | B2 |
| 8794525 | Amundsen et al. | Aug 2014 | B2 |
| 8794526 | Wang et al. | Aug 2014 | B2 |
| 8798367 | Ellis | Aug 2014 | B2 |
| 8807431 | Wang et al. | Aug 2014 | B2 |
| 8807432 | Van et al. | Aug 2014 | B2 |
| 8817327 | Kamijima | Aug 2014 | B2 |
| 8820630 | Qu et al. | Sep 2014 | B2 |
| 8822848 | Meagher | Sep 2014 | B2 |
| 8824692 | Sheerin et al. | Sep 2014 | B2 |
| 8824696 | Braho | Sep 2014 | B2 |
| 8842849 | Wahl et al. | Sep 2014 | B2 |
| 8844822 | Kotlarsky et al. | Sep 2014 | B2 |
| 8844823 | Fritz et al. | Sep 2014 | B2 |
| 8849019 | Li et al. | Sep 2014 | B2 |
| D716285 | Chaney et al. | Oct 2014 | S |
| 8851383 | Yeakley et al. | Oct 2014 | B2 |
| 8854633 | Laffargue et al. | Oct 2014 | B2 |
| 8866963 | Grunow et al. | Oct 2014 | B2 |
| 8868421 | Braho et al. | Oct 2014 | B2 |
| 8868519 | Maloy et al. | Oct 2014 | B2 |
| 8868802 | Barten | Oct 2014 | B2 |
| 8868803 | Caballero | Oct 2014 | B2 |
| 8870074 | Gannon | Oct 2014 | B1 |
| 8879085 | Vandemark et al. | Nov 2014 | B2 |
| 8879639 | Sauerwein, Jr. | Nov 2014 | B2 |
| 8880426 | Smith | Nov 2014 | B2 |
| 8881983 | Havens et al. | Nov 2014 | B2 |
| 8881987 | Wang | Nov 2014 | B2 |
| 8903172 | Smith | Dec 2014 | B2 |
| 8908995 | Benos et al. | Dec 2014 | B2 |
| 8910870 | Li et al. | Dec 2014 | B2 |
| 8910875 | Ren et al. | Dec 2014 | B2 |
| 8914290 | Hendrickson et al. | Dec 2014 | B2 |
| 8914788 | Pettinelli et al. | Dec 2014 | B2 |
| 8915439 | Feng et al. | Dec 2014 | B2 |
| 8915444 | Havens et al. | Dec 2014 | B2 |
| 8916789 | Woodburn | Dec 2014 | B2 |
| 8918250 | Hollifield | Dec 2014 | B2 |
| 8918564 | Caballero | Dec 2014 | B2 |
| 8925818 | Kosecki et al. | Jan 2015 | B2 |
| 8939374 | Jovanovski et al. | Jan 2015 | B2 |
| 8942480 | Ellis | Jan 2015 | B2 |
| 8944313 | Williams et al. | Feb 2015 | B2 |
| 8944327 | Meier et al. | Feb 2015 | B2 |
| 8944332 | Harding et al. | Feb 2015 | B2 |
| 8950678 | Germaine et al. | Feb 2015 | B2 |
| D723560 | Zhou et al. | Mar 2015 | S |
| 8967468 | Gomez et al. | Mar 2015 | B2 |
| 8971346 | Sevier | Mar 2015 | B2 |
| 8976030 | Cunningham et al. | Mar 2015 | B2 |
| 8976368 | El et al. | Mar 2015 | B2 |
| 8978981 | Guan | Mar 2015 | B2 |
| 8978983 | Bremer et al. | Mar 2015 | B2 |
| 8978984 | Hennick et al. | Mar 2015 | B2 |
| 8985456 | Zhu et al. | Mar 2015 | B2 |
| 8985457 | Soule et al. | Mar 2015 | B2 |
| 8985459 | Kearney et al. | Mar 2015 | B2 |
| 8985461 | Gelay et al. | Mar 2015 | B2 |
| 8988578 | Showering | Mar 2015 | B2 |
| 8988590 | Gillet et al. | Mar 2015 | B2 |
| 8991704 | Hopper et al. | Mar 2015 | B2 |
| 8996194 | Davis et al. | Mar 2015 | B2 |
| 8996384 | Funyak et al. | Mar 2015 | B2 |
| 9002641 | Showering | Apr 2015 | B2 |
| 9007368 | Laffargue et al. | Apr 2015 | B2 |
| 9010641 | Qu et al. | Apr 2015 | B2 |
| 9015513 | Murawski et al. | Apr 2015 | B2 |
| 9016576 | Brady et al. | Apr 2015 | B2 |
| D730357 | Fitch et al. | May 2015 | S |
| 9022288 | Nahill et al. | May 2015 | B2 |
| 9030964 | Essinger et al. | May 2015 | B2 |
| 9033240 | Smith et al. | May 2015 | B2 |
| 9033242 | Gillet et al. | May 2015 | B2 |
| 9036037 | Rudin et al. | May 2015 | B1 |
| 9036054 | Koziol et al. | May 2015 | B2 |
| 9037344 | Chamberlin | May 2015 | B2 |
| 9038911 | Xian et al. | May 2015 | B2 |
| 9038915 | Smith | May 2015 | B2 |
| 9041762 | Bai et al. | May 2015 | B2 |
| D730901 | Oberpriller et al. | Jun 2015 | S |
| D730902 | Fitch et al. | Jun 2015 | S |
| D733112 | Chaney et al. | Jun 2015 | S |
| 9047098 | Barten | Jun 2015 | B2 |
| 9047359 | Caballero et al. | Jun 2015 | B2 |
| 9047420 | Caballero | Jun 2015 | B2 |
| 9047525 | Barber et al. | Jun 2015 | B2 |
| 9047531 | Showering et al. | Jun 2015 | B2 |
| 9053055 | Caballero | Jun 2015 | B2 |
| 9053378 | Hou et al. | Jun 2015 | B1 |
| 9053380 | Xian et al. | Jun 2015 | B2 |
| 9058526 | Powilleit | Jun 2015 | B2 |
| 9064165 | Havens et al. | Jun 2015 | B2 |
| 9064167 | Xian et al. | Jun 2015 | B2 |
| 9064168 | Todeschini et al. | Jun 2015 | B2 |
| 9064254 | Todeschini et al. | Jun 2015 | B2 |
| 9066032 | Wang | Jun 2015 | B2 |
| 9070032 | Corcoran | Jun 2015 | B2 |
| D734339 | Zhou et al. | Jul 2015 | S |
| D734751 | Oberpriller et al. | Jul 2015 | S |
| 9079423 | Bouverie et al. | Jul 2015 | B2 |
| 9093141 | Liu | Jul 2015 | B2 |
| 9104934 | Li et al. | Aug 2015 | B2 |
| 9111166 | Cunningham, IV | Aug 2015 | B2 |
| 9137009 | Gardiner | Sep 2015 | B1 |
| 9158000 | Sauerwein, Jr. | Oct 2015 | B2 |
| 9158340 | Reed et al. | Oct 2015 | B2 |
| 9158953 | Gillet et al. | Oct 2015 | B2 |
| 9159059 | Daddabbo et al. | Oct 2015 | B2 |
| 9171539 | Funyak et al. | Oct 2015 | B2 |
| 9171543 | Emerick et al. | Oct 2015 | B2 |
| 9174457 | Aihara et al. | Nov 2015 | B1 |
| 9183425 | Wang | Nov 2015 | B2 |
| 9189669 | Zhu et al. | Nov 2015 | B2 |
| 9219836 | Bouverie et al. | Dec 2015 | B2 |
| 9224022 | Ackley et al. | Dec 2015 | B2 |
| 9224027 | Van et al. | Dec 2015 | B2 |
| D747321 | London et al. | Jan 2016 | S |
| 9230140 | Ackley | Jan 2016 | B1 |
| 9245492 | Ackley et al. | Jan 2016 | B2 |
| 9248640 | Heng | Feb 2016 | B2 |
| 9250712 | Todeschini | Feb 2016 | B1 |
| 9258033 | Showering | Feb 2016 | B2 |
| 9261398 | Amundsen et al. | Feb 2016 | B2 |
| 9262633 | Todeschini et al. | Feb 2016 | B1 |
| 9262662 | Chen et al. | Feb 2016 | B2 |
| 9262664 | Soule et al. | Feb 2016 | B2 |
| 9269036 | Bremer | Feb 2016 | B2 |
| 9270782 | Hala et al. | Feb 2016 | B2 |
| 9274806 | Barten | Mar 2016 | B2 |
| 9274812 | Doren et al. | Mar 2016 | B2 |
| 9275388 | Havens et al. | Mar 2016 | B2 |
| 9277668 | Feng et al. | Mar 2016 | B2 |
| 9280693 | Feng et al. | Mar 2016 | B2 |
| 9282501 | Wang et al. | Mar 2016 | B2 |
| 9292969 | Laffargue et al. | Mar 2016 | B2 |
| 9298667 | Caballero | Mar 2016 | B2 |
| 9298964 | Li et al. | Mar 2016 | B2 |
| 9301427 | Feng et al. | Mar 2016 | B2 |
| D754205 | Nguyen et al. | Apr 2016 | S |
| D754206 | Nguyen et al. | Apr 2016 | S |
| 9310609 | Rueblinger et al. | Apr 2016 | B2 |
| 9317037 | Byford et al. | Apr 2016 | B2 |
| 9319548 | Showering et al. | Apr 2016 | B2 |
| D757009 | Oberpriller et al. | May 2016 | S |
| 9342724 | McCloskey et al. | May 2016 | B2 |
| 9342827 | Smith | May 2016 | B2 |
| 9355294 | Smith et al. | May 2016 | B2 |
| 9361536 | Howe et al. | Jun 2016 | B1 |
| 9361882 | Ressler et al. | Jun 2016 | B2 |
| 9365381 | Colonel et al. | Jun 2016 | B2 |
| 9367722 | Xian et al. | Jun 2016 | B2 |
| 9373018 | Colavito et al. | Jun 2016 | B2 |
| 9375945 | Bowles | Jun 2016 | B1 |
| D760719 | Zhou et al. | Jul 2016 | S |
| 9390596 | Todeschini | Jul 2016 | B1 |
| 9396375 | Qu et al. | Jul 2016 | B2 |
| 9398008 | Todeschini et al. | Jul 2016 | B2 |
| D762604 | Fitch et al. | Aug 2016 | S |
| D762647 | Fitch et al. | Aug 2016 | S |
| 9405011 | Showering | Aug 2016 | B2 |
| 9407840 | Wang | Aug 2016 | B2 |
| 9411386 | Sauerwein, Jr. | Aug 2016 | B2 |
| 9412242 | Van et al. | Aug 2016 | B2 |
| 9418252 | Nahill et al. | Aug 2016 | B2 |
| 9418269 | Havens et al. | Aug 2016 | B2 |
| 9418270 | Van Volkinburg et al. | Aug 2016 | B2 |
| 9423318 | Liu et al. | Aug 2016 | B2 |
| D766244 | Zhou et al. | Sep 2016 | S |
| 9443123 | Hejl | Sep 2016 | B2 |
| 9443222 | Singel et al. | Sep 2016 | B2 |
| 9448610 | Davis et al. | Sep 2016 | B2 |
| 9454689 | McCloskey et al. | Sep 2016 | B2 |
| 9478113 | Xie et al. | Oct 2016 | B2 |
| D771631 | Fitch et al. | Nov 2016 | S |
| 9481186 | Bouverie et al. | Nov 2016 | B2 |
| 9487113 | Schukalski | Nov 2016 | B2 |
| 9488986 | Solanki | Nov 2016 | B1 |
| 9489782 | Payne et al. | Nov 2016 | B2 |
| 9490540 | Davies et al. | Nov 2016 | B1 |
| 9491729 | Rautiola et al. | Nov 2016 | B2 |
| 9497092 | Gomez et al. | Nov 2016 | B2 |
| 9507974 | Todeschini | Nov 2016 | B1 |
| 9519814 | Cudzilo | Dec 2016 | B2 |
| 9521331 | Bessettes et al. | Dec 2016 | B2 |
| D777166 | Bidwell et al. | Jan 2017 | S |
| 9557166 | Thuries et al. | Jan 2017 | B2 |
| 9558386 | Yeakley | Jan 2017 | B2 |
| 9564035 | Ackley et al. | Feb 2017 | B2 |
| 9569837 | Madden et al. | Feb 2017 | B2 |
| 9582696 | Barber et al. | Feb 2017 | B2 |
| 9606581 | Howe et al. | Mar 2017 | B1 |
| D783601 | Schulte et al. | Apr 2017 | S |
| 9616749 | Chamberlin | Apr 2017 | B2 |
| 9618993 | Murawski et al. | Apr 2017 | B2 |
| D785617 | Bidwell et al. | May 2017 | S |
| D785636 | Oberpriller et al. | May 2017 | S |
| 9641700 | Schumann et al. | May 2017 | B2 |
| 9646189 | Lu et al. | May 2017 | B2 |
| 9646200 | Archibald et al. | May 2017 | B2 |
| 9652648 | Ackley et al. | May 2017 | B2 |
| 9652653 | Todeschini et al. | May 2017 | B2 |
| 9656487 | Ho et al. | May 2017 | B2 |
| 9659183 | Zhu et al. | May 2017 | B2 |
| 9659198 | Giordano et al. | May 2017 | B2 |
| 9659670 | Choi et al. | May 2017 | B2 |
| 9665757 | Feng et al. | May 2017 | B2 |
| D790505 | Vargo et al. | Jun 2017 | S |
| D790546 | Zhou et al. | Jun 2017 | S |
| D790553 | Fitch et al. | Jun 2017 | S |
| 9680282 | Hanenburg | Jun 2017 | B2 |
| 9697401 | Feng et al. | Jul 2017 | B2 |
| 9701140 | Alaganchetty et al. | Jul 2017 | B1 |
| 9712758 | Noda | Jul 2017 | B2 |
| 9715614 | Todeschini et al. | Jul 2017 | B2 |
| 9734493 | Gomez et al. | Aug 2017 | B2 |
| 9752864 | Laffargue et al. | Sep 2017 | B2 |
| 9762793 | Ackley et al. | Sep 2017 | B2 |
| 9767581 | Todeschini | Sep 2017 | B2 |
| 9786101 | Ackley | Oct 2017 | B2 |
| 9794392 | Hejl | Oct 2017 | B2 |
| 9823059 | Li et al. | Nov 2017 | B2 |
| 9826106 | Ackley | Nov 2017 | B2 |
| 9852102 | Kohtz et al. | Dec 2017 | B2 |
| 9857167 | Jovanovski et al. | Jan 2018 | B2 |
| 9861182 | Oberpriller et al. | Jan 2018 | B2 |
| 9891612 | Charpentier et al. | Feb 2018 | B2 |
| 9892876 | Bandringa | Feb 2018 | B2 |
| 9897434 | Ackley et al. | Feb 2018 | B2 |
| 9898814 | Kitai et al. | Feb 2018 | B2 |
| 9924006 | Schoon et al. | Mar 2018 | B2 |
| 9930050 | Yeakley et al. | Mar 2018 | B2 |
| 9954871 | Hussey et al. | Apr 2018 | B2 |
| 9978088 | Pape | May 2018 | B2 |
| 9984685 | Braho et al. | May 2018 | B2 |
| 10007112 | Fitch et al. | Jun 2018 | B2 |
| 10019334 | Caballero et al. | Jul 2018 | B2 |
| 10021043 | Sevier | Jul 2018 | B2 |
| 10038716 | Todeschini et al. | Jul 2018 | B2 |
| 10060729 | Laffargue et al. | Aug 2018 | B2 |
| 10066982 | Ackley et al. | Sep 2018 | B2 |
| 10121466 | Pecorari | Nov 2018 | B2 |
| 10139495 | Payne | Nov 2018 | B2 |
| 10195880 | D'Armancourt | Feb 2019 | B2 |
| 10269342 | Braho et al. | Apr 2019 | B2 |
| 10427424 | Creencia et al. | Oct 2019 | B2 |
| 10546160 | Sprague et al. | Jan 2020 | B2 |
| 10552848 | Soborski | Feb 2020 | B2 |
| 10621470 | Ackley | Apr 2020 | B2 |
| 10628723 | D'Armancourt et al. | Apr 2020 | B2 |
| 10672588 | Pathangi et al. | Jun 2020 | B1 |
| 10795618 | Gutierrez et al. | Oct 2020 | B2 |
| 10834283 | D'Armancourt et al. | Nov 2020 | B2 |
| 10999460 | D'Armancourt et al. | May 2021 | B2 |
| 11157217 | Gutierrez et al. | Oct 2021 | B2 |
| 11210483 | Ackley et al. | Dec 2021 | B2 |
| 20010016054 | Banker et al. | Aug 2001 | A1 |
| 20010035971 | Koakutsu et al. | Nov 2001 | A1 |
| 20020067925 | Yamano | Jun 2002 | A1 |
| 20020181805 | Loeb et al. | Dec 2002 | A1 |
| 20030102376 | Meier et al. | Jun 2003 | A1 |
| 20040029068 | Sachdeva et al. | Feb 2004 | A1 |
| 20040033098 | Chiu | Feb 2004 | A1 |
| 20040036089 | Chen | Feb 2004 | A1 |
| 20040057768 | Oshino et al. | Mar 2004 | A1 |
| 20040120569 | Hung et al. | Jun 2004 | A1 |
| 20040156630 | Tsukamoto et al. | Aug 2004 | A1 |
| 20050105104 | Sakai et al. | May 2005 | A1 |
| 20060012664 | Jeong | Jan 2006 | A1 |
| 20060039690 | Steinberg et al. | Feb 2006 | A1 |
| 20060110024 | Wakabayashi | May 2006 | A1 |
| 20060197795 | Takatsuka et al. | Sep 2006 | A1 |
| 20060269342 | Yoshida et al. | Nov 2006 | A1 |
| 20070139703 | Shimamura et al. | Jun 2007 | A1 |
| 20070146755 | Mindler et al. | Jun 2007 | A1 |
| 20070195337 | Takayama et al. | Aug 2007 | A1 |
| 20080144080 | Randt | Jun 2008 | A1 |
| 20080185432 | Caballero et al. | Aug 2008 | A1 |
| 20080218551 | Inaba | Sep 2008 | A1 |
| 20090002749 | Koyano | Jan 2009 | A1 |
| 20090058348 | Ryu | Mar 2009 | A1 |
| 20090085952 | Yamazaki | Apr 2009 | A1 |
| 20090087022 | Fukuda et al. | Apr 2009 | A1 |
| 20090134221 | Zhu et al. | May 2009 | A1 |
| 20090316161 | Yamaguchi et al. | Dec 2009 | A1 |
| 20100165022 | Makuta et al. | Jul 2010 | A1 |
| 20100177076 | Essinger et al. | Jul 2010 | A1 |
| 20100177080 | Essinger et al. | Jul 2010 | A1 |
| 20100177707 | Essinger et al. | Jul 2010 | A1 |
| 20100177749 | Essinger et al. | Jul 2010 | A1 |
| 20100182618 | Akiyama et al. | Jul 2010 | A1 |
| 20100188714 | Yamakawa | Jul 2010 | A1 |
| 20100265880 | Rautiola et al. | Oct 2010 | A1 |
| 20110102850 | Watanabe | May 2011 | A1 |
| 20110109918 | Conlon et al. | May 2011 | A1 |
| 20110202554 | Powilleit et al. | Aug 2011 | A1 |
| 20110286043 | Hagisawa et al. | Nov 2011 | A1 |
| 20110292435 | Cok et al. | Dec 2011 | A1 |
| 20120039384 | Reznik | Feb 2012 | A1 |
| 20120085823 | Nakamura | Apr 2012 | A1 |
| 20120111946 | Golant | May 2012 | A1 |
| 20120168511 | Kotlarsky et al. | Jul 2012 | A1 |
| 20120168512 | Kotlarsky et al. | Jul 2012 | A1 |
| 20120182374 | Matsuda et al. | Jul 2012 | A1 |
| 20120182571 | Wu et al. | Jul 2012 | A1 |
| 20120193423 | Samek | Aug 2012 | A1 |
| 20120203647 | Smith | Aug 2012 | A1 |
| 20120223141 | Good et al. | Sep 2012 | A1 |
| 20120228382 | Havens et al. | Sep 2012 | A1 |
| 20120248188 | Kearney | Oct 2012 | A1 |
| 20120263483 | Suzuki | Oct 2012 | A1 |
| 20120330447 | Gerlach et al. | Dec 2012 | A1 |
| 20130038670 | Chen | Feb 2013 | A1 |
| 20130043312 | Van Horn | Feb 2013 | A1 |
| 20130082104 | Kearney et al. | Apr 2013 | A1 |
| 20130148987 | Arakawa | Jun 2013 | A1 |
| 20130153661 | Yamaguchi | Jun 2013 | A1 |
| 20130175341 | Kearney et al. | Jul 2013 | A1 |
| 20130175343 | Good | Jul 2013 | A1 |
| 20130250369 | Kitai et al. | Sep 2013 | A1 |
| 20130250370 | Kojima et al. | Sep 2013 | A1 |
| 20130257744 | Daghigh et al. | Oct 2013 | A1 |
| 20130257759 | Daghigh | Oct 2013 | A1 |
| 20130258368 | Shigemoto et al. | Oct 2013 | A1 |
| 20130259301 | Chen et al. | Oct 2013 | A1 |
| 20130270346 | Xian et al. | Oct 2013 | A1 |
| 20130287258 | Kearney | Oct 2013 | A1 |
| 20130292475 | Kotlarsky et al. | Nov 2013 | A1 |
| 20130292477 | Hennick et al. | Nov 2013 | A1 |
| 20130293539 | Hunt et al. | Nov 2013 | A1 |
| 20130293540 | Laffargue et al. | Nov 2013 | A1 |
| 20130306728 | Thuries et al. | Nov 2013 | A1 |
| 20130306731 | Pedrao | Nov 2013 | A1 |
| 20130307964 | Bremer et al. | Nov 2013 | A1 |
| 20130308625 | Park et al. | Nov 2013 | A1 |
| 20130313324 | Koziol et al. | Nov 2013 | A1 |
| 20130313325 | Wilz et al. | Nov 2013 | A1 |
| 20130322701 | Szymanski | Dec 2013 | A1 |
| 20130332996 | Fiala et al. | Dec 2013 | A1 |
| 20130335759 | Hirose | Dec 2013 | A1 |
| 20130342717 | Havens et al. | Dec 2013 | A1 |
| 20140001267 | Giordano et al. | Jan 2014 | A1 |
| 20140002842 | Ito | Jan 2014 | A1 |
| 20140008439 | Wang | Jan 2014 | A1 |
| 20140009529 | Teshigawara et al. | Jan 2014 | A1 |
| 20140025584 | Liu et al. | Jan 2014 | A1 |
| 20140034734 | Sauerwein, Jr. | Feb 2014 | A1 |
| 20140036848 | Pease et al. | Feb 2014 | A1 |
| 20140039693 | Havens et al. | Feb 2014 | A1 |
| 20140042814 | Kather et al. | Feb 2014 | A1 |
| 20140049120 | Kohtz et al. | Feb 2014 | A1 |
| 20140049635 | Laffargue et al. | Feb 2014 | A1 |
| 20140061306 | Wu et al. | Mar 2014 | A1 |
| 20140063289 | Hussey et al. | Mar 2014 | A1 |
| 20140066136 | Sauerwein et al. | Mar 2014 | A1 |
| 20140067692 | Ye et al. | Mar 2014 | A1 |
| 20140070005 | Nahill et al. | Mar 2014 | A1 |
| 20140071840 | Venancio | Mar 2014 | A1 |
| 20140074746 | Wang | Mar 2014 | A1 |
| 20140076974 | Havens et al. | Mar 2014 | A1 |
| 20140078341 | Havens et al. | Mar 2014 | A1 |
| 20140078345 | Showering | Mar 2014 | A1 |
| 20140079292 | Kaneko et al. | Mar 2014 | A1 |
| 20140097249 | Gomez et al. | Apr 2014 | A1 |
| 20140098792 | Wang et al. | Apr 2014 | A1 |
| 20140100813 | Showering | Apr 2014 | A1 |
| 20140103115 | Meier et al. | Apr 2014 | A1 |
| 20140104413 | McCloskey et al. | Apr 2014 | A1 |
| 20140104414 | McCloskey et al. | Apr 2014 | A1 |
| 20140104416 | Giordano et al. | Apr 2014 | A1 |
| 20140104451 | Todeschini et al. | Apr 2014 | A1 |
| 20140106594 | Skvoretz | Apr 2014 | A1 |
| 20140106725 | Sauerwein, Jr. | Apr 2014 | A1 |
| 20140108010 | Maltseff et al. | Apr 2014 | A1 |
| 20140108402 | Gomez et al. | Apr 2014 | A1 |
| 20140110485 | Toa et al. | Apr 2014 | A1 |
| 20140114530 | Fitch et al. | Apr 2014 | A1 |
| 20140124577 | Wang et al. | May 2014 | A1 |
| 20140124579 | Ding | May 2014 | A1 |
| 20140125842 | Winegar | May 2014 | A1 |
| 20140125853 | Wang | May 2014 | A1 |
| 20140125999 | Longacre et al. | May 2014 | A1 |
| 20140129378 | Richardson | May 2014 | A1 |
| 20140131438 | Kearney | May 2014 | A1 |
| 20140131441 | Nahill et al. | May 2014 | A1 |
| 20140131443 | Smith | May 2014 | A1 |
| 20140131444 | Wang | May 2014 | A1 |
| 20140131445 | Ding et al. | May 2014 | A1 |
| 20140131448 | Xian et al. | May 2014 | A1 |
| 20140133379 | Wang et al. | May 2014 | A1 |
| 20140136208 | Maltseff et al. | May 2014 | A1 |
| 20140140585 | Wang | May 2014 | A1 |
| 20140151453 | Meier et al. | Jun 2014 | A1 |
| 20140152882 | Samek et al. | Jun 2014 | A1 |
| 20140158770 | Sevier et al. | Jun 2014 | A1 |
| 20140159869 | Zumsteg et al. | Jun 2014 | A1 |
| 20140166755 | Liu et al. | Jun 2014 | A1 |
| 20140166759 | Liu et al. | Jun 2014 | A1 |
| 20140168709 | Tokumaru | Jun 2014 | A1 |
| 20140168787 | Wang et al. | Jun 2014 | A1 |
| 20140175165 | Havens et al. | Jun 2014 | A1 |
| 20140175172 | Jovanovski et al. | Jun 2014 | A1 |
| 20140191644 | Chaney | Jul 2014 | A1 |
| 20140191684 | Valois | Jul 2014 | A1 |
| 20140191913 | Ge et al. | Jul 2014 | A1 |
| 20140197238 | Liu et al. | Jul 2014 | A1 |
| 20140197239 | Havens et al. | Jul 2014 | A1 |
| 20140197304 | Feng et al. | Jul 2014 | A1 |
| 20140214631 | Hansen | Jul 2014 | A1 |
| 20140217166 | Berthiaume et al. | Aug 2014 | A1 |
| 20140217180 | Liu | Aug 2014 | A1 |
| 20140231500 | Ehrhart et al. | Aug 2014 | A1 |
| 20140232930 | Anderson | Aug 2014 | A1 |
| 20140247315 | Marty et al. | Sep 2014 | A1 |
| 20140263493 | Amurgis et al. | Sep 2014 | A1 |
| 20140263645 | Smith et al. | Sep 2014 | A1 |
| 20140267609 | Laffargue | Sep 2014 | A1 |
| 20140270196 | Braho et al. | Sep 2014 | A1 |
| 20140270229 | Braho | Sep 2014 | A1 |
| 20140278387 | Digregorio | Sep 2014 | A1 |
| 20140278391 | Braho et al. | Sep 2014 | A1 |
| 20140282210 | Bianconi | Sep 2014 | A1 |
| 20140284384 | Lu et al. | Sep 2014 | A1 |
| 20140288933 | Braho et al. | Sep 2014 | A1 |
| 20140291401 | Nakamura | Oct 2014 | A1 |
| 20140297058 | Barker et al. | Oct 2014 | A1 |
| 20140299665 | Barber et al. | Oct 2014 | A1 |
| 20140312121 | Lu et al. | Oct 2014 | A1 |
| 20140319220 | Coyle | Oct 2014 | A1 |
| 20140319221 | Oberpriller et al. | Oct 2014 | A1 |
| 20140326787 | Barten | Nov 2014 | A1 |
| 20140332590 | Wang et al. | Nov 2014 | A1 |
| 20140344943 | Todeschini et al. | Nov 2014 | A1 |
| 20140346233 | Liu et al. | Nov 2014 | A1 |
| 20140351317 | Smith et al. | Nov 2014 | A1 |
| 20140353373 | Van et al. | Dec 2014 | A1 |
| 20140361073 | Qu et al. | Dec 2014 | A1 |
| 20140361082 | Xian et al. | Dec 2014 | A1 |
| 20140362184 | Jovanovski et al. | Dec 2014 | A1 |
| 20140363015 | Braho | Dec 2014 | A1 |
| 20140369511 | Sheerin et al. | Dec 2014 | A1 |
| 20140374483 | Lu | Dec 2014 | A1 |
| 20140374485 | Xian et al. | Dec 2014 | A1 |
| 20150001301 | Ouyang | Jan 2015 | A1 |
| 20150001304 | Todeschini | Jan 2015 | A1 |
| 20150003673 | Fletcher | Jan 2015 | A1 |
| 20150009338 | Laffargue et al. | Jan 2015 | A1 |
| 20150009610 | London et al. | Jan 2015 | A1 |
| 20150014416 | Kotlarsky et al. | Jan 2015 | A1 |
| 20150021397 | Rueblinger et al. | Jan 2015 | A1 |
| 20150028102 | Ren et al. | Jan 2015 | A1 |
| 20150028103 | Jiang | Jan 2015 | A1 |
| 20150028104 | Ma et al. | Jan 2015 | A1 |
| 20150029002 | Yeakley et al. | Jan 2015 | A1 |
| 20150032709 | Maloy et al. | Jan 2015 | A1 |
| 20150039309 | Braho et al. | Feb 2015 | A1 |
| 20150039878 | Barten | Feb 2015 | A1 |
| 20150040378 | Saber et al. | Feb 2015 | A1 |
| 20150048168 | Fritz et al. | Feb 2015 | A1 |
| 20150049347 | Laffargue et al. | Feb 2015 | A1 |
| 20150051992 | Smith | Feb 2015 | A1 |
| 20150053766 | Havens et al. | Feb 2015 | A1 |
| 20150053768 | Wang et al. | Feb 2015 | A1 |
| 20150053769 | Thuries et al. | Feb 2015 | A1 |
| 20150060544 | Feng et al. | Mar 2015 | A1 |
| 20150062366 | Liu et al. | Mar 2015 | A1 |
| 20150063215 | Wang | Mar 2015 | A1 |
| 20150063676 | Lloyd et al. | Mar 2015 | A1 |
| 20150063889 | Kojima | Mar 2015 | A1 |
| 20150069130 | Gannon | Mar 2015 | A1 |
| 20150071819 | Todeschini | Mar 2015 | A1 |
| 20150078627 | Fukase | Mar 2015 | A1 |
| 20150083800 | Li et al. | Mar 2015 | A1 |
| 20150086114 | Todeschini | Mar 2015 | A1 |
| 20150088522 | Hendrickson et al. | Mar 2015 | A1 |
| 20150096872 | Woodburn | Apr 2015 | A1 |
| 20150099557 | Pettinelli et al. | Apr 2015 | A1 |
| 20150100196 | Hollifield | Apr 2015 | A1 |
| 20150102109 | Huck | Apr 2015 | A1 |
| 20150115035 | Meier et al. | Apr 2015 | A1 |
| 20150127791 | Kosecki et al. | May 2015 | A1 |
| 20150128116 | Chen et al. | May 2015 | A1 |
| 20150129659 | Feng et al. | May 2015 | A1 |
| 20150133047 | Smith et al. | May 2015 | A1 |
| 20150134470 | Hejl et al. | May 2015 | A1 |
| 20150136851 | Harding et al. | May 2015 | A1 |
| 20150136854 | Lu et al. | May 2015 | A1 |
| 20150142492 | Kumar | May 2015 | A1 |
| 20150144692 | Hejl | May 2015 | A1 |
| 20150144698 | Teng et al. | May 2015 | A1 |
| 20150144701 | Xian et al. | May 2015 | A1 |
| 20150149946 | Benos et al. | May 2015 | A1 |
| 20150161429 | Tao | Jun 2015 | A1 |
| 20150169925 | Chen et al. | Jun 2015 | A1 |
| 20150169929 | Williams et al. | Jun 2015 | A1 |
| 20150178523 | Gelay et al. | Jun 2015 | A1 |
| 20150178534 | Jovanovski et al. | Jun 2015 | A1 |
| 20150178535 | Bremer et al. | Jun 2015 | A1 |
| 20150178536 | Hennick et al. | Jun 2015 | A1 |
| 20150178537 | El et al. | Jun 2015 | A1 |
| 20150181093 | Zhu et al. | Jun 2015 | A1 |
| 20150181109 | Gillet et al. | Jun 2015 | A1 |
| 20150193644 | Kearney et al. | Jul 2015 | A1 |
| 20150220753 | Zhu et al. | Aug 2015 | A1 |
| 20150221077 | Kawabata et al. | Aug 2015 | A1 |
| 20150281019 | Hashizume | Oct 2015 | A1 |
| 20150312780 | Wang et al. | Oct 2015 | A1 |
| 20150324623 | Powilleit | Nov 2015 | A1 |
| 20150327012 | Bian et al. | Nov 2015 | A1 |
| 20160025697 | Alt et al. | Jan 2016 | A1 |
| 20160042241 | Todeschini | Feb 2016 | A1 |
| 20160057230 | Todeschini et al. | Feb 2016 | A1 |
| 20160062473 | Bouchat et al. | Mar 2016 | A1 |
| 20160092805 | Geisler et al. | Mar 2016 | A1 |
| 20160101936 | Chamberlin | Apr 2016 | A1 |
| 20160104019 | Todeschini et al. | Apr 2016 | A1 |
| 20160104274 | Jovanovski et al. | Apr 2016 | A1 |
| 20160117627 | Raj et al. | Apr 2016 | A1 |
| 20160125217 | Todeschini | May 2016 | A1 |
| 20160125342 | Miller et al. | May 2016 | A1 |
| 20160171597 | Todeschini | Jun 2016 | A1 |
| 20160171666 | McCloskey | Jun 2016 | A1 |
| 20160171775 | Todeschini et al. | Jun 2016 | A1 |
| 20160171777 | Todeschini et al. | Jun 2016 | A1 |
| 20160174674 | Oberpriller et al. | Jun 2016 | A1 |
| 20160178479 | Goldsmith | Jun 2016 | A1 |
| 20160178685 | Young et al. | Jun 2016 | A1 |
| 20160178707 | Young et al. | Jun 2016 | A1 |
| 20160179132 | Harr | Jun 2016 | A1 |
| 20160179143 | Bidwell et al. | Jun 2016 | A1 |
| 20160179368 | Roeder | Jun 2016 | A1 |
| 20160179378 | Kent et al. | Jun 2016 | A1 |
| 20160180130 | Bremer | Jun 2016 | A1 |
| 20160180133 | Oberpriller et al. | Jun 2016 | A1 |
| 20160180136 | Meier et al. | Jun 2016 | A1 |
| 20160180594 | Todeschini | Jun 2016 | A1 |
| 20160180663 | McMahan et al. | Jun 2016 | A1 |
| 20160180713 | Bernhardt et al. | Jun 2016 | A1 |
| 20160185136 | Ng et al. | Jun 2016 | A1 |
| 20160185291 | Chamberlin | Jun 2016 | A1 |
| 20160186926 | Oberpriller et al. | Jun 2016 | A1 |
| 20160188861 | Todeschini | Jun 2016 | A1 |
| 20160188939 | Sailors et al. | Jun 2016 | A1 |
| 20160188940 | Lu et al. | Jun 2016 | A1 |
| 20160188941 | Todeschini et al. | Jun 2016 | A1 |
| 20160188942 | Good et al. | Jun 2016 | A1 |
| 20160188943 | Franz | Jun 2016 | A1 |
| 20160188944 | Wilz, Sr. et al. | Jun 2016 | A1 |
| 20160189076 | Mellott et al. | Jun 2016 | A1 |
| 20160189087 | Morton et al. | Jun 2016 | A1 |
| 20160189088 | Pecorari et al. | Jun 2016 | A1 |
| 20160189092 | George et al. | Jun 2016 | A1 |
| 20160189284 | Mellott et al. | Jun 2016 | A1 |
| 20160189288 | Todeschini et al. | Jun 2016 | A1 |
| 20160189366 | Chamberlin et al. | Jun 2016 | A1 |
| 20160189443 | Smith | Jun 2016 | A1 |
| 20160189447 | Valenzuela | Jun 2016 | A1 |
| 20160189489 | Au et al. | Jun 2016 | A1 |
| 20160192051 | Dipiazza et al. | Jun 2016 | A1 |
| 20160202951 | Pike et al. | Jul 2016 | A1 |
| 20160202958 | Zabel et al. | Jul 2016 | A1 |
| 20160202959 | Doubleday et al. | Jul 2016 | A1 |
| 20160203021 | Pike et al. | Jul 2016 | A1 |
| 20160203429 | Mellott et al. | Jul 2016 | A1 |
| 20160203797 | Pike et al. | Jul 2016 | A1 |
| 20160203820 | Zabel et al. | Jul 2016 | A1 |
| 20160204623 | Haggerty et al. | Jul 2016 | A1 |
| 20160204636 | Allen et al. | Jul 2016 | A1 |
| 20160204638 | Miraglia et al. | Jul 2016 | A1 |
| 20160255241 | Harashima et al. | Sep 2016 | A1 |
| 20160282807 | Kinoshita et al. | Sep 2016 | A1 |
| 20160292477 | Bidwell | Oct 2016 | A1 |
| 20160314276 | Wilz et al. | Oct 2016 | A1 |
| 20160314294 | Kubler et al. | Oct 2016 | A1 |
| 20160316190 | McCloskey et al. | Oct 2016 | A1 |
| 20160327614 | Young et al. | Nov 2016 | A1 |
| 20160343163 | Venkatesha et al. | Nov 2016 | A1 |
| 20160364914 | Todeschini | Dec 2016 | A1 |
| 20160373847 | Vargo et al. | Dec 2016 | A1 |
| 20160377414 | Thuries et al. | Dec 2016 | A1 |
| 20170010141 | Ackley | Jan 2017 | A1 |
| 20170010328 | Mullen et al. | Jan 2017 | A1 |
| 20170010780 | Waldron, Jr. et al. | Jan 2017 | A1 |
| 20170016714 | Laffargue et al. | Jan 2017 | A1 |
| 20170018094 | Todeschini | Jan 2017 | A1 |
| 20170046603 | Lee et al. | Feb 2017 | A1 |
| 20170047864 | Stang et al. | Feb 2017 | A1 |
| 20170053146 | Liu et al. | Feb 2017 | A1 |
| 20170053147 | Germaine et al. | Feb 2017 | A1 |
| 20170053647 | Nichols et al. | Feb 2017 | A1 |
| 20170055606 | Xu et al. | Mar 2017 | A1 |
| 20170060316 | Larson | Mar 2017 | A1 |
| 20170060494 | Palmen et al. | Mar 2017 | A1 |
| 20170061961 | Nichols et al. | Mar 2017 | A1 |
| 20170064634 | Van Horn et al. | Mar 2017 | A1 |
| 20170083730 | Feng et al. | Mar 2017 | A1 |
| 20170083734 | Henning et al. | Mar 2017 | A1 |
| 20170091502 | Furlong et al. | Mar 2017 | A1 |
| 20170091706 | Lloyd et al. | Mar 2017 | A1 |
| 20170091741 | Todeschini | Mar 2017 | A1 |
| 20170091904 | Ventress, Jr. | Mar 2017 | A1 |
| 20170092908 | Chaney | Mar 2017 | A1 |
| 20170094238 | Germaine et al. | Mar 2017 | A1 |
| 20170098947 | Wolski | Apr 2017 | A1 |
| 20170100949 | Celinder et al. | Apr 2017 | A1 |
| 20170108838 | Todeschini et al. | Apr 2017 | A1 |
| 20170108895 | Chamberlin et al. | Apr 2017 | A1 |
| 20170111523 | Ackley | Apr 2017 | A1 |
| 20170118355 | Wong et al. | Apr 2017 | A1 |
| 20170123598 | Phan et al. | May 2017 | A1 |
| 20170124369 | Rueblinger et al. | May 2017 | A1 |
| 20170124396 | Todeschini et al. | May 2017 | A1 |
| 20170124687 | McCloskey et al. | May 2017 | A1 |
| 20170126873 | McGary et al. | May 2017 | A1 |
| 20170126904 | D'Armancourt et al. | May 2017 | A1 |
| 20170139012 | Smith | May 2017 | A1 |
| 20170140329 | Bernhardt et al. | May 2017 | A1 |
| 20170140731 | Smith | May 2017 | A1 |
| 20170147847 | Berggren et al. | May 2017 | A1 |
| 20170150124 | Thuries | May 2017 | A1 |
| 20170169198 | Nichols | Jun 2017 | A1 |
| 20170171035 | Lu et al. | Jun 2017 | A1 |
| 20170171703 | Maheswaranathan | Jun 2017 | A1 |
| 20170171803 | Maheswaranathan | Jun 2017 | A1 |
| 20170180359 | Wolski et al. | Jun 2017 | A1 |
| 20170180577 | Nguon et al. | Jun 2017 | A1 |
| 20170181299 | Shi et al. | Jun 2017 | A1 |
| 20170182819 | Gonzalez et al. | Jun 2017 | A1 |
| 20170190192 | Delario et al. | Jul 2017 | A1 |
| 20170193432 | Bernhardt | Jul 2017 | A1 |
| 20170193461 | Celinder et al. | Jul 2017 | A1 |
| 20170193727 | Van Horn et al. | Jul 2017 | A1 |
| 20170199266 | Rice et al. | Jul 2017 | A1 |
| 20170200108 | Au et al. | Jul 2017 | A1 |
| 20170200275 | McCloskey et al. | Jul 2017 | A1 |
| 20170206643 | Weiss et al. | Jul 2017 | A1 |
| 20170309011 | Hori et al. | Oct 2017 | A1 |
| 20180007215 | Zakharov | Jan 2018 | A1 |
| 20180131815 | Spivakovsky et al. | May 2018 | A1 |
| 20180198937 | Yoshizawa | Jul 2018 | A1 |
| 20180227463 | Fukase | Aug 2018 | A1 |
| 20180268534 | Kaneko | Sep 2018 | A1 |
| 20190116275 | Edwards et al. | Apr 2019 | A1 |
| 20190213369 | Ackley et al. | Jul 2019 | A1 |
| 20190215410 | D'Armancourt et al. | Jul 2019 | A1 |
| 20200082131 | Ackley | Mar 2020 | A1 |
| 20200145546 | Alaganchetty et al. | May 2020 | A1 |
| 20200234422 | Esumi | Jul 2020 | A1 |
| 20210045268 | Easton | Feb 2021 | A1 |
| 20210197601 | Celinder et al. | Jul 2021 | A1 |
| 20210218857 | D'Armancourt et al. | Jul 2021 | A1 |
| 20210295117 | Lim | Sep 2021 | A1 |
| 20210405938 | Gutierrez et al. | Dec 2021 | A1 |
| 20220067316 | Ackley | Mar 2022 | A1 |
| 20220222500 | Ackley | Jul 2022 | A1 |
| 20230041346 | Ackley et al. | Feb 2023 | A1 |
| Number | Date | Country |
|---|---|---|
| 1085452 | Mar 2001 | EP |
| 2270746 | Jan 2011 | EP |
| 3336770 | Jun 2018 | EP |
| 09-027049 | Jan 1997 | JP |
| 2002-281287 | Sep 2002 | JP |
| 2004-341764 | Dec 2004 | JP |
| 4644283 | Mar 2011 | JP |
| 2011-110777 | Jun 2011 | JP |
| 2013-151126 | Aug 2013 | JP |
| 10-0767433 | Oct 2007 | KR |
| 2013163789 | Nov 2013 | WO |
| 2013173985 | Nov 2013 | WO |
| 2014019130 | Feb 2014 | WO |
| 2014110495 | Jul 2014 | WO |
| Entry |
|---|
| US 8,548,242 B1, 10/2013, Longacre (withdrawn) |
| US 8,616,454 B2, 12/2013, Havens et al. (withdrawn) |
| U.S. Appl. No. 17/301,259, filed Mar. 30, 2021, U.S. Pat. No. 11,570,321, Patented. |
| U.S. Appl. No. 17/790,417, filed Feb. 13, 2020, U.S. Pat. No. 10,999,460, Patented. |
| U.S. Appl. No. 16/240,140, filed Jan. 4, 2019, U.S. Pat. No. 10,834,283, Patented. |
| Notice of Allowance and Fees Due (PTOL-85) dated Feb. 27, 2023 for U.S. Appl. No. 17/468,425. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jan. 25, 2023 for U.S. Appl. No. 17/454,148. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jan. 31, 2023 for U.S. Appl. No. 17/468,425. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jul. 28, 2020 for U.S. Appl. No. 16/240,140. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jun. 2, 2020 for U.S. Appl. No. 16/240,295. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jun. 8, 2022 for U.S. Appl. No. 17/301,259. |
| Notice of Allowance and Fees Due (PTOL-85) dated Jun. 12, 2019 for U.S. Appl. No. 16/240,109. |
| Notice of Allowance and Fees Due (PTOL-85) dated Mar. 13, 2023 for U.S. Appl. No. 17/468,425. |
| Notice of Allowance and Fees Due (PTOL-85) dated Mar. 15, 2023 for U.S. Appl. No. 17/454,148. |
| Notice of Allowance and Fees Due (PTOL-85) dated Nov. 6, 2019 for U.S. Appl. No. 16/240,140. |
| Notice of Allowance and Fees Due (PTOL-85) dated Nov. 23, 2022 for U.S. Appl. No. 17/468,425. |
| Notice of Allowance and Fees Due (PTOL-85) dated Sep. 23, 2020 for U.S. Appl. No. 16/240,140. |
| Notice of Allowance and Fees Due (PTOL-85) dated Sep. 23, 2022 for U.S. Appl. No. 17/301,259. |
| Notice of Allowance for U.S. Appl. No. 16/240,109, dated Aug. 14, 2019, 10 pages. |
| Notice of Allowance received for U.S. Appl. No. 16/688,197, dated Nov. 22, 2021, 8 pages. |
| Notice of Allowance received for U.S. Appl. No. 16/930,022, dated Aug. 23, 2021, 3 pages. |
| Notice of Allowance received for U.S. Appl. No. 16/930,022, dated Jun. 8, 2021, 12 pages. |
| Notice of Allowance received for U.S. Appl. No. 16/930,022, dated Sep. 22, 2021, 2 pages. |
| Office Action for U.S. Appl. No. 14/824,455 dated Nov. 30, 2018, 17 pages. |
| Supplemental Notice of Allowability (PTOL-37) dated Sep. 10, 2020 for U.S. Appl. No. 16/240,295. |
| Supplemental Notice of Allowability dated Aug. 21, 2020 for U.S. Appl. No. 16/240,295. |
| Supplemental Notice of Allowability received for U.S. Appl. No. 17/010,515, dated Oct. 15, 2021, 2 pages. |
| U.S. Patent Application for “Methods, Apparatuses, And Systems For Verifying Printed Image And Improving Print Quality”, Unpublished (Filing date Feb. 23, 2023), (Jose Guiterrez, Inventor), (Hand Held Products, Inc., Assignee), U.S. Appl. No. 18/173,463. |
| U.S. Appl. No. 13/367,978 for a Laser Scanning Module Employing an Elastomeric U-Hinge Based Laser Scanning Assembly, filed Feb. 7, 2012, Feng et al. |
| U.S. Appl. No. 14/277,337 for Multipurpose Optical Reader, filed May 14, 2014, Jovanovski et al. |
| U.S. Appl. No. 14/283,282 for Terminal Having Illumination and Focus Control filed May 21, 2014, Liu et al. |
| U.S. Appl. No. 14/446,391 for Multifunction Point of Sale Apparatus With Optical Signature Capture filed Jul. 30, 2014, Good et al. |
| U.S. Appl. No. 14/676,109 for Indicia Reader, filed Apr. 1, 2015, Richard Walter Huck. |
| “Detecting Barcodes in Images with Python and OpenCV” [online] [retrieved on May 27, 2019] Retrieved from the Internet: <https://www.pyimagesearch.com/2014/11/24/detecting-barcodes-images-python-opencv/> dated Nov. 24, 2014. |
| Annex to the communication dated Feb. 20, 2023 for EP Application No. 19150494. |
| Anonymous: “How can I quantify difference between two images?—Stack Overflow”, [online] [retrieved on May 27, 2019] Retrieved from the Internet:URL:https://stackoverflow.com/questions/189943/how-can-i-quantify-difference-between-two-images> dated Apr. 21, 2015, pp. 1-5. |
| Basic Image Enhancement and Analysis Techniques, 4 pages, [online], [retrieved on Oct. 3, 2016]. Retrieved from the Internet <URL:https://in.mathworks.com/help/images/image-enhancement-and-analysis.html>. |
| Communication about intention to grant a European patent dated Dec. 23, 2022 for EP Application No. 19150493.5. |
| Communication about intention to grant a European patent received for EP Application No. 19150495.0, dated Nov. 15, 2021, 6 pages. |
| Communication from the Examining Division dated Jul. 15, 2021 for EP Application No. 19150493.5. |
| Communication Pursuant to Article 94(3) issued in European Application No. 19150495.0 dated Jul. 9, 2021, 6 pages. |
| Communication Pursuant to Article 94(3) received for European Application No. 19150494.3, dated Aug. 13, 2021, 6 pages. |
| Communication pursuant to Rules 70(2) and 70a(2) for European Application No. 19150493.5, dated Jul. 15, 2019, 2 pages. |
| Communication pursuant to Rules 70(2) and 70a(2) for European Application No. 19150494.3, dated Jul. 15, 2019, 2 pages. |
| Communication pursuant to Rules 70(2) and 70a(2) for European Application No. 19150495.0, dated Jul. 15, 2019, 2 pages. |
| Corrected Notice of Allowability (PTOL-37) dated Sep. 23, 2020 for U.S. Appl. No. 16/240,140. |
| Corrected Notice of Allowability dated Aug. 7, 2020 for U.S. Appl. No. 16/240,140. |
| Corrected Notice of Allowability dated Jul. 21, 2020 for U.S. Appl. No. 16/240,295. |
| Corrected Notice of Allowability dated Jun. 24, 2020 for U.S. Appl. No. 16/240,067. |
| Corrected Notice of Allowability dated Sep. 2, 2020 for U.S. Appl. No. 16/240,067. |
| Corrected Notice of Allowability received for U.S. Appl. No. 16/930,022, dated Sep. 9, 2021, 3 pages. |
| Corrected Notice of Allowability received for U.S. Appl. No. 17/010,515, dated Nov. 5, 2021, 2 pages. |
| Decision to grant a European patent received for European Application No. 19150495.0, dated Mar. 24, 2022, 2 pages. |
| EP Office Action dated Feb. 20, 2023 for EP Application No. 19150494. |
| European search report and Search opinion dated May 24, 2019 for EP Application No. 19150493.5. |
| Examiner initiated interview summary (PTOL-413B) dated Apr. 16, 2020 for U.S. Appl. No. 16/240,067. |
| Extended European Search Report for European Application No. 19150494.3 dated Jun. 6, 2019. |
| Extended European Search Report for European Application No. 19150495.0 dated Jun. 4, 2019. |
| Extended European search report dated Jun. 22, 2022 for EP Application No. 22160775.7, 7 pages. |
| Faulty Barcode Detection, 11 pages, [online], [retrieved on Oct. 24, 2016]. Retrieved from the Internet <URL:http://tewson.com/sites/default/files/barcode.pdf>. |
| Final Rejection dated Jan. 10, 2020 for U.S. Appl. No. 16/240,067. |
| Find Image Rotation and Scale Using Automated Feature Matching, 7 pages, [online], [retrieved on Oct. 3, 2016]. Retrieved from the Internet <URL: hhttps://www.mathworks.com/examples/matlab-computer-vision/mw/vision_product-visionrecovertform-find-image-rotation-and-scale-using-automated-feature-matching>. |
| Image Analysis, 1 page, [online], [retrieved on Nov. 7, 2016]. Retrieved from the Internet <URL: http://in.mathworks.com/help/images/image-analysis.html>. |
| Image Enhancement, 1 page, [online], [retrieved on Oct. 3, 2016]. Retrieved from the Internet <URL: http://in.mathworks.com/help/images/image-enhancement-and-restoration.html>. |
| Imshowpair—compare differences between images, 6 pages, [online], [retrieved on Nov. 7, 2016]. Retrieved from the Internet <URL: http://in.mathworks.com/help/images/ref/imshowpair.html?requestedDomain=in.mathworks.com#bta3zrg>. |
| Non-Final Rejection dated Aug. 2, 2022 for U.S. Appl. No. 17/468,425, 8 pages. |
| Non-Final Rejection dated Aug. 25, 2020 for U.S. Appl. No. 16/790,417. |
| Non-Final Rejection dated Feb. 2, 2023 for U.S. Appl. No. 17/651,977. |
| Non-Final Rejection dated Feb. 8, 2022 for U.S. Appl. No. 17/301,259. |
| Non-Final Rejection dated Jul. 11, 2019 for U.S. Appl. No. 16/240,067. |
| Non-Final Rejection dated Jun. 26, 2019 for U.S. Appl. No. 16/240,140. |
| Non-Final Rejection dated Mar. 12, 2020 for U.S. Appl. No. 16/240,140. |
| Non-Final Rejection dated May 2, 2019 for U.S. Appl. No. 16/240,109. |
| Non-Final Rejection dated May 26, 2021 for U.S. Appl. No. 16/688,197. |
| Non-Final Rejection dated Nov. 27, 2020 for U.S. Appl. No. 16/688,197. |
| Notice of allowability dated Jan. 27, 2021 for U.S. Appl. No. 16/790,417. |
| Notice of Allowability dated Sep. 16, 2020 for U.S. Appl. No. 16/240,140. |
| Notice of Allowance and Fees Due (PTOL-85) dated Apr. 16, 2020 for U.S. Appl. No. 16/240,067. |
| Notice of Allowance and Fees Due (PTOL-85) dated Aug. 11, 2021 for U.S. Appl. No. 17/010,515. |
| Notice of Allowance and Fees Due (PTOL-85) dated Dec. 21, 2022 for U.S. Appl. No. 17/301,259. |
| Notice of Allowance and Fees Due (PTOL-85) dated Dec. 31, 2020 for U.S. Appl. No. 16/790,417. |
| Notice of Allowance and Fees Due (PTOL-85) dated Feb. 8, 2023 for U.S. Appl. No. 17/468,425. |
| Notice of Allowance and Fees Due (PTOL-85) dated Feb. 9, 2023 for U.S. Appl. No. 17/454,148. |
| Decision to grant a European patent dated May 8, 2023 for EP Application No. 19150493, 2 page(s). |
| Notice of Allowance and Fees Due (PTOL-85) dated Jun 14, 2023 for U.S. Appl. No. 17/651,977, 8 page(s). |
| Extended European Search Report dated Jun. 29, 2023 for EP Application No. 23163411, 7 page(s). |
| Intention to grant dated Jun. 5, 2023 for EP Application No. 19150494, 9 page(s). |
| Non-Final Rejection dated Jul. 27, 2023 for U.S. Appl. No. 18/173,463, 8 page(s). |
| Decision to grant a European patent dated Sep 14, 2023 for EP Application No. 19150494, 2 page(s). |
| Notice of Allowance and Fees Due (PTOL-85) dated Sep 29, 2023 for U.S. Appl. No. 17/651,977, 8 page(s). |
| Notice of Allowance and Fees Due (PTOL-85) dated Nov. 15, 2023 for U.S. Appl. No. 18/173,463, 9 page(s). |
| Non-Final Rejection dated Dec. 21, 2023 for U.S. Appl. No. 18/306,904, 7 page(s). |
| Extended European Search Report dated Dec. 21, 2023 for EP Application No. 23195821, 8 page(s). |
| Number | Date | Country | |
|---|---|---|---|
| 20230125920 A1 | Apr 2023 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62614089 | Jan 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17301259 | Mar 2021 | US |
| Child | 18146201 | US | |
| Parent | 16790417 | Feb 2020 | US |
| Child | 17301259 | US | |
| Parent | 16240140 | Jan 2019 | US |
| Child | 16790417 | US |
