US 10,242,285 B2Grant
Iterative recognition-guided thresholding and data extraction
Issue Date:2019-03-26
•20 Claims
•9 Drawing Sheets
Abstract
Techniques for improved binarization and extraction of information from digital image data are disclosed in accordance with various embodiments. The inventive concepts include independently binarizing portions of the image data on the basis of individual features, e.g. per connected component, and using multiple different binarization thresholds to obtain the best possible binarization result for each portion of the image data independently binarized. Determining the quality of each binarization result may be based on attempted recognition and/or extraction of information therefrom. Independently binarized portions may be assembled into a contiguous result. In one embodiment, a method includes: identifying a region of interest within a digital image; generating a plurality of binarized images based on the region of interest using different binarization thresholds; and extracting data from some or all of the plurality of binarized images. Corresponding systems and computer program products are also disclosed.
Metadata
Assignee
- KOFAX, INC.
Inventors
- Christopher W. Thrasher
- Alexander Shustorovich
- Stephen Michael Thompson
- Jan W. Amtrup
- Anthony Macciola
Application Information
Application Number:US 15/214,351
Filing Date:2016-07-19
Priority Date:2015-07-20
Art Unit:2667
Classifications
IPC:
G06K9/34G06K9/38G06T7/11G06T7/136G06T7/187G06K9/32G06K9/46
Patent Drawings (9 sheets)
Description
Related Applications
[0001] This application is related to U.S. Provisional Patent Application No. 62/194,783, filed Jul. 20, 2015; U.S. Pat. No. 9,058,515, filed Mar. 19, 2014; U.S. Pat. No. 8,885,229, filed May 2, 2014; U.S. Pat. No. 8,855,375, filed Jan. 11, 2013; U.S. Pat. No. 8,345,981, filed Feb. 10, 2009; U.S. Pat. No. 9,355,312, filed Mar. 13, 2013; and U.S. Pat. No. 9,311,531, filed Mar. 13, 2014; each of which is herein incorporated by reference in its entirety.
Field of Invention
[0002] The present invention relates to image capture and image processing. In particular, the present invention relates to capturing and processing digital images using a mobile device, and extracting data from the processed digital image using a recognition-guided thresholding and extraction process.
Background of the Invention
[0003] Digital images having depicted therein an object inclusive of documents such as a letter, a check, a bill, an invoice, etc. have conventionally been captured and processed using a scanner or multifunction peripheral (MFP) coupled to a computer workstation such as a laptop or desktop computer. Methods and systems capable of performing such capture and processing are well known in the art and well adapted to the tasks for which they are employed.
[0004] More recently, the conventional scanner-based and MFP-based image capture and processing applications have shifted toward mobile platforms, e.g. as described in the related patent applications noted above with respect to capturing and processing images using mobile devices (U.S. Pat. No. 8,855,375), classifying objects depicted in images captured using mobile devices (U.S. Pat. No. 9,355,312, e.g. at column 9, line 9—column 15, line 28), and extracting data from images captured using mobile devices (U.S. Patent Publication No. 9,311,531, e.g. at column 18, line 25—column 27, line 16).
[0005] While these capture, processing, classification and extraction engines and methods are capable of reliably extracting information from certain objects or images, it is not possible to dynamically extract information from other objects, particularly objects characterized by a relatively complex background, and/or overlapping regions of foreground (e.g. text) and background. In practice, while it may be possible to reliably extract information from a simple document having a plain white background with dark foreground text and/or images imposed thereon, a document depicting one or more graphics (such as pictures, logos, etc.) as the background with foreground text and/or images imposed thereon, especially if overlapping.
[0006] This problem arises primarily because it becomes significantly difficult to distinguish the foreground from the background, especially in view of the fact that digital images are conventionally converted to bitonal (black/white) or grayscale color depth prior to attempting extraction. As a result, tonal differences between background and foreground are suppressed in converting the color channel information into grayscale intensity information or bitonal information.
[0007] This is an undesirable limitation that restricts users from using powerful extraction technology on an increasingly diverse array of documents encountered in the modern world and which are useful or necessary to complete various mobile device-mediated transactions or business processes.
[0008] For example, it is common for financial documents such as checks, credit cards, etc. to include graphics, photographs, or other imagery and/or color schemes as background upon which important financial information are displayed. The font and color of the foreground financial information may also vary from “standard” business fonts and/or colors, creating additional likelihood that discriminating between the foreground and background will be difficult or impossible.
[0009] Similarly, identifying documents such as driver's licenses, passports, employee identification, etc. frequently depict watermarks, holograms, logos, seals, pictures, etc. over which important identifying information may be superimposed in the foreground. To the extent these background and foreground elements overlap, difficulties are introduced into the discrimination process, frustrating or defeating the ability to extract those important information.
[0010] Therefore, it would be highly beneficial to provide new method, system and/or computer program product technology for extracting information from complex digital image data depicting highly similar foreground and background elements, and/or overlapping background and foreground elements.
Summary
[0011] According to one embodiment, a computer-implemented method includes: identifying a region of interest within a digital image; generating a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extracting data from some or all of the plurality of binarized images.
[0012] In accordance with another embodiment, a system such as a mobile device includes a processor and logic integrated with and/or executable by the processor. The logic is configured, upon execution thereof, to cause the processor to: identify a region of interest within a digital image; generate a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extract data from some or all of the plurality of binarized images.
[0013] According to yet another embodiment, a computer program product includes a computer readable medium having embodied therewith computer readable program instructions configured to cause a processor, upon execution of the instructions, to: identify, using the processor, a region of interest within a digital image; generate, using the processor, a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extract, using the processor, data from some or all of the plurality of binarized images.
[0014] Other aspects and embodiments of the present invention will become apparent from the following detailed description, which, when taken in conjunction with the drawings, illustrate by way of example the principles of the invention.
Brief Description of the Drawings
[0015] FIG. 1 illustrates a network architecture, in accordance with one embodiment.
[0016] FIG. 2 shows a representative hardware environment that may be associated with the servers and/or clients of FIG. 1 , in accordance with one embodiment.
[0017] FIG. 3 a portion of a driver's license in a color rendition, according to one embodiment.
[0018] FIG. 4 depicts the same portion of the driver's license, in a grayscale rendition generated from the color image shown in FIG. 3 , according to one embodiment.
[0019] FIG. 5 depicts a plurality of binary images generated by applying a plurality of different binarization thresholds to the grayscale image shown in FIG. 4 , according to one embodiment.
[0020] FIGS. 6A and 6B depict a composite image generated by extracting and assembling high-confidence components from the plurality of thresholded images shown in FIG. 5 .
[0021] FIG. 7 is a flowchart of a method, according to one embodiment.
Detailed Description
[0022] The following description is made for the purpose of illustrating the general principles of the present invention and is not meant to limit the inventive concepts claimed herein. Further, particular features described herein can be used in combination with other described features in each of the various possible combinations and permutations.
[0023] Unless otherwise specifically defined herein, all terms are to be given their broadest possible interpretation including meanings implied from the specification as well as meanings understood by those skilled in the art and/or as defined in dictionaries, treatises, etc.
[0024] It must also be noted that, as used in the specification and the appended claims, the singular forms “a,” “an” and “the” include plural referents unless otherwise specified.
[0025] The present application refers to image processing of images (e.g. pictures, figures, graphical schematics, single frames of movies, videos, films, clips, etc.) captured by cameras, especially cameras of mobile devices. In particular, the presently disclosed inventive concepts concern determining optimum binarization parameters for recognizing and/or extracting features of an image, especially text. Determining optimum binarization parameters involves an iterative process whereby various binarization thresholds are employed to an image, and data are extracted from the binarized images to determine whether and to what degree the extraction result matches an expected result.
[0026] According to one embodiment, a computer-implemented method includes: identifying a region of interest within a digital image; generating a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extracting data from some or all of the plurality of binarized images.
[0027] In accordance with another embodiment, a system such as a mobile device includes a processor and logic integrated with and/or executable by the processor. The logic is configured, upon execution thereof, to cause the processor to: identify a region of interest within a digital image; generate a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extract data from some or all of the plurality of binarized images.
[0028] According to yet another embodiment, a computer program product includes a computer readable medium having embodied therewith computer readable program instructions configured to cause a processor, upon execution of the instructions, to: identify, using the processor, a region of interest within a digital image; generate, using the processor, a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and extract, using the processor, data from some or all of the plurality of binarized images.
[0029] As understood herein, a mobile device is any device capable of receiving data without having power supplied via a physical connection (e.g. wire, cord, cable, etc.) and capable of receiving data without a physical data connection (e.g. wire, cord, cable, etc.). Mobile devices within the scope of the present disclosures include exemplary devices such as a mobile telephone, smartphone, tablet, personal digital assistant, iPod®, iPad®, BLACKBERRY® device, etc.
[0030] However, as it will become apparent from the descriptions of various functionalities, the presently disclosed mobile image processing algorithms can be applied, sometimes with certain modifications, to images coming from scanners and multifunction peripherals (MFPs). Similarly, images processed using the presently disclosed processing algorithms may be further processed using conventional scanner processing algorithms, in some approaches.
[0031] Of course, the various embodiments set forth herein may be implemented utilizing hardware, software, or any desired combination thereof. For that matter, any type of logic may be utilized which is capable of implementing the various functionality set forth herein.
[0032] As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as “logic,” “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
[0033] Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, processor, or device.
[0034] A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband, as part of a carrier wave, an electrical connection having one or more wires, an optical fiber, etc. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
[0035] Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
[0036] Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
[0037] Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
[0038] These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
[0039] The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
[0040] The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
[0041] FIG. 1 illustrates an architecture 100, in accordance with one embodiment. As shown in FIG. 1 , a plurality of remote networks 102 are provided including a first remote network 104 and a second remote network 106. A gateway 101 may be coupled between the remote networks 102 and a proximate network 108. In the context of the present architecture 100, the networks 104, 106 may each take any form including, but not limited to a LAN, a WAN such as the Internet, public switched telephone network (PSTN), internal telephone network, etc.
[0042] In use, the gateway 101 serves as an entrance point from the remote networks 102 to the proximate network 108. As such, the gateway 101 may function as a router, which is capable of directing a given packet of data that arrives at the gateway 101, and a switch, which furnishes the actual path in and out of the gateway 101 for a given packet.
[0043] Further included is at least one data server 114 coupled to the proximate network 108, and which is accessible from the remote networks 102 via the gateway 101. It should be noted that the data server(s) 114 may include any type of computing device/groupware. Coupled to each data server 114 is a plurality of user devices 116. Such user devices 116 may include a desktop computer, lap-top computer, hand-held computer, printer or any other type of logic. It should be noted that a user device 111 may also be directly coupled to any of the networks, in one embodiment.
[0044] A peripheral 120 or series of peripherals 120, e.g., facsimile machines, printers, networked and/or local storage units or systems, etc., may be coupled to one or more of the networks 104, 106, 108. It should be noted that databases and/or additional components may be utilized with, or integrated into, any type of network element coupled to the networks 104, 106, 108. In the context of the present description, a network element may refer to any component of a network.
[0045] According to some approaches, methods and systems described herein may be implemented with and/or on virtual systems and/or systems which emulate one or more other systems, such as a UNIX system which emulates an IBM z/OS environment, a UNIX system which virtually hosts a MICROSOFT WINDOWS environment, a MICROSOFT WINDOWS system which emulates an IBM z/OS environment, etc. This virtualization and/or emulation may be enhanced through the use of VMWARE software, in some embodiments.
[0046] In more approaches, one or more networks 104, 106, 108, may represent a cluster of systems commonly referred to as a “cloud.” In cloud computing, shared resources, such as processing power, peripherals, software, data, servers, etc., are provided to any system in the cloud in an on-demand relationship, thereby allowing access and distribution of services across many computing systems. Cloud computing typically involves an Internet connection between the systems operating in the cloud, but other techniques of connecting the systems may also be used.
[0047] FIG. 2 shows a representative hardware environment associated with a user device 116 and/or server 114 of FIG. 1 , in accordance with one embodiment. Such figure illustrates a typical hardware configuration of a workstation having a central processing unit 210, such as a microprocessor, and a number of other units interconnected via a system bus 212.
[0048] The workstation shown in FIG. 2 includes a Random Access Memory (RAM) 214, Read Only Memory (ROM) 216, an I/O adapter 218 for connecting peripheral devices such as disk storage units 220 to the bus 212, a user interface adapter 222 for connecting a keyboard 224, a mouse 226, a speaker 228, a microphone 232, and/or other user interface devices such as a touch screen and a digital camera (not shown) to the bus 212, communication adapter 234 for connecting the workstation to a communication network 235 (e.g., a data processing network) and a display adapter 236 for connecting the bus 212 to a display device 238.
[0049] The workstation may have resident thereon an operating system such as the Microsoft Windows® Operating System (OS), a MAC OS, a UNIX OS, etc. It will be appreciated that a preferred embodiment may also be implemented on platforms and operating systems other than those mentioned. A preferred embodiment may be written using JAVA, XML, C, and/or C++ language, or other programming languages, along with an object oriented programming methodology. Object oriented programming (OOP), which has become increasingly used to develop complex applications, may be used.
[0050] An application may be installed on the mobile device, e.g., stored in a nonvolatile memory of the device. In one approach, the application includes instructions to perform processing of an image on the mobile device. In another approach, the application includes instructions to send the image to a remote server such as a network server. In yet another approach, the application may include instructions to decide whether to perform some or all processing on the mobile device and/or send the image to the remote site.
[0051] In various embodiments, the presently disclosed methods, systems and/or computer program products may utilize and/or include any of the functionalities disclosed in related U.S. Patents, Patent Publications, and/or Patent Applications incorporated herein by reference. For example, digital images suitable for processing according to the presently disclosed algorithms may be subjected to image processing operations, such as page detection, rectangularization, detection of uneven illumination, illumination normalization, resolution estimation, blur detection, classification, data extraction, etc.
[0052] In more approaches, the presently disclosed methods, systems, and/or computer program products may be utilized with, implemented in, and/or include one or more user interfaces configured to facilitate performing any functionality disclosed herein and/or in the aforementioned related patent applications, publications, and/or patents, such as an image processing mobile application, a case management application, and/or a classification application, in multiple embodiments.
[0053] In still more approaches, the presently disclosed systems, methods and/or computer program products may be advantageously applied to one or more of the use methodologies and/or scenarios disclosed in the aforementioned related patent applications, publications, and/or patents, among others that would be appreciated by one having ordinary skill in the art upon reading these descriptions.
[0054] It will further be appreciated that embodiments presented herein may be provided in the form of a service deployed on behalf of a customer to offer service on demand.
[0055] Intelligent, Iterative Recognition-Guided Thresholding
[0056] In general, the presently disclosed inventive concepts encompass the notion of performing a recognition-guided thresholding and extraction process on individual regions of interest of a digital image to maximize the quality of the processed (preferentially a binarized image, since a great number of OCR engines rely on binary images as input) for subsequent extraction of information therefrom. The process is iterative in that individual regions of interest are identified, and subjected to a plurality of thresholding and extraction iterations, in an attempt to identify the best quality image for extraction. The process is intelligent in that a training phase is employed from which a priori expectations may be developed regarding the nature (e.g. identity, location, size, shape, color, etc.) of information depicted in images of objects belonging to a common classification, e.g. driver's licenses issued by a particular state. These a priori expectations may be leveraged in subsequent operations directed to extracting information from other objects belonging to the same classification, for example by matching an expected region of interest identity with an expected region of interest location, it is possible to acquire confidence in the extraction result. For instance, and as will be described in further detail below, by matching a region of interest location with an expected region of interest identity, the result of extraction from various image “frames” subjected to different threshold levels may be evaluated to determine whether the extraction at one particular threshold is “correct.”
[0057] In the training phase, image features (such as the bounding box locations and OCR results from various regions of interest) are determined for a plurality of images depicting representative exemplars of a class of object, such as a document or person. The features are determined using a learn-by-example classification technique. Features are analyzed to determine characteristic features of the subject of the image. For example, characteristic features include any suitable feature upon which a person or item may be identified, such as the dynamic location range for the region (i.e. a subset of pixels within the image in which a field or object is statistically likely to be located, which may preferably be determined based on observing location of many exemplars in the training phase); median height, width, or other dimension(s) of each region; appropriate character set for each region; text or image formatting for each region; text color for each region; background color for each region; text alignment for each region; etc. as would be understood by a person having ordinary skill in the art upon reading the present descriptions.
[0058] A set of characteristic features is preferably defined as corresponding to objects belonging to a particular class of object based on this training. In this manner, it is possible to subsequently facilitate identification of characteristic features based on object class, and vice-versa, in various embodiments. For example, an image may be labeled as depicting a particular class of object, and features of the individual object belonging to that particular class may be determined based in whole or in part on the class definition including the characteristic object features. Conversely, an object may be determined to belong to the particular class based on determining an image of the object depicts some or all of the characteristic features defined in the class definition.
[0059] A trained system, algorithm, technique, etc. as referenced above is provided a test or sample image, e.g. an image depicting a document belonging to a particular class of objects for which the system, algorithm, technique, etc. was trained. Using the test image, the presently disclosed inventive concepts perform an initial classification and extraction operation such as described in U.S. Pat. No. 9,355,312; and/or U.S. Pat. No. 9,311,531 and attempt to extract as much information as possible from the image based on the object class and corresponding extraction model.
[0060] However, for various reasons including background/foreground overlap, complex background, etc., at least some of the information cannot be reliably extracted. For example, in one embodiment an image depicts a driver's license wherein the name, date of birth, expiration date, etc. partially overlap with a state seal depicted in the background of the driver's license and a hologram overlaying the text (e.g. embedded in a laminate layer overlaying the foreground text and the background state seal). Worse still, the name, date of birth, expiration date, etc. is depicted in a font color substantially similar to the color of the state seal, but significantly contrasting with other portions of the driver's license background.
[0061] In preferred embodiments, training therefore may also encompass the initial attempt to extract information, such that particular elements within the image which are robustly difficult or impossible to accurately extract may be identified. This “trouble region” information may be included as part of the characteristic features of the object, such that computational cost of performing iterative, recognition-guided thresholding as described further below is minimized.
[0062] As will be appreciated by skilled artisans, it is incredibly difficult if not impossible to define appropriate parameters for extracting underlying information such as text from an image that depicts text or other foreground regions having both substantial similarity and substantial contrast with the background region(s) they respectively overlay/overlap. This is in part because extracting underlying information relies in some form on reducing the color depth of the received image, e.g. from RGB to grayscale or bi-tonal, before performing recognition, e.g. OCR, intelligent character recognition (ICR), etc. as would be understood by a person having ordinary skill in the art upon reading the present descriptions. As a result, where a region depicts both significantly similar and significantly contrasting foreground and background elements, it is not possible to define color suppression (e.g. binarization) parameters which generate a legible result for both the significantly similar foreground/background elements and the significantly contrasting foreground/background elements.
[0063] Instead, color suppression parameters may be configured to boost the contrast between the significantly similar foreground/background elements, but this generally renders the significantly contrasting foreground/background elements illegible. In the opposite scenario, e.g. without contrast boosting, the significantly contrasting foreground/background elements are legible, but the significantly similar foreground/background elements are not. In rare circumstances, it may be possible to achieve an intermediately contrasting result by boosting contrast only slightly, but in practice this approach does not adequately facilitate extraction of all elements within the region of interest.
[0064] In order to accomplish accurate and reliable extraction of both significantly similar and significantly contrasting foreground/background elements within a single image or region of interest of an image, the presently disclosed inventive concepts propose an iterative, intelligent, recognition-guided thresholding and extraction process. In essence, and with reference to a string of text characters as the exemplary embodiment, the thresholding process may be performed in a manner that renders a legible result on a per-character basis, and upon achieving a legible result, extraction is performed on the legible result, and the process proceeds to obtain a legible result for other characters in the string. Upon accurately extracting all individual characters, the string may be reconstructed from the aggregate extraction results, including the extracted portion(s) of the image, as well as the result of extracting the region of interest (e.g. OCR result). As described herein, this basic procedure is referred to as recognition-guided thresholding.
[0065] Of course, it should be understood that recognition-guided thresholding as generally described herein may be performed on the basis of any suitable confidence criterion, and need not evaluate textual information as a means of deriving such confidence information. For example, in various approaches image features may serve as the basis for deriving confidence.
[0066] In one implementation, a recognition-guided thresholding process may identify a region of interest depicting one or more image features. Characteristics of the image features (e.g. size, location, shape, color profile, etc.) may be known based on a training operation such as a learn-by-example classification training operation. For example, a class of documents includes an image feature comprising an embedded security mark that overlaps with or is otherwise partially obscured by background textures appearing in the document. In order to authenticate the document, it is necessary to extract and verify the security mark. So as to overcome the apparent obscurity or overlap, it may be advantageous to apply an iterative thresholding process as described herein, and evaluate confidence of a result under each threshold on the basis of image features in the thresholded region matching corresponding image features in thresholded training images.
[0067] Of course, any other equivalent means of determining confidence as to whether a particular image feature matches an expected image feature may be employed without departing from the scope of the present disclosures.
[0068] Recognition-guided thresholding and extraction may also preferably include color normalization as an aspect of improving extraction robustness and accuracy. As discussed herein, color normalization should be understood as normalizing intensity values across the various color channels (e.g. R, B and G) to “stretch” each channel onto a single normalized scale. Most preferably, color normalization is performed prior to thresholding, and may be performed for each region of interest independently or on the aggregate of all regions of interest. This is particularly advantageous where foreground and background are similar and relatively dark, and assists in discriminating between foreground and background by “stretching” the values across the entire intensity range.
[0069] For instance, an image region is characterized by pixels having a RGB color profile. No pixel in the region has an intensity value greater than 100 in any color channel. Each color channel permits intensity values in a range from 0-255. In this scenario, color normalization may effectively set the maximum intensity value of 100 as corresponding to the maximum value in the range, and “stretch” the intervening values across the entire color space, such that each difference of 1 intensity unit in the original image becomes effectively a difference of 2.55 intensity units.
[0070] Of course, it should be understood that the iterative thresholding and extraction process described above is equally applicable to extraction of non-textual information, such as lines or other document structures, graphical elements, etc., as long as there is a quality criterion (as akin to OCR confidence for characters, e.g. a classification-based or other feature-matching confidence measure) evaluating the result. For example, consider a graphical element depicting a gradient of color, which progresses from contrasting with the background to substantially representing the background color the graphical element overlays. In such circumstances, it is similarly possible to progress along the gradient (or other pattern or progression) using an iterative thresholding process to extract a legible or clear version of the graphic.
[0071] In practice, and according to another exemplary approach based on connected components, images of a particular class of object such as a document may depict a plurality of regions of interest each corresponding to one or more of photograph(s), document structure, graphical elements, text fields, etc. A plurality of such images are used in a training phase as described above, and subsequent to training an image depicting a plurality of regions of interest is analyzed.
[0072] As referred-to herein, it should be understood that the term “connected component” refers to any structure within a bitonal image that is formed from a contiguous set of adjacent black pixels. For example connected components may include lines (e.g. part of a document's structure such as field boundaries in a form), graphical elements (e.g. photographs, logos, illustrations, unique markings, etc.), text (e.g. characters, symbols, handwriting, etc.) or any other feature depicted in a bitonal image. Accordingly, in one embodiment a connected component may be defined within a bitonal image according to the location of the various pixels from which the component is formed.
[0073] The term “image feature” is to be understood as inclusive of connected components, but also includes such components as may be defined within color spaces other than a bitonal image. Thus, an image feature includes any structure of an image that is formed from a contiguous set of adjacent pixels. The image feature may be defined according to the location of constituent pixels as noted above for connected components, but may also include other information such as intensity information (e.g. in one or more color channels).
[0074] Based on the training phase, each region of interest expected to appear is known a priori, preferably both in terms of the statistically-likely location of the region, as well as an expected identity of one or more image features and/or connected components located within the region (including an expected set of possible identities, such as a subset of alphanumeric characters, pixel color channel values, feature shape, size, etc. or other identifying characteristics of one or more connected components located within the region of interest.)
[0075] This information is utilized to perform conventional classification and extraction, by which a plurality of expected regions of interest are successfully extracted, while others are either not found or imperfectly extracted.
[0076] One or more particular regions of interest, e.g. depicting a field partially or wholly overlaying a seal, logo, or other similar background texture, may be known to be among the “trouble regions” defined in the classification, and/or may be determined “trouble regions” based on achieving imperfect/incomplete extraction results from the conventional approach. In response to determining a trouble region exists in the digital image, in some approaches a determination may be made that recognition-guided thresholding should be applied to the particular trouble regions, and/or optionally on all regions of interest in the digital image.
[0077] Each of the particular regions of interest are subjected to a color normalization process to stretch the intensity values in each color channel, thereby enhancing ability to distinguish between foreground and background elements.
[0078] In one exemplary approach, where the confidence measure is OCR confidence and the primary but nonexclusive objective is to threshold textual information, each particular region is matched to a corresponding region of interest known from the training set, e.g. based on its location, and is rendered (e.g. in grayscale) using channel weights derived from the analysis of foreground and background colors so that the foreground in the rendered image is made dark vs. lighter background. If the foreground is known or determined to be brighter than the background, this rendered image is inverted.
[0079] For each region of interest, a plurality of thresholds are applied to the rendered image, which is preferably a grayscale image, of the rectangular region encompassing the region of interest. Each threshold represents a different intensity value along a range of intensity values (e.g. grayscale intensity), and generates a different binary image with a number of connected components. Each component is subjected to a recognition process such as optical character recognition to attempt extracting information therefrom, e.g. character identity. As will be understood by those having ordinary skill in the art, the OCR may achieve varied results across the set of connected components. However, it is extremely likely that in at least one such binary image the component will be legible and the extraction will match expected extraction results based on the training set. For example, the extracted character may match an expected character or match one of a set of possible expected characters with high confidence, and deemed a candidate on this basis.
[0080] While the above example contemplates performing a plurality of thresholding operations on a particular region, it is also within the scope of the present disclosures to perform thresholding on a per-component or a per-feature basis. For example, in one approach a particular region may depict text having a known character spacing, or depict one or more image features according to a known pattern. It may be advantageous in some approaches to perform thresholding on individual features rather than the region as a whole. For example, the region may be divided according to the known character spacing or pattern, and each subregion defined therein may be separately subjected to thresholding, which may utilize different parameters than a thresholding process applied to the region as a whole.
[0081] In this manner, it is possible to tailor the thresholding to the individual feature or component desired for extraction, as well as for an immediately surrounding background region, without needing to consider the differences between the foreground and background of the region as a whole.
[0082] For instance, in one approach a credit card may depict a credit card number comprising a plurality of characters arranged in a line and having equal spacing between each character. The credit card number as a whole may be encompassed within a region of interest, which may be matched as described above. In addition or in the alternative to performing region-based thresholding as above, thresholding may include subdividing the region into a plurality (e.g. 16) subregions of interest, and performing thresholding on each individual region. This may be particularly useful in situations where, e.g., the credit card depicts a complex background whereby some but not all of the characters in the credit card number are in “trouble spots” and overlap or are obscured by unique background elements, such that no single threshold applied to the region as a whole can identify character(s) overlapping one or more of the unique background elements. By isolating those characters, thresholding may be specifically performed on the “trouble spot” to maximize the likelihood of achieving a candidate result with sufficient confidence for extraction.
[0083] In any event, as the threshold value diminishes the amount of black in the binary image is reduced and connected components become thinner and break into smaller components. Performing OCR on the sequence of progressively thinning components associated with diminishing threshold levels with significant overlap of their bounding boxes generates a sequence of candidates, and as the components break up a formerly single candidate with a wider bounding box may be replaced by a more confident pair or triplet of components associated with a lower threshold level. The candidates with highest confidences form the final string.
[0084] In some approaches, since the highest confidence candidates for a particular character/feature/component, etc. may include several (potentially consecutive) binarization threshold levels, it may be advantageous to choose from among the several highest confidence candidates. For instance, in situations where intensity values are minimized across multiple extraction results to assemble a contiguous extracted result, it may be useful to select one of the highest confidence candidates having an intensity value closest to a mean, median, etc. intensity of other frames to be used in assembling the final extraction result. Accordingly, in one embodiment the presently disclosed inventive concepts include techniques for determining from which thresholded image(s) to select a corresponding bounding box into the final binary rendition of the original region of interest.
[0085] Upon identifying the threshold range for each candidate in the region of interest, the various bounding boxes (and/or extraction results obtained therefrom) may be assembled into a cohesive result. As noted in further detail herein, in some embodiments where the various portions of the image corresponding to each component are to be assembled, it is advantageous to select a legible bounding box (but not necessarily the one with the highest confidence character) for some or all of the components in order to generate a more consistent visual result.
[0086] As another advantage, the presently disclosed inventive, recognition-guided thresholding process provides superior accuracy and reliability even outside the context of foreground elements that overlap with similar background elements. For instance, and as known in the art, extraction may be frustrated or rendered impossible due to poor image quality, e.g. arising from insufficient illumination in the capture environment, presence of artifacts such as shadows, etc.
[0087] To address these common problems, conventional image processing algorithms seek to improve the quality of the image as a whole, which yields moderate improvements to extraction capability, e.g. via correcting a uniformly insufficient illumination and permit improved distinction between foreground and background elements. However, these conventional solutions approach the rectification process from the perspective of the image, rather than individual elements of the image (e.g. connected components), and thus are limited in applicability and efficacy because adjustments that may be appropriate for one portion of an image are not appropriate or are less appropriate for other portions of the image.
[0088] By contrast, the presently disclosed inventive concepts can provide extraction that is robustly capable of extracting only the information from the image that most closely matches expected information based on training, both in terms of information content (e.g. text character identity) as well as location (e.g. center pixel, dynamic region, etc.). In particularly preferred approaches, extracted information matches the expected information in terms of information content, location, and size.
[0089] For instance, and as will be appreciated by persons having ordinary skill in the art upon reading the present descriptions, insufficient contrast between foreground and background in a digital image can have the effect of making foreground elements appear larger, due to “blobifying” of the foreground element (see, e.g. images 502-520 of FIG. 5 , where the “0” and “6” characters are connected as a single “blob” that is not resolved until image 522). As a result, in an image having insufficient contrast, an expected element may be identifiable, but the appearance of the element may be unreliably identifiable due to obscured boundaries between foreground and background, or the identity of the element may be in question because the element is not fully contained within the dynamic region where the element is expected based on training.
[0090] Similarly, when contrast is excessive, a single element in an image may appear “broken” into several constituent elements (e.g. connected components) which may be unrecognizable or problematically represent an incorrect element (e.g. a capital letter “H” representing two adjacent “1” or “1” characters when the cross-bar is broken or missing). By leveraging the expected identity, location, and size, the presently disclosed concepts may more accurately and robustly determine, e.g. based on the width of spacing between the two “1” or “1” characters, the location within the image, and/or the identity of the components extracted from a corresponding location in training, that the component is actually a capital H instead of adjacent “1” or “1” characters.
[0091] In addition and/or alternatively, the presently disclosed inventive concepts may include determining a more appropriate image intensity to utilize prior to extracting the “H” character based on an iterative thresholding process as described herein. Accordingly, not only may overall extraction be improved with respect to compliance with expected results, the quality of information extracted may be bolstered by selectively thresholding the region from which the component is to be extracted.
[0092] Thus, while conventional image processing techniques are limited to determining the best possible extraction based on the overall image, the presently disclosed techniques can evaluate each element or grouping of elements (such as connected components) individually at varying levels of image intensity, and thus provide a more accurate extraction result (e.g. by selecting a frame where the component most closely matches the size, shape, and location expected by training from among a plurality of frames, where each frame depicts the component at a different level of image intensity).
[0093] Accordingly, in several embodiments evaluating each element or grouping of elements may include generating a sequence of candidate extraction results for each element or grouping of elements. Preferably, each sequence of candidate extraction results includes and/or is based on extracting data from a plurality of images each generated using a different binarization threshold but depicting the same element or grouping of elements. Thus each sequence of candidate extraction results preferably represents data extracted from a plurality of images spanning a spectrum or range of binarization thresholds, and more preferably represents data extracted from a plurality of images depicting the same content, or at least the same element or grouping of elements.
[0094] While in preferred approaches each sequence of candidate extraction results includes candidates corresponding to different binarization thresholds, various individual candidate extraction results from different sequences of candidate extraction results may correspond to the same binarization threshold. The candidate extraction results from different sequences may include images and/or data extracted therefrom corresponding to some of the same elements or groupings of elements as elements or groupings of elements to which other sequences correspond. For example, in one embodiment a windowed approach may attempt to extract data from adjacent pairs, triplets, etc. of connected components within a region of interest. However, in preferred embodiments each sequence of candidate extraction results includes or is based on extracting data from images depicting at least one non-overlapping element or groupings of elements.
[0095] In addition, the overall extraction process is more robust since the evaluation can be performed individually for each component, rather than on the image as a whole, increasing the likelihood of extracting a similarly accurate result from even drastically different renditions of the same image, or from different portions of a single image (e.g. illuminated region versus shadowed region, regions having different color profiles and/or color depths, etc.).
[0096] Those having ordinary skill in the art will also appreciate that this recognition-guided thresholding and extraction technique may generate resulting extracted versions of portions of a component or element which exhibit perhaps drastically different appearance, to the point of potentially looking like a “mosaic” or “ransom note” stitched together from multiple images. For example, adjacent characters, one of which overlays a dark background but the other of which overlays only a bright background, may be extracted based on very different image intensity levels and thus appear very different upon recreating or synthesizing a composite of the extracted components.
[0097] To alleviate this artifact, it is advantageous to select from among plural exemplary frames of a component so as to minimize the overall range of frame intensity across a particular set of components. For instance, assuming a two-component element is represented by a plurality of frames for each component, each of the plurality of frames being characterized by a different intensity level. While it may be the case that the most legible frame for the first component is characterized by an intensity of 100, and the most legible frame for the second component is characterized by an intensity of 20, if each component has a frame that is legible (even if not most legible) and characterized by a value closer to the midpoint between the two values (i.e. 60), it is preferable in some approaches to choose the frames that more closely match in intensity to generate a single, consistently intense result.
[0098] In practical application, the presently disclosed inventive techniques have been applied to images depicting driver licenses. Training involved providing a plurality of exemplar driver licenses from a particular state, identifying characteristic features thereof, defining a classification based on the characteristic features, and attempting classical extraction.
[0099] Based on this training, several “trouble regions” were identified, and intelligent, iterative thresholding was applied to these regions when processing subsequent test images.
[0100] From experimentation, it was determined that iterative, intelligent thresholding as described herein employ approximately twenty thresholds with which to investigate the image to determine ideal extraction parameters and perform extraction therewith.
[0101] The various threshold levels may be evenly distributed across a particular range, e.g. grayscale intensity ranging from 0-255, or may be staggered throughout a particular range, e.g. according to predetermined intensity levels known to generate desirable extraction results. Again, according to experimental results, it is apparent that distributing the threshold levels across a grayscale intensity ranging from 1 to 120 (i.e. each threshold corresponding to a 6-point intensity increment) is advantageous for extracting text from documents or images featuring complex backgrounds and/or illumination variations, e.g. from shadows, glare, etc.
[0102] As will be appreciated by skilled artisans, different threshold values, distributions, or ranges may be appropriate depending on the nature of the image data to be processed. The aforementioned experimentally determined values were established as optimal for processing complex documents having primarily a white or light colored background, with a plurality of dark background and foreground elements depicted thereon.
[0103] The images depicted in FIGS. 3-5 represent experimental results determined from a Massachusetts driver's license when attempting to extract an expiration date that overlaps a complex background texture, in this case the state seal, forming a “trouble region” where thresholding and extraction using conventional (e.g. OCR) approaches cannot obtain the entire date. In all images depicted in FIGS. 3-5 , the expiration date is Jun. 27, 2013 (represented as “06-23-2013”). The images have been enlarged to emphasize differences.
[0104] First, FIG. 3 shows a rendition of the image in color, where many different colored background textures underlay the month, date and the majority of the year. Although the electronic record of the present application will reflect FIG. 3 in grayscale, skilled artisans in the field of image processing and object recognition will appreciate, e.g. by way of comparison to FIG. 4 , that the complexity of color images such as FIG. 3 is greater than that of grayscale or bitonal images.
[0105] As will be further appreciated by those having ordinary skill in the art, and as described in further detail elsewhere herein, presence of complex backgrounds is a common source of error in attempting to extract information from an image, particularly where the information to be extracted overlaps in whole or in part with the complex background.
[0106] FIG. 4 depicts the same portion of the driver's license, appearing in a grayscale rendition of the color image shown in FIG. 3 . As can be seen from FIG. 4 , conventional techniques for reducing color depth across an entirety of a particular image are often incapable of removing or rectifying the source of extraction error, e.g. a complex background or illumination problem/variance. As shown in FIG. 4 , the complexity of the background is reduced relative to the color rendition shown in FIG. 3 , but retains sufficient variation in background texture that applying a single binarization threshold to the grayscale rendition shown in FIG. 4 will not enable accurate extraction of all text depicted in the region of interest (expiration date field).
[0107] For example, according to one embodiment none of the plurality of images shown in FIG. 5 , each of which were generated by applying a different binarization threshold to the image shown in FIG. 4 , are suitable for extracting all characters depicted in the region of interest with sufficient confidence. Each of the plurality of images may be suitable for extracting one or more of the characters with sufficient confidence, but in each image at least one character is sufficiently degraded (e.g. by white pixels for low binarization thresholds such as the bottom 25% to 33% of the range of binarization thresholds) or obscured (e.g. by black pixels for higher binarization thresholds such as the top 50% to 25% of the range of binarization thresholds) such that the obscured/degraded character(s) cannot be extracted with sufficient confidence.
[0108] FIG. 5 depicts a plurality of binary images 502-538 generated using a plurality of different binarization thresholds as described herein. The plurality of images depicted in FIG. 5 may be understood as forming a sequence of candidate extraction results, or alternatively a plurality of images upon which a sequence of candidate extraction results is based, in several embodiments. Each image is generated using a different binarization threshold, and is characterized by a difference in the binarization threshold of 6 units with respect to vertically adjacent counterparts. Thus, in accordance with FIG. 5 the first image 502 corresponds to a threshold value of 115, while the last image 538 corresponds to a threshold value of 1 (each on a scale from 0-255), and images 504-536 correspond to threshold values between 1-115, each separated by 6 units of intensity. As will be appreciated by skilled artisans, according to the binarization applied to FIG. 4 in order to generate the binary images shown in FIG. 5 , pixels from the image shown in FIG. 4 having an intensity value less than the binarization threshold used to generate the corresponding image of FIG. 5 are converted to black, while pixels having an intensity value greater than or equal to the binarization threshold are converted to white. Thus, low binarization thresholds generally produce more white pixels and high binarization thresholds generate more black pixels. Although the embodiment shown and described with reference to FIGS. 3-5 involve thresholding based on grayscale pixel intensity values, it should be understood that other embodiments may additionally and/or alternatively utilize other image characteristics or values, such as intensity values in a particular color channel or combination of color channels, hue values, etc. as would be appreciated by skilled artisans upon reading the present disclosures.
[0109] Of course, in various embodiments sequences of candidate extraction results may be generated for each connected component (e.g. each character as shown in FIGS. 3-5 ), for different groupings of connected components (e.g. each pair or triplet of adjacent characters, each series of characters not separated by whitespace, etc.), or for the region of interest as a whole.
[0110] FIGS. 6A (enlarged) and 6B (native size) depict a composite image generated by extracting data from high-confidence candidates (e.g. candidate extraction results having confidence above a predetermined threshold) from the plurality of thresholded images shown in FIG. 5 , and assembling the extracted high-confidence candidates into a single image. For instance, in one approach the composite image corresponding to FIGS. 6A and 6B may be generated by assembling an extraction result from images 522 and/or 524 for the “0” character of the month field, from images 526 and/or 528 for the “6” character of the month field, from image 530 for the hyphen separating the month and day fields as well as for the numerals forming the day and year fields, and from image 536 for the hyphen separating the day and year fields. In another embodiment extraction may be performed on the region as a whole based on image 530. Of course, in various approaches any combination of images and/or extraction results may be used to generate the composite image shown in FIGS. 6A and 6B .
[0111] In certain embodiments, it may be advantageous to essentially invert the assumptions, operation of thresholds (e.g. pixels with intensity greater than the binarization threshold convert to black, and pixels with intensity less than or equal to the binarization threshold convert to white), and/or the image data, e.g. when attempting to detect a light foreground element on a light background as opposed to a dark foreground element depicted on a dark background. This inversion may be particularly advantageous when one particular component overlays multiple different background textures, or when a particular component depicts multiple colors or textures itself.
[0112] The presently disclosed inventive concepts also encompass performing binarization (which in various embodiments involves a thresholding process, but which does not necessarily employ the iterative, Recognition-guided approach set forth herein) based on classification, e.g. as described in related U.S. Pat. No. 9,355,312. For instance, determining particular binarization parameters based on a classification of an object such as a connected component or group of connected components may include techniques and features as described in column 16, line 33—column 18, line 6 of U.S. Pat. No. 9,355,312.
Validation
[0113] In additional embodiments, classification and/or extraction results may be presented to a user for validation, e.g. for confirmation, negation, modification of the assigned class, etc. For example, upon classifying an object using semi- or fully-automated processes in conjunction with distinguishing criteria such as defined herein, the classification and the digital image to which the classification relates may be displayed to a user (e.g. on a mobile device display) so that the user may confirm or negate the classification. Upon negating the classification, a user may manually define the “proper” classification of the object depicted in the digital image. This user input may be utilized to provide ongoing “training” to the classifier(s), in preferred approaches. Of course, user input may be provided in relation to any number of operations described herein without departing from the scope of the instant disclosures.
[0114] In even more preferred embodiments, the aforementioned validation may be performed without requiring user input. For instance, it is possible to mitigate the need for a user to review and/or to correct extraction results by performing automatic validation of extraction results. In general, this technique involves referencing an external system or database in order to confirm whether the extracted values are known to be correct. For example, if name and address are extracted, in some instances it is possible to validate that the individual in question in fact resides at the given address.
[0115] This validation principle extends to classification, in even more embodiments. For example, if the extraction is correct, in some approaches it is appropriate to infer that the classification is also correct. This inference relies on the assumption that the only manner in which to achieve the “correct” extraction result (e.g. a value matches an expected value in a reference data source, matches an expected format for the value in question, is associated with an expected symbol or other value, etc. as would be understood by one having ordinary skill in the art upon reading the present descriptions).
[0116] Now referring to FIG. 7 , a flowchart of a method 700 is shown according to one embodiment. The method 700 may be performed in accordance with the present invention in any of the environments depicted in FIGS. 1-2 , among others, in various embodiments. Of course, more or less operations than those specifically described in FIG. 7 may be included in method 700, as would be understood by one of skill in the art upon reading the present descriptions.
[0117] Each of the steps of the method 700 may be performed by any suitable component of the operating environment. For example, in various embodiments, the method 700 may be partially or entirely performed by a processor of a mobile device, a processor of a workstation or server environment, some other device having one or more processors therein, or any combination thereof.
[0118] The processor, e.g., processing circuit(s), chip(s), and/or module(s) implemented in hardware and/or software, and preferably having at least one hardware component may be utilized in any device to perform one or more steps of the method 700. Illustrative processors include, but are not limited to, a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc., combinations thereof, or any other suitable computing device known in the art.
[0119] As shown in FIG. 7 , method 700 may initiate with operation 702, where a region of interest within a digital image is identified. The region of interest preferably includes content such as text, a photograph, a symbol, etc. upon which extraction is to be performed, each of which may generally be represented via one or more connected components in the digital image (and/or representations of the digital image such as a grayscale or bitonal rendition of the digital image). Regions of interest may be identified in various embodiments based on a priori expectations such as a learned location of a particular field, photograph, symbol, etc. within a document, and/or image characteristics representing e.g. the identity, color, shape, size, etc. of object(s) depicted in particular location(s) of the document. As described above, in preferred approaches such a priori expectations may be developed in a training phase.
[0120] Method 700 also includes operation 704, in which a plurality of binarized images are generated based on the region of interest. The plurality of binarized images are preferably generated using a plurality of different binarization thresholds, though some of the binarized images may be generated using the same threshold(s) in some approaches. In various embodiments the plurality of binarized images may be arranged in one or more sequences, each sequence corresponding to a unique single connected component or a unique grouping of connected components from the region of interest. Where sequence(s) of binarized images are employed, preferably each image within each sequence is generated using a different binarization threshold, but images from different sequences may be generated using the same binarization threshold, in some embodiments.
[0121] With continuing reference to FIG. 7 , method 700 also includes extracting data from some or all of the plurality of binarized images in operation 706. Data extraction may include any suitable form of extraction as disclosed herein and/or in the related patent documents referenced herein, in various embodiments. In preferred approaches, extraction includes recognizing text and/or objects within some or all of the plurality of binarized images, e.g. using techniques such as optical character recognition or equivalents thereof, and/or image classification and/or data extraction.
[0122] In multiple varying but combinable embodiments, method 700 may include any number of additional and/or alternative features, operations, etc. as described herein, and should be viewed as a generic embodiment of iterative, recognition-guided thresholding as contemplated by the inventors. Various species falling within the generic embodiment are described in accordance with embodiments of the invention that may be utilized in different scenarios to achieve desired binarization results. Accordingly, skilled artisans reading the present disclosure will appreciate that the embodiments described herein may be combined in any suitable manner without departing from the scope of these inventive concepts.
[0123] For instance, and in accordance with several such exemplary species embodiments, method 700 may include any one or more of the following features, functions, operations, inputs, etc.
[0124] As mentioned briefly above, in one embodiment the region of interest encompasses a plurality of connected components; and each of the plurality of binarized images corresponds to a different combination of: one of the plurality of connected components; and one of the plurality of binarization thresholds. As such, each binarized image may represent a unique combination of connected components rendered according to a unique binarization threshold with respect to that particular combination of connected components. In more embodiments, of course, there may be overlap between the combinations of connected components (e.g. a windowed approach) and/or binarization thresholds applied thereto.
[0125] With continuing reference to connected components encompassed within the region(s) of interest, in several embodiments extracting the data is performed on a per-component basis for at least some of the plurality of connected components. As such, extraction may be performed on a per-component resolution to address extreme variations in image characteristics across a particular region of interest, enabling robust extraction even when desired information overlaps with complex background texture(s) and/or variations in illumination.
[0126] In various embodiments, extracting the data generally includes estimating an identity of some or all of the plurality of connected components within one or more of the plurality of binarized images. The identity estimation may be based on a recognition engine, classification technique, etc. as discussed above, in preferred approaches. In particularly preferred approaches, estimating the identity of the connected components determining a confidence of the estimated identity of some or all of the plurality of connected components. Confidence may be determined in any suitable manner and measured according to any suitable standard, such as OCR confidence, classification confidence, etc. in various approaches.
[0127] In a preferred embodiment, determining the confidence of the estimated identity of connected components includes comparing the estimated identity of various connected components with an expected identity of the respective connected components. Such expectation-based identity comparisons may be based on a priori information derived from training, and/or based on extraction results obtained from other of the plurality of binarized images.
[0128] In some approaches, expectation-based confidence may be determined based on whether a particular component matches an expected component type and/or location, and/or whether the particular component matches one of a plurality of possible expected component types and/or locations. Accordingly, determining the confidence of the estimated identity of some or all of the connected components may include comparing the estimated location of each respective one of the plurality of connected components for which the identity was estimated with an expected location of the respective one of the plurality of connected components.
[0129] In circumstances where some or all of the plurality of connected components comprise non-textual information; determining the confidence of the estimated identity of some or all of the plurality of connected components may include classifying some or all of the connected components for which the identity was estimated. The classification is preferably based on image features such as component color, size, location, shape, aspect ratio, etc.
[0130] Where confidence measures are available, extracting data may include choosing from among a plurality of candidate component identities (e.g. “3” versus “8”), in which case the choice may be made based in whole or in part on determining whether the confidence of the estimated identity of one of the plurality of connected components is less than a predetermined confidence threshold. In cases where the confidence of the estimated identity is less than the predetermined confidence threshold, the candidate component identity may be discarded, and/or an alternate candidate component identity (preferably having a higher confidence measure, even if below the confidence threshold) may be chosen as the component identity.
[0131] In more embodiments, where the confidence of the estimated identity is less than the predetermined confidence threshold method 700 may include estimating the identity of the corresponding connected component(s) based on a different binarized image, optionally but preferably a different member of a sequence of binarized images corresponding to the same connected component(s) but generated using a different binarization threshold.
[0132] In still more embodiments of method 700, extracting data from binarized images may therefore include: generating at least one sequence of candidate extraction results for each grouping of one or more connected components depicted within the region of interest; determining an optimal extraction result within each sequence of candidate extraction results; and assembling all of the optimal extraction results into a single string of the one or more connected components.
[0133] Preferably, each sequence of candidate extraction results includes a plurality of candidate extraction results, and each candidate extraction result within a given sequence corresponds to a same connected component or grouping of connected components depicted within the region of interest. Furthermore, each candidate extraction result within the given sequence preferably corresponds to a different one of the plurality of binarization thresholds. Accordingly, each sequence may represent a spectrum of binarization results generated using different binarization thresholds to render the same connected component(s) into a binarized form.
[0134] Of course, in various embodiments candidate extraction results in different sequences may correspond to the same binarization threshold, and in one embodiment at least one candidate result from each of at least two of the sequences corresponds to a same binarization threshold.
[0135] Determining the optimal extraction result within each sequence of candidate extraction results, as mentioned above, may include selecting one extraction result within each sequence of candidate extraction results so as to minimize intensity differences between the optimal extraction results assembled into the single string. This approach facilitates avoiding the appearance of a “ransom note” in the assembled result, and may include selecting candidates that do not correspond to the highest identity confidence level in order to minimize intensity differences across the assembled result.
[0136] In one embodiment, at least two of the plurality of connected components encompassed by the region of interest are preferably extracted from different ones of the plurality of binarized images. As noted above performing extraction on a per-component basis may enable extraction of components that could otherwise not be accomplished using conventional binarization techniques.
[0137] The method 700 in one embodiment also includes normalizing color within the digital image and/or the region of interest specifically. Advantageously, region-based color normalization allows more precise extraction of data since the normalization process is not influenced by other portions of the document/digital image that may have very different color profiles and thus would “stretch” the color channels in a manner not appropriate (or less appropriate) for the particular region of interest.
[0138] As described in further detail above, method 700 may also include validating extracted data. Preferably, in such embodiments validation includes inferring a classification of an object depicted in the digital image based on validating the extracted data. For example, upon validating a name and address correspond to a same individual, a digital image or object depicted therein may be classified as an appropriate type of document, e.g. a utility bill, identification document, etc. optionally based in part on a location within the digital image/document from which the name and address are extracted. Of course, in various embodiments other combinations of criteria may be used to validate extracted information and infer therefrom a classification of a particular object.
[0139] While the present descriptions of data extraction within the scope of the instant disclosure have been made with primary reference to methods, one having ordinary skill in the art will appreciate that the inventive concepts described herein may be equally implemented in or as a system and/or computer program product.
[0140] For example, a system within the scope of the present descriptions may include a processor and logic in and/or executable by the processor to cause the processor to perform steps of a method as described herein.
[0141] Similarly, a computer program product within the scope of the present descriptions may include a computer readable storage medium having program code embodied therewith, the program code readable/executable by a processor to cause the processor to perform steps of a method as described herein.
[0142] The inventive concepts disclosed herein have been presented by way of example to illustrate the myriad features thereof in a plurality of illustrative scenarios, embodiments, and/or implementations. It should be appreciated that the concepts generally disclosed are to be considered as modular, and may be implemented in any combination, permutation, or synthesis thereof. In addition, any modification, alteration, or equivalent of the presently disclosed features, functions, and concepts that would be appreciated by a person having ordinary skill in the art upon reading the instant descriptions should also be considered within the scope of this disclosure.
[0143] Accordingly, one embodiment of the present invention includes all of the features disclosed herein, including those shown and described in conjunction with any of the FIGS. Other embodiments include subsets of the features disclosed herein and/or shown and described in conjunction with any of the FIGS. Such features, or subsets thereof, may be combined in any way using known techniques that would become apparent to one skilled in the art after reading the present description.
[0144] While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of an embodiment of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
Claims
What is claimed is:
1. A computer-implemented method, comprising:
identifying a region of interest within a digital image;
generating a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and
extracting data from some or all of the plurality of binarized images;
wherein extracting the data from some or all of the plurality of binarized images comprises:
generating at least one sequence of candidate extraction results for each grouping of one or more connected components depicted within the region of interest;
determining an optimal extraction result within each sequence of candidate extraction results;
assembling all of the optimal extraction results into a single string of the one or more connected components; and
wherein determining the optimal extraction result within each sequence of candidate extraction results comprises selecting one extraction result within each sequence of candidate extraction results so as to minimize intensity differences between the optimal extraction results assembled into the single string; and
wherein at least some of the connected components are text characters.
2. The computer-implemented method as recited in claim 1, wherein the region of interest comprises a plurality of connected components; and
wherein each of the plurality of binarized images corresponds to a different combination of:
one of the plurality of connected components; and
one of the plurality of binarization thresholds.
3. The computer-implemented method as recited in claim 1, wherein the region of interest comprises a plurality of connected components; and
wherein extracting the data is performed on a per-component basis for at least some of the plurality of connected components.
4. The computer-implemented method as recited in claim 1, wherein the region of interest comprises a plurality of connected components;
wherein extracting the data comprises estimating an identity of some or all of the plurality of connected components within one or more of the plurality of binarized images;
wherein the identity of some or all of the plurality of connected components within one or more of the plurality of binarized images comprises the character, location, size, shape or color; and
the method further comprising determining a confidence of the estimated identity of some or all of the plurality of connected components.
5. The computer-implemented method as recited in claim 4, wherein determining the confidence of the estimated identity of some or all of the plurality of connected components comprises comparing the estimated identity of each respective one of the plurality of connected components for which the identity was estimated with an expected identity of the respective one of the plurality of connected components.
6. The computer-implemented method as recited in claim 4, wherein determining the confidence of the estimated identity of some or all of the plurality of connected components comprises comparing an estimated location of each respective one of the plurality of connected components for which the identity was estimated with an expected location of the respective one of the plurality of connected components.
7. The computer-implemented method as recited in claim 4, wherein some or all of the plurality of connected components comprise non-textual information; and
wherein determining the confidence of the estimated identity of some or all of the plurality of connected components comprises classifying some or all of the connected components for which the identity was estimated based on image features.
8. The computer-implemented method as recited in claim 4, comprising determining whether the confidence of the estimated identity of one of the plurality of connected components is less than a predetermined confidence threshold.
9. The computer-implemented method as recited in claim 8, comprising, in response to determining the confidence of the estimated identity of the one of the plurality of connected components is less than the predetermined confidence threshold, estimating the identity of the one of the plurality of connected components based on a different one of the plurality of binarized images than the one of the plurality of binarized images for which the confidence of the estimated identity of one of the plurality of connected components was determined to be less than the predetermined confidence threshold.
10. The computer-implemented method as recited in claim 1, wherein each sequence of candidate extraction results comprises a plurality of candidate extraction results each corresponding to the same grouping of one or more of the connected components depicted within the region of interest; and
wherein each of the plurality of candidate extraction results in each respective sequence of candidate extraction results corresponds to a different one of the plurality of binarization thresholds.
11. The computer-implemented method as recited in claim 10, wherein at least one of the plurality of candidate results from each of at least two of the sequences of candidate extraction results correspond to a same one of the plurality of binarization thresholds.
12. The computer-implemented method as recited in claim 1, wherein the region of interest comprises a plurality of connected components; and
wherein at least two of the plurality of connected components are extracted from different ones of the plurality of binarized images.
13. The computer-implemented method as recited in claim 1, comprising normalizing color within the digital image or the region of interest prior to thresholding;
wherein normalizing color includes normalizing intensity values across one or more color channels to stretch the channel along a single normalized scale; and
the one or more color channels being selected from a group consisting of: R, G and B.
14. The computer-implemented method as recited in claim 1, comprising: validating the extracted data; and
inferring a classification of an object depicted in the digital image based on validating the extracted data.
15. A system, comprising: a processor; and logic integrated with and/or executable by the processor to cause the processor to:
identify a region of interest within a digital image, wherein the region of interest comprises a plurality of connected components;
generate a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and
extract data from some or all of the plurality of binarized images, wherein the data comprise a potential character identity of one or more of the plurality of connected components;
wherein the region of interest is characterized by a complex background overlapped by the plurality of connected components;
wherein one or more of the connected components overlap or are obscured by one or more unique background elements such that no single binarization threshold applied to a region encompassing the one or more of the plurality of connected components can identify the one or more of the connected components that overlap or are obscured by the one or more unique background elements.
16. A computer program product, comprising a non-transitory computer readable medium having embodied therewith computer readable program instructions configured to cause a processor, upon execution thereof, to:
identify, using the processor, a region of interest within a digital image;
generate, using the processor, a plurality of binarized images based on the region of interest, wherein some or all of the binarized images are generated using a different one of a plurality of binarization thresholds; and
subjecting the region of interest within a digital image to a plurality of thresholding and extraction iterations;
extract, using the processor, data from some or all of the plurality of binarized images;
wherein the extracted data comprises one or more connected components represented in the plurality of binarized images; and
wherein one or more of the connected components overlap or are obscured by one or more unique background elements such that no single binarization threshold applied to a region encompassing the one or more connected components can identify the one or more of the connected components that overlap or are obscured by the one or more unique background elements.
17. The computer-implemented method of claim 5, wherein the expected identity of the respective one of the plurality of connected components is based on either:
a priori information derived from a training set of digital images; or
extraction results obtained from other of the plurality of images.
18. The computer-implemented method as recited in claim 1, wherein the region of interest is characterized by a complex background forming a trouble region with respect to extracting the data.
19. The computer-implemented method as recited in claim 1, wherein one or more of the connected components overlap or are obscured by one or more unique background elements such that no single binarization threshold applied to a region encompassing the one or more connected components can identify the one or more of the connected components that overlap or are obscured by the one or more unique background elements.
20. The computer-implemented method as recited in claim 1, wherein the region of interest comprises a plurality of connected components; and
wherein each of the plurality of binarized images depicts at least one of the plurality of connected components at a different level of image intensity.
Patent Citations (891)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US16601102 | 1928-02-01 | Appelt et al. | Applicant |
| US3069654(A) | 1962-12-01 | Hough | Applicant |
| US3696599(A) | 1972-10-01 | Palmer et al. | Applicant |
| US4558461(A) | 1985-12-01 | Schlang | Applicant |
| US4651287(A) | 1987-03-01 | Tsao | Applicant |
| US4656665(A) | 1987-04-01 | Pennebaker | Applicant |
| US4836026(A) | 1989-06-01 | P'an et al. | Applicant |
| US4903312(A) | 1990-02-01 | Sato | Applicant |
| US4992863(A) | 1991-02-01 | Moriya | Applicant |
| US5020112(A) | 1991-05-01 | Chou | Applicant |
| US5063604(A) | 1991-11-01 | Weiman | Applicant |
| US5101448(A) | 1992-03-01 | Kawachiya et al. | Applicant |
| US5124810(A) | 1992-06-01 | Seto | Applicant |
| US5151260(A) | 1992-09-01 | Contursi et al. | Applicant |
| US5159667(A) | 1992-10-01 | Borrey et al. | Applicant |
| US5181260(A) | 1993-01-01 | Kurosu et al. | Applicant |
| US5202934(A) | 1993-04-01 | Miyakawa et al. | Applicant |
| US5220621(A) | 1993-06-01 | Saitoh | Applicant |
| US5268967(A) | 1993-12-01 | Jang et al. | Applicant |
| US5282055(A) | 1994-01-01 | Suzuki | Applicant |
| US5293429(A) | 1994-03-01 | Pizano et al. | Applicant |
| US5313527(A) | 1994-05-01 | Guberman et al. | Applicant |
| US5317646(A) | 1994-05-01 | Sang, Jr. et al. | Applicant |
| US5321770(A) | 1994-06-01 | Huttenlocher et al. | Applicant |
| US5344132(A) | 1994-09-01 | LeBrun et al. | Applicant |
| US5353673(A) | 1994-10-01 | Lynch | Applicant |
| US5355547(A) | 1994-10-01 | Fitjer | Applicant |
| US5375197(A) | 1994-12-01 | Kang | Applicant |
| US5430810(A) | 1995-07-01 | Saeki | Applicant |
| US5467407(A) | 1995-11-01 | Guberman et al. | Applicant |
| US5473742(A) | 1995-12-01 | Polyakov et al. | Applicant |
| US5546474(A) | 1996-08-01 | Zuniga | Applicant |
| US5563723(A) | 1996-10-01 | Beaulieu et al. | Applicant |
| US5563966(A) | 1996-10-01 | Ise et al. | Applicant |
| US5586199(A) | 1996-12-01 | Kanda et al. | Applicant |
| US5594815(A) | 1997-01-01 | Fast et al. | Applicant |
| US5596655(A) | 1997-01-01 | Lopez | Applicant |
| US5602964(A) | 1997-02-01 | Barrett | Applicant |
| US5629989(A) | 1997-05-01 | Osada | Applicant |
| US5652663(A) | 1997-07-01 | Zelten | Applicant |
| US5668890(A) | 1997-09-01 | Winkelman | Applicant |
| US5680525(A) | 1997-10-01 | Sakai et al. | Applicant |
| US5696611(A) | 1997-12-01 | Nishimura et al. | Applicant |
| US5696805(A) | 1997-12-01 | Gaborski et al. | Applicant |
| US5699244(A) | 1997-12-01 | Clark, Jr. et al. | Applicant |
| US5717794(A) | 1998-02-01 | Koga et al. | Applicant |
| US5721940(A) | 1998-02-01 | Luther et al. | Applicant |
| US5757963(A) | 1998-05-01 | Ozaki et al. | Applicant |
| US5760912(A) | 1998-06-01 | Itoh | Applicant |
| US5781665(A) | 1998-07-01 | Cullen et al. | Applicant |
| US5818978(A) | 1998-10-01 | Al-Hussein | Applicant |
| US5822454(A) | 1998-10-01 | Rangarajan | Applicant |
| US5825915(A) | 1998-10-01 | Michimoto et al. | Applicant |
| US5832138(A) | 1998-11-01 | Nakanishi et al. | Applicant |
| US5839019(A) | 1998-11-01 | Ito | Applicant |
| US5848184(A) | 1998-12-01 | Taylor et al. | Applicant |
| US5857029(A) | 1999-01-01 | Patel | Applicant |
| US5867264(A) | 1999-02-01 | Hinnrichs | Applicant |
| US5899978(A) | 1999-05-01 | Irwin | Applicant |
| US5923763(A) | 1999-07-01 | Walker et al. | Applicant |
| US5937084(A) | 1999-08-01 | Crabtree et al. | Applicant |
| US5953388(A) | 1999-09-01 | Walnut et al. | Applicant |
| US5956468(A) | 1999-09-01 | Ancin | Applicant |
| US5987172(A) | 1999-11-01 | Michael | Applicant |
| US3005958(A) | 1999-12-01 | Farmer et al. | Applicant |
| US6002489(A) | 1999-12-01 | Murai et al. | Applicant |
| US6005968(A) | 1999-12-01 | Granger | Applicant |
| US6009191(A) | 1999-12-01 | Julier | Applicant |
| US6009196(A) | 1999-12-01 | Mahoney | Applicant |
| US6011595(A) | 2000-01-01 | Henderson et al. | Applicant |
| US6016361(A) | 2000-01-01 | Hongu et al. | Applicant |
| US6038348(A) | 2000-03-01 | Carley | Applicant |
| US6052124(A) | 2000-04-01 | Stein et al. | Applicant |
| US6055968(A) | 2000-05-01 | Sasaki et al. | Applicant |
| US6067385(A) | 2000-05-01 | Cullen et al. | Applicant |
| US6072916(A) | 2000-06-01 | Suzuki | Applicant |
| US6073148(A) | 2000-06-01 | Rowe et al. | Applicant |
| US6094198(A) | 2000-07-01 | Shashua | Applicant |
| US6098065(A) | 2000-08-01 | Skillen et al. | Applicant |
| US6104830(A) | 2000-08-01 | Schistad | Applicant |
| US6104840(A) | 2000-08-01 | Ejiri et al. | Applicant |
| US6118544(A) | 2000-09-01 | Rao | Applicant |
| US6118552(A) | 2000-09-01 | Suzuki et al. | Applicant |
| US6154217(A) | 2000-11-01 | Aldrich | Applicant |
| US6192360(B1) | 2001-02-01 | Dumais et al. | Applicant |
| US6215469(B1) | 2001-04-01 | Mori et al. | Applicant |
| US6219158(B1) | 2001-04-01 | Dawe | Applicant |
| US6219773(B1) | 2001-04-01 | Garibay, Jr. et al. | Applicant |
| US6223223(B1) | 2001-04-01 | Kumpf et al. | Applicant |
| US6229625(B1) | 2001-05-01 | Nakatsuka | Applicant |
| US6233059(B1) | 2001-05-01 | Kodaira et al. | Applicant |
| US6263122(B1) | 2001-07-01 | Simske et al. | Applicant |
| US6292168(B1) | 2001-09-01 | Venable et al. | Applicant |
| US6327581(B1) | 2001-12-01 | Platt | Applicant |
| US6337925(B1) | 2002-01-01 | Cohen et al. | Applicant |
| US6347152(B1) | 2002-02-01 | Shinagawa et al. | Applicant |
| US6347162(B1) | 2002-02-01 | Suzuki | Applicant |
| US6356647(B1) | 2002-03-01 | Bober et al. | Applicant |
| US6370277(B1) | 2002-04-01 | Borrey et al. | Applicant |
| US6385346(B1) | 2002-05-01 | Gillihan et al. | Applicant |
| US6393147(B2) | 2002-05-01 | Danneels et al. | Applicant |
| US6396599(B1) | 2002-05-01 | Patton et al. | Applicant |
| US6408094(B1) | 2002-06-01 | Mirzaoff et al. | Applicant |
| US6408105(B1) | 2002-06-01 | Maruo | Applicant |
| US6424742(B2) | 2002-07-01 | Yamamoto et al. | Applicant |
| US6426806(B2) | 2002-07-01 | Melen | Applicant |
| US6433896(B1) | 2002-08-01 | Ueda et al. | Applicant |
| US6456738(B1) | 2002-09-01 | Tsukasa | Applicant |
| US6463430(B1) | 2002-10-01 | Brady et al. | Applicant |
| US6469801(B1) | 2002-10-01 | Telle | Applicant |
| US6473198(B1) | 2002-10-01 | Matama | Applicant |
| US6473535(B1) | 2002-10-01 | Takaoka | Applicant |
| US6480304(B1) | 2002-11-01 | Os et al. | Applicant |
| US6480624(B1) | 2002-11-01 | Horie et al. | Applicant |
| US6501855(B1) | 2002-12-01 | Zelinski | Applicant |
| US6512848(B2) | 2003-01-01 | Wang et al. | Applicant |
| US6522791(B2) | 2003-02-01 | Nagarajan | Applicant |
| US6525840(B1) | 2003-02-01 | Haraguchi et al. | Applicant |
| US6563531(B1) | 2003-05-01 | Matama | Applicant |
| US6571008(B1) | 2003-05-01 | Bandyopadhyay et al. | Applicant |
| US6601026(B2) | 2003-07-01 | Appelt et al. | Applicant |
| US6614930(B1) | 2003-09-01 | Agnihotri et al. | Applicant |
| US6621595(B1) | 2003-09-01 | Fan et al. | Applicant |
| US6628416(B1) | 2003-09-01 | Hsu et al. | Applicant |
| US6628808(B1) | 2003-09-01 | Bach et al. | Applicant |
| US6633857(B1) | 2003-10-01 | Tipping | Applicant |
| US6643413(B1) | 2003-11-01 | Shum et al. | Applicant |
| US6646765(B1) | 2003-11-01 | Barker et al. | Applicant |
| US6658147(B2) | 2003-12-01 | Gorbatov et al. | Applicant |
| US6665425(B1) | 2003-12-01 | Sampath et al. | Applicant |
| US6667774(B2) | 2003-12-01 | Berman et al. | Applicant |
| US6675159(B1) | 2004-01-01 | Lin et al. | Applicant |
| US6701009(B1) | 2004-03-01 | Makoto et al. | Applicant |
| US6704441(B1) | 2004-03-01 | Inagaki et al. | Applicant |
| US6724916(B1) | 2004-04-01 | Shyu | Applicant |
| US6729733(B1) | 2004-05-01 | Raskar et al. | Applicant |
| US6732046(B1) | 2004-05-01 | Joshi | Applicant |
| US6748109(B1) | 2004-06-01 | Yamaguchi | Applicant |
| US6751349(B2) | 2004-06-01 | Matama | Applicant |
| US6757081(B1) | 2004-06-01 | Fan et al. | Applicant |
| US6757427(B1) | 2004-06-01 | Hongu | Applicant |
| US6763515(B1) | 2004-07-01 | Vazquez et al. | Applicant |
| US6765685(B1) | 2004-07-01 | Yu | Applicant |
| US6778684(B1) | 2004-08-01 | Bollman | Applicant |
| US6781375(B2) | 2004-08-01 | Miyazaki et al. | Applicant |
| US6788830(B1) | 2004-09-01 | Morikawa | Applicant |
| US6789069(B1) | 2004-09-01 | Barnhill et al. | Applicant |
| US6801658(B2) | 2004-10-01 | Morita et al. | Applicant |
| US6816187(B1) | 2004-11-01 | Iwai et al. | Applicant |
| US6826311(B2) | 2004-11-01 | Wilt | Applicant |
| US6831755(B1) | 2004-12-01 | Narushima et al. | Applicant |
| US6839466(B2) | 2005-01-01 | Venable | Applicant |
| US6850653(B2) | 2005-02-01 | Abe | Applicant |
| US6873721(B1) | 2005-03-01 | Beyerer et al. | Applicant |
| US6882983(B2) | 2005-04-01 | Furphy et al. | Applicant |
| US6898601(B2) | 2005-05-01 | Amado et al. | Applicant |
| US6901170(B1) | 2005-05-01 | Terada et al. | Applicant |
| US6917438(B1) | 2005-07-01 | Yoda et al. | Applicant |
| US6917709(B2) | 2005-07-01 | Zelinski | Applicant |
| US6921220(B2) | 2005-07-01 | Aiyama | Applicant |
| US6950555(B2) | 2005-09-01 | Filatov et al. | Applicant |
| US6987534(B1) | 2006-01-01 | Seta | Applicant |
| US6989914(B2) | 2006-01-01 | Iwaki | Applicant |
| US6999625(B1) | 2006-02-01 | Nelson | Applicant |
| US7006707(B2) | 2006-02-01 | Peterson | Applicant |
| US7016549(B1) | 2006-03-01 | Utagawa | Applicant |
| US7017108(B1) | 2006-03-01 | Wan | Applicant |
| US7020320(B2) | 2006-03-01 | Filatov | Applicant |
| US7023447(B2) | 2006-04-01 | Luo et al. | Applicant |
| US7027181(B2) | 2006-04-01 | Takamori | Applicant |
| US7038713(B1) | 2006-05-01 | Matama | Applicant |
| US7042603(B2) | 2006-05-01 | Masao et al. | Applicant |
| US7043080(B1) | 2006-05-01 | Dolan | Applicant |
| US7054036(B2) | 2006-05-01 | Hirayama | Applicant |
| US7081975(B2) | 2006-07-01 | Yoda et al. | Applicant |
| US7082426(B2) | 2006-07-01 | Musgrove et al. | Applicant |
| US7107285(B2) | 2006-09-01 | von Kaenel et al. | Applicant |
| US7123292(B1) | 2006-10-01 | Seeger et al. | Applicant |
| US7123387(B2) | 2006-10-01 | Cheng et al. | Applicant |
| US7130471(B2) | 2006-10-01 | Bossut et al. | Applicant |
| US7145699(B2) | 2006-12-01 | Dolan | Applicant |
| US7149347(B1) | 2006-12-01 | Wnek | Applicant |
| US7167281(B1) | 2007-01-01 | Fujimoto | Examiner |
| US7168614(B2) | 2007-01-01 | Kotovich et al. | Applicant |
| US7173732(B2) | 2007-02-01 | Matama | Applicant |
| US7174043(B2) | 2007-02-01 | Lossev et al. | Applicant |
| US7177049(B2) | 2007-02-01 | Karidi | Applicant |
| US7181082(B2) | 2007-02-01 | Feng | Applicant |
| US7184929(B2) | 2007-02-01 | Goodman | Applicant |
| US7194471(B1) | 2007-03-01 | Nagatsuka et al. | Applicant |
| US7197158(B2) | 2007-03-01 | Camara et al. | Applicant |
| US7201323(B2) | 2007-04-01 | Kotovich et al. | Applicant |
| US7209599(B2) | 2007-04-01 | Simske et al. | Applicant |
| US7228314(B2) | 2007-06-01 | Kawamoto et al. | Applicant |
| US7249717(B2) | 2007-07-01 | Kotovich et al. | Applicant |
| US7251777(B1) | 2007-07-01 | Valtchev et al. | Applicant |
| US7253836(B1) | 2007-08-01 | Suzuki et al. | Applicant |
| US7263221(B1) | 2007-08-01 | Moriwaki | Applicant |
| US7266768(B2) | 2007-09-01 | Ferlitsch et al. | Applicant |
| US7286177(B2) | 2007-10-01 | Cooper | Applicant |
| US7298897(B1) | 2007-11-01 | Dominguez et al. | Applicant |
| US7317828(B2) | 2008-01-01 | Suzuki et al. | Applicant |
| US7337389(B1) | 2008-02-01 | Woolf et al. | Applicant |
| US7339585(B2) | 2008-03-01 | Verstraelen et al. | Applicant |
| US7340376(B2) | 2008-03-01 | Goodman | Applicant |
| US7349888(B1) | 2008-03-01 | Heidenreich et al. | Applicant |
| US7365881(B2) | 2008-04-01 | Burns et al. | Applicant |
| US7366705(B2) | 2008-04-01 | Zeng et al. | Applicant |
| US7382921(B2) | 2008-06-01 | Lossev et al. | Applicant |
| US7386527(B2) | 2008-06-01 | Harris et al. | Applicant |
| US7392426(B2) | 2008-06-01 | Wolfe et al. | Applicant |
| US7403008(B2) | 2008-07-01 | Blank et al. | Applicant |
| US7403313(B2) | 2008-07-01 | Kuo | Applicant |
| US7406183(B2) | 2008-07-01 | Emerson et al. | Applicant |
| US7409092(B2) | 2008-08-01 | Srinivasa | Applicant |
| US7409633(B2) | 2008-08-01 | Lerner et al. | Applicant |
| US7416131(B2) | 2008-08-01 | Fortune et al. | Applicant |
| US7426293(B2) | 2008-09-01 | Chien et al. | Applicant |
| US7430059(B2) | 2008-09-01 | Rodrigues et al. | Applicant |
| US7430066(B2) | 2008-09-01 | Hsu et al. | Applicant |
| US7430310(B2) | 2008-09-01 | Kotovich et al. | Applicant |
| US7447377(B2) | 2008-11-01 | Takahira | Applicant |
| US7464066(B2) | 2008-12-01 | Zelinski et al. | Applicant |
| US7478332(B2) | 2009-01-01 | Buttner et al. | Applicant |
| US7487438(B1) | 2009-02-01 | Withers | Applicant |
| US7492478(B2) | 2009-02-01 | Une | Applicant |
| US7492943(B2) | 2009-02-01 | Li et al. | Applicant |
| US7515313(B2) | 2009-04-01 | Cheng | Applicant |
| US7515772(B2) | 2009-04-01 | Li et al. | Applicant |
| US7528883(B2) | 2009-05-01 | Hsu | Applicant |
| US7542931(B2) | 2009-06-01 | Black et al. | Applicant |
| US7545529(B2) | 2009-06-01 | Borrey et al. | Applicant |
| US7553095(B2) | 2009-06-01 | Kimura | Applicant |
| US7562060(B2) | 2009-07-01 | Sindhwani et al. | Applicant |
| US7580557(B2) | 2009-08-01 | Zavadsky et al. | Applicant |
| US7636479(B2) | 2009-12-01 | Luo et al. | Applicant |
| US7639387(B2) | 2009-12-01 | Hull et al. | Applicant |
| US7643665(B2) | 2010-01-01 | Zavadsky et al. | Applicant |
| US7651286(B2) | 2010-01-01 | Tischler | Applicant |
| US7655685(B2) | 2010-02-01 | McElroy et al. | Applicant |
| US7657091(B2) | 2010-02-01 | Postnikov et al. | Applicant |
| US7665061(B2) | 2010-02-01 | Kothari et al. | Applicant |
| US7673799(B2) | 2010-03-01 | Hart et al. | Applicant |
| US7702162(B2) | 2010-04-01 | Cheong et al. | Applicant |
| US7735721(B1) | 2010-06-01 | Ma et al. | Applicant |
| US7738730(B2) | 2010-06-01 | Hawley | Applicant |
| US7739127(B1) | 2010-06-01 | Hall | Applicant |
| US7761391(B2) | 2010-07-01 | Schmidtler et al. | Applicant |
| US7778457(B2) | 2010-08-01 | Nepomniachtchi et al. | Applicant |
| US7782384(B2) | 2010-08-01 | Kelly | Applicant |
| US7787695(B2) | 2010-08-01 | Nepomniachtchi et al. | Applicant |
| US7937345(B2) | 2011-05-01 | Schmidtler et al. | Applicant |
| US7941744(B2) | 2011-05-01 | Oppenlander et al. | Applicant |
| US7949167(B2) | 2011-05-01 | Krishnan et al. | Applicant |
| US7949176(B2) | 2011-05-01 | Nepomniachtchi | Applicant |
| US7949660(B2) | 2011-05-01 | Green et al. | Applicant |
| US7953268(B2) | 2011-05-01 | Nepomniachtchi | Applicant |
| US7958067(B2) | 2011-06-01 | Schmidtler et al. | Applicant |
| US7978900(B2) | 2011-07-01 | Nepomniachtchi et al. | Applicant |
| US7999961(B2) | 2011-08-01 | Wanda | Applicant |
| US8000514(B2) | 2011-08-01 | Nepomniachtchi et al. | Applicant |
| US8035641(B1) | 2011-10-01 | O'Donnell | Applicant |
| US8059888(B2) | 2011-11-01 | Chen et al. | Applicant |
| US8064710(B2) | 2011-11-01 | Mizoguchi | Applicant |
| US8073263(B2) | 2011-12-01 | Hull et al. | Applicant |
| US8078958(B2) | 2011-12-01 | Cottrille et al. | Applicant |
| US8081227(B1) | 2011-12-01 | Kim et al. | Applicant |
| US8094976(B2) | 2012-01-01 | Berard et al. | Applicant |
| US8126924(B1) | 2012-02-01 | Herin | Applicant |
| US8135656(B2) | 2012-03-01 | Evanitsky | Applicant |
| US8136114(B1) | 2012-03-01 | Gailloux et al. | Applicant |
| US8184156(B2) | 2012-05-01 | Mino et al. | Applicant |
| US8194965(B2) | 2012-06-01 | Lossev et al. | Applicant |
| US8213687(B2) | 2012-07-01 | Fan | Applicant |
| US8238880(B2) | 2012-08-01 | Jin et al. | Applicant |
| US8239335(B2) | 2012-08-01 | Schmidtler et al. | Applicant |
| US8244031(B2) | 2012-08-01 | Cho et al. | Applicant |
| US8265422(B1) | 2012-09-01 | Jin | Applicant |
| US8279465(B2) | 2012-10-01 | Couchman | Applicant |
| US8295599(B2) | 2012-10-01 | Katougi et al. | Applicant |
| US8311296(B2) | 2012-11-01 | Filatov et al. | Applicant |
| US8326015(B2) | 2012-12-01 | Nepomniachtchi | Applicant |
| US8345981(B2) | 2013-01-01 | Schmidtler et al. | Applicant |
| US8354981(B2) | 2013-01-01 | Kawasaki et al. | Applicant |
| US8374977(B2) | 2013-02-01 | Schmidtler et al. | Applicant |
| US8379914(B2) | 2013-02-01 | Nepomniachtchi et al. | Applicant |
| US8385647(B2) | 2013-02-01 | Hawley et al. | Applicant |
| US8406480(B2) | 2013-03-01 | Grigsby et al. | Applicant |
| US8433775(B2) | 2013-04-01 | Buchhop et al. | Applicant |
| US8441548(B1) | 2013-05-01 | Nechyba et al. | Applicant |
| US8443286(B2) | 2013-05-01 | Cameron | Applicant |
| US8452098(B2) | 2013-05-01 | Nepomniachtchi et al. | Applicant |
| US8478052(B1) | 2013-07-01 | Yee et al. | Applicant |
| US8483473(B2) | 2013-07-01 | Roach et al. | Applicant |
| US8503769(B2) | 2013-08-01 | Baker et al. | Applicant |
| US8503797(B2) | 2013-08-01 | Turkelson et al. | Applicant |
| US8515163(B2) | 2013-08-01 | Cho et al. | Applicant |
| US8515208(B2) | 2013-08-01 | Minerich | Applicant |
| US8526739(B2) | 2013-09-01 | Schmidtler et al. | Applicant |
| US8532374(B2) | 2013-09-01 | Chen et al. | Applicant |
| US8532419(B2) | 2013-09-01 | Coleman | Applicant |
| US8553984(B2) | 2013-10-01 | Slotine et al. | Applicant |
| US8559766(B2) | 2013-10-01 | Tilt et al. | Applicant |
| US8577118(B2) | 2013-11-01 | Nepomniachtchi et al. | Applicant |
| US8582862(B2) | 2013-11-01 | Nepomniachtchi et al. | Applicant |
| US8587818(B2) | 2013-11-01 | Imaizumi et al. | Applicant |
| US8620058(B2) | 2013-12-01 | Nepomniachtchi et al. | Applicant |
| US8620078(B1) | 2013-12-01 | Chapleau | Examiner |
| US8639621(B1) | 2014-01-01 | Ellis et al. | Applicant |
| US8675953(B1) | 2014-03-01 | Elwell et al. | Applicant |
| US8676165(B2) | 2014-03-01 | Cheng et al. | Applicant |
| US8677249(B2) | 2014-03-01 | Buttner et al. | Applicant |
| US8681150(B2) | 2014-03-01 | Kim et al. | Applicant |
| US8693043(B2) | 2014-04-01 | Schmidtler et al. | Applicant |
| US8705836(B2) | 2014-04-01 | Gorski et al. | Applicant |
| US8719197(B2) | 2014-05-01 | Schmidtler et al. | Applicant |
| US8724907(B1) | 2014-05-01 | Sampson et al. | Applicant |
| US8745488(B1) | 2014-06-01 | Wong | Applicant |
| US8749839(B2) | 2014-06-01 | Borrey et al. | Applicant |
| US8774516(B2) | 2014-07-01 | Amtrup et al. | Applicant |
| US8805125(B1) | 2014-08-01 | Kumar et al. | Applicant |
| US8811751(B1) | 2014-08-01 | Ma | Examiner |
| US8813111(B2) | 2014-08-01 | Guerin et al. | Applicant |
| US8823991(B2) | 2014-09-01 | Borrey et al. | Applicant |
| US8855375(B2) | 2014-10-01 | Macciola et al. | Applicant |
| US8855425(B2) | 2014-10-01 | Schmidtler et al. | Applicant |
| US8879120(B2) | 2014-11-01 | Thrasher et al. | Applicant |
| US8879783(B1) | 2014-11-01 | Wang et al. | Applicant |
| US8879846(B2) | 2014-11-01 | Amtrup et al. | Applicant |
| US8885229(B1) | 2014-11-01 | Amtrup et al. | Applicant |
| US8908977(B2) | 2014-12-01 | King | Applicant |
| US8918357(B2) | 2014-12-01 | Minocha et al. | Applicant |
| US8955743(B1) | 2015-02-01 | Block et al. | Applicant |
| US8971587(B2) | 2015-03-01 | Macciola et al. | Applicant |
| US8989515(B2) | 2015-03-01 | Shustorovich et al. | Applicant |
| US8995012(B2) | 2015-03-01 | Heit et al. | Applicant |
| US8995769(B2) | 2015-03-01 | Carr | Applicant |
| US9020432(B2) | 2015-04-01 | Matsushita et al. | Applicant |
| US9058327(B1) | 2015-06-01 | Lehrman et al. | Applicant |
| US9058515(B1) | 2015-06-01 | Amtrup et al. | Applicant |
| US9058580(B1) | 2015-06-01 | Amtrup et al. | Applicant |
| US9064316(B2) | 2015-06-01 | Eid et al. | Applicant |
| US9117117(B2) | 2015-08-01 | Macciola et al. | Applicant |
| US9129210(B2) | 2015-09-01 | Borrey et al. | Applicant |
| US9135277(B2) | 2015-09-01 | Petrou | Applicant |
| US9137417(B2) | 2015-09-01 | Macciola et al. | Applicant |
| US9141926(B2) | 2015-09-01 | Kilby et al. | Applicant |
| US9158967(B2) | 2015-10-01 | Shustorovich et al. | Applicant |
| US9165187(B2) | 2015-10-01 | Macciola et al. | Applicant |
| US9165188(B2) | 2015-10-01 | Thrasher et al. | Applicant |
| US9183224(B2) | 2015-11-01 | Petrou et al. | Applicant |
| US9208536(B2) | 2015-12-01 | Macciola et al. | Applicant |
| US9239713(B1) | 2016-01-01 | Lakshman et al. | Applicant |
| US9251614(B1) | 2016-02-01 | Tian | Examiner |
| US9253349(B2) | 2016-02-01 | Amtrup et al. | Applicant |
| US9275281(B2) | 2016-03-01 | Macciola | Applicant |
| US9277022(B2) | 2016-03-01 | Lee et al. | Applicant |
| US9292815(B2) | 2016-03-01 | Vibhor et al. | Applicant |
| US9298979(B2) | 2016-03-01 | Nepomniachtchi et al. | Applicant |
| US9311531(B2) | 2016-04-01 | Amtrup et al. | Applicant |
| US9342741(B2) | 2016-05-01 | Amtrup et al. | Applicant |
| US9342742(B2) | 2016-05-01 | Amtrup et al. | Applicant |
| US9355312(B2) | 2016-05-01 | Amtrup et al. | Applicant |
| US9367899(B1) | 2016-06-01 | Fang | Examiner |
| US9373057(B1) | 2016-06-01 | Erhan et al. | Applicant |
| US9386235(B2) | 2016-07-01 | Ma et al. | Applicant |
| US9405772(B2) | 2016-08-01 | Petrou et al. | Applicant |
| US9436921(B2) | 2016-09-01 | Whitmore | Applicant |
| US9483794(B2) | 2016-11-01 | Amtrup et al. | Applicant |
| US9514357(B2) | 2016-12-01 | Macciola et al. | Applicant |
| US9576272(B2) | 2017-02-01 | Macciola et al. | Applicant |
| US9584729(B2) | 2017-02-01 | Amtrup et al. | Applicant |
| US9648297(B1) | 2017-05-01 | Ettinger et al. | Applicant |
| US9747504(B2) | 2017-08-01 | Ma et al. | Applicant |
| US9754164(B2) | 2017-09-01 | Macciola et al. | Applicant |
| US9760788(B2) | 2017-09-01 | Shustorovich et al. | Applicant |
| US9767354(B2) | 2017-09-01 | Thompson et al. | Applicant |
| US9767379(B2) | 2017-09-01 | Macciola et al. | Applicant |
| US9769354(B2) | 2017-09-01 | Thrasher et al. | Applicant |
| US9779296(B1) | 2017-10-01 | Ma et al. | Applicant |
| US9819825(B2) | 2017-11-01 | Amtrup et al. | Applicant |
| US9934433(B2) | 2018-04-01 | Thompson et al. | Applicant |
| US9946954(B2) | 2018-04-01 | Macciola et al. | Applicant |
| US9978024(B2) | 2018-05-01 | Ryan et al. | Applicant |
| US9996741(B2) | 2018-06-01 | Amtrup et al. | Applicant |
| US10108860(B2) | 2018-10-01 | Ma et al. | Applicant |
| US10127441(B2) | 2018-11-01 | Amtrup et al. | Applicant |
| US10127636(B2) | 2018-11-01 | Ma et al. | Applicant |
| US2001/0027420(A1) | 2001-10-01 | Boublik et al. | Applicant |
| US2002/0030831(A1) | 2002-03-01 | Kinjo | Applicant |
| US2002/0054693(A1) | 2002-05-01 | Elmenhurst | Applicant |
| US2002/0069218(A1) | 2002-06-01 | Sull et al. | Applicant |
| US2002/0113801(A1) | 2002-08-01 | Reavy et al. | Applicant |
| US2002/0122071(A1) | 2002-09-01 | Camara et al. | Applicant |
| US2002/0126313(A1) | 2002-09-01 | Namizuka | Applicant |
| US2002/0165717(A1) | 2002-11-01 | Solmer et al. | Applicant |
| US2003/0002068(A1) | 2003-01-01 | Constantin et al. | Applicant |
| US2003/0007683(A1) | 2003-01-01 | Wang et al. | Applicant |
| US2003/0026479(A1) | 2003-02-01 | Thomas et al. | Applicant |
| US2003/0030638(A1) | 2003-02-01 | Astrom et al. | Applicant |
| US2003/0044012(A1) | 2003-03-01 | Eden | Applicant |
| US2003/0046445(A1) | 2003-03-01 | Witt et al. | Applicant |
| US2003/0053696(A1) | 2003-03-01 | Schmidt et al. | Applicant |
| US2003/0063213(A1) | 2003-04-01 | Poplin | Applicant |
| US2003/0086615(A1) | 2003-05-01 | Dance et al. | Applicant |
| US2003/0095709(A1) | 2003-05-01 | Zhou | Applicant |
| US2003/0101161(A1) | 2003-05-01 | Ferguson et al. | Applicant |
| US2003/0117511(A1) | 2003-06-01 | Belz et al. | Applicant |
| US2003/0120653(A1) | 2003-06-01 | Brady et al. | Applicant |
| US2003/0142328(A1) | 2003-07-01 | McDaniel et al. | Applicant |
| US2003/0151674(A1) | 2003-08-01 | Lin | Applicant |
| US2003/0156201(A1) | 2003-08-01 | Zhang | Applicant |
| US2003/0197063(A1) | 2003-10-01 | Longacre | Applicant |
| US2003/0210428(A1) | 2003-11-01 | Bevlin et al. | Applicant |
| US2003/0223615(A1) | 2003-12-01 | Keaton et al. | Applicant |
| US2004/0019274(A1) | 2004-01-01 | Galloway et al. | Applicant |
| US2004/0021909(A1) | 2004-02-01 | Kikuoka | Applicant |
| US2004/0022437(A1) | 2004-02-01 | Beardsley | Applicant |
| US2004/0022439(A1) | 2004-02-01 | Beardsley | Applicant |
| US2004/0049401(A1) | 2004-03-01 | Carr et al. | Applicant |
| US2004/0083119(A1) | 2004-04-01 | Schunder et al. | Applicant |
| US2004/0090458(A1) | 2004-05-01 | Yu et al. | Applicant |
| US2004/0093119(A1) | 2004-05-01 | Gunnarsson et al. | Applicant |
| US2004/0102989(A1) | 2004-05-01 | Jang et al. | Applicant |
| US2004/0111453(A1) | 2004-06-01 | Harris et al. | Applicant |
| US2004/0143547(A1) | 2004-07-01 | Mersky | Applicant |
| US2004/0143796(A1) | 2004-07-01 | Lerner et al. | Applicant |
| US2004/0169873(A1) | 2004-09-01 | Nagarajan | Applicant |
| US2004/0169889(A1) | 2004-09-01 | Sawada | Applicant |
| US2004/0175033(A1) | 2004-09-01 | Matama | Applicant |
| US2004/0181482(A1) | 2004-09-01 | Yap | Applicant |
| US2004/0190019(A1) | 2004-09-01 | Li et al. | Applicant |
| US2004/0223640(A1) | 2004-11-01 | Bovyrin | Applicant |
| US2004/0245334(A1) | 2004-12-01 | Sikorski | Applicant |
| US2004/0252190(A1) | 2004-12-01 | Antonis | Applicant |
| US2004/0261084(A1) | 2004-12-01 | Rosenbloom et al. | Applicant |
| US2004/0263639(A1) | 2004-12-01 | Sadovsky et al. | Applicant |
| US2005/0021360(A1) | 2005-01-01 | Miller et al. | Applicant |
| US2005/0030602(A1) | 2005-02-01 | Gregson et al. | Applicant |
| US2005/0046887(A1) | 2005-03-01 | Shibata et al. | Applicant |
| US2005/0050060(A1) | 2005-03-01 | Damm et al. | Applicant |
| US2005/0054342(A1) | 2005-03-01 | Otsuka | Applicant |
| US2005/0060162(A1) | 2005-03-01 | Mohit et al. | Applicant |
| US2005/0063585(A1) | 2005-03-01 | Matsuura | Applicant |
| US2005/0065903(A1) | 2005-03-01 | Zhang et al. | Applicant |
| US2005/0080844(A1) | 2005-04-01 | Dathathraya et al. | Applicant |
| US2005/0100209(A1) | 2005-05-01 | Lewis et al. | Applicant |
| US2005/0131780(A1) | 2005-06-01 | Princen | Applicant |
| US2005/0134935(A1) | 2005-06-01 | Schmidtler et al. | Applicant |
| US2005/0141777(A1) | 2005-06-01 | Kuwata | Applicant |
| US2005/0151990(A1) | 2005-07-01 | Ishikawa et al. | Applicant |
| US2005/0160065(A1) | 2005-07-01 | Seeman | Applicant |
| US2005/0163343(A1) | 2005-07-01 | Kakinami et al. | Applicant |
| US2005/0180628(A1) | 2005-08-01 | Curry et al. | Applicant |
| US2005/0180632(A1) | 2005-08-01 | Aradhye et al. | Applicant |
| US2005/0193325(A1) | 2005-09-01 | Epstein | Applicant |
| US2005/0204058(A1) | 2005-09-01 | Philbrick et al. | Applicant |
| US2005/0206753(A1) | 2005-09-01 | Sakurai et al. | Applicant |
| US2005/0212925(A1) | 2005-09-01 | Lefebure et al. | Applicant |
| US2005/0216426(A1) | 2005-09-01 | Weston et al. | Applicant |
| US2005/0216564(A1) | 2005-09-01 | Myers | Examiner |
| US2005/0226505(A1) | 2005-10-01 | Wilson | Examiner |
| US2005/0228591(A1) | 2005-10-01 | Hur et al. | Applicant |
| US2005/0234955(A1) | 2005-10-01 | Zeng et al. | Applicant |
| US2005/0246262(A1) | 2005-11-01 | Aggarwal et al. | Applicant |
| US2005/0265618(A1) | 2005-12-01 | Jebara | Applicant |
| US2005/0271265(A1) | 2005-12-01 | Wang et al. | Applicant |
| US2005/0273453(A1) | 2005-12-01 | Holloran | Applicant |
| US2006/0013463(A1) | 2006-01-01 | Ramsay et al. | Applicant |
| US2006/0017810(A1) | 2006-01-01 | Kurzweil et al. | Applicant |
| US2006/0023271(A1) | 2006-02-01 | Boay et al. | Applicant |
| US2006/0031344(A1) | 2006-02-01 | Mishima et al. | Applicant |
| US2006/0033615(A1) | 2006-02-01 | Nou | Applicant |
| US2006/0047704(A1) | 2006-03-01 | Gopalakrishnan | Applicant |
| US2006/0048046(A1) | 2006-03-01 | Joshi et al. | Applicant |
| US2006/0074821(A1) | 2006-04-01 | Cristianini | Applicant |
| US2006/0082595(A1) | 2006-04-01 | Liu et al. | Applicant |
| US2006/0089907(A1) | 2006-04-01 | Kohlmaier et al. | Applicant |
| US2006/0093208(A1) | 2006-05-01 | Li et al. | Applicant |
| US2006/0095373(A1) | 2006-05-01 | Venkatasubramanian et al. | Applicant |
| US2006/0095374(A1) | 2006-05-01 | Lo et al. | Applicant |
| US2006/0095830(A1) | 2006-05-01 | Krishna et al. | Applicant |
| US2006/0098899(A1) | 2006-05-01 | King et al. | Applicant |
| US2006/0112340(A1) | 2006-05-01 | Mohr et al. | Applicant |
| US2006/0114488(A1) | 2006-06-01 | Motamed | Applicant |
| US2006/0115153(A1) | 2006-06-01 | Bhattacharjya | Applicant |
| US2006/0120609(A1) | 2006-06-01 | Ivanov et al. | Applicant |
| US2006/0126918(A1) | 2006-06-01 | Oohashi et al. | Applicant |
| US2006/0147113(A1) | 2006-07-01 | Han | Applicant |
| US2006/0159364(A1) | 2006-07-01 | Poon et al. | Applicant |
| US2006/0161646(A1) | 2006-07-01 | Chene et al. | Applicant |
| US2006/0164682(A1) | 2006-07-01 | Lev | Applicant |
| US2006/0195491(A1) | 2006-08-01 | Nieland et al. | Applicant |
| US2006/0203107(A1) | 2006-09-01 | Steinberg et al. | Applicant |
| US2006/0206628(A1) | 2006-09-01 | Erez | Applicant |
| US2006/0212413(A1) | 2006-09-01 | Rujan et al. | Applicant |
| US2006/0215231(A1) | 2006-09-01 | Borrey et al. | Applicant |
| US2006/0219773(A1) | 2006-10-01 | Richardson | Applicant |
| US2006/0222239(A1) | 2006-10-01 | Bargeron et al. | Applicant |
| US2006/0235732(A1) | 2006-10-01 | Miller et al. | Applicant |
| US2006/0235812(A1) | 2006-10-01 | Rifkin et al. | Applicant |
| US2006/0236304(A1) | 2006-10-01 | Luo et al. | Applicant |
| US2006/0239539(A1) | 2006-10-01 | Kochi et al. | Applicant |
| US2006/0242180(A1) | 2006-10-01 | Graf et al. | Applicant |
| US2006/0256371(A1) | 2006-11-01 | King et al. | Applicant |
| US2006/0256392(A1) | 2006-11-01 | Van Hoof et al. | Applicant |
| US2006/0257048(A1) | 2006-11-01 | Lin et al. | Applicant |
| US2006/0262962(A1) | 2006-11-01 | Hull et al. | Applicant |
| US2006/0263134(A1) | 2006-11-01 | Beppu | Applicant |
| US2006/0265640(A1) | 2006-11-01 | Albornoz et al. | Applicant |
| US2006/0268352(A1) | 2006-11-01 | Tanigawa et al. | Applicant |
| US2006/0268356(A1) | 2006-11-01 | Shih et al. | Applicant |
| US2006/0268369(A1) | 2006-11-01 | Kuo | Applicant |
| US2006/0279798(A1) | 2006-12-01 | Rudolph et al. | Applicant |
| US2006/0282442(A1) | 2006-12-01 | Lennon et al. | Applicant |
| US2006/0282463(A1) | 2006-12-01 | Kudolph et al. | Applicant |
| US2006/0282762(A1) | 2006-12-01 | Diamond et al. | Applicant |
| US2006/0288015(A1) | 2006-12-01 | Schirripa et al. | Applicant |
| US2006/0294154(A1) | 2006-12-01 | Shimizu | Applicant |
| US2007/0002348(A1) | 2007-01-01 | Hagiwara | Applicant |
| US2007/0002375(A1) | 2007-01-01 | Ng | Applicant |
| US2007/0003155(A1) | 2007-01-01 | Miller et al. | Applicant |
| US2007/0003165(A1) | 2007-01-01 | Sibiryakov et al. | Applicant |
| US2007/0005341(A1) | 2007-01-01 | Burges et al. | Applicant |
| US2007/0011334(A1) | 2007-01-01 | Higgins et al. | Applicant |
| US2007/0016848(A1) | 2007-01-01 | Rosenoff et al. | Applicant |
| US2007/0030540(A1) | 2007-02-01 | Cheng et al. | Applicant |
| US2007/0031028(A1) | 2007-02-01 | Vetter et al. | Applicant |
| US2007/0035780(A1) | 2007-02-01 | Kanno | Applicant |
| US2007/0036432(A1) | 2007-02-01 | Xu | Examiner |
| US2007/0046957(A1) | 2007-03-01 | Jacobs et al. | Applicant |
| US2007/0046982(A1) | 2007-03-01 | Hull et al. | Applicant |
| US2007/0047782(A1) | 2007-03-01 | Hull et al. | Applicant |
| US2007/0065033(A1) | 2007-03-01 | Hemandez et al. | Applicant |
| US2007/0086667(A1) | 2007-04-01 | Dai et al. | Applicant |
| US2007/0109590(A1) | 2007-05-01 | Hagiwara | Applicant |
| US2007/0118794(A1) | 2007-05-01 | Hollander et al. | Applicant |
| US2007/0128899(A1) | 2007-06-01 | Mayer | Applicant |
| US2007/0133862(A1) | 2007-06-01 | Gold et al. | Applicant |
| US2007/0165801(A1) | 2007-07-01 | Devolites et al. | Applicant |
| US2007/0172151(A1) | 2007-07-01 | Gennetten et al. | Applicant |
| US2007/0177818(A1) | 2007-08-01 | Teshima et al. | Applicant |
| US2007/0204162(A1) | 2007-08-01 | Rodriguez | Applicant |
| US2007/0206877(A1) | 2007-09-01 | Wu et al. | Applicant |
| US2007/0239642(A1) | 2007-10-01 | Sindhwani et al. | Applicant |
| US2007/0250416(A1) | 2007-10-01 | Beach et al. | Applicant |
| US2007/0252907(A1) | 2007-11-01 | Hsu | Applicant |
| US2007/0255653(A1) | 2007-11-01 | Tumminaro et al. | Applicant |
| US2007/0260588(A1) | 2007-11-01 | Biazetti et al. | Applicant |
| US2008/0004073(A1) | 2008-01-01 | John et al. | Applicant |
| US2008/0005678(A1) | 2008-01-01 | Buttner et al. | Applicant |
| US2008/0068452(A1) | 2008-03-01 | Nakao et al. | Applicant |
| US2008/0082352(A1) | 2008-04-01 | Schmidtler et al. | Applicant |
| US2008/0086432(A1) | 2008-04-01 | Schmidtler et al. | Applicant |
| US2008/0086433(A1) | 2008-04-01 | Schmidtler et al. | Applicant |
| US2008/0095467(A1) | 2008-04-01 | Olszak et al. | Applicant |
| US2008/0097936(A1) | 2008-04-01 | Schmidtler et al. | Applicant |
| US2008/0130992(A1) | 2008-06-01 | Fujii | Applicant |
| US2008/0133388(A1) | 2008-06-01 | Alekseev et al. | Applicant |
| US2008/0137971(A1) | 2008-06-01 | King et al. | Applicant |
| US2008/0144881(A1) | 2008-06-01 | Fortune et al. | Applicant |
| US2008/0147561(A1) | 2008-06-01 | Euchner et al. | Applicant |
| US2008/0147790(A1) | 2008-06-01 | Malaney et al. | Applicant |
| US2008/0166025(A1) | 2008-07-01 | Thorne | Applicant |
| US2008/0175476(A1) | 2008-07-01 | Ohk et al. | Applicant |
| US2008/0177612(A1) | 2008-07-01 | Starink et al. | Applicant |
| US2008/0177643(A1) | 2008-07-01 | Matthews et al. | Applicant |
| US2008/0183576(A1) | 2008-07-01 | Kim et al. | Applicant |
| US2008/0199081(A1) | 2008-08-01 | Kimura et al. | Applicant |
| US2008/0211809(A1) | 2008-09-01 | Kim et al. | Applicant |
| US2008/0212115(A1) | 2008-09-01 | Konishi | Applicant |
| US2008/0215489(A1) | 2008-09-01 | Lawson et al. | Applicant |
| US2008/0219543(A1) | 2008-09-01 | Csulits et al. | Applicant |
| US2008/0225127(A1) | 2008-09-01 | Ming | Applicant |
| US2008/0232715(A1) | 2008-09-01 | Miyakawa et al. | Applicant |
| US2008/0235766(A1) | 2008-09-01 | Wallos et al. | Applicant |
| US2008/0253647(A1) | 2008-10-01 | Cho et al. | Applicant |
| US2008/0292144(A1) | 2008-11-01 | Kim | Applicant |
| US2008/0294737(A1) | 2008-11-01 | Kim | Applicant |
| US2008/0298718(A1) | 2008-12-01 | Liu et al. | Applicant |
| US2009/0015687(A1) | 2009-01-01 | Shinkai et al. | Applicant |
| US2009/0073266(A1) | 2009-03-01 | Abdellaziz Trimeche et al. | Applicant |
| US2009/0089078(A1) | 2009-04-01 | Bursey | Applicant |
| US2009/0103808(A1) | 2009-04-01 | Dey et al. | Applicant |
| US2009/0110267(A1) | 2009-04-01 | Zakhor et al. | Applicant |
| US2009/0132468(A1) | 2009-05-01 | Putivsky et al. | Applicant |
| US2009/0132504(A1) | 2009-05-01 | Vegnaduzzo et al. | Applicant |
| US2009/0141985(A1) | 2009-06-01 | Sheinin et al. | Applicant |
| US2009/0154778(A1) | 2009-06-01 | Lei et al. | Applicant |
| US2009/0159509(A1) | 2009-06-01 | Wojdyla et al. | Applicant |
| US2009/0164889(A1) | 2009-06-01 | Piersol et al. | Applicant |
| US2009/0175537(A1) | 2009-07-01 | Tribelhorn et al. | Applicant |
| US2009/0185241(A1) | 2009-07-01 | Nepomniachtchi | Applicant |
| US2009/0214112(A1) | 2009-08-01 | Borrey et al. | Applicant |
| US2009/0225180(A1) | 2009-09-01 | Maruyama et al. | Applicant |
| US2009/0228499(A1) | 2009-09-01 | Schmidtler et al. | Applicant |
| US2009/0254487(A1) | 2009-10-01 | Dhar et al. | Applicant |
| US2009/0285445(A1) | 2009-11-01 | Vasa | Applicant |
| US2009/0324025(A1) | 2009-12-01 | Camp, Jr. et al. | Applicant |
| US2009/0324062(A1) | 2009-12-01 | Lim et al. | Applicant |
| US2009/0327250(A1) | 2009-12-01 | Green et al. | Applicant |
| US2010/0007751(A1) | 2010-01-01 | Icho et al. | Applicant |
| US2010/0014769(A1) | 2010-01-01 | Lundgren | Applicant |
| US2010/0045701(A1) | 2010-02-01 | Scott | Applicant |
| US2010/0049035(A1) | 2010-02-01 | Hu | Examiner |
| US2010/0060910(A1) | 2010-03-01 | Fechter | Applicant |
| US2010/0060915(A1) | 2010-03-01 | Suzuki et al. | Applicant |
| US2010/0062491(A1) | 2010-03-01 | Lehmbeck | Applicant |
| US2010/0082491(A1) | 2010-04-01 | Rosenblatt et al. | Applicant |
| US2010/0142820(A1) | 2010-06-01 | Malik | Examiner |
| US2010/0150424(A1) | 2010-06-01 | Nepomniachtchi et al. | Applicant |
| US2010/0166318(A1) | 2010-07-01 | Ben-Horesh et al. | Applicant |
| US2010/0169250(A1) | 2010-07-01 | Schmidtler et al. | Applicant |
| US2010/0174974(A1) | 2010-07-01 | Brisebois et al. | Applicant |
| US2010/0202698(A1) | 2010-08-01 | Schmidtler et al. | Applicant |
| US2010/0202701(A1) | 2010-08-01 | Basri et al. | Applicant |
| US2010/0209006(A1) | 2010-08-01 | Grigsby et al. | Applicant |
| US2010/0214291(A1) | 2010-08-01 | Muller et al. | Applicant |
| US2010/0214584(A1) | 2010-08-01 | Takahashi | Applicant |
| US2010/0232706(A1) | 2010-09-01 | Forutanpour | Applicant |
| US2010/0280859(A1) | 2010-11-01 | Frederick, II | Applicant |
| US2010/0331043(A1) | 2010-12-01 | Chapman et al. | Applicant |
| US2011/0004547(A1) | 2011-01-01 | Giordano et al. | Applicant |
| US2011/0013039(A1) | 2011-01-01 | Aisaka et al. | Applicant |
| US2011/0025825(A1) | 2011-02-01 | McNamer et al. | Applicant |
| US2011/0025842(A1) | 2011-02-01 | King et al. | Applicant |
| US2011/0025860(A1) | 2011-02-01 | Katougi et al. | Applicant |
| US2011/0032570(A1) | 2011-02-01 | Imaizumi et al. | Applicant |
| US2011/0035284(A1) | 2011-02-01 | Moshfeghi | Applicant |
| US2011/0055033(A1) | 2011-03-01 | Chen et al. | Applicant |
| US2011/0090337(A1) | 2011-04-01 | Klomp et al. | Applicant |
| US2011/0091092(A1) | 2011-04-01 | Nepomniachtchi et al. | Applicant |
| US2011/0116716(A1) | 2011-05-01 | Kwon et al. | Applicant |
| US2011/0129153(A1) | 2011-06-01 | Petrou et al. | Applicant |
| US2011/0137898(A1) | 2011-06-01 | Gordo et al. | Applicant |
| US2011/0145178(A1) | 2011-06-01 | Schmidtler et al. | Applicant |
| US2011/0181589(A1) | 2011-07-01 | Quan et al. | Applicant |
| US2011/0182500(A1) | 2011-07-01 | Esposito et al. | Applicant |
| US2011/0194127(A1) | 2011-08-01 | Nagakoshi et al. | Applicant |
| US2011/0196870(A1) | 2011-08-01 | Schmidtler et al. | Applicant |
| US2011/0200107(A1) | 2011-08-01 | Ryu | Applicant |
| US2011/0246076(A1) | 2011-10-01 | Su et al. | Applicant |
| US2011/0249905(A1) | 2011-10-01 | Singh et al. | Applicant |
| US2011/0279456(A1) | 2011-11-01 | Hiranuma et al. | Applicant |
| US2011/0280450(A1) | 2011-11-01 | Nepomniachtchi et al. | Applicant |
| US2011/0285873(A1) | 2011-11-01 | Showering | Applicant |
| US2011/0285874(A1) | 2011-11-01 | Showering et al. | Applicant |
| US2011/0313966(A1) | 2011-12-01 | Schmidt et al. | Applicant |
| US2012/0008856(A1) | 2012-01-01 | Hewes et al. | Applicant |
| US2012/0008858(A1) | 2012-01-01 | Sedky | Examiner |
| US2012/0019614(A1) | 2012-01-01 | Murray et al. | Applicant |
| US2012/0038549(A1) | 2012-02-01 | Mandella et al. | Applicant |
| US2012/0057756(A1) | 2012-03-01 | Yoon et al. | Applicant |
| US2012/0069131(A1) | 2012-03-01 | Abelow | Applicant |
| US2012/0075442(A1) | 2012-03-01 | Vujic | Applicant |
| US2012/0077476(A1) | 2012-03-01 | Paraskevakos et al. | Applicant |
| US2012/0092329(A1) | 2012-04-01 | Koo et al. | Applicant |
| US2012/0105662(A1) | 2012-05-01 | Staudacher et al. | Applicant |
| US2012/0113489(A1) | 2012-05-01 | Heit et al. | Applicant |
| US2012/0114249(A1) | 2012-05-01 | Conwell | Applicant |
| US2012/0116957(A1) | 2012-05-01 | Zanzot et al. | Applicant |
| US2012/0131139(A1) | 2012-05-01 | Siripurapu et al. | Applicant |
| US2012/0134576(A1) | 2012-05-01 | Sharma | Examiner |
| US2012/0162527(A1) | 2012-06-01 | Baker | Applicant |
| US2012/0194692(A1) | 2012-08-01 | Mers et al. | Applicant |
| US2012/0195466(A1) | 2012-08-01 | Teng et al. | Applicant |
| US2012/0215578(A1) | 2012-08-01 | Swierz, III et al. | Applicant |
| US2012/0230577(A1) | 2012-09-01 | Calman et al. | Applicant |
| US2012/0230606(A1) | 2012-09-01 | Sugiyama et al. | Applicant |
| US2012/0236019(A1) | 2012-09-01 | Oh et al. | Applicant |
| US2012/0269398(A1) | 2012-10-01 | Fan | Examiner |
| US2012/0272192(A1) | 2012-10-01 | Grossman et al. | Applicant |
| US2012/0284122(A1) | 2012-11-01 | Brandis | Applicant |
| US2012/0284185(A1) | 2012-11-01 | Mettler et al. | Applicant |
| US2012/0290421(A1) | 2012-11-01 | Qawami et al. | Applicant |
| US2012/0293607(A1) | 2012-11-01 | Bhogal et al. | Applicant |
| US2012/0294524(A1) | 2012-11-01 | Zyuzin et al. | Applicant |
| US2012/0300020(A1) | 2012-11-01 | Arth et al. | Applicant |
| US2012/0301011(A1) | 2012-11-01 | Grzechnik | Applicant |
| US2012/0301024(A1) | 2012-11-01 | Yuan | Examiner |
| US2012/0308139(A1) | 2012-12-01 | Dhir | Applicant |
| US2013/0004076(A1) | 2013-01-01 | Koo et al. | Applicant |
| US2013/0022231(A1) | 2013-01-01 | Nepomniachtchi et al. | Applicant |
| US2013/0027757(A1) | 2013-01-01 | Lee et al. | Applicant |
| US2013/0057703(A1) | 2013-03-01 | Vu et al. | Applicant |
| US2013/0060596(A1) | 2013-03-01 | Gu et al. | Applicant |
| US2013/0066798(A1) | 2013-03-01 | Morin et al. | Applicant |
| US2013/0073459(A1) | 2013-03-01 | Zacarias et al. | Applicant |
| US2013/0078983(A1) | 2013-03-01 | Doshi et al. | Applicant |
| US2013/0080347(A1) | 2013-03-01 | Paul et al. | Applicant |
| US2013/0088757(A1) | 2013-04-01 | Schmidtler et al. | Applicant |
| US2013/0090969(A1) | 2013-04-01 | Rivere | Applicant |
| US2013/0097157(A1) | 2013-04-01 | Ng et al. | Applicant |
| US2013/0117175(A1) | 2013-05-01 | Hanson | Applicant |
| US2013/0121610(A1) | 2013-05-01 | Chen et al. | Applicant |
| US2013/0124414(A1) | 2013-05-01 | Roach et al. | Applicant |
| US2013/0142402(A1) | 2013-06-01 | Myers et al. | Applicant |
| US2013/0152176(A1) | 2013-06-01 | Courtney et al. | Applicant |
| US2013/0182002(A1) | 2013-07-01 | Macciola et al. | Applicant |
| US2013/0182105(A1) | 2013-07-01 | Fahn et al. | Applicant |
| US2013/0182128(A1) | 2013-07-01 | Amtrup et al. | Applicant |
| US2013/0182292(A1) | 2013-07-01 | Thrasher et al. | Applicant |
| US2013/0182951(A1) | 2013-07-01 | Shustorovich et al. | Applicant |
| US2013/0182959(A1) | 2013-07-01 | Thrasher et al. | Applicant |
| US2013/0182970(A1) | 2013-07-01 | Shustorovich et al. | Applicant |
| US2013/0182973(A1) | 2013-07-01 | Macciola et al. | Applicant |
| US2013/0185618(A1) | 2013-07-01 | Macciola et al. | Applicant |
| US2013/0188865(A1) | 2013-07-01 | Saha et al. | Applicant |
| US2013/0198192(A1) | 2013-08-01 | Hu et al. | Applicant |
| US2013/0198358(A1) | 2013-08-01 | Taylor | Applicant |
| US2013/0223762(A1) | 2013-08-01 | Nagamasa | Applicant |
| US2013/0230246(A1) | 2013-09-01 | Nuggehalli | Applicant |
| US2013/0251280(A1) | 2013-09-01 | Borrey et al. | Applicant |
| US2013/0268378(A1) | 2013-10-01 | Yovin | Applicant |
| US2013/0268430(A1) | 2013-10-01 | Lopez et al. | Applicant |
| US2013/0271579(A1) | 2013-10-01 | Wang | Applicant |
| US2013/0287265(A1) | 2013-10-01 | Nepomniachtchi et al. | Applicant |
| US2013/0287284(A1) | 2013-10-01 | Lepomniachtchi et al. | Applicant |
| US2013/0290036(A1) | 2013-10-01 | Strange | Applicant |
| US2013/0297353(A1) | 2013-11-01 | Strange et al. | Applicant |
| US2013/0308832(A1) | 2013-11-01 | Schmidtler et al. | Applicant |
| US2013/0329023(A1) | 2013-12-01 | Suplee, III et al. | Applicant |
| US2014/0003721(A1) | 2014-01-01 | Saund | Applicant |
| US2014/0006129(A1) | 2014-01-01 | Heath | Applicant |
| US2014/0006198(A1) | 2014-01-01 | Daly et al. | Applicant |
| US2014/0012754(A1) | 2014-01-01 | Hanson et al. | Applicant |
| US2014/0032406(A1) | 2014-01-01 | Roach et al. | Applicant |
| US2014/0047367(A1) | 2014-02-01 | Nielsen | Applicant |
| US2014/0055812(A1) | 2014-02-01 | DeRoller | Applicant |
| US2014/0055826(A1) | 2014-02-01 | Hinski | Applicant |
| US2014/0079294(A1) | 2014-03-01 | Amtrup et al. | Applicant |
| US2014/0108456(A1) | 2014-04-01 | Ramachandrula et al. | Applicant |
| US2014/0149308(A1) | 2014-05-01 | Ming | Applicant |
| US2014/0153787(A1) | 2014-06-01 | Schmidtler et al. | Applicant |
| US2014/0153830(A1) | 2014-06-01 | Amtrup et al. | Applicant |
| US2014/0164914(A1) | 2014-06-01 | Schmidtler et al. | Applicant |
| US2014/0172687(A1) | 2014-06-01 | Chirehdast | Applicant |
| US2014/0181691(A1) | 2014-06-01 | Poornachandran et al. | Applicant |
| US2014/0201612(A1) | 2014-07-01 | Buttner et al. | Applicant |
| US2014/0207717(A1) | 2014-07-01 | Schmidtler et al. | Applicant |
| US2014/0211991(A1) | 2014-07-01 | Stoppa | Examiner |
| US2014/0233068(A1) | 2014-08-01 | Borrey et al. | Applicant |
| US2014/0254887(A1) | 2014-09-01 | Amtrup et al. | Applicant |
| US2014/0270349(A1) | 2014-09-01 | Amtrup et al. | Applicant |
| US2014/0270439(A1) | 2014-09-01 | Chen | Applicant |
| US2014/0270536(A1) | 2014-09-01 | Amtrup et al. | Applicant |
| US2014/0316841(A1) | 2014-10-01 | Kilby et al. | Applicant |
| US2014/0317595(A1) | 2014-10-01 | Kilby et al. | Applicant |
| US2014/0327940(A1) | 2014-11-01 | Amtrup et al. | Applicant |
| US2014/0328520(A1) | 2014-11-01 | Macciola et al. | Applicant |
| US2014/0333971(A1) | 2014-11-01 | Macciola et al. | Applicant |
| US2014/0368890(A1) | 2014-12-01 | Amtrup et al. | Applicant |
| US2014/0376060(A1) | 2014-12-01 | Bocharov et al. | Applicant |
| US2015/0040001(A1) | 2015-02-01 | Kannan et al. | Applicant |
| US2015/0040002(A1) | 2015-02-01 | Kannan et al. | Applicant |
| US2015/0086080(A1) | 2015-03-01 | Stein | Applicant |
| US2015/0093033(A1) | 2015-04-01 | Kwon | Examiner |
| US2015/0098628(A1) | 2015-04-01 | Macciola et al. | Applicant |
| US2015/0120564(A1) | 2015-04-01 | Smith et al. | Applicant |
| US2015/0161765(A1) | 2015-06-01 | Kota et al. | Applicant |
| US2015/0170085(A1) | 2015-06-01 | Amtrup et al. | Applicant |
| US2015/0248391(A1) | 2015-09-01 | Watanabe | Applicant |
| US2015/0254469(A1) | 2015-09-01 | Butler | Applicant |
| US2015/0317529(A1) | 2015-11-01 | Zhou et al. | Applicant |
| US2015/0324640(A1) | 2015-11-01 | Macciola et al. | Applicant |
| US2015/0339526(A1) | 2015-11-01 | Macciola et al. | Applicant |
| US2015/0347861(A1) | 2015-12-01 | Doepke et al. | Applicant |
| US2015/0355889(A1) | 2015-12-01 | Kilby et al. | Applicant |
| US2016/0019530(A1) | 2016-01-01 | Wang et al. | Applicant |
| US2016/0028921(A1) | 2016-01-01 | Thrasher | Examiner |
| US2016/0034775(A1) | 2016-02-01 | Meadow et al. | Applicant |
| US2016/0055395(A1) | 2016-02-01 | Macciola et al. | Applicant |
| US2016/0063358(A1) | 2016-03-01 | Mehrseresht | Applicant |
| US2016/0125613(A1) | 2016-05-01 | Shustorovich et al. | Applicant |
| US2016/0147891(A1) | 2016-05-01 | Chhichhia et al. | Applicant |
| US2016/0171603(A1) | 2016-06-01 | Amtrup et al. | Applicant |
| US2016/0217319(A1) | 2016-07-01 | Bhanu et al. | Applicant |
| US2016/0320466(A1) | 2016-11-01 | Berker | Examiner |
| US2016/0350592(A1) | 2016-12-01 | Ma et al. | Applicant |
| US2017/0046788(A1) | 2017-02-01 | Macciola et al. | Applicant |
| US2017/0103281(A1) | 2017-04-01 | Amtrup et al. | Applicant |
| US2017/0104885(A1) | 2017-04-01 | Amtrup et al. | Applicant |
| US2017/0109576(A1) | 2017-04-01 | Shustorovich et al. | Applicant |
| US2017/0109588(A1) | 2017-04-01 | Ma et al. | Applicant |
| US2017/0109606(A1) | 2017-04-01 | Macciola et al. | Applicant |
| US2017/0109610(A1) | 2017-04-01 | Macciola et al. | Applicant |
| US2017/0109818(A1) | 2017-04-01 | Amtrup et al. | Applicant |
| US2017/0109819(A1) | 2017-04-01 | Amtrup et al. | Applicant |
| US2017/0109830(A1) | 2017-04-01 | Macciola et al. | Applicant |
| US2017/0111532(A1) | 2017-04-01 | Amtrup et al. | Applicant |
| US2017/0147572(A1) | 2017-05-01 | Kilby et al. | Applicant |
| US2017/0286764(A1) | 2017-10-01 | Ma et al. | Applicant |
| US2017/0351915(A1) | 2017-12-01 | Thompson et al. | Applicant |
| US2017/0357869(A1) | 2017-12-01 | Shustorovich et al. | Applicant |
| CN101052991(A) | 2007-10-01 | Applicant | |
| CN101295305(A) | 2008-10-01 | Applicant | |
| CN101329731(A) | 2008-12-01 | Applicant | |
| CN101339566(A) | 2009-01-01 | Applicant | |
| CN101493830(A) | 2009-07-01 | Applicant | |
| CN101673402(A) | 2010-03-01 | Applicant | |
| CN101894262(A) | 2010-11-01 | Applicant | |
| EP549329(A2) | 1993-06-01 | Applicant | |
| EP723247(A1) | 1996-07-01 | Applicant | |
| EP767578(A2) | 1997-04-01 | Applicant | |
| EP809219(A2) | 1997-11-01 | Applicant | |
| EP843277(A2) | 1998-05-01 | Applicant | |
| EP936804(A2) | 1999-08-01 | Applicant | |
| EP1054331(A2) | 2000-11-01 | Applicant | |
| EP1128659(A1) | 2001-08-01 | Applicant | |
| EP1229485(A2) | 2002-08-01 | Applicant | |
| EP1317133(A1) | 2003-06-01 | Applicant | |
| EP1319133(A1) | 2003-06-01 | Applicant | |
| EP1422520(A1) | 2004-05-01 | Applicant | |
| EP1422920(A2) | 2004-05-01 | Applicant | |
| EP1956518(A1) | 2008-08-01 | Applicant | |
| EP1959363(A2) | 2008-08-01 | Applicant | |
| EP1976259(A1) | 2008-10-01 | Applicant | |
| EP2107480(A1) | 2009-10-01 | Applicant | |
| EP2472372(A1) | 2012-07-01 | Applicant | |
| JE5462286(B2) | 2014-04-01 | Applicant | |
| JPH04034671(A) | 1992-02-01 | Applicant | |
| JPH05060616(A) | 1993-03-01 | Applicant | |
| JPH07260701(A) | 1995-10-01 | Applicant | |
| JPH0962826(A) | 1997-03-01 | Applicant | |
| JPH09091341(A) | 1997-04-01 | Applicant | |
| JPH09116720(A) | 1997-05-01 | Applicant | |
| JPH11118444(A) | 1999-04-01 | Applicant | |
| JP2000067065(A) | 2000-03-01 | Applicant | |
| JP2000103628(A) | 2000-04-01 | Applicant | |
| JP2000298702(A) | 2000-10-01 | Applicant | |
| JP2000354144(A) | 2000-12-01 | Applicant | |
| JP2001297303(A) | 2001-10-01 | Applicant | |
| JP2001309128(A) | 2001-11-01 | Applicant | |
| JP2002024258(A) | 2002-01-01 | Applicant | |
| JP2002109242(A) | 2002-04-01 | Applicant | |
| JP2002519766(A) | 2002-07-01 | Applicant | |
| JP2002312385(A) | 2002-10-01 | Applicant | |
| JP2003091521(A) | 2003-03-01 | Applicant | |
| JP2003196357(A) | 2003-07-01 | Applicant | |
| JP2003234888(A) | 2003-08-01 | Applicant | |
| JP2003303315(A) | 2003-10-01 | Applicant | |
| JP2004005624(A) | 2004-01-01 | Applicant | |
| JP2004523022(A) | 2004-07-01 | Applicant | |
| JP2004363786(A) | 2004-12-01 | Applicant | |
| JP2005018678(A) | 2005-01-01 | Applicant | |
| JP2005071262(A) | 2005-03-01 | Applicant | |
| JP2005085173(A) | 2005-03-01 | Applicant | |
| JP2005173730(A) | 2005-06-01 | Applicant | |
| JP2005208861(A) | 2005-08-01 | Applicant | |
| JP2006031379(A) | 2006-02-01 | Applicant | |
| JP2006054519(A) | 2006-02-01 | Applicant | |
| JP2006126941(A) | 2006-05-01 | Applicant | |
| JP2006185367(A) | 2006-07-01 | Applicant | |
| JP2006209588(A) | 2006-08-01 | Applicant | |
| JP2006330863(A) | 2006-12-01 | Applicant | |
| JP201052670(A) | 2007-03-01 | Applicant | |
| JP2007251518(A) | 2007-09-01 | Applicant | |
| JP2008134683(A) | 2008-06-01 | Applicant | |
| JP2009015396(A) | 2009-01-01 | Applicant | |
| JP2009211431(A) | 2009-09-01 | Applicant | |
| JP2009541896(A) | 2009-11-01 | Applicant | |
| JP2010062722(A) | 2010-03-01 | Applicant | |
| JP2011034387(A) | 2011-02-01 | Applicant | |
| JP2011055467(A) | 2011-03-01 | Applicant | |
| JP2011118513(A) | 2011-06-01 | Applicant | |
| JP2011118600 | 2011-06-01 | Applicant | |
| JP2012008791(A) | 2012-01-01 | Applicant | |
| JP2012009033(A) | 2012-01-01 | Applicant | |
| JP2012058904(A) | 2012-03-01 | Applicant | |
| JP2012156644(A) | 2012-08-01 | Applicant | |
| JP2012517637(A) | 2012-08-01 | Applicant | |
| JP2012194736(A) | 2012-10-01 | Applicant | |
| JP2012217159(A) | 2012-11-01 | Applicant | |
| JP2013196357(A) | 2013-09-01 | Applicant | |
| TW401553(B) | 2000-08-01 | Applicant | |
| WO9604749(A1) | 1996-02-01 | Applicant | |
| WO97006522(A1) | 1997-02-01 | Applicant | |
| WO9847098(A1) | 1998-10-01 | Applicant | |
| WO9967731(A1) | 1999-12-01 | Applicant | |
| WO263812(A2) | 2002-08-01 | Applicant | |
| WO2063812(A2) | 2002-08-01 | Applicant | |
| WO2004053630(A2) | 2004-06-01 | Applicant | |
| WO2004056360(A1) | 2004-07-01 | Applicant | |
| WO2006104627(A1) | 2006-10-01 | Applicant | |
| WO2007081147(A1) | 2007-07-01 | Applicant | |
| WO2007082534(A1) | 2007-07-01 | Applicant | |
| WO2008008142(A2) | 2008-01-01 | Applicant | |
| WO2010030056(A1) | 2010-03-01 | Applicant | |
| WO2010056368(A1) | 2010-05-01 | Applicant | |
| WO2010096192(A1) | 2010-08-01 | Applicant | |
| WO2013059599(A1) | 2013-04-01 | Applicant |
Non-Patent Literature (229)
- Thompson et al., U.S. Appl. No. 15/686,017, filed Aug. 24, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/389,342, dated Aug. 30, 2017.Applicant
- Shustorovich et al., U.S. Appl. No. 15/672,200, filed Aug. 8, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/390,321, dated Oct. 4, 2017.Applicant
- Final Office Action from U.S. Appl. No. 14/932,902, dated Oct. 20, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/686,017, dated Oct. 18, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/390,321, dated Oct. 20, 2017.Applicant
- Supplementary European Search Report from European Application No. 15764687.8, dated Oct. 17, 2017.Applicant
- Examination Report from European Application No. 14775259.6, dated Oct. 25, 2017.Applicant
- Office Action from Chinese Patent Application No. 201480014229.9, dated Oct. 10, 2017.Applicant
- Examination Report from European Application No. 13738301.4, dated Oct. 26, 2017.Applicant
- Final Office Action from U.S. Appl. No. 15/424,756, dated Dec. 22, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/157,325, dated Jan. 8, 2018.Applicant
- Advisory Action from U.S. Appl. No. 14/932,902, dated Jan. 23, 2018.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/1390,321, dated Jan. 23, 2018.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/829,474, dated Jan. 25, 2018.Applicant
- KOFAX Inc, “Module 2—Kofax Capture Overview,” Jun. 2011, pp. 1-22.Applicant
- KOFAX Inc., “Kofax Capture 10.0 Developer's Guide,” Aug. 1, 2011, 138 pages.Applicant
- Notice of Allowance from U.S. Appl. No. 15/686,017, dated, Feb. 14, 2018.Applicant
- Office Action from Japanese Patent Application No. 2016-512078, dated Feb. 13, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 14/932,902, dated Feb. 16, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 14/932,902, dated Mar. 2, 2018.Applicant
- Office Action from Japanese Patent Application No. 2016-502192, dated Feb. 13, 2018.Applicant
- Hirose et al., “Media Conversion for Document Images Based on Layout Analysis and Character Recognition,” IEICE Technical Report, The Institute of Electronics, Information and Communication Engineers, vol. 99, No. 648, Feb. 21, 2000, pp. 39-46.Applicant
- Oe et al., “Segmentation Method of Texture Image Using Two-Dimensional AR Model and Pyramid Linking,” The Transactions of The Institute of Electronics, Information and Communication Engineers, vol. J75-D-II, No. 7, Jul. 25, 1992, pp. 1132-1142.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/804,281, dated Mar. 16, 2018.Applicant
- Office Action from Chinese Patent Application No. 201580014141.1, dated Feb. 6, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 15/157,325, dated Mar. 26, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/157,325, dated Apr. 5, 2018.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/385,707, dated Apr. 4, 2018.Applicant
- Final Office Action from U.S. Appl. No. 15/234,993, dated Apr. 9, 2018.Applicant
- Wang et al., “Object Recognition Using Multi-View Imaging,” ICSP2008 Proceedings, IEEE, 2008, pp. 810-813.Applicant
- Examination Report from European Application No. 14773721.7, dated Mar. 27, 2018.Applicant
- Office Action from Taiwanese Application No. 103114611, dated Feb. 8, 2018.Applicant
- Office Action from Chinese Patent Application No. 201380004057.2, dated Feb. 27, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 14/814,455, dated Mar. 30, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/932,902, dated Apr. 11, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/390,321, dated Mar. 17, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/146,848, dated Apr. 13, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 14/927,359, dated Aug. 2, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 14/927,359, dated Aug. 9, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/191,442, dated Aug. 2, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/146,848, dated Aug. 4, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/389,342, dated Aug. 14, 2017.Applicant
- Notice of Grounds of Rejection from Japanese Application No. 2015-229466, dated Jul. 18, 2017, with English Translation.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/829,474, dated Aug. 17, 2017.Applicant
- Extended European Search Report from European Application No. 14847922.3 dated Jun. 22, 2017.Applicant
- Tsoi et al., “Geometric and Shading Correction for Images of Printed Materials a Unified Approach Using Boundary,” Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04), 2004, pp. 1-7.Applicant
- Tian et al., “Rectification and 3D Reconstruction of Curved Document Images,” 2011 IEEE Conference on Computer Vision and Pattern Recognition, Jun. 2011, pp. 377-384.Applicant
- Notice of Allowance from U.S. Appl. No. 14/927,359, dated Jul. 20, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/191,442, dated Apr. 24, 2017.Applicant
- Final Office Action from U.S. Appl. No. 14/927,359, dated Apr. 28, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/234,969, dated May 8, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/234,993, dated Dec. 14, 2017.Applicant
- Office Action from Japanese Patent Application No. 2016-502178, dated Apr. 10, 2018.Applicant
- Office Action from Japanese Patent Application No. 2016-568791, dated Mar. 28, 2018.Applicant
- Kawakatsu et al., “Development and Evaluation of Task Driven Device Orchestration System for User Work Support,” Forum on Information Technology 10th Conference Proceedings, Institute of Electronics, Information and Communication Engineers (IEICE), Aug. 22, 2011, pp. 309-310.Applicant
- Statement of Relevance of Non-Translated Foreign Document NPL: Kawakatsu et al., “Development and Evaluation of Task Driven Device Orcestration System for User Work Support,” Forum on Information Technology 10th Conference Proceedings, Institute of Electronics, Information and Communication Engineers (IEICE), Aug. 22, 2011, pp. 309-310.Applicant
- Office Action from Chinese Patent Application No. 201480013621.1, dated Apr. 28, 2018.Applicant
- Examination Report from European Application No. 14847922.3 dated Jun. 22, 2018.Applicant
- Lenz et al., “Techniques for Calibration of the Scale Factor and Image Center for High Accuracy 3-D Machine Vision Metrology,” IEEE Transactions on Pattern Anaysis and Machine Intelligence, vol. 10, No. 5, Sep. 1988, pp. 713-720.Applicant
- Wang et al., “Single view metrology from scene constraints,” Image and Vision Computing, vol. 23, 2005, pp. 831-840.Applicant
- Criminisi et al., “A plane measuring device,” Image and Vision Computing, vol. 17, 1999, pp. 625-634.Applicant
- Notice of Allowance from U.S. Appl. No. 15/234,993, dated Jul. 5, 2018.Applicant
- Final Office Action from U.S. Appl. No. 14/829,474, dated Jul. 10, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 15/396,322 , dated Jul. 18, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 14/804,281, dated Jul. 23, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 15/390,321, dated Aug. 6, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/396,322, dated Aug. 8, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/234,993, dated Aug. 1, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 14/814,455, dated May 26, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/191,442, dated May 26, 2017.Applicant
- Extended European Search Report from European Application No. 14881675.4, dated Jun. 7, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/394,719, dated Jun. 20, 2017.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2017/025553, dated May 24, 2017.Applicant
- Office Action from Chinese Patent Application No. 201580014141.1, dated May 31, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/424,756, dated Jun. 27, 2017.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/191,442, dated Jun. 29, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 14/818,196, dated Jul. 3, 2017.Applicant
- Office Action from Japanese Patent Application No. 2016-512078, dated Aug. 8, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/898,407, dated Aug. 1, 2013.Applicant
- Final Office Action from U.S. Appl. No. 13/898,407, dated Jan. 13, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/898,407, dated Apr. 23, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/340,460, dated Jan. 16, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/340,460, dated Apr. 28, 2015.Applicant
- Office Action from Japanese Patent Application No. 2014-552356, dated Jun. 2, 2015.Applicant
- Office Action from Taiwan Application No. 102101177, dated Dec. 17, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 14/220,023, dated Jan. 30, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/220,029, dated Feb. 11, 2015.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2013/021336, dated May 23, 2013.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,127, dated Oct. 27, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,131, dated Oct. 27, 2014.Applicant
- Final Office Action from U.S. Appl. No. 13/740,134, dated Mar. 3, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,134, dated Oct. 10, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,138, dated Dec. 1, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,139, dated Aug. 29, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,145, dated Mar. 30, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,145, dated Sep. 29, 2014.Applicant
- Notice of Allowance from Taiwan Patent Application No. 102101177, dated Apr. 24, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,138, dated Jun. 5, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,127, dated Jun. 8, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/569,375, dated Apr. 15, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,134, dated May 29, 2015.Applicant
- Notice of Allowability from U.S. Appl. No. 13/740,145, dated May 26, 2015.Applicant
- Corrected Notice of Allowability from U.S. Appl. No. 13/740,138, dated Jul. 8, 2018.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,127, dated Feb. 23, 2015.Applicant
- Final Office Action from U.S. Appl. No. 13/740,134, dated Mar. 3, 3015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/804,276, dated Oct. 21, 2015.Applicant
- Extended Europrean Search Report from European Application No. 13738301.4, dated Nov. 17, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,145, dated Jan. 15, 2016.Applicant
- Office Action from Taiwan Patent Application No. 102101177, dated Dec. 17, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/740,141, dated Oct. 16, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 13/140,145, dated Sep. 8, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/334,558, dated Sep. 10, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,123, dated Jul. 10, 2014.Applicant
- Intsig Information Co., Ltd., “CamScanner,” www.intsig.com/en/camscanner.html, retrieved Oct. 25, 2012.Applicant
- Intsig Information Co., Ltd., “Product Descriptions,” www.intsig.com/en/product.html, retrieved Oct. 25, 2012.Applicant
- Extended European Search Report from European Application No. 14775259.6, dated Jun. 1, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/814,455, dated Jun. 17, 2016.Applicant
- Final Office Action from U.S. Appl. No. 13/740,141, dated May 5, 2016.Applicant
- Notice of Allowance from U.S. Appl. No. 13/740,141, dated Jul. 29, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/818,196, dated Aug. 19, 2016.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2016/043207, dated Oct. 21, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/927,359, dated Nov. 21, 2016.Applicant
- Final Office Action from U.S. Appl. No. 14/814,455, dated Dec. 16, 2016.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US14/26569, dated Aug. 12, 2014.Applicant
- Gllavata et al., “Finding Text in Images Via Local Thresholding,” International Symposium on Signal Processing and Information Technology, Dec. 2003, pp. 539-542.Applicant
- Zunino et al., “Vector Quantization for License-Plate Location and Image Coding,” IEEE Transactions on Industrial Electronics, vol. 47, Issue 1, Feb. 2000, pp. 159-167.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2014/057065, dated Dec. 30, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/932,902, dated Sep. 28, 2016.Applicant
- Su et al., “Stereo rectification of calibrated image pairs based on geometric transformation,” I.J.Modem Education and Computer Science, vol. 4, 2011, pp. 17-24.Applicant
- Malis et al., “Deeper understanding of the homography decomposition for vision-based control,” [Research Report] RR-6303, INRIA, Sep. 2007, pp. 1-90.Applicant
- Notice of Allowance from U.S. Appl. No. 14/491,901, dated Aug. 4, 2015.Applicant
- Final Office Action from U.S. Appl. No. 14/491,901, dated Apr. 30, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/491,901, dated Nov. 19, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/234,969, dated Nov. 18, 2016.Applicant
- Amtrup, J. W. et al., U.S. Appl. No. 14/220,029, filed Mar. 19, 2014.Applicant
- International Search Report and Written Opinion from PCT Application No. PCT/US15/26022, dated Jul. 22, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/588,147, dated Jun. 3, 2015.Applicant
- Notice of Allowance from Japanese Patent Application No. 2014-005616, dated Jun. 12, 2015.Applicant
- Office Action from Japanese Patent Application No. 2014-005616, dated Oct. 7, 2014.Applicant
- Final Office Action from U.S. Appl. No. 14/588,147, dated Nov. 4, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/283,156, dated Dec. 1, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/588,147, dated Jan. 14, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/804,278, dated Mar. 10, 2016.Applicant
- Notice of Allowance from U.S. Appl. No. 14/283,156, dated Mar. 16, 2016.Applicant
- Summons to Attend Oral Proceedings from European Application No. 10741580.4, dated Jun. 7, 2016.Applicant
- Notice of Allowance from U.S. Appl. No. 14/078,402, dated Feb. 26, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/078,402, dated Jan. 30, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 14/175,999, dated Aug. 8, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/175,999, dated Apr. 3, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 13/802,226, dated Jan. 29, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/802,226, dated Sep. 30, 2015.Applicant
- Final Office Action from U.S. Appl. No. 13/802,226, dated May 20, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 13/802,226, dated Jan. 8, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/209,825, dated Apr. 14, 2015.Applicant
- Final Office Action from U.S. Appl. No. 14/209,825, dated Aug. 13, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/209,825, dated Oct. 28, 2015.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2014/026569, dated Aug. 12, 2014.Applicant
- Bruns, E. et al., “Mobile Phone-Enabled Museum Guidance with Adaptive Classification,” Computer Graphics and Applications, IEEE, vol. 28, No. 4, Jul.-Aug. 2008, pp. 98,102.Applicant
- Tzotsos, A. et al., “Support vector machine classification for object-based image analysis,” Object-Based Image Analysis, Springer Berlin Heidelberg, 2008, pp. 663-677.Applicant
- Vailaya, A. et al., “On Image Classification: City Images vs. Landscapes,” Pattern Recognition, vol. 31, No. 12, Dec. 1998, pp. 1921-1935.Applicant
- Extended European Search Report from European Application No. 14773721.7, dated May 17, 2016.Applicant
- Gonzalez, R. C. et al., “Image Interpolation”, Digital Image Processing, Third Edition,2008, Chapter 2, pp. 65-68.Applicant
- Kim, D. et al., “Location-based large-scale landmark image recognition scheme for mobile devices,” 2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing, IEEE, 2012, pp. 47-52.Applicant
- Sauvola, J. et al., “Adaptive document image binarization,” Pattern Recognition, vol. 33, 2000, pp. 225-236.Applicant
- Tsai, C., “Effects of 2-D Preprocessing on Feature Extraction: Accentuating Features by Decimation, Contrast Enhancement, Filtering,” EE 262: 2D Imaging Project Report, 2008, pp. 1-9.Applicant
- Final Office Action from U.S. Appl. No. 14/804,278, dated Jun. 28, 2016.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2014/065831, dated Feb. 26, 2015.Applicant
- U.S. Appl. No. 61/780,747, filed Mar. 13, 2013.Applicant
- U.S. Appl. No. 61/819,463, dated May 3, 2013.Applicant
- Notice of Allowance from U.S. Appl. No. 14/268,876, dated Aug. 29, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/268,876, dated Jul. 24, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/473,950, dated Jan. 21, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/473,950, dated Feb. 6, 2015.Applicant
- Final Office Action from U.S. Appl. No. 14/473,950, dated Jun. 26, 2015.Applicant
- Notice of Allowance from U.S. Appl. No. 14/473,950, dated Sep. 16, 2015.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/981,759, dated Jun. 7, 2016.Applicant
- Extended European Search Report from European Application No. 14861942.2, dated Nov. 2, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/191,442, dated Oct. 12, 2016.Applicant
- Partial Supplementary European Search Report from European Application No. 14792188.6, dated Sep. 12, 2016.Applicant
- Notice of Allowance from U.S. Appl. No. 14/981,759, dated Nov. 16, 2016.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2015/021597, dated Jun. 22, 2015.Applicant
- U.S. Appl. No. 14/340,460, filed Jul. 24, 2014.Applicant
- Requirement for Restriction from U.S. Appl. No. 14/177,136, dated Aug. 15, 2014.Applicant
- International Search Report and Written Opinion from PCT Application No. PCT/US2014/036673, dated Aug. 28, 2014.Applicant
- U.S. Appl. No. 14/473,950, filed Aug. 29, 2014.Applicant
- Final Office Action from U.S. Appl. No. 14/176,006, dated Sep. 3, 2014.Applicant
- Bishop, C.M., “Neural Networks for Pattern Recognition,” Oxford University Press, Inc., 1995, p. 27.Applicant
- Bishop, C.M., “Neural Networks for Pattern Recognition,” Oxford University Press, Inc., 1995, pp. 77-85.Applicant
- Bishop, C.M., “Neural Networks for Pattern Recognition,” Oxford University Press, Inc., 1995, pp. 230-247.Applicant
- Bishop, C.M., “Neural Networks for Pattern Recognition,” Oxford University Press, Inc., 1995, pp. 295-300.Applicant
- Bishop, C.M., “Neural Networks for Pattern Recognition,” Oxford University Press, Inc., 1995, pp. 343-345.Applicant
- Final Office Action from U.S. Appl. No. 14/220,023, dated Sep. 18, 2014.Applicant
- International Search Report and Written Opinion from PCT Application No. PCT/US14/26597, dated Sep. 19, 2014.Applicant
- U.S. Appl. No. 14/491,901, filed Sep. 19, 2014.Applicant
- Final Office Action from U.S. Appl. No. 14/220,029, dated Sep. 26, 2014.Applicant
- International Search Report and Written Opinion from PCT Application No. PCT/US14/36851, dated Sep. 25, 2014.Applicant
- Notice of Allowance from U.S. Appl. No. 14/176,006, dated Oct. 1, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 11/752,691, dated Oct. 10, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/146,848, dated Dec. 6, 2016.Applicant
- U.S. Appl. No. 15/389,342, filed Dec. 22, 2016.Applicant
- U.S. Appl. No. 15/390,321, filed Dec. 23, 2016.Applicant
- Final Office Action from U.S. Appl. No. 14/177,136, dated Nov. 4, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/177,136, dated Apr. 13, 2016.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/177,136, dated Dec. 29, 2014.Applicant
- “Location and Camera with Cell Phones,” Wikipedia, Mar. 30, 2016, pp. 1-19.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/176,006, dated Apr. 7, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/220,023, dated May 5, 2014.Applicant
- Non-Final Office Action from U.S. Appl. No. 14/220,029, dated May 14, 2014.Applicant
- International Search Report and Written Opinion from International Application No. PCT/US2016/043204, dated Oct. 6, 2016.Applicant
- Final Office Action from U.S. Appl. No. 14/818,196, dated Jan. 9, 2017.Applicant
- Decision to Refuse from European Application No. 10 741 580.4, dated Jan. 20, 2017.Applicant
- Rainardi, V., “Building a Data Warehouse: With Examples in SQL Server,” Apress, Dec. 27, 2007, pp. 471-473.Applicant
- Office Action from Japanese Patent Application No. 2015-229466, dated Nov. 29, 2016.Applicant
- Extended European Search Report from European Application No. 14792188.6, dated Jan. 25, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/394,719, dated Feb. 21, 2017.Applicant
- Non-Final Office Action from U.S. Appl. No. 15/389,342, dated Mar. 10, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 14/818,196, dated Mar. 16, 2017.Applicant
- Notice of Allowance from U.S. Appl. No. 15/385,707, dated Aug. 15, 2018.Applicant
- Macciola et al., U.S. Appl. No. 16/052,495, filed Aug. 1, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/390,321, dated Sep. 19, 2018.Applicant
- Notice of Allowance from U.S. Appl. No. 14/829,474, dated Oct. 1, 2018.Applicant
- Abiteboul et al., “Collaborative Data-Driven Workflows: Think Global, Act Local,” ACM, PODS, Jun. 2013, pp. 91-102.Applicant
- Chen et al., “A Model Driven Visualization Platform for Workflow,” ACM, VINCI, Sep. 2010, 6 pages.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/396,322, dated Oct. 16, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/234,993, dated Oct. 11, 2018.Applicant
- Corrected Notice of Allowance from U.S. Appl. No. 15/385,707, dated Oct. 16, 2018.Applicant
- Ma et al., U.S. Appl. No. 16/151,090, filed Oct. 3, 2018.Applicant