Character count determination for a digital image

An image processing system or electronic device may implement processing circuitry. The processing circuitry may receive an image, such as financial document image. The processing circuitry may determine a character count for the financial document image or particular portions of the financial document image without recognizing any particular character in the financial document image. In that regard, the processing circuitry may determine a top left score for pixels in the financial document, the top left score indicating or representing a likelihood that a particular pixel corresponds to a top left corner of a text character. The processing circuitry may also determine top right score for image pixels. Then, the processing circuitry may identify one or more text chunks using the top left and top rights scores for pixels in the financial document image. The processing circuitry may determine a character count for the identified text chunks.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
BACKGROUND

1. Technical Field

This disclosure relates to determining a character count for an image, such as a financial document image. This disclosure also relates to determining the character count of the image without recognizing the identity of the characters in the image.

2. Description of Related Art

Systems may receive digital images for processing. As one example, an electronic device may capture an image of a financial document, such as a check. The user can submit the image of the check to a financial institution server for processing and deposit of the check. However, the check image may be degraded in multiple ways. The check may be overly cropped by the user such that important fields or portions of the check are cropped out of the check image. The image capture device of the electronic device may capture a blurry image of the check. These degradations may inhibit subsequent processing of the check image.

BRIEF SUMMARY

The descriptions below include methods, systems, logic, and devices for processing an image and determining a number of characters in the image with recognizing or attempting to recognize the actual text or characters in the image. In one aspect, a method is performed by circuitry, such as a processor, in an electronic device. The method performed by the circuitry includes receiving a financial document image and identifying a text chunk in the financial document image by determining a first pixel of the financial document image as the top left pixel of the text chunk based on a top left score of the first pixel and determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel. The method further includes determining a character count for the text chunk without recognizing any particular character in the text chunk.

In another aspect, a system includes a memory and a processor. The processor is operable to receive a financial document image and identify a text chunk in the financial document image by determining a first pixel of the financial document image as top left pixel of the text chunk based on a top left score of the first pixel and determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel. The processor is also operable to determine a chunk extension for the text chunk and add the chunk extension to the text chunk. After adding the chunk extension to the text chunk, the processor is operable to determine a character count for the text chunk without recognizing any particular character in the text chunk.

In another aspect, a non-transitory computer readable medium includes instructions that, when executed by a processor, cause the processor to receive a financial document image; identify an interest region in the financial document image; and identify a text chunk in the interest region of the financial document image. The instructions cause the processor to identify the text chunk by determining a first pixel of the financial document image as top left pixel of the text chunk based on a top left score of the first pixel and determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel. The instructions also cause the processor to determine a character count for the text chunk in the interest region of the financial document image without recognizing any particular character in the text chunk; determine a character count for the interest region by summing the character count for the text chunk with a character count of any additional text chunks in the interest region; and determine whether the character count for the interest region exceeds a minimum character count threshold specifically for the interest region.

BRIEF DESCRIPTION OF THE DRAWINGS

The innovation may be better understood with reference to the following drawings and description. In the figures, like reference numerals designate corresponding parts throughout the different views.

FIG. 1 shows an example of a system for determining a character count of an image.

FIG. 2 shows an example of a financial document image.

FIG. 3 shows an example of a top left scoring grid for an image pixel.

FIG. 4 shows an example of a top left score array.

FIG. 5 shows an example of a top right scoring grid for an image pixel.

FIG. 6 shows an exemplary flow for determining a top right pixel of a text chunk.

FIG. 7 shows examples of text chunks the processing circuitry may determine.

FIG. 8 shows an example of logic for identifying one or more text chunks in an image.

FIG. 9 shows an exemplary flow for counting characters in a text chunk.

FIG. 10 shows an example of logic for obtaining a character count for a text chunk.

FIG. 11 shows an example of logic that may be implemented in hardware, software, or both.

 DETAILED DESCRIPTION

FIG. 1 shows an example of a system 100 for determining a character count of an image. The system 100 in FIG. 1 includes an electronic device 102 communicatively linked to an image processing system 104 through a communication network 106. The electronic device 102 may include or communicate with an image capture device that captures digital images, such as a digital camera or scanning device. In FIG. 1, the electronic device 102 is a mobile communication device, e.g., a cellular telephone with a digital camera. However, the electronic device 102 may take any number of forms, including as examples a laptop, digital camera, personal digital assistant (PDA), tablet device, portable music player, desktop computer, any image scanning device, or others. The electronic device 102 may also include any number of communication interfaces supporting communication through the communication network 106.

The communication network 106 may include any number of networks for communicating data. In that regard, the communication network 106 may include intermediate network devices or logic operating according to any communication number of mediums, protocols, topologies, or standards. As examples, the communication network 106 may communicate across any of the following mediums, protocols, topologies and standards: Ethernet, cable, DSL, Multimedia over Coax Alliance, power line, Ethernet Passive Optical Network (EPON), Gigabit Passive Optical Network (GPON), any number of cellular standards (e.g., 2G, 3G, Universal Mobile Telecommunications System (UMTS), GSM (R) Association, Long Term Evolution (LTE) (TM), or more), WiFi (including 802.11a/b/g/n/ac), WiMAX, Bluetooth, WiGig, and more.

The exemplary system 100 shown in FIG. 1 also includes the image processing system 104. As described in greater detail below, the image processing system 104 may determine a character count for an image received by the image processing system 104. The image processing system 104 may determine the character count for the image without recognizing the content or identity of characters in the image.

In some implementations, the image processing system 104 may include a communication interface 110, processing circuitry 112, and a user interface 114. The processing circuitry 112 of the image processing system 104 may perform any functionality associated with the image processing system 104, including any combination of the image processing techniques and methods described below. In one implementation, the processing circuitry 112 includes one or more processors 116 and a memory 120. The memory 120 may store image processing instructions 122 and character count parameters 124. The character count parameters 124 may include any parameters, settings, configurations, or criteria that control how the processing circuitry 112 determines process an image, including determining of a character count for the image. In some variations, the electronic device 102, such as a mobile device, may additionally or alternatively implement any of the functionality of the processing circuitry 112 described herein.

The processing circuitry 112 may process any digital image that may include text. As examples, the processing circuitry 112 may process an image of any type of financial document, including negotiable instruments such as personal checks, business checks, money orders, promissory notes, certificate of deposits, and more. As additional examples, the processing circuitry 112 may process images of any other type, such as a image of any type of insurance form or document, tax documents (e.g., form 1040), employment forms, savings bonds, traveler's checks, job applications, any type of bill, such as an automotive repair bill or medical bill, a remittance coupon, and images of many more types.

FIG. 2 shows an example of a financial document image 200 that the processing circuitry 112 may determine a character count for. A financial document image may refer to an image that includes any portion of a financial document. In particular, the example in FIG. 2 shows an image of a check, though the financial document image 200 may take various forms. The processing circuitry 112 may receive the financial document image 200 and apply any number of image processing functions prior to performing a character count process for the financial document image. For instance, the processing circuitry 112 may determine one or more corners or edges of the financial document image 200, deskew the image 200 to remove distortions, adjust the contrast of the image 200 to ease subsequent processing, apply any number of image cleaning algorithms, de-blur the image 200, binarize the image into black and white pixels, and more. As another example, the processing circuitry 112 may adjust the size of the image 200 to a particular height or width (e.g., in pixels) or to a particular proportion of the originally received image (e.g., shrink the image 200 to ¼ of the original size). The processing circuitry 112 may resize the image such that expected text in the financial document image (e.g., text of a particular font, particular font size, particular font size range, etc.) is of a particular pixel height, width, or within a particular pixel range.

The processing circuitry 112 may convert the financial document image 200 into a pixel array for processing. To illustrate, the financial document image 200 in FIG. 2 includes the image portion labeled as 210. The exemplary image portion 210 includes a number of pixels binarized into either white pixels or black pixels, as seen in the expanded image portion 210 reproduced and expanded in FIG. 2 above the financial document image 200. The processing circuitry 112 may represent the image portion 210 as a pixel array of black and white pixels. As one example, the processing circuitry 112 may represent the financial document image 200, including the image portion 210, as a two-dimensional array of array values, where an array value of ‘0’ indicates a white pixel and an array value of ‘1’ indicates a black pixel. The processing circuitry 112 may perform any of the image processing steps described above in preparation of determining the character count for the financial document image 200.

Exemplary processes through which the processing circuitry 112 may determine or estimate a character count for the financial document image 200 are presented next. First, the processing circuitry 112 may identify one or more text chunks in the financial document image 200, for example as described through FIGS. 3-8. Next, the processing circuitry 112 may determine a character count for some or all of the identified text chunks, for example as described through FIGS. 9-10.

Identifying Text Chunks

The processing circuitry 112 may identify one or more text chunks in the financial document image 200. A text chunk may refer to a particular portion of set of pixels of the financial document image 200 that may contain one or more text characters. In doing so, the processing circuitry 112 may evaluate the financial document image 200 to determine the likelihood particular portions (e.g., particular pixels) of the image 200 correspond to the boundary of a character, such as any edge, a top right corner, a top left corner, or other boundary portion of a text character.

In particular, the processing circuitry 112 may determine a likelihood that an image pixel corresponds to or is within a particular distance from the top left corner of a character. In some variations, the processing circuitry 112 may apply a top left scoring algorithm for pixels in the financial document image 200 to specify this likelihood. In scoring a particular pixel, the top left scoring algorithm may account for any number of other pixels surrounding the particular pixel. One such example is presented next in FIG. 3.

FIG. 3 shows an example of a top left scoring grid 301 for an image pixel 302. A scoring grid of pixels may represent a set of pixels surrounding a particular pixel, and the processing circuitry 112 may use the top left scoring grid 301 to apply a top left scoring algorithm to the image pixel 302. The top left scoring grid 301 may take various sizes or shapes, which may be specified through the character count parameters 124. The character count parameters 124 may, for instance, specify a height and/or width of the top left scoring grid 301. As shown in FIG. 3, the processing circuitry 112 determines the top left scoring grid 301 as a 6 by 6 array of pixels with the image pixel 302 being evaluated by the top left scoring algorithm positioned as the top left pixel of the top left scoring grid 301.

The character count parameters 124 may specify dimensions for a scoring grid according to any number of factors, some of which are presented next. The processing circuitry 112 may resize the financial document image 200 such that expected text of the image has a particular size, e.g., a MICR line, courtesy amount line, or other particular text in the financial document image 200 has particular pixel height, width, or pixel size range. The character count parameters 124 may specify, for example, dimensions for the top left scoring grid 301 such that the top left scoring grid 301 (or a non-padded portion thereof as discussed in greater detail below) covers a predetermined portion of an expected text character in the financial document image 200. As another variation, the character count parameters 124 may specify a scoring grid size that covers ⅓ the width an expected text character and ½ the height of an expected text character, which may be specified in pixels.

In some implementations, the character count parameters 124 specify the dimensions of a scoring grid to account for a particular pixel density of the financial document image 200. For instance, the character count parameters 124 may specify a particular dimension (e.g., 6 pixels wide by 9 pixels high) for scoring grid given a particular pixel density of the image 200 (e.g., for a 200 Dots-Per-Inch image). Additionally or alternatively, the character count parameters 124 may specify a scoring grid dimension to account for a minimum expected font size or minimum relevant font size in an image, for which the pixel size may vary depending on how the image was resized by the processing circuitry 112.

The processing circuitry 112 may determine a top left score for a pixel. The scoring algorithm may implement a scoring range indicative of the likelihood that the image pixel 302 corresponds to a top left corner of a character or is within a particular padded distance from the top left corner of a character. With regards to a padded distance, the top left scoring algorithm may include a padding parameter. The padding parameter may specify a particular padding of white pixels that surround the top left corner of a character. For example, with a padding parameter value of 2, the image pixel 302 may have an increased top left score when the image pixel 302 is two pixels above and two pixels to the left of a top left corner pixel of a text character. For top left scoring, the character count parameters 124 may specify a top padding parameter, a left padding parameter, or both.

The processing circuitry 112 may determine a top left score for the image pixel 302 according to the distribution of white and/or black pixels in the top left scoring grid 301. With padding, the scoring algorithm may indicate a higher likelihood of the image pixel 302 corresponding to a top left corner of a character when particular portions of the top left scoring grid 301 are white pixels, e.g. a white padded portion of the top left scoring grid 301. Along similar lines, the scoring algorithm may indicate a higher likelihood of a pixel corresponding to the top left corner when particular portions of the top left scoring grid 301 are black pixels, e.g., a black character portion. As one example, for a padding parameter value of 2 (for both top and left), the character count parameters 124 may specify an ideal distribution of white and black pixels in a 6×6 top left scoring grid 301 as the following configuration:

W W W W W W W W W W W W W W B B B B W W B B B B W W B B B B W W B B B B

The ideally white (W) pixels in the above ideal configuration may form the white padded portion for determining a top left score and the ideally black pixels (B) may form the black character portion for determining a top left score. When determining a top left score for a pixel, the processing circuitry 112 may determine the proportion of the white padded portion of the top left scoring grid 301 for that pixel that includes white pixels and the proportion of the black character portion that includes black pixels.

The processing circuitry 112 may apply weights when evaluating the pixels in the top left scoring grid 301. That is, the processing circuitry 112 may give more or less weight when a particular pixel in a particular position in the top left scoring grid 301 is either white or black. For instance, the character count parameters 124 may specify greater weight for pixels that are closer to a particular pixel, edge, or region in the top left scoring grid 301. One exemplary weighting for a 6×6 top left scoring grid 301 with a padding parameter value of 2 is as follows:

1 1 1 1 1 1 1 2 2 2 2 2 1 2 4 4 4 4 1 2 4 3 3 3 1 2 4 3 2 2 1 2 4 3 2 1

In the above weighting, white pixels in the white padded portion are given a weight (e.g., multiplier) by 1 or 2. Black pixels in the white padded portion may be given a weight of 0. Black pixels in the black character portion are given a weight of 4, 3, 2 or 1, as shown by the underlined weights for pixels in the black character portion. White pixels in the black character portion may be given a weight of 0. In that regard, the processing circuitry 112 may determine a weighted proportion of white pixels in the white padded portion (e.g., a white padded score), for example by dividing a weighted sum for the pixels in a white padded portion by the ideal weighted value for the white padded portion. The processing circuitry 112 may determine a black character score in a consistent manner as well.

To illustrate, the processing circuitry 112 may determine the top left score for the image pixel 302 with the particular top left scoring grip 301 depicted in FIG. 3 according to a padding value of 2 and the exemplary weights shown above. The processing circuitry 112 may calculate a white padded portion score and black character score for the top left scoring grid 301. In particular, the white padded portion of the top left scoring grid 301 shown in FIG. 3 has pixel array of:

W W W W W W W W W W W W W B — — — — W B — — — — W B — — — — W B — — — —

Applying the weights for white and black pixels in the white padded portion, the processing circuitry 112 may determine the following weighted values for the white padded portion:

1 1 1 1 1 1 1 2 2 2 2 2 1 0 — — — — 1 0 — — — — 1 0 — — — — 1 0 — — — —

Summing the weighted values, the processing circuitry 112 may determine the weighted sum for the white padded portions as 21. The processing circuitry 112 may identify the ideal weighted value (e.g., when all the pixels in the white padded portion are white) as 29. Accordingly, the processing circuitry 112 may determine the white padded score of the top left scoring grid 301 shown in FIG. 3 as 21/29=0.72.

The processing circuitry 112 may similarly determine a black character score of the top left scoring grid 301. The processing circuitry 112 may apply the exemplary weighting shown above for the black character portion of the top left scoring grid 301 in FIG. 3. In doing so, the processing circuitry 112 may determine the following weighted values for the black character portion:

— — — — — — — — — — — — — — 4 0 0 0 — — 4 3 0 3 — — 4 3 2 2 — — 4 3 2 1

In this example, the processing circuitry 112 may determine the weighted sum for the black character portion as 35 and the ideal weighted sum (e.g., when all the pixels in the black character portion are black) as 50. Accordingly, the processing circuitry 112 may, in one implementation, determine the weighted black character score of the top left scoring grid 301 shown in FIG. 3 as 35/50=0.70.

The processing circuitry 112 may additionally apply weights when accounting for the white padded score and the black character score. When weighted equally, the processing circuitry 112 may determine the top left score of the image pixel 302 as the average the white padded score and black character score. In this example, the processing circuitry 112 determines the top left score of the image pixel 302 as (0.5)*0.72+(0.5)*0.70=0.71, as shown in FIG. 3. In other variations, the processing circuitry 112 may apply a greater weight to the white padded score than the black character score or vice versa.

The processing circuitry 112 may determine the top left score for the image pixel 302 as well as for any number of other pixels in the financial document image 200. The top left score determination method above may provide an quick and efficient method for determining the likelihood a particular pixel corresponds to the top left corner of a text character. The processing circuitry 112 may determine a respective top left score for pixels and identify pixels with a greater likelihood of corresponding to the top left corner of a character without, for example, performing edge detection processes or other processing-intensive processes.

While some particular examples have been presented above, the character count parameters 124 may specify any number of different configurations for determining a top left score, including varying height and width dimensions for the top left scoring grid 301, varying padding parameter values (including top padding, left padding, or both), as well as varying weight configurations, such as weights applied to particular pixels in the white padded portion or the black character portions, or to the white padded and black character scores. Another weighting configuration for a 6×9 top left scoring grid 301 with a top and left padding of 3 may be as follows (with black character portion weights underlined):

1 1 1 1 1 1 1 2 2 2 2 2 1 2 3 3 3 3 1 2 3 3 2 1 1 2 3 2 2 1 1 2 3 1 1 1 1 2 3 1 1 1 1 2 3 1 1 1 1 2 3 1 1 1

In this example, the white padded portion is weighted along the edge of the top and left edges of a character and the black character portion is weighted to emphasize the top left pixel of the character. The character count parameters 124 may implement any number of varying configurations through which the processing circuitry 112 determines the top left score for pixels in the financial document image 200.

FIG. 4 shows an example of a top left score array 400. In particular, the top left score array 400 shown in FIG. 4 includes top left scores for a row of pixels in the financial document image 200, e.g., after the processing circuitry 112 has determined the top left scores for that particular row of pixels. Along similar lines, the processing circuitry 112 may determine the top left scores for the remaining pixels of the financial document image 200 as well. In the exemplary top left score array 400 shown in FIG. 4, the processing circuitry 112 may determine the respective top left score for pixels in the financial document image 200 according to the following parameters: using a 6×9 pixel dimension for a top left scoring grid, a padding parameter value of 2, and an equal weight (e.g., half or 0.5) for the white padded score and black character score.

The processing circuitry 112 may determine a respective top left score for some or all of the pixels in the financial document image 200. For example, the processing circuitry 112 may abstain or forego determining the top left score for a pixel when the pixel is in a particular region of the financial document image 200, e.g., in the bottom-most row of the image 200, within a predetermined number of rows from the bottom-most row, in the right-most column of the image 200, or within a predetermined number of rows from the right-most column. As another example, the processing circuitry 112 may selectively determine the top left scores for pixels within a predetermined pixel distance from an interest region of the financial document image 200, such as the Magnetic Ink Character Recognition (MICR) location of a check, from a particular form field of an insurance document, and the like.

Before, during, or after determining the top left score for pixels in the financial document image 200, the processing circuitry 112 may determine a top right score for one or more pixels in the financial document image 200. In that regard, the processing circuitry 112 may determine a likelihood that an image pixel corresponds to or is within a particular pixel distance from the top right corner of a text character. The processing circuitry 112 may apply a scoring algorithm similar in many respects to top left scoring algorithm described above, but with any number of variances. For example, the configuration, weights, and other parameters specified by the character count parameters 124 for determining the top right score may be vertically mirrored from those used for determining a top left score.

The character count parameters 124 may specify distinct parameters through which the processing circuitry 112 determines a top right score for a pixel. In that regard, the character count parameters 124 may specify different configurations for a top right scoring grid as compared to the top left scoring grid, including differences in scoring grid dimensions, weights applied to pixels within a top right scoring grid, etc. In particular, the processing circuitry 112 may use a top padding parameter value and/or right padding parameter value in determining the top right score for a pixel, but not a left padding parameter value (as compared to the top left score determination parameters that may include a top left padding parameter value but not a top right padding parameter value).

FIG. 5 shows an example of a top right scoring grid 501 for an image pixel 502. The top right scoring grid 501 in FIG. 5 has a height and width of 6 pixels and a padding parameter value of 2. In this example, the character count parameters 124 may specify an ideal distribution of white and black pixels in the 6×6 top right scoring grid 501 as the following configuration:

W W W W W W W W W W W W B B B B W W B B B B W W B B B B W W B B B B W W

The ideally white (W) pixels in the above ideal configuration may form the white padded portion for determining the top right score for a particular pixel, e.g., the top right pixel of the top right scoring grid 501. The ideally black (B) pixels in the above ideal configuration may form the black character portion for determining the top right score. One exemplary weighting for a 6×6 top right scoring grid 501 with a padding value of 2 is as follows (with black character weights underlined):

1 1 1 1 1 1 2 2 2 2 2 1 4 4 4 4 2 1 3 3 3 4 2 1 2 2 3 4 2 1 1 2 3 4 2 1

As seen, this exemplary weighting for a 6×6 top right scoring grid 501 is vertically mirrored from the exemplary weighting for a 6×6 top left scoring grid 301 discussed above.

The processing circuitry 112 may apply the weights to the top right scoring grid 501 for the image pixel 502 specifically shown in FIG. 5, which may be represented by the following pixel array (pixels in the black character portion underlined):

W W W W W W W W W W W W W W B B W W B W B B W W B B B B W W B B B B W W

The processing circuitry 112 may determine the weighted sum of the white padded portion to be 29 and the ideal weighted sum to be 29. In this example, the processing circuitry 112 determines the white padded score as 29/29=1.0. Following consistent respective calculations, the processing circuitry 112 may determine the black character score as 0.70. The processing circuitry 112 may, for example, apply the same weight to each score and determine the top right score of the image pixel 502 as (0.5)*1.0+(0.5)*(0.70)=0.85, as shown in FIG. 5. In a similar way, the processing circuitry 112 may determine a respective top right score for some or all of the pixels in the financial document image 200.

The processing circuitry 112 may determine top right scores and top left scores for some or all of the pixels in the financial document image 200. For a particular pixel, the processing circuitry 112 may determine a top right score for the particular pixel, a top left score for the particular pixel, or both. After determining top right and top left scores for pixels of the financial document image 200, the processing circuitry 112 may use the determined top right scores and top left scores to identify text chunks in the financial document image 200.

The processing circuitry 112 may identify a text chunk by determining one or more boundary pixels or edges for the text chunk. As one exemplary process described in greater detail below, the processing circuitry 112 may determine a top left pixel of the text chunk, a top right pixel of the text chunk, and a bottom edge of the text chunk. In that regard, the processing circuitry 112 may sequentially consider pixels in the financial document image 200 to identify a boundary of a text chunk. For example, the processing circuitry 112 may start the sequential processing of pixels for the text chunk determination process at the top left pixel of the financial document image 200. Or, the processing circuitry 112 may start with a pixel belongs to a particular portion of the financial document image 200, e.g., a MICR line portion of a check image.

The processing circuitry 112 may identify pixels or boundaries for a text chunk according to any number of chunk boundary criteria, which may be specified by the character count parameters 124. For a current pixel being considered for text chunk identification, the processing circuitry 112 may first determine whether the current pixel is already part of a previously determined text chunk. If so, the processing circuitry 112 may exclude the current pixel from belonging to another text chunk and proceed to a subsequent pixel for consideration.

When a current pixel is not part of a previously determined text chunk, the processing circuitry 112 may determine whether the current pixel meets chunk boundary criteria for a top left pixel of the text chunk. The processing circuitry 112 may identify the current pixel as the top left pixel for a text chunk when the top left score of the current pixel is equal to or exceeds a top left score threshold, such as a top left score threshold of 0.65 in some implementations. Accordingly, the processing circuitry 112 may identify a top left pixel for the text chunk without performing additional or more complicated image processing techniques, e.g., without performing edge detection algorithms. After determining a top left pixel for a text chunk, the processing circuitry 112 may determine the top right pixel for the text chunk.

The processing circuitry 112 may determine a top right pixel for the text chunk by evaluating pixels to the right of the determined top left pixel of the text chunk. In that regard, the processing circuitry 112 may determine a set of potential top right pixels based on the top left scores of the pixels being evaluated, e.g., top right candidate pixels. In one implementation, the processing circuitry 112 determines the top right candidate pixels for the text chunk as a set of consecutive pixels with a top left score below a top left score threshold, as set by the character count parameters 124. The character count parameters 124 may specify the same or a different top left score threshold used for identifying the top left pixel of the text chunk and the top right candidate pixels of the text chunk.

To illustrate, the processing circuitry 112 may start at the determined top left pixel of the text chunk and sequentially consider pixels to the right of the top left pixel. When the current pixel has a top left score less than the top left score threshold for identifying a top right pixel (e.g., 0.65), the processing circuitry 112 may increment a counter value and continue to the next pixel. When the current pixel has a top left score equal to or greater than the top left score threshold for identifying a top right pixel (e.g., 0.65), the processing circuitry 112 may reset the counter to 0 and continue to the next pixel. When the counter value reaches a counter threshold value (e.g., 13), the processing circuitry 112 may identify a number of previously considered pixels equal to the counter threshold value as the top right candidate pixels (e.g., the 13 previously considered pixels when the counter threshold value is 13). An exemplary iteration of this process is presented in FIG. 6.

FIG. 6 shows an exemplary flow 600 for determining a top right pixel of a text chunk. In the exemplary flow 600 in FIG. 6, the processing circuitry 112 reads the character count parameters 124, which may specify a top left score threshold for identifying the top right pixel as 0.65 and the counter threshold value as 13. As the processing circuitry 112 evaluates successive pixels, the processing circuitry 112 either increments a counter value when the top left score of the pixel is less than 0.65 or resets the counter value when the top left score of the pixels is equal to or greater than 0.65. In this example, when the processing circuitry 112 identifies thirteen (13) consecutive pixels with a top left score less than 0.65, the processing circuitry 112 determines the top right candidate pixels 610 for the text chunk.

The processing circuitry 112 may determine the top right pixel for the text chunk from among the top right candidate pixels 610. In some implementations, the processing circuitry 112 identifies the pixel with the highest top right score from among the top right candidate pixels 610 as the top right pixel for the text chunk. In the example shown in FIG. 6, the processing circuitry 112 determines the pixel with the top right score of 0.83 as the top right pixel 620 for the text chunk. The processing circuitry 112 may identify a top right pixel for the text chunk without performing additional or more complicated image processing techniques, e.g., without performing edge detection algorithms.

After determining a top left and top right corner for a text chunk, the processing circuitry 112 may determine a bottom edge of the text chunk. In doing so, the processing circuitry 112 may consider rows of pixels below the particular row of pixels formed by and between the top left and top right pixels, e.g., the top row of the text chunk. The processing circuitry 112 may identify a first row of pixels below the top row of the text chunk formed by the top left and top right pixels with a proportion of white pixels that exceeds a bottom edge threshold. In some variations, the character count parameters 124 may set the bottom edge threshold at 90%, for example. The processing circuitry 112 may determine the bottom edge of the text chunk as the upper edge of the identified first row of pixels with a proportion of white pixels that exceeds the bottom edge threshold.

In determining the bottom edge of the pixel chunk, the processing circuitry 112 may ignore or not consider a number of pixel rows at the top of the text chunk equal to the padding parameter value. For example, when the padding parameter value is set to 2, the processing circuitry 112 may not consider the top two rows of pixels formed between the top left and top right pixels when identifying the bottom edge of the text chunk. Put another way, the processing circuitry 112 may forego considering the top row of pixels that includes the top left and top right pixels and the next row of pixels directly below the top row when the padding parameter value is 2. Accordingly, the processing circuitry 112 may determine a text chunk formed by a top left pixel, a top right pixel, and a bottom edge. The processing circuitry 112 may further process the text chunk as well, some examples of which are shown in FIG. 7.

FIG. 7 shows examples of text chunks 710, 720, and 730 the processing circuitry 112 may determine. The processing circuitry 112 may determine the text chunk labeled as 710 with boundaries set by the top left pixel 711, top right pixel 712, and the bottom edge 713 using any of the methods or techniques described above. In particular, in determining the text chunk 710, the character count parameters 124 may specify a padding parameter value of 2, and accordingly, the processing circuitry 112 may forego considering the first two rows of pixels in the text chunk 710 when determining the bottom edge 713. As seen in FIG. 7, the row of pixels below the bottom edge 713 is composed entirely of white pixels, and the processing circuitry 112 may identify this row as the first row of pixels that exceed a bottom edge threshold. Accordingly, the processing circuitry 112 may determine the bottom edge 713 of the text chunk 710 as the upper edge of this row of white pixels exceeding the bottom edge threshold.

In some variations, the processing circuitry 112 may pad the bottom edge 713 of a determined text chunk 710. In that regard, the processing circuitry 112 may add a number of rows of white pixels below the bottom edge 713 as set by the character count parameters 724. In the example shown in FIG. 7, the processing circuitry 112 determine the text chunk 720 by padding the text chunk 710 with two rows of white pixels, e.g., through setting the padded bottom edge 723 as the bottom edge of a text chunk.

In some variations, the processing circuitry 112 may adjust the left or right edges of a determined text chunk. For example, the processing circuitry 112 may pad the left edge of a text chunk, right edge of a text chunk, or both as similarly described above with regards to padding the bottom edge 713 of the text chunk 710. The processing circuitry 112 may additionally or alternatively adjust the left or right edges of a text chunk to include a chunk extension. In FIG. 7, the processing circuitry 112 may determine the text chunk 730 by adjusting the text chunk 720 to include the chunk extension 740.

The processing circuitry 112 may determine a chunk extension for a text chunk. In doing so, the processing circuitry 112 may consider the columns of pixels to the right or left of an edge of a text chunk and determine occurrence of a threshold number of consecutive white pixel columns, e.g., a consecutive number of columns each or which and/or collectively have a proportion of white pixels that exceed an extension threshold, such as 90% white pixels. The columns considered by the processing circuitry 112 may be to the left or right of the text chunk and have the same height as the text chunk. The processing circuitry 112 may determine the chunk extension as the section of pixels between the edge of the text chunk and the identified consecutive white pixels columns.

As one particular example shown in FIG. 7, the processing circuitry 112 may determine the text chunk 720. Then, the processing circuitry 112 may determine the chunk extension 740 when, for example, the next threshold number of (e.g., the next 20) pixel columns to the right of the chunk extension 740 in the financial document image 200 are each 90% (or more) white. Accordingly, the processing circuitry 112 may determine the text chunk 730 by appending the chunk extension 740 to the text chunk 720. As such, the processing circuitry 112 may identify the top right pixel 732 in the chunk extension 740 as part of the boundary of the text chunk 730.

In processing the financial document image 200, the processing circuitry 112 may determine the text chunks 710 and 720 shown in FIG. 7 as intermediate text chunks and the text chunk 730 as the determined text chunk. However, the character count parameters 124 may include any number of additional or alternative parameters for determining intermediate text chunks before obtaining a determined text chunk.

FIG. 8 shows an example of logic 800 for identifying one or more text chunks in an image. The logic 800 may be implemented in hardware, software, or both. For example, the processing circuitry 112 may implement the logic 800 in software as the image processing instructions 122.

The processing circuitry 112 may read the character count parameters 124 (802) and receive an image (804). The image may, for example, be a financial document image 200 such as a check or insurance form. The processing circuitry 112 may perform various pre-processing on the image, such as cleaning up the image, resizing the image to control the text size of expected text in the image (e.g., text of a MICR line or courtesy line in a check), binarizing the image, or converting the image to a pixel array.

The processing circuitry 112 may determine a respective top left score for some or all of the pixels in the image (804). The processing circuitry 112 may determine a respective top right score for some or all of the pixels in the image (806), including for pixels different from the pixels for which the processing circuitry 112 determines respective top left scores. In some implementations, the processing circuitry 112 may determine the top left scores and/or top right scores for specific portions (e.g., interest regions) of the image, and decline or skip determining the top left and/or top right scores for pixels outside of the interest regions of the image. As one example, the character count parameters 124 may specify a MICR line region, upper left hand corner, amount region on the middle right side, or other portions of a check image as interest regions. Upon determining the top left and top right scores for image pixels in the image, the processing circuitry 112 may sequentially process pixels in the image. In that regard, the processing circuitry may determine whether any additional pixels in the image remain for processing (810), e.g., whether any unprocessed pixels remain in the interest region(s) of the image. If so, the processing circuitry 112 may set a current pixel (812). The processing circuitry 112 may set the current pixel as the next pixel in a pixel processing ordering. For example, the processing circuitry 112 may process pixels ordering from left to right and row by row from the top left corner of the image to the bottom right corner of the image or interest region.

For a current pixel, the processing circuitry 112 determines whether the current pixel is already part of a previously formed text chunk (816). For example, the processing circuitry 112 may access a listing of determined text chunks for the image, and determine whether the pixel is already part of another determined text chunk. If so, the processing circuitry 112 may proceed to consider a subsequent pixel of the image or interest region, if any remain (810).

The processing circuitry 112 may determine the boundaries of a text chunk. In that regard, the processing circuitry 112 may determine a top left corner for the text chunk. The processing circuitry 112 may determine, for example, whether the top left score of the current pixel exceeds (or alternatively, is equal to or greater than) a top left score threshold, which may be set by the character count parameters 124. When the top left score of the current pixel does not exceed the top left score threshold, the processing circuitry 112 may proceed to consider a subsequent pixel of the image or interest region, if any remain (810). When the top left score of the current pixel exceeds the top left score threshold, the processing circuitry 112 may set the current pixel as the top left corner of the text chunk (820).

Continuing the boundary determination for a text chunk, the processing circuitry 112 may determine a top right pixel for the text chunk (822) through any of the methods or techniques described above. For example, the processing circuitry 112 may determine a set of top right candidate pixels from the image, and identify the top right corner of the text chunk as the pixel from among the top right candidate pixels with the highest top right score (e.g., the pixel most likely to correspond to the top right corner or a text character as specified by top right score). The processing circuitry 112 may also determine the bottom edge of the text chunk (824) through any of the processes and techniques described above.

The processing circuitry 112 may further adjust the boundaries of a text chunk. In some variations, the processing circuitry 112 determines one or more chunk extensions (826) through which to extend the left edge or right edge (or both) of a text chunk. The processing circuitry 112 may additionally or alternatively pad the text chunk with white pixels, for example as specified by padding parameter(s) in the character count parameters 124. Using any combination of the techniques, process, or steps described above, the processing circuitry 112 may determine a text chunk.

Upon determining a text chunk, the processing circuitry 112 may validate the text chunk (830). As an exemplary validation, the processing circuitry 112 may determine whether the height of text chunk (e.g., pixel height) exceeds a minimum height threshold (e.g., 10 pixels). As another example, the processing circuitry may determine whether the height of the text chunk is within a maximum height threshold (e.g., 50 pixels). In some variations, the processing circuitry 112 may validate that all (or a threshold percentage) of the pixels in the text chunk are not a part of another determined text chunk. In these variations, the processing circuitry 112 may access a listing of previously determined text chunks to determine whether pixels of the text chunk belong to any of the previously determined text chunks. When the text chunk passes the validation process, the processing circuitry 112 may store the text chunk (832), e.g., by storing an indication of the text chunk in the determined text chunk listing. The indication may, for example, take the form of a database or data structure entry and may specify the boundary and/or pixels belonging to the associated text chunk. Then, the processing circuitry 112 may consider the subsequent pixel of the image or interest region, if any remain (810). When the text chunk fails the validation, the processing circuitry 112 may discard the text chunk and not store the text chunk in the determined text chunk listing. That is, the processing circuitry 112 may proceed to consider the subsequent pixel of the image or interest region (810) without storing an indication of the text chunk.

Determining Character Count

After identifying text chunks in an image, e.g., a financial document image 200, the processing circuitry 112 may determine a character count for the text chunks. As described in greater detail below, the processing circuitry 112 may determine the character count for a text chunk without specifically recognizing the identity or content of any particular text characters in the text chunk. For example, the processing circuitry 112 may determine the character count for the text chunk without performing any character recognition techniques, such as Optical Character Recognition (OCR) or other similar character recognition techniques.

FIG. 9 shows an exemplary character count 900 in a text chunk 910. The processing circuitry 112 may perform the character count 900 to determine a character count for the text chunk 910 without recognizing any particular characters in the text chunk 910. That is, the text chunk 910 shown in FIG. 9 includes the text “Wilmington, Del.” and the processing circuitry 112 may obtain a character count for the text chunk 910 without recognizing the letters or the comma within the text chunk 910.

The processing circuitry 112 may process the text chunk 710 to determine a character start column and a corresponding character end column. To do so, the processing circuitry 112 may start at the leftmost pixel column of the text chunk and sequentially consider pixel columns in text chunk 710. The processing circuitry 112 may identify a character start column when the number of black pixels in a current column exceeds a black column threshold, which may be specified in the character count parameters 124 as a number of pixels or percentage, for example. In the specific example shown in FIG. 9, the processing circuitry 112 identifies the character start column when a current pixel column has at least one black pixel or greater than 0% of black pixels. The processing circuitry 112 may identify the character start columns shown in FIG. 9 that are marked with the dotted arrows and labeled with a corresponding character start number.

Upon identifying a character start column, the processing circuitry 112 may continue to sequentially consider pixel columns to the left of the character start column to identify a corresponding character end column. The processing circuitry 112 may identify the corresponding character end column as the first pixel column to the right of the character start column with white pixels that exceed a white column threshold. The processing circuitry 112 may identify a character end column when a current pixel column has less than 2 black pixels, for example. As seen in the exemplary text chunk 910 in FIG. 9, the processing circuitry 112 identifies the character end columns marked with the non-dotted arrows and labeled with a corresponding character end number. After identifying a corresponding character end column for a particular character start column, the processing circuitry 112 may increment a character count value and continue sequentially considering pixel columns of the text chunk 910 to determine a next character start column. The processing circuitry 112 may continue the character count process until reaching the end of the text chunk 910, e.g., considering the rightmost column of the text chunk 910. In the example shown in FIG. 9, the processing circuitry 112 determines character count of the text chunk 910 be 13, and determines the character count without recognizing the content or identity of any of the characters in the text chunk 910.

FIG. 10 shows an example of logic 1000 for obtaining a character count for a text chunk. The logic 1000 may be implemented in hardware, software, or both. For example, the processing circuitry 112 may implement the logic 1000 in software as the image processing instructions 122.

The processing circuitry 112 may read the character count parameters 124 (1002) and obtain a text chunk (1004). In some implementations, the processing circuitry 112 may obtain the chunk by accessing a text chunk listing or data structure, which may provide, for example, an indication of the boundaries of a particular text chunk in an image. The text chunk may be in the form of a pixel array.

In determining a character count for a text chunk, the processing circuitry 112 may process one or more pixel columns in the text chunk. The processing circuitry 112 may determine a character start column in the text chunk and then a corresponding character end column. To do so, the processing circuitry 112 may process the pixel columns in the chunk in according to a pixel column processing ordering. For example, the processing circuitry 112 may process pixel columns in the text chunk in a sequential order from the left most pixel column to the right most pixel column. Accordingly, the processing circuitry 112 may determine whether any additional pixel columns in the text chunk remain for processing (1006). If so, the processing circuitry 112 may set the next pixel column in the pixel column processing ordering as the current column for determining a character start column (1008).

The processing circuitry 112 may identify a character start column when a current pixel column meets any number of character start column criteria. The processing circuitry 112 may identify a character start column based on a black column threshold, which may specify a percentage, proportion, or number of black pixels in a pixel column. Accordingly, the processing circuitry 112 may identify a character start column by determining whether the number or proportion of black pixels in the current pixel column exceeds a black column threshold (1010). If not, the processing circuitry 112 may consider the next pixel column in the text chunk for determining a character start column, if any remain (1006). When the number or proportion of black pixels in the current pixel column exceeds the black column threshold, the processing circuitry 112 identifies this particular pixel column as a character start column (1012).

The processing circuitry 112 may determine a corresponding character end column for the identified character start column. After identifying the character start column, the processing circuitry 112 may consider the next pixel column in the text chunk, if any remain (1014). If so, the processing circuitry 112 may set the next pixel column as the current column for determining a character end column (1016). The processing circuitry 112 may identify a character end column when a current pixel column meets any number of character end column criteria. In particular, the processing circuitry 112 may, for example, identify a character end column by determining whether the number or proportion of white pixels in the current pixel column exceeds a white column threshold (1018). If not, the processing circuitry 112 may consider the next pixel column in the text chunk for determining a character end column, if any remain (1014).

When the number or proportion of white pixels in the current pixel column exceeds the white column threshold, the processing circuitry 112 identifies this particular pixel column as a corresponding character end column to the previously determined character start column (1020). The processing circuitry 112 may increment a counter indicating the character count for the text chunk.

The processing circuitry 112 may continue processing the text chunk to determine character start columns and corresponding character end columns until no additional pixel columns remain (1006 or 1014). Then, the processing circuitry 112 may obtain the character count for the text chunk by reading the counter indicating the character count for the text chunk (1022).

FIG. 11 shows an example of logic 1100 that may be implemented in hardware, software, or both. For example, the processing circuitry 112 may implement the logic 1100 in software as the image processing instructions 122.

The processing circuitry 112 may read the character count parameters 124 (1102) and receive a financial document image 200 (1104). In some implementations, the character count parameters 124 may specify a character count threshold for the financial document image 200. The character count threshold may specify a minimum or maximum threshold number of characters in a financial document image 200 to meet particular quality criteria for processing the financial document image 200. Additionally, the character count parameters 124 may specify a particular character count threshold for different types of images, such as specific character count thresholds for business checks, personal checks, financial forms, remittance coupons, etc. As illustrative examples, the character count threshold for a business check may be set to 50 characters for personal checks and 100 characters for business checks. The character count parameters 124 may additionally or alternatively specify a particular character count threshold for particular regions (e.g., interest regions) of the financial document image 200 or any other image type the processing circuitry 112 may process.

The processing circuitry 112 may optionally perform image pre-processing techniques on the financial document image 200 (1106), including any of the pre-processing techniques described above. The processing circuitry 112 may determine a character count for the financial document image 200, for example by identifying one or more text chunks in the financial document image 200 (1008) and determining a character count for one or more of the identified text chunks (1110). To do so, the processing circuitry 112 may utilize any combination of the methods, flows, and techniques described above. The processing circuitry 112 may determine a character count for the financial document image 200 by summing the determined character count of text chunks in the financial document image 200.

The processing circuitry 112 may determine whether the character count for the financial document image 200 meets the character count criteria (1112). When the character count for the financial document image 200 fails the character count criteria, the processing circuitry 112 may instruct recapture of the financial document image (1114). For example, the processing circuitry 112 may send an image rejection message to an electronic device 102 used to capture the financial document image 200. The image rejection message may further instruct a user to recapture the image of financial document.

When the character count for the financial document image 200 meets the character count criteria, the processing circuitry 112 may perform further image processing. For example, the processing circuitry 112 may perform character recognition (e.g., OCR) on the financial document image 200 to recognize the characters on the financial document image 200. The processing circuitry 112 may perform further processing after character recognition, such as initiating a deposit process of a check represented by the financial document image 200, processing of a medical bill or financial form, etc.

The character count criteria may serve as an initial quality screen for incoming images received by the processing circuitry 112. By determining the character count of an image prior to performing subsequent image processing, the processing circuitry 112 may determine that the image is not overly cropped, and thus containing a character count less than a minimum threshold. Similarly, the character count criteria may be configured to prevent processing of overly blurry images, e.g., blurry images such that the processing circuitry 112 cannot determine enough character start and end columns and resulting in a character count less than a minimum threshold.

As discussed above, the character count parameters 124 may specify particular character count thresholds for interest regions of an image. Accordingly, the processing circuitry 112 may specifically identify text chunks and determine character counts for these interest regions instead of for the entire image. The processing circuitry 112 may determine the image passes the character count criteria when some or all of the particular character count criteria for the determined interest regions are met. As one example, the processing circuitry 112 may identify a MICR line portion of a check image as an interest region, and apply particular character count criteria for the MICR line portion, e.g., a minimum character count threshold. Additional exemplary interest regions may include high priority fields of a document, such as a social security number field, name field, address field, courtesy amount field, or any high priority region of an image received by the processing circuitry.

By performing combinations of the methods and techniques described above, the processing circuitry 112 may identify the character count for a financial document image 200 or other image without recognizing any particular character in the financial document image 200.

Although the example of a financial document 200 such as a check is provided by way of example above, the techniques discussed for identifying the presence, but not the specific identity or literal meaning, of characters or words, may be applied to any type of document. Other documents that may be analyzed with the techniques described herein include receipts, insurance documents, coupons, and so on. Specific portions of these documents may be targeted, or only characters of a particular font size may be included, for a given type of document. An advantage of the techniques discussed above is that the processing power and time for recognizing the presence, but not the specific identity, of characters or words may be less than that needed for actually identifying the individual letter, number or symbol. In other words, the knowledge that the captured image has chunks of text with a likelihood of four characters may be used rather than identifying those four characters as “abc3’ can provide a helpful filter for a system to determine if an expected type of document is being looked at. In this way, a system may quickly, and with less processing power, filter out unacceptable (e.g., overly cropped or blurry) documents.

In some implementations, an image processing system 104 may implement the processing circuitry 112 for performing any of the methods and techniques described above, including determining a character count for a financial document image 200 without recognizing any particular character in the financial document image 200. In other implementations, an electronic device 102, such as a mobile device, may implement the processing circuitry 112. In yet other implementations, the functionality of the processing circuitry 112 may be implemented, e.g., distributed, through a combination of the image processing system 104 and electronic device 102.

The methods, devices, and logic described above may be implemented in many different ways in many different combinations of hardware, software or both hardware and software. For example, all or parts of the system may include circuitry in a controller, a microprocessor, or an application specific integrated circuit (ASIC), or may be implemented with discrete logic or components, or a combination of other types of analog or digital circuitry, combined on a single integrated circuit or distributed among multiple integrated circuits. All or part of the logic described above may be implemented as instructions for execution by a processor, controller, or other processing device and may be stored in a tangible or non-transitory machine-readable or computer-readable medium such as flash memory, random access memory (RAM) or read only memory (ROM), erasable programmable read only memory (EPROM) or other machine-readable medium such as a compact disc read only memory (CDROM), or magnetic or optical disk. Thus, a product, such as a computer program product, may include a storage medium and computer readable instructions stored on the medium, which when executed in an endpoint, computer system, or other device, cause the device to perform operations according to any of the description above.

The processing capability described above may be distributed among multiple system components, such as among multiple processors and memories, optionally including multiple distributed processing systems. Parameters, databases, and other data structures may be separately stored and managed, may be incorporated into a single memory or database, may be logically and physically organized in many different ways, and may implemented in many ways, including data structures such as linked lists, hash tables, or implicit storage mechanisms. Programs may be parts (e.g., subroutines) of a single program, separate programs, distributed across several memories and processors, or implemented in many different ways, such as in a library, such as a shared library (e.g., a dynamic link library (DLL)). The DLL, for example, may store code that performs any of the system processing described above. While various embodiments of the systems and methods have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the systems and methods. Accordingly, the systems and methods are not to be restricted except in light of the attached claims and their equivalents.

Claims

1. A method comprising:

in an electronic device comprising a memory for holding document image data and processor in communication with the memory, the processor: receiving a financial document image; identifying a text chunk in the financial document image by: determining a first pixel of the financial document image as top left pixel of the text chunk based on a top left score of the first pixel; and determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel; and determining a character count for the text chunk without recognizing any particular character in the text chunk.

2. The method of claim 1, where identifying the text chunk in the financial document image further comprises:

determining a bottom edge of the text chunk.

3. The method of claim 2, where determining the bottom edge of the text chunk comprises:

identifying a particular pixel row with a proportion of white pixels exceeding a bottom edge threshold; and
identifying an upper edge of the particular pixel row as the bottom edge of the text chunk.

4. The method of claim 1, where the top left score of the first pixel represents a likelihood that the first pixel corresponds to a top left corner of a text character.

5. The method of claim 4, where the top left score of the first pixel represents a likelihood that the first pixel is a particular pixel distance from the top left corner of the text character.

6. The method of claim 1, where the top right score of the second pixel represents a likelihood that the second pixel corresponds to a top right corner of a text character.

7. The method of claim 1, where determining a character count for the text chunk comprises:

processing pixel columns in the text chunk to determine a first character start column and a corresponding character end column; and
incrementing a counter after determining the corresponding character end column.

8. The method of claim 7, further comprising:

processing each of the pixels columns in the text chunk; and
determining the character count as a value of the counter after processing each of the pixel columns.

9. The method of claim 1, further comprising:

determining a character count for the financial image document by summing character counts of text chunks in the financial document image.

10. The method of claim 9, further comprising:

determining whether the character count for the financial image document meets a minimum character count threshold; and
when the character count for the financial image document meets the minimum character count threshold: performing further image processing on the financial document image; and
when the character count for the financial image document does not meet the minimum character count threshold: rejecting the financial document image.

11. The method of claim 10, where performing further image processing on the financial document image when the character count for the financial image document meets the minimum character count threshold comprises:

performing Optical Character Recognition (OCR) on the financial document image.

12. The method of claim 10, where rejecting the financial document image when the character count for the financial image document does not meet the minimum character count threshold comprises:

instructing recapture of the financial document image.

13. The method of claim 1, where identifying the text chunk in the financial document image further comprises:

adjusting an edge of the text chunk to include an additional row or column of white pixels based on a padding parameter value.

14. A system comprising:

a memory for storing document image data; and
a processor in communication with the memory, wherein the processor is configured to: receive a financial document image; identify a text chunk in the financial document image by: determining a first pixel of the financial document image as top left pixel of the text chunk based on a top left score of the first pixel; and determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel; and determine a chunk extension for the text chunk; add the chunk extension to the text chunk so the text chunk includes the chunk extension; and after adding the chunk extension to the text chunk: determine a character count for the text chunk without recognizing any particular character in the text chunk.

15. The system of claim 14, where the processing processor is configured to determine the chunk extension for the text chunk by:

identifying a threshold number of consecutive columns positioned left or right of the text chunk, where each of the consecutive columns have a proportion of white pixels that exceed an extension threshold.

16. The system of claim 15, where the processor is further configured to determine the chunk extension for the text chunk by:

determining the chunk extension as a section of pixels between an edge of the text chunk and a first column of the consecutive columns.

17. A non-transitory computer readable medium comprising:

instructions that, when executed by a processor, cause the processor to: receive a financial document image; identify an interest region in the financial document image; identify a text chunk in the interest region of the financial document image by: determining a first pixel of the financial document image as top left pixel of the text chunk based on a top left score of the first pixel; determining a second pixel of the financial document image as top right pixel of the text chunk based on a top right score of the second pixel; and determine a character count for the text chunk in the interest region of the financial document image without recognizing any particular character in the text chunk; determine a character count for the interest region by summing the character count for the text chunk with a character count of any additional text chunks in the interest region; and determine whether the character count for the interest region exceeds a minimum character count threshold specifically for the interest region.

18. The non-transitory computer readable medium of claim 17, where the interest region comprises a high priority field of the financial document image.

19. The non-transitory computer readable medium of claim 17, where the interest region comprises a Magnetic Ink Character Recognition (MICR) portion of a check.

20. The non-transitory computer readable medium of claim 17, where the instructions cause the process to reject the financial document image when the character count for the interest region does not meet the minimum character count threshold.

Referenced Cited
U.S. Patent Documents
3005282 October 1961 Christiansen
3341820 September 1967 Grillmeier, Jr. et al.
3576972 May 1971 Wood
3593913 July 1971 Bremer
3620553 November 1971 Donovan
3648242 March 1972 Grosbard
3800124 March 1974 Walsh
3816943 June 1974 Henry
4002356 January 11, 1977 Weidmann
4060711 November 29, 1977 Buros
4070649 January 24, 1978 Wright, Jr. et al.
4128202 December 5, 1978 Buros
4136471 January 30, 1979 Austin
4205780 June 3, 1980 Burns
4264808 April 28, 1981 Owens
4305216 December 15, 1981 Skelton
4321672 March 23, 1982 Braun
4433436 February 21, 1984 Carnes
4454610 June 1984 Sziklai
RE31692 October 2, 1984 Tyburski et al.
4523330 June 11, 1985 Cain
4636099 January 13, 1987 Goldstone
4640413 February 3, 1987 Kaplan
4644144 February 17, 1987 Chandek
4722444 February 2, 1988 Murphy et al.
4722544 February 2, 1988 Weber
4727435 February 23, 1988 Otani et al.
4774574 September 27, 1988 Daly et al.
4774663 September 27, 1988 Musmanno
4790475 December 13, 1988 Griffin
4806780 February 21, 1989 Yamamoto
4837693 June 6, 1989 Schotz
4890228 December 26, 1989 Longfield
4927071 May 22, 1990 Wood
4934587 June 19, 1990 McNabb
4960981 October 2, 1990 Benton
4975735 December 4, 1990 Bright
5022683 June 11, 1991 Barbour
5053607 October 1, 1991 Carlson
5146606 September 8, 1992 Grondalski
5157620 October 20, 1992 Shaar
5159548 October 27, 1992 Caslavka
5191525 March 2, 1993 LeBrun
5193121 March 9, 1993 Elischer et al.
5220501 June 15, 1993 Lawlor
5227863 July 13, 1993 Bilbrey et al.
5229589 July 20, 1993 Schneider
5237159 August 17, 1993 Stephens
5257320 October 26, 1993 Etherington et al.
5265008 November 23, 1993 Benton
5321816 June 14, 1994 Rogan
5347302 September 13, 1994 Simonoff
5350906 September 27, 1994 Brody
5373550 December 13, 1994 Campbell
5419588 May 30, 1995 Wood
5422467 June 6, 1995 Graef
5444794 August 22, 1995 Uhland, Sr.
5475403 December 12, 1995 Havlovick et al.
5504538 April 2, 1996 Tsujihara
5504677 April 2, 1996 Pollin
5528387 June 18, 1996 Kelly et al.
5577179 November 19, 1996 Blank
5583759 December 10, 1996 Geer
5590196 December 31, 1996 Moreau
5594225 January 14, 1997 Botvin
5598969 February 4, 1997 Ong
5602936 February 11, 1997 Green
5610726 March 11, 1997 Nonoshita
5611028 March 11, 1997 Shibasaki
5630073 May 13, 1997 Nolan
5631984 May 20, 1997 Graf et al.
5668897 September 16, 1997 Stolfo
5673320 September 30, 1997 Ray et al.
5677955 October 14, 1997 Doggett
5678046 October 14, 1997 Cahill et al.
5679938 October 21, 1997 Templeton
5680611 October 21, 1997 Rail
5691524 November 25, 1997 Josephson
5699452 December 16, 1997 Vaidyanathan
5734747 March 31, 1998 Vaidyanathan
5737440 April 7, 1998 Kunkler
5748780 May 5, 1998 Stolfo
5751842 May 12, 1998 Riach
5784503 July 21, 1998 Bleecker, III et al.
5830609 November 3, 1998 Warner
5832463 November 3, 1998 Funk
5838814 November 17, 1998 Moore
5863075 January 26, 1999 Rich
5870456 February 9, 1999 Rogers
5870724 February 9, 1999 Lawlor
5870725 February 9, 1999 Bellinger et al.
5878337 March 2, 1999 Joao
5893101 April 6, 1999 Balogh et al.
5897625 April 27, 1999 Gustin
5898157 April 27, 1999 Mangili et al.
5901253 May 4, 1999 Tretter
5903878 May 11, 1999 Talati
5903881 May 11, 1999 Schrader
5910988 June 8, 1999 Ballard
5917931 June 29, 1999 Kunkler
5924737 July 20, 1999 Schrupp
5926548 July 20, 1999 Okamoto
5930778 July 27, 1999 Geer
5937396 August 10, 1999 Konya
5940844 August 17, 1999 Cahill
5982918 November 9, 1999 Mennie
5987439 November 16, 1999 Gustin et al.
6012048 January 4, 2000 Gustin et al.
6014454 January 11, 2000 Kunkler
6021202 February 1, 2000 Anderson
6021397 February 1, 2000 Jones
6029887 February 29, 2000 Furuhashi
6030000 February 29, 2000 Diamond
6032137 February 29, 2000 Ballard
6038553 March 14, 2000 Hyde
6053405 April 25, 2000 Irwin, Jr. et al.
6073119 June 6, 2000 Bornemisza-wahr
6073121 June 6, 2000 Ramzy
6085168 July 4, 2000 Mori
6086708 July 11, 2000 Colgate
6089450 July 18, 2000 Koeple
6089610 July 18, 2000 Greene
6097834 August 1, 2000 Krouse
6097845 August 1, 2000 Ng et al.
6097885 August 1, 2000 Rayner
6105865 August 22, 2000 Hardesty
6141339 October 31, 2000 Kaplan et al.
6145738 November 14, 2000 Stinson et al.
6151426 November 21, 2000 Lee
6159585 December 12, 2000 Rittenhouse
6170744 January 9, 2001 Lee
6178409 January 23, 2001 Weber et al.
6188506 February 13, 2001 Kaiserman
6189785 February 20, 2001 Lowery
6192165 February 20, 2001 Irons
6195694 February 27, 2001 Chen et al.
6199055 March 6, 2001 Kara
6236009 May 22, 2001 Emigh et al.
6243689 June 5, 2001 Norton
6278983 August 21, 2001 Ball
6282523 August 28, 2001 Tedesco et al.
6282826 September 4, 2001 Richards
6293469 September 25, 2001 Masson et al.
6304860 October 16, 2001 Martin
6314452 November 6, 2001 Dekel
6317727 November 13, 2001 May
6328207 December 11, 2001 Gregoire et al.
6330546 December 11, 2001 Gopinathan et al.
6339658 January 15, 2002 Moccagatta
6363162 March 26, 2002 Moed et al.
6363164 March 26, 2002 Jones et al.
6390362 May 21, 2002 Martin
6397196 May 28, 2002 Kravetz
6408084 June 18, 2002 Foley
6411725 June 25, 2002 Rhoads
6411737 June 25, 2002 Wesolkowski et al.
6411938 June 25, 2002 Gates et al.
6413305 July 2, 2002 Mehta
6417869 July 9, 2002 Do
6425017 July 23, 2002 Dievendorff
6429952 August 6, 2002 Olbricht
6439454 August 27, 2002 Masson et al.
6449397 September 10, 2002 Che-chu
6450403 September 17, 2002 Martens et al.
6463220 October 8, 2002 Dance et al.
6464134 October 15, 2002 Page
6469745 October 22, 2002 Yamada et al.
6470325 October 22, 2002 Leemhuis
6505178 January 7, 2003 Flenley
6546119 April 8, 2003 Ciolli et al.
6574609 June 3, 2003 Downs
6578760 June 17, 2003 Otto
6587837 July 1, 2003 Spagna
6606117 August 12, 2003 Windle
6609200 August 19, 2003 Anderson
6611598 August 26, 2003 Hayosh
6614930 September 2, 2003 Agnihotri et al.
6643416 November 4, 2003 Daniels
6654487 November 25, 2003 Downs, Jr.
6661910 December 9, 2003 Jones et al.
6672452 January 6, 2004 Alves
6682452 January 27, 2004 Quintus
6695204 February 24, 2004 Stinson
6711474 March 23, 2004 Treyz et al.
6726097 April 27, 2004 Graef
6728397 April 27, 2004 Mcneal
6738496 May 18, 2004 Van Hall
6742128 May 25, 2004 Joiner
6745186 June 1, 2004 Testa et al.
6754640 June 22, 2004 Bozeman
6755340 June 29, 2004 Voss et al.
6763226 July 13, 2004 McZeal
6781962 August 24, 2004 Williams
6786398 September 7, 2004 Stinson et al.
6789054 September 7, 2004 Makhlouf
6796491 September 28, 2004 Nakajima
6806903 October 19, 2004 Okisu et al.
6813733 November 2, 2004 Li
6829704 December 7, 2004 Zhang
6844885 January 18, 2005 Anderson
6856965 February 15, 2005 Stinson
6863214 March 8, 2005 Garner et al.
6870947 March 22, 2005 Kelland
6883140 April 19, 2005 Acker
6898314 May 24, 2005 Kung et al.
6902105 June 7, 2005 Koakutsu
6910023 June 21, 2005 Schibi
6913188 July 5, 2005 Wong
6931591 August 16, 2005 Brown
6934719 August 23, 2005 Nally
6957770 October 25, 2005 Robinson
6961689 November 1, 2005 Greenberg
6970843 November 29, 2005 Forte
6973589 December 6, 2005 Wright
6983886 January 10, 2006 Natsukari et al.
6993507 January 31, 2006 Meyer
6996263 February 7, 2006 Jones et al.
6999943 February 14, 2006 Johnson
7003040 February 21, 2006 Yi
7004382 February 28, 2006 Sandru
7010155 March 7, 2006 Koakutsu et al.
7010507 March 7, 2006 Anderson
7016704 March 21, 2006 Pallakoff
7039048 May 2, 2006 Monta
7058036 June 6, 2006 Yu
7062099 June 13, 2006 Li et al.
7062456 June 13, 2006 Riehl et al.
7062768 June 13, 2006 Kubo
7072862 July 4, 2006 Wilson
7076458 July 11, 2006 Lawlor et al.
7086003 August 1, 2006 Demsky
7092561 August 15, 2006 Downs, Jr.
7104443 September 12, 2006 Paul et al.
7113925 September 26, 2006 Waserstein
7114649 October 3, 2006 Nelson
7131571 November 7, 2006 Swift et al.
7139594 November 21, 2006 Nagatomo
7140539 November 28, 2006 Crews
7163347 January 16, 2007 Lugg
7178721 February 20, 2007 Maloney
7181430 February 20, 2007 Buchanan et al.
7184980 February 27, 2007 Allen-Rouman et al.
7197173 March 27, 2007 Jones et al.
7200255 April 3, 2007 Jones
7204412 April 17, 2007 Foss, Jr.
7216106 May 8, 2007 Buchanan
7219082 May 15, 2007 Forte
7219831 May 22, 2007 Murata
7249076 July 24, 2007 Pendleton
7252224 August 7, 2007 Verma
7257246 August 14, 2007 Brodie et al.
7266230 September 4, 2007 Doran
7290034 October 30, 2007 Budd
7299970 November 27, 2007 Ching
7299979 November 27, 2007 Phillips
7313543 December 25, 2007 Crane
7314163 January 1, 2008 Crews et al.
7321874 January 22, 2008 Dilip
7321875 January 22, 2008 Dilip
7325725 February 5, 2008 Foss, Jr.
7328190 February 5, 2008 Smith et al.
7330604 February 12, 2008 Wu et al.
7336813 February 26, 2008 Prakash et al.
7343320 March 11, 2008 Treyz
7349566 March 25, 2008 Jones et al.
7356505 April 8, 2008 March
7377425 May 27, 2008 Ma
7379978 May 27, 2008 Anderson
7383227 June 3, 2008 Weinflash et al.
7385631 June 10, 2008 Maeno
7386511 June 10, 2008 Buchanan
7391897 June 24, 2008 Jones et al.
7391934 June 24, 2008 Goodall et al.
7392935 July 1, 2008 Byrne
7401048 July 15, 2008 Rosedale
7403917 July 22, 2008 Larsen
7406198 July 29, 2008 Aoki et al.
7421107 September 2, 2008 Lugg
7421410 September 2, 2008 Schechtman et al.
7427016 September 23, 2008 Chimento
7433098 October 7, 2008 Klein et al.
7437327 October 14, 2008 Lam
7440924 October 21, 2008 Buchanan
7447347 November 4, 2008 Weber
7455220 November 25, 2008 Phillips
7455221 November 25, 2008 Sheaffer
7460108 December 2, 2008 Tamura
7461779 December 9, 2008 Ramachandran
7461780 December 9, 2008 Potts
7471818 December 30, 2008 Price
7475040 January 6, 2009 Buchanan
7477923 January 13, 2009 Wallmark
7480382 January 20, 2009 Dunbar
7480422 January 20, 2009 Ackley et al.
7489953 February 10, 2009 Griffin
7490242 February 10, 2009 Torres
7497429 March 3, 2009 Reynders
7503486 March 17, 2009 Ahles
7505759 March 17, 2009 Rahman
7506261 March 17, 2009 Satou
7509287 March 24, 2009 Nutahara
7512564 March 31, 2009 Geer
7519560 April 14, 2009 Lam
7520420 April 21, 2009 Phillips
7520422 April 21, 2009 Robinson et al.
7536354 May 19, 2009 deGroeve et al.
7536440 May 19, 2009 Budd
7539646 May 26, 2009 Gilder
7540408 June 2, 2009 Levine
7542598 June 2, 2009 Jones
7545529 June 9, 2009 Borrey et al.
7548641 June 16, 2009 Gilson et al.
7566002 July 28, 2009 Love et al.
7571848 August 11, 2009 Cohen
7587066 September 8, 2009 Cordery et al.
7587363 September 8, 2009 Cataline
7590275 September 15, 2009 Clarke et al.
7599543 October 6, 2009 Jones
7599888 October 6, 2009 Manfre
7602956 October 13, 2009 Jones
7606762 October 20, 2009 Heit
7609873 October 27, 2009 Foth et al.
7609889 October 27, 2009 Guo et al.
7619721 November 17, 2009 Jones
7620231 November 17, 2009 Jones
7620604 November 17, 2009 Bueche, Jr.
7630518 December 8, 2009 Frew et al.
7644037 January 5, 2010 Ostrovsky
7644043 January 5, 2010 Minowa
7647275 January 12, 2010 Jones
7668363 February 23, 2010 Price
7672022 March 2, 2010 Fan
7672940 March 2, 2010 Viola
7676409 March 9, 2010 Ahmad
7680735 March 16, 2010 Loy
7689482 March 30, 2010 Lam
7697776 April 13, 2010 Wu et al.
7698222 April 13, 2010 Bueche, Jr.
7702588 April 20, 2010 Gilder et al.
7720735 May 18, 2010 Anderson et al.
7734545 June 8, 2010 Fogliano
7743979 June 29, 2010 Fredman
7753268 July 13, 2010 Robinson et al.
7761358 July 20, 2010 Craig et al.
7766244 August 3, 2010 Field
7769650 August 3, 2010 Bleunven
7792752 September 7, 2010 Kay
7792753 September 7, 2010 Slater et al.
7810714 October 12, 2010 Murata
7812986 October 12, 2010 Graham et al.
7818245 October 19, 2010 Prakash et al.
7831458 November 9, 2010 Neumann
7856402 December 21, 2010 Kay
7873200 January 18, 2011 Oakes, III et al.
7876949 January 25, 2011 Oakes, III et al.
7885451 February 8, 2011 Walls et al.
7885880 February 8, 2011 Prasad et al.
7894094 February 22, 2011 Nacman et al.
7896232 March 1, 2011 Prasad et al.
7900822 March 8, 2011 Prasad et al.
7903863 March 8, 2011 Jones et al.
7904386 March 8, 2011 Kalra et al.
7912785 March 22, 2011 Kay
7949587 May 24, 2011 Morris et al.
7950698 May 31, 2011 Popadic et al.
7953441 May 31, 2011 Lors
7958053 June 7, 2011 Stone
7962411 June 14, 2011 Prasad et al.
7970677 June 28, 2011 Oakes, III et al.
7974899 July 5, 2011 Prasad et al.
7978900 July 12, 2011 Nepomniachtchi et al.
7996314 August 9, 2011 Smith et al.
7996315 August 9, 2011 Smith et al.
7996316 August 9, 2011 Smith et al.
8001051 August 16, 2011 Smith et al.
8045784 October 25, 2011 Price et al.
8046301 October 25, 2011 Smith et al.
8060442 November 15, 2011 Hecht et al.
8065307 November 22, 2011 Haslam et al.
8091778 January 10, 2012 Block et al.
8116533 February 14, 2012 Kiplinger et al.
8203640 June 19, 2012 Kim et al.
8204293 June 19, 2012 Csulits et al.
8235284 August 7, 2012 Prasad et al.
8271385 September 18, 2012 Emerson et al.
8290237 October 16, 2012 Burks et al.
8320657 November 27, 2012 Burks et al.
8351677 January 8, 2013 Oakes, III et al.
8358826 January 22, 2013 Medina et al.
8392332 March 5, 2013 Oakes, III et al.
8401962 March 19, 2013 Bent et al.
8422758 April 16, 2013 Bueche, Jr.
8559766 October 15, 2013 Tilt et al.
8582862 November 12, 2013 Nepomniachtchi et al.
8732081 May 20, 2014 Oakes et al.
20010004235 June 21, 2001 Maloney
20010014881 August 16, 2001 Drummond
20010018739 August 30, 2001 Anderson
20010027994 October 11, 2001 Hayashida
20010037299 November 1, 2001 Nichols et al.
20010042171 November 15, 2001 Vermeulen
20010042785 November 22, 2001 Walker
20010043748 November 22, 2001 Wesolkowski et al.
20010047330 November 29, 2001 Gephart
20010054020 December 20, 2001 Barth et al.
20020001393 January 3, 2002 Jones
20020016763 February 7, 2002 March
20020016769 February 7, 2002 Barbara et al.
20020026418 February 28, 2002 Koppel et al.
20020032656 March 14, 2002 Chen
20020038289 March 28, 2002 Lawlor et al.
20020040340 April 4, 2002 Yoshida
20020052841 May 2, 2002 Guthrie
20020052853 May 2, 2002 Munoz
20020065786 May 30, 2002 Martens et al.
20020072974 June 13, 2002 Pugliese
20020075524 June 20, 2002 Blair
20020084321 July 4, 2002 Martens
20020087467 July 4, 2002 Mascavage, III et al.
20020107767 August 8, 2002 McClair et al.
20020107809 August 8, 2002 Biddle et al.
20020116329 August 22, 2002 Serbetcioglu
20020116335 August 22, 2002 Star
20020118891 August 29, 2002 Rudd
20020120562 August 29, 2002 Opiela
20020120582 August 29, 2002 Elston et al.
20020129249 September 12, 2002 Maillard et al.
20020130868 September 19, 2002 Smith
20020133409 September 19, 2002 Sawano et al.
20020138522 September 26, 2002 Muralidhar
20020147798 October 10, 2002 Huang
20020150279 October 17, 2002 Scott
20020152160 October 17, 2002 Allen-Rouman et al.
20020152161 October 17, 2002 Aoike
20020152164 October 17, 2002 Dutta
20020152165 October 17, 2002 Dutta et al.
20020152169 October 17, 2002 Dutta et al.
20020159648 October 31, 2002 Alderson et al.
20020171820 November 21, 2002 Okamura
20020178112 November 28, 2002 Goeller
20020186881 December 12, 2002 Li
20020188564 December 12, 2002 Star
20020195485 December 26, 2002 Pomerleau et al.
20030005326 January 2, 2003 Flemming
20030009420 January 9, 2003 Jones
20030023557 January 30, 2003 Moore
20030026609 February 6, 2003 Parulski
20030038227 February 27, 2003 Sesek
20030050889 March 13, 2003 Burke
20030055756 March 20, 2003 Allan
20030055776 March 20, 2003 Samuelson
20030074315 April 17, 2003 Lam
20030075596 April 24, 2003 Koakutsu
20030075916 April 24, 2003 Gorski
20030081824 May 1, 2003 Mennie
20030093367 May 15, 2003 Allen-Rouman et al.
20030093369 May 15, 2003 Ijichi et al.
20030102714 June 5, 2003 Rhodes et al.
20030105688 June 5, 2003 Brown
20030105714 June 5, 2003 Alarcon-Luther et al.
20030126078 July 3, 2003 Vihinen
20030130940 July 10, 2003 Hansen et al.
20030132384 July 17, 2003 Sugiyama et al.
20030133610 July 17, 2003 Nagarajan et al.
20030139999 July 24, 2003 Rowe
20030159046 August 21, 2003 Choi et al.
20030167225 September 4, 2003 Adams
20030191615 October 9, 2003 Bailey
20030191869 October 9, 2003 Williams
20030200174 October 23, 2003 Star
20030202690 October 30, 2003 Jones et al.
20030212904 November 13, 2003 Randle et al.
20030217005 November 20, 2003 Drummond et al.
20030225705 December 4, 2003 Park et al.
20030233278 December 18, 2003 Marshall
20030233318 December 18, 2003 King et al.
20040010466 January 15, 2004 Anderson
20040012496 January 22, 2004 De Souza
20040013284 January 22, 2004 Yu
20040024626 February 5, 2004 Bruijning
20040024708 February 5, 2004 Masuda
20040030741 February 12, 2004 Wolton et al.
20040044606 March 4, 2004 Buttridge et al.
20040057697 March 25, 2004 Renzi
20040058705 March 25, 2004 Morgan
20040066031 April 8, 2004 Wong
20040069841 April 15, 2004 Wong
20040071333 April 15, 2004 Douglas et al.
20040076320 April 22, 2004 Downs, Jr.
20040078299 April 22, 2004 Down-Logan
20040080795 April 29, 2004 Bean et al.
20040089711 May 13, 2004 Sandru
20040093303 May 13, 2004 Picciallo
20040093305 May 13, 2004 Kight
20040103057 May 27, 2004 Melbert et al.
20040103296 May 27, 2004 Harp
20040109596 June 10, 2004 Doran
20040110975 June 10, 2004 Osinski et al.
20040111371 June 10, 2004 Friedman
20040117302 June 17, 2004 Weichert
20040122754 June 24, 2004 Stevens
20040133511 July 8, 2004 Smith et al.
20040138974 July 15, 2004 Shimamura
20040148235 July 29, 2004 Craig et al.
20040158549 August 12, 2004 Matena
20040165096 August 26, 2004 Maeno
20040170259 September 2, 2004 Park
20040184766 September 23, 2004 Kim et al.
20040210515 October 21, 2004 Hughes
20040210523 October 21, 2004 Gains et al.
20040225604 November 11, 2004 Foss, Jr. et al.
20040228277 November 18, 2004 Williams
20040236647 November 25, 2004 Acharya
20040236688 November 25, 2004 Bozeman
20040240722 December 2, 2004 Tsuji et al.
20040245324 December 9, 2004 Chen
20040247199 December 9, 2004 Murai et al.
20040248600 December 9, 2004 Kim
20040252679 December 16, 2004 Williams
20040260636 December 23, 2004 Marceau
20040267666 December 30, 2004 Minami
20050001421 January 6, 2005 Luth et al.
20050010108 January 13, 2005 Rahn et al.
20050015332 January 20, 2005 Chen
20050021466 January 27, 2005 Buchanan et al.
20050030388 February 10, 2005 Stavely et al.
20050033645 February 10, 2005 Duphily
20050033685 February 10, 2005 Reyes
20050033695 February 10, 2005 Minowa
20050035193 February 17, 2005 Gustin et al.
20050038746 February 17, 2005 Latimer et al.
20050038754 February 17, 2005 Geist
20050044042 February 24, 2005 Mendiola
20050044577 February 24, 2005 Jerding
20050049950 March 3, 2005 Johnson
20050071283 March 31, 2005 Randle et al.
20050075969 April 7, 2005 Nielson et al.
20050075974 April 7, 2005 Turgeon
20050078336 April 14, 2005 Ferlitsch
20050080725 April 14, 2005 Pick
20050082364 April 21, 2005 Alvarez et al.
20050086140 April 21, 2005 Ireland
20050086168 April 21, 2005 Alvarez
20050089209 April 28, 2005 Stefanuk
20050091161 April 28, 2005 Gustin
20050096992 May 5, 2005 Geisel
20050097019 May 5, 2005 Jacobs
20050097046 May 5, 2005 Singfield
20050097050 May 5, 2005 Orcutt
20050108164 May 19, 2005 Salafia
20050108168 May 19, 2005 Halpin
20050115110 June 2, 2005 Dinkins
20050125338 June 9, 2005 Tidwell et al.
20050125360 June 9, 2005 Tidwell et al.
20050127160 June 16, 2005 Fujikawa
20050131820 June 16, 2005 Rodriguez
20050149436 July 7, 2005 Elterich
20050168566 August 4, 2005 Tada
20050171899 August 4, 2005 Dunn
20050171907 August 4, 2005 Lewis
20050177494 August 11, 2005 Kelly et al.
20050177499 August 11, 2005 Thomas
20050177518 August 11, 2005 Brown
20050182710 August 18, 2005 Anderson
20050188306 August 25, 2005 Mackenzie
20050203430 September 15, 2005 Williams et al.
20050205661 September 22, 2005 Taylor
20050209961 September 22, 2005 Michelsen
20050213805 September 29, 2005 Blake et al.
20050218209 October 6, 2005 Heilper et al.
20050220324 October 6, 2005 Klein et al.
20050228733 October 13, 2005 Bent
20050244035 November 3, 2005 Klein et al.
20050252955 November 17, 2005 Sugai
20050267843 December 1, 2005 Acharya et al.
20050268107 December 1, 2005 Harris et al.
20050269412 December 8, 2005 Chiu
20050273368 December 8, 2005 Hutten et al.
20050278250 December 15, 2005 Zair
20050281448 December 22, 2005 Lugg
20050281471 December 22, 2005 LeConte
20050281474 December 22, 2005 Huang
20050289030 December 29, 2005 Smith
20050289182 December 29, 2005 Pandian et al.
20060002426 January 5, 2006 Madour
20060004660 January 5, 2006 Pranger
20060025697 February 2, 2006 Kurzweil
20060039628 February 23, 2006 Li et al.
20060039629 February 23, 2006 Li et al.
20060041506 February 23, 2006 Mason et al.
20060045321 March 2, 2006 Yu
20060047593 March 2, 2006 Naratil
20060053056 March 9, 2006 Alspach-Goss
20060059085 March 16, 2006 Tucker
20060064368 March 23, 2006 Forte
20060080245 April 13, 2006 Bahl
20060085357 April 20, 2006 Pizarro
20060085516 April 20, 2006 Farr et al.
20060102704 May 18, 2006 Reynders
20060106691 May 18, 2006 Sheaffer
20060106717 May 18, 2006 Randle
20060108168 May 25, 2006 Fischer et al.
20060110063 May 25, 2006 Weiss
20060112013 May 25, 2006 Maloney
20060115110 June 1, 2006 Rodriguez
20060115141 June 1, 2006 Koakutsu et al.
20060118613 June 8, 2006 McMann
20060124730 June 15, 2006 Maloney
20060144924 July 6, 2006 Stover
20060144937 July 6, 2006 Heilper et al.
20060144950 July 6, 2006 Johnson
20060159367 July 20, 2006 Zeineh et al.
20060161501 July 20, 2006 Waserstein
20060164682 July 27, 2006 Lev
20060166178 July 27, 2006 Driedijk
20060167818 July 27, 2006 Wentker et al.
20060182331 August 17, 2006 Gilson et al.
20060182332 August 17, 2006 Weber
20060186194 August 24, 2006 Richardson et al.
20060206506 September 14, 2006 Fitzpatrick
20060208059 September 21, 2006 Cable et al.
20060210138 September 21, 2006 Hilton et al.
20060212391 September 21, 2006 Norman et al.
20060214940 September 28, 2006 Kinoshita
20060215204 September 28, 2006 Miyamoto et al.
20060215230 September 28, 2006 Borrey et al.
20060222260 October 5, 2006 Sambongi et al.
20060229976 October 12, 2006 Jung
20060229986 October 12, 2006 Corder
20060238503 October 26, 2006 Smith
20060242062 October 26, 2006 Peterson
20060242063 October 26, 2006 Peterson
20060249567 November 9, 2006 Byrne
20060274164 December 7, 2006 Kimura et al.
20060279628 December 14, 2006 Fleming
20060282383 December 14, 2006 Doran
20060291744 December 28, 2006 Ikeda et al.
20070016796 January 18, 2007 Singhal
20070019243 January 25, 2007 Sato
20070022053 January 25, 2007 Waserstein
20070027802 February 1, 2007 VanDeburg et al.
20070031022 February 8, 2007 Frew
20070038561 February 15, 2007 Vancini et al.
20070041629 February 22, 2007 Prakash et al.
20070050292 March 1, 2007 Yarbrough
20070053574 March 8, 2007 Verma et al.
20070058851 March 15, 2007 Quine
20070063016 March 22, 2007 Myatt
20070064991 March 22, 2007 Douglas
20070065143 March 22, 2007 Didow et al.
20070075772 April 5, 2007 Kokubo
20070076940 April 5, 2007 Goodall et al.
20070076941 April 5, 2007 Carreon et al.
20070077921 April 5, 2007 Hayashi
20070080207 April 12, 2007 Williams
20070082700 April 12, 2007 Landschaft
20070084911 April 19, 2007 Crowell
20070086642 April 19, 2007 Foth
20070086643 April 19, 2007 Spier
20070094088 April 26, 2007 Mastie
20070094140 April 26, 2007 Riney et al.
20070100748 May 3, 2007 Dheer
20070110277 May 17, 2007 Hayduchok et al.
20070118472 May 24, 2007 Allen-Rouman et al.
20070122024 May 31, 2007 Haas et al.
20070124241 May 31, 2007 Newton
20070127805 June 7, 2007 Foth et al.
20070129955 June 7, 2007 Dalmia
20070136198 June 14, 2007 Foth et al.
20070140545 June 21, 2007 Rossignoli
20070140594 June 21, 2007 Franklin
20070143208 June 21, 2007 Varga
20070150337 June 28, 2007 Hawkins et al.
20070154098 July 5, 2007 Geva et al.
20070156438 July 5, 2007 Popadic et al.
20070168265 July 19, 2007 Rosenberger
20070168283 July 19, 2007 Alvarez et al.
20070171288 July 26, 2007 Inoue
20070172107 July 26, 2007 Jones et al.
20070172148 July 26, 2007 Hawley
20070179883 August 2, 2007 Questembert
20070183000 August 9, 2007 Eisen et al.
20070183741 August 9, 2007 Lerman et al.
20070194102 August 23, 2007 Cohen
20070198432 August 23, 2007 Pitroda et al.
20070203708 August 30, 2007 Polcyn et al.
20070208816 September 6, 2007 Baldwin et al.
20070214086 September 13, 2007 Homoki
20070217669 September 20, 2007 Swift et al.
20070233525 October 4, 2007 Boyle
20070233585 October 4, 2007 Ben Simon et al.
20070235518 October 11, 2007 Mueller et al.
20070235520 October 11, 2007 Smith et al.
20070241179 October 18, 2007 Davis
20070244782 October 18, 2007 Chimento
20070246525 October 25, 2007 Smith et al.
20070251992 November 1, 2007 Sharma et al.
20070255652 November 1, 2007 Tumminaro
20070255653 November 1, 2007 Tumminaro
20070255662 November 1, 2007 Tumminaro
20070258634 November 8, 2007 Simonoff
20070268540 November 22, 2007 Gaspardo et al.
20070271182 November 22, 2007 Prakash et al.
20070278286 December 6, 2007 Crowell et al.
20070288380 December 13, 2007 Starrs
20070288382 December 13, 2007 Narayanan et al.
20070295803 December 27, 2007 Levine et al.
20070299928 December 27, 2007 Kohli et al.
20080002911 January 3, 2008 Eisen
20080021802 January 24, 2008 Pendleton
20080040280 February 14, 2008 Davis et al.
20080052182 February 28, 2008 Marshall
20080059376 March 6, 2008 Davis
20080063253 March 13, 2008 Wood
20080068674 March 20, 2008 McIntyre
20080071721 March 20, 2008 Wang
20080073423 March 27, 2008 Heit et al.
20080080760 April 3, 2008 Ronca
20080086420 April 10, 2008 Gilder et al.
20080086421 April 10, 2008 Gilder
20080086770 April 10, 2008 Kulkarni et al.
20080091599 April 17, 2008 Foss, Jr.
20080097899 April 24, 2008 Jackson et al.
20080103790 May 1, 2008 Abernethy
20080103967 May 1, 2008 Ackert et al.
20080113674 May 15, 2008 Baig
20080114739 May 15, 2008 Hayes
20080116257 May 22, 2008 Fickling
20080117991 May 22, 2008 Peddireddy
20080119178 May 22, 2008 Peddireddy
20080133411 June 5, 2008 Jones et al.
20080140579 June 12, 2008 Sanjiv
20080147549 June 19, 2008 Rathbun
20080155672 June 26, 2008 Sharma
20080156438 July 3, 2008 Stumphauzer et al.
20080162319 July 3, 2008 Breeden et al.
20080162350 July 3, 2008 Allen-Rouman et al.
20080162371 July 3, 2008 Rampell et al.
20080177659 July 24, 2008 Lacey et al.
20080180750 July 31, 2008 Feldman
20080208727 August 28, 2008 McLauqhlin et al.
20080214180 September 4, 2008 Cunningham et al.
20080219543 September 11, 2008 Csulits
20080245869 October 9, 2008 Berkun et al.
20080247629 October 9, 2008 Gilder
20080247655 October 9, 2008 Yano
20080249931 October 9, 2008 Gilder et al.
20080249951 October 9, 2008 Gilder et al.
20080262953 October 23, 2008 Anderson
20080275821 November 6, 2008 Bishop et al.
20080301441 December 4, 2008 Calman et al.
20080316542 December 25, 2008 Mindrum et al.
20090024520 January 22, 2009 Drory et al.
20090046938 February 19, 2009 Yoder
20090060396 March 5, 2009 Blessan et al.
20090066987 March 12, 2009 Inokuchi
20090108080 April 30, 2009 Meyer
20090110281 April 30, 2009 Hirabayashi
20090141962 June 4, 2009 Borgia et al.
20090164350 June 25, 2009 Sorbe et al.
20090164370 June 25, 2009 Sorbe et al.
20090166406 July 2, 2009 Pigg et al.
20090167870 July 2, 2009 Caleca et al.
20090171819 July 2, 2009 Emde et al.
20090171825 July 2, 2009 Roman
20090173781 July 9, 2009 Ramachandran
20090185737 July 23, 2009 Nepomniachtchi
20090185738 July 23, 2009 Nepomniachtchi
20090190823 July 30, 2009 Walters
20090192938 July 30, 2009 Amos
20090212929 August 27, 2009 Drory et al.
20090236413 September 24, 2009 Mueller et al.
20090252437 October 8, 2009 Li
20090254447 October 8, 2009 Blades
20090263019 October 22, 2009 Tzadok et al.
20090281904 November 12, 2009 Pharris
20090284637 November 19, 2009 Parulski et al.
20090290751 November 26, 2009 Ferman et al.
20090292628 November 26, 2009 Dryer et al.
20090313167 December 17, 2009 Dujari et al.
20100007899 January 14, 2010 Lay
20100027679 February 4, 2010 Sunahara et al.
20100030687 February 4, 2010 Panthaki et al.
20100047000 February 25, 2010 Park et al.
20100057578 March 4, 2010 Blair et al.
20100061446 March 11, 2010 Hands et al.
20100082470 April 1, 2010 Walach
20100165015 July 1, 2010 Barkley et al.
20100225773 September 9, 2010 Lee
20100226559 September 9, 2010 Najari et al.
20100260408 October 14, 2010 Prakash et al.
20100262522 October 14, 2010 Anderson et al.
20100312705 December 9, 2010 Caruso et al.
20110016084 January 20, 2011 Mundy et al.
20110069180 March 24, 2011 Nijemcevic et al.
20110112967 May 12, 2011 Anderson et al.
20110251956 October 13, 2011 Cantley et al.
20110280450 November 17, 2011 Nepomniachtchi et al.
20110285874 November 24, 2011 Showering et al.
20110310442 December 22, 2011 Popadic et al.
20120047070 February 23, 2012 Pharris
20120062732 March 15, 2012 Marman et al.
20120185388 July 19, 2012 Pranger
20120229872 September 13, 2012 Dolev
20130021651 January 24, 2013 Popadic et al.
Foreign Patent Documents
0 984 410 March 2000 EP
Other references
  • Herley, Cormac, “Efficient Inscribing of Noisy Rectangular Objects in Scanned Images,” 2004 International Conference on Image Processing, 4 pages.
  • “Accept ”Customer Not Present“ Checks,” Accept Check Online, http://checksoftware.com, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (1 pg).
  • “Adjusting Brightness and Contrast”, www.eaglesoftware.com/adjustin.htm, retrieved on May 4, 2009 (4 pgs).
  • “Best practices for producing quality digital image files,” Digital Images Guidelines, http://deepblue.lib.umich.edu/bitstream/2027.42/40247/1/Images-Best—Practice.pdf, downloaded 2007 (2 pgs).
  • “Chapter 7 Payroll Programs,” Uniform Staff Payroll System, http://www2.oecn.kl2.oh.us/www/ssdt/usps/usps—user—guide—005.html, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (9 pgs).
  • “Check 21—The check is not in the post”, RedTitan Technology 2004 http://www.redtitan.com/check21/htm (3 pgs).
  • “Check 21 Solutions,” Columbia Financial International, Inc. http://www.columbiafinancial.us/check21/solutions.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (8 pgs).
  • “Check Fraud: A Guide to Avoiding Losses”, All Net, http://all.net/books/audit/checkfraud/security.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (1 pg).
  • “Compliance with Regulation CC”, http./www/federalreserve.gov/Pubs/regcc/regcc.htm, Jan. 24, 2006 (6 pgs).
  • “Customer Personalized Bank Checks and Address Labels” Checks Your Way Inc., http://www.checksyourway.com/htm/web—pages/faq.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (6 pgs).
  • “Direct Deposit Application for Payroll”, Purdue University, Business Office Form 0003, http://purdue.edu/payroll/pdf/directdepositapplication.pdf, Jul. 2007 (2 pgs).
  • “Direct Deposit Authorization Form”, www.umass.edu/humres/library/DDForm.pdf, May 2003 (3 pgs).
  • “Direct Deposit,” University of Washington, http://www.washington.edu/admin/payroll/directdeposit.html, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (3 pgs).
  • “Electronic Billing Problem: The E-check is in the mail” American Banker-vol. 168, No. 95, May 19, 2003 (4 pgs).
  • “Frequently Asked Questions” Bank of America, http://www/bankofamerica.com/deposits/checksave/index.cfm?templatelc faq bymail, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (2 pgs).
  • “Full Service Direct Deposit”, www.nonprofitstaffing.com/images/upload/dirdepform.pdf. Cited in U.S. Pat. No. 7,900,822, as dated 2001, (2 pgs).
  • “How to Digitally Deposit a Check Image”, Smart Money Daily, Copyright 2008 (5 pgs).
  • “ImageNet Mobile Deposit Provides Convenient Check Deposit and Bill Pay to Mobile Consumers,” Miteksystems, 2008 (2 pgs).
  • “It's the easiest way to Switch banks”, LNB, http://www.inbky.com/pdf/LNBswitch-kit10-07.pdf Cited in U.S. Pat. No. 7,996,316, as dated 2007 (7 pgs).
  • “Lesson 38—More Bank Transactions”, Turtle Soft, http://www.turtlesoft.com/goldenseal-software-manual.lesson38.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (8 pgs).
  • “Middleware”, David E. Bakken, Encyclopedia of Distributed Computing, Kluwer Academic Press, 2001 (6 pgs).
  • “Mitek Systems Announces Mobile Deposit Application for Apple iPhone,” http://prnewswire.com/cgi-bin/stories/pl?ACCT=104&STORY=/www/story/10-01- . . ., Nov. 25, 2008 (2 pgs).
  • “Personal Finance”, PNC, http://www.pnc.com/webapp/unsec/productsandservice.do?sitearea=/PNC/home/personal/account+services/quick+switch/quick+switch+faqs, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (12 pgs).
  • “Refractive index” Wikipedia, the free encyclopedia; http://en.wikipedia.org./wiki/refractiveindex.com Oct. 16, 2007 (4 pgs).
  • “Remote check deposit is the answer to a company's banking problem,” Daily Breeze, Torrance, CA, Nov. 17, 2006, 2 pgs.
  • “Remote Deposit Capture”, Plante & Moran, http://plantemoran.com/industries/fincial/institutions/bank/resources/community+bank+advisor/2007+summer+issue/remote+deposit+capture.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (3 pgs).
  • “Remote Deposit” National City, http://www.nationalcity.com/smallbusiness/cashmanagement/remotedeposit/default.asp; Cited in U.S. Pat. No. 7,900,822, as dated 2007 (1 pg).
  • “Save on ATM Fees”, RedEye Edition, Chicago Tribune, Chicago, IL Jun. 30, 2007 (2 pgs).
  • “SNB Check Capture: SmartClient User's Guide,” Nov. 2006, 21 pgs.
  • “Switching Made Easy,” Bank of North Georgia, http://www.banknorthgeorgia.com/cmsmaster/documents/286/documents616.pdf, 2007 (7 pgs).
  • “Two Words Every Business Should Know: Remote Deposit,” Canon, http://www.rpsolutions.com/rpweb/pdfs/canon—rdc.pdf, 2005 (7 pgs).
  • “Virtual Bank Checks”, Morebusiness.com, http://www.morebusiness.com/running—yourbusiness/businessbits/d908484987.brc, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (3 pgs).
  • “WallStreetGrapevine.com” Stocks on the Rise: JADG, BKYI, MITK; Mar. 3, 2008 (4 pgs).
  • “What is check Fraud”, National Check Fraud Center, http://www.ckfraud.org/ckfraud.html, Cited in U.S. Pat. No. 7,900,822, as dated 2007 (12 pgs).
  • Affinity Federal Credit Union, “Affinity Announces Online Deposit,” Aug. 4, 2005 (1 pg).
  • Albrecht, W. Steve, “Check Kiting: Detection, Prosecution and Prevention,” The FBI Law Enforcement Bulletin, Nov. 1, 1993 (6 pgs).
  • Alves, Vander and Borba, Paulo; “Distributed Adapters Pattern: A Design for Object-Oriented Distributed Applications”; First Latin American Conference on Pattern Languages of Programming; Oct. 2001; pp. 132-142; Rio de Janeiro, Brazil (11 pgs).
  • Amber Avalona-Butler / Paraglide, “At Your Service: Best iPhone Apps for Military Lifestyle,” Jul. 9, 2010 (2 pgs).
  • Anderson, Milton M. “FSML and Echeck”, Financial Services Technology Consortium, 1999 (17 pgs).
  • Archive Index Systems; Panini My Vision X-30 or VX30 or X30 © 1994-2008 Archive Systems, Inc. P./O. Box 40135 Bellevue, WA USA 98015 (2 pgs).
  • Associate of German Banks, SEPA 2008: Uniform Payment Instruments for Europe, Berlin, Cited in U.S. Pat. No. 7,900,822, as dated Jul. 2007, Bundesverbankd deutscher banker ev (42 pgs).
  • Automated Merchant Systems, Inc., “Electronic Check Conversion,” http://www.automatedmerchant.com/electronic—check—conversion.cfm, 2006, downloaded Oct. 18, 2006 (3 pgs).
  • Bank Systems & Technology, Untitled Article, May 1, 2006, http://www.banktech.com/showarticle.jhtml? articleID=187003126, “Are you Winning in the Payment World?” (4 pgs).
  • BankServ, “DepositNow: What's the difference?” Cited in U.S. Pat. No. 7,970,677, as dated 2006, (4 pgs).
  • BankServ, Product Overview, http://www.bankserv.com/products/remotedeposit.htm, Cited in U.S. Pat. No. 7,970,677, as dated 2006, (3 pgs).
  • Blafore, Bonnie “Lower Commissions, Fewer Amenities”, Better Investing, Madison Heights: Feb. 2003, vol. 52, Iss 6, (4 pgs).
  • BLM Technologies, “Case Study: Addressing Check 21 and RDC Error and Fraud Threats,” Remote Deposit Capture News Articles from Jun. 11, 2007, Retrieved from http://www.remotedepositcapture.com/News/june—11—2007.htm on Feb. 19, 2008 (5 pgs).
  • Blue Mountain Consulting, from URL: www.bluemontainconsulting.com, Cited in U.S. Pat. No. 7,900,822, as dated Apr. 26, 2006 (3 pgs).
  • Board of Governors of the federal reserve system, “Report to the Congress on the Check Clearing for the 21st Century Act of 2003” Apr. 2007, Submitted to Congress pursuant to section 16 of the Check Clearing for the 21st Century Act of 2003, (59 pgs).
  • Bruene, Jim; “Check Free to Enable In-Home Remote Check Deposit for Consumers and Small Business”, NetBanker. Com, Financial Insite, Inc., http://www.netbanker.com/2008/02/checkfree—to—enableinhome—rem.html, Feb. 5, 2008 (3 pgs).
  • Bruene, Jim; “Digital Federal Credit Union and Four Others Offer Consumer Remote Deposit Capture Through EasCorp”, NetBanker—Tracking Online Finance, www.netbanker.com/2008/04/digital—federal—credit—union—a.html, Apr. 13, 2008 (3 pgs).
  • Bruno, M., “Instant Messaging,″ Bank Technology News,” Dec. 2002 (3 pgs).
  • Burnett, J. “Depository Bank Endorsement Requirements,” BankersOnline.com, http://www.bankersonline.com/cgi-bin/printview/printview.pl, Jan. 6, 2003 (3 pgs).
  • Canon, ImageFormula CR-25/CR-55, “Improve Your Bottom Line with Front-Line Efficiencies”, 0117W117, 1207-55/25-1 OM-BSP, Cited in U.S. Pat. No. 7,949,587 as dated 2007. (4 pgs).
  • Carrubba, P. et al., “Remote Deposit Capture: A White Paper Addressing Regulatory, Operational and Risk Issues,” NetDeposit Inc., 2006 (11 pgs).
  • Century Remote Deposit High-Speed Scanner User's Manual Release 2006, (Century Manual), Century Bank, 2006, (32 pgs).
  • Chiang, Chuck, The Bulletin, “Remote banking offered”, http://bendbulletin.com/apps/pbcs.dll/article?AID=/20060201/BIZ0102/602010327&templ . . ., May 23, 2008 (2 pgs).
  • CNN.com/technology, “Scan, deposit checks from home”, www.cnn.com/2008ITECH/biztech/02/07/check.scanning.ap/index.html, Feb. 7,2008 (3 pgs).
  • Constanzo, Chris, “Remote Check Deposit: Wells Captures A New Checking Twist”, Bank Technology News Article—May 2005, www.americanbanker.com/btn—article.html?id=20050502YQ50FSYG (2 pgs).
  • Craig, Ben, “Resisting Electronic Payment Systems: Burning Down the House?”, Federal Reserve Bank of Cleveland, Jul. 1999 (4 pgs).
  • Creativepaymentsolutions.com, “Creative Payment Solutions—Websolution,” www.creativepaymentsolution.com/cps/financialservices/websolution/default.html, Copyright 2008, Creative Payment Solutions, Inc. (1 pg).
  • Credit Union Journal, “The Ramifications of Remote Deposit Capture Success”, www.cuiournal.com/orintthis.html?id=20080411 EODZT57G, Apr. 14, 2008 (1 pg).
  • Credit Union Journal, “AFCU Averaging 80 DepositHome Transactions Per Day”, Credit Union Journal, Aug. 15, 2005 (1 pg).
  • Credit Union Management, “When You wish Upon an Imaging System . . .the Right Selection Process can be the Shining Star,” Credit Union Management, Aug. 1993, printed from the internet at <http://search.proquest.com/docview/227756409/14138420743684F7722/15?accountid=14 . . .>, on Oct. 19, 2013 (11 pgs).
  • DCU Member's Monthly—Jan. 2008, “PC Deposit—Deposit Checks from Home!”, http://www.mycreditunionnewsletter.com/dcu/0108/page1.html, Copyright 2008 Digital Federal Credit Union (2 pgs).
  • De Jesus, A. et al., “Distributed Check Processing in a Check 21 Environment: An educational overview of the opportunities and challenges associated with implementing distributed check imaging and processing solutions,” Panini, 2004, pp. 1-22.
  • De Queiroz, Ricardo et al., “Mixed Raster Content (MRC) Model for Compound Image Compression”, 1998 (14 pgs).
  • Debello, James et al., “RDM and Mitek Systems to Provide Mobile Check Deposit,” Mitek Systems, Inc., San Diego, California and Waterloo, Ontario, (Feb. 24, 2009), 2 pgs.
  • DeYoung, Robert; “The Financial Performance of Pure Play Internet Banks”; Federal Reserve Bank of Chicago Economic Perspectives; 2001; pp. 60-75; vol. 25, No. 1 (16pgs).
  • Dias, Danilo et al., “A Model for the Electronic Representation of Bank Checks”, Brasilia Univ. Oct. 2006, (5 pgs).
  • Digital Transactions News, “An ACH-Image Proposal for Check Roils Banks and Networks” May 26, 2006 (3 pgs).
  • Dinan, R.F. et al., “Image Plus High Performance Transaction System”, IBM Systems Journal, 1990 vol. 29, No. 3 (14 pgs).
  • Doermann, David et al., “Progress in Camera-Based Document Image Analysis,” Proceedings of the Seventh International Conference on Document Analysis and Recognition (ICDAR 2003) 0-7695-1960-1/03, 2003 IEEE (11 pages).
  • Duvall, Mel, “Remote Deposit Capture,” Baseline, vol. 1, Issue 70, Mar. 2007, 2 pgs.
  • eCU Technologies, “Upost Remote Deposit Solution,” Retrieved from the internet https://www.eutechnologies.com/products/upost.html, downloaded 2009 (1 pg).
  • EFT Network Unveils FAXTellerPlus, EFT Network, Inc., www.eftnetwork.com, Jan. 13, 2009 (2 pgs).
  • ElectronicPaymentProviders, Inc., “FAQs: ACH/ARC, CheckVerification/Conversion/Guarantee, RCK Check Re-Presentment,” http://www.useapp.com/faq.htm, downloaded Oct. 18, 2006 (3 pgs).
  • Federal Check 21 Act, “New Check 21 Act effective Oct. 28, 2004: Bank No Longer Will Return Original Cancelled Checks,” Consumer Union's FAQ's and Congressional Testimony on Check 21, www.consumerlaw.org.initiatives/content/check21—content.html, Cited in patent No. 7,873,200, as dated Dec. 2005 (20 pgs).
  • Federal Reserve Board, “Check Clearing for the 21st Century Act”, FRB, http://www.federalreserve.gov/paymentsystems/truncation/, Mar. 1, 2006 (1 pg).
  • Federal Reserve System, “12 CFR, Part 229: Availability of Funds and Collection of Checks,” Federal Registrar, Apr. 28, 1997, pp. 1-50.
  • Federal Reserve System, “Part IV, 12 CFR Part 229: Availability of Funds and Collection of Checks; Final Rule,” Federal Registrar, vol. 69, No. 149, Aug. 4, 2004, pp. 47290-47328.
  • Fest, Glen., “Patently Unaware” Bank Technology News, Apr. 2006, Retrieved from the internet at URL:http://banktechnews.com/article.html?id=2006403T7612618 (5 pgs).
  • Fidelity Information Services, “Strategic Vision Embraces Major Changes in Financial Services Solutions: Fidelity's long-term product strategy ushers in new era of application design and processing,” Insight, 2004, pp. 1-14.
  • Fisher, Dan M., “Home Banking in the 21st Century: Remote Capture Has Gone Retail”, May 2008 (4 pgs).
  • Furst, Karen et al., “Internet Banking: Developments and Prospects”, Economic and Policy Analysis Working Paper 2000-9, Sep. 2000 (60 pgs).
  • Garry, M., “Checking Options: Retailers face an evolving landscape for electronic check processing that will require them to choose among several scenarios,” Supermarket News, vol. 53, No. 49, 2005 (3 pgs).
  • German Shegalov, Diplom-Informatiker, “Integrated Data, Message, and Process Recovery for Failure Masking in Web Services”, Dissertation Jul. 2005 (146 pgs).
  • Gupta, Amar et al., “An Integrated Architecture for Recognition of Totally Unconstrained Handwritten Numerals”, WP#3765, Jan. 1993, Productivity from Information Technology “Profit” Research Initiative Sloan School of Management (20 pgs).
  • Gupta, Maya R. et al., “OCR binarization and image pre-processing for searching historical documents,” Pattern Recognition, vol. 40, No. 2, Feb. 2007, pp. 389-397.
  • Hale, J., “Picture this: Check 21 uses digital technology to speed check processing and shorten lag time,” Columbus Business First, http://columbus.bizjournals.com/columbus/stories/2005/03/14focus1.html, downloaded 2007 (3 pgs).
  • Hartly, Thomas, “Banks Check Out New Image”, Business First, Buffalo: Jul. 19, 2004, vol. 20, Issue 43, (3 pgs).
  • Heckenberg, D. “Using Mac OS X for Real-Time Image Processing” Oct. 08, 2003 (15 pgs).
  • Hildebrand, C. et al., “Electronic Money,” Oracle, http://www.oracle.com/oramag/profit/05-feb/p15financial.html, 2005, downloaded Oct. 18, 2006 (5 pgs).
  • Hillebrand, G., “Questions and Answers About the Check Clearing for the 21st Century Act, 'Check 21,” ConsumersUnion.org, http://www.consumersunion.org/finance/ckclear1002.htm, Jul. 27, 2004, downloaded Oct. 18, 2006 (6 pgs).
  • Iida, Jeanne, “The Back Office: Systems—Image Processing Rolls on as Banks ReapBenefits,” American Banker, Jul. 19, 1993, printed from the internet at <http://search.proquest.com/docview/292903245/14138420743684F7722/14?accountid=14 . . .>, on Oct. 19, 2013 (3 pgs).
  • Image Master, “Photo Restoration: We specialize in digital photo restoration and photograph repair of family pictures”, http://www.imphotorepair.com, Cited in U.S. Pat. No. 7,900,822, as downloaded Apr. 2007 (1 pg).
  • Investment Systems Company, “Portfolio Accounting System,” 2000, pp. 1-32.
  • JBC, “What is a MICR Line?,” eHow.com, retrieved from http://www.ehow.com/about—4684793—what-micr-line.html on May 4, 2009 (2 pgs).
  • Johnson, Jennifer J., Secretary of the Board; Federal Reserve System, 12 CFR Part 229, Regulation CC; Docket No. R 1176, “Availability of Funds and Collection of Checks”. Cited in U.S. Pat. No. 7,900,822, as dated 2009, (89 pgs).
  • Kendrick, Kevin B., “Check Kiting, Float for Purposes of Profit,” Bank Security & Fraud Prevention, vol. 1, No. 2, 1994 (3 pgs).
  • Kiser, Elizabeth K.; “Modeling the Whole Firm: The Effect of Multiple Inputs and Financial Intermediation on Bank Deposit Rates;” FEDS Working Paper No. Jul. 2004; Jun. 3, 2003; pp. 1-46 (46 pgs).
  • Knestout, Brian P. et al., “Banking Made Easy” Kiplinger's Personal Finance Washington, Jul. 2003, vol. 57, Iss 7 (5 pgs).
  • Kornai Andras et al., “Recognition of Cursive Writing on Personal Checks”, Proceedings of International Workshop on the Frontiers in Handwriting Recognition, Cited in U.S. Pat. No. 7,900,822, as dated Sep. 1996, (6 pgs).
  • Levitin, Adam J., Remote Deposit Capture: A Legal and Transactional Overview, Banking Law Journal, p. 115, 2009 (RDC).
  • Masonson, L., “Check Truncation and ACH Trends—Automated Clearing Houses”, healthcare financial management associate, http://www.findarticles.com/p/articles/mLm3276/is—n7—v47/ai—14466034/print, 1993 (2 pgs).
  • Matthews, Deborah, “Advanced Technology Makes Remote Deposit Capture Less Risky,” Indiana Bankers Association, Apr. 2008 (2 pgs).
  • Metro 1 Credit Union, “Remote Banking Services,” hltp://www.metro1cu.org/metro1cu/remote.html, downloaded Apr. 17, 2007 (4 pgs).
  • Mitek systems, “Imagenet Mobile Deposit”, San Diego, CA, downloaded 2009 (2 pgs).
  • Mitek Systems: Mitek Systems Launches First Mobile Check Deposit and Bill Pay Application, San Diego, CA, Jan. 22, 2008 (3 pgs).
  • Mohl, Bruce, “Banks Reimbursing ATM Fee to Compete With Larger Rivals”, Boston Globe, Boston, MA, Sep. 19, 2004 (3 pgs).
  • Moreau, T., “Payment by Authenticated Facsimile Transmission: a Check Replacement Technology for Small and Medium Enterprises,” CONNOTECH Experts-conseils, Inc., Apr. 1995 (31 pgs).
  • B112 Nelson, B. et al., “Remote deposit capture changes the retail landscape,” Northwestern Financial Review, http://findarticles.com/p/articles/miqa3799/is200607/ai—n16537250, 2006 (3 pgs).
  • NetBank, Inc., “Branch Out: Annual Report 2004,” 2004 (150 pgs).
  • NetBank, Inc., “Quick Post: Deposit and Payment Forwarding Service,” 2005 (1 pg).
  • NetDeposit Awarded Two Patents for Electronic Check Process, NetDeposit, Jun. 18, 2007, (1 pg).
  • Nixon, Julie et al., “Fisery Research Finds Banks are Interested in Offering Mobile Deposit Capture as an,” Fiserv, Inc. Brookfield, Wis., (Business Wire), (Feb. 20, 2009), 2 pgs.
  • Online Deposit: Frequently Asked Questions, http://www.depositnow.com/faq.html, Copyright 2008 (1 pg).
  • Onlinecheck.com/Merchant Advisors, “Real-Time Check Debit”, Merchant Advisors: Retail Check Processing Check Conversion, http://www.onlinecheck/wach/rcareal.htm, Cited in U.S. Pat. No. 7,900,822, as dated 2006 (3 pgs).
  • Oxley, Michael G., from committee on Financial Services; “Check Clearing for the 21st Century Act”, 108th Congress, 1st Session House of Representatives report 108-132, Jun. 2003 (20 pgs).
  • Oxley, Michael G., from the committee of conference; “Check Clearing for the 21st Century Act” 108th Congress, 1st Session Senate report 108-291, Oct. 1, 2003 (27 pgs).
  • Palacios, Rafael et al., “Automatic Processing of Brazilian Bank Checks”. Cited in U.S. Pat. No. 7,900,822, as dated 2002 (28 pgs).
  • Patterson, Scott “USAA Deposit@Home—Another Wow moment for Net Banking”, NextCU.com, Jan. 26, 2007 (5 pgs).
  • Public Law 108-100, 108 Congress; “An Act Check Clearing for the 21st Century Act”, Oct. 28, 2003, 117 STAT. 1177 (18 pgs).
  • Rao, Bharat; “The Internet and the Revolution in Distribution: A Cross-Industry Examination”; Technology in Society; 1999; pp. 287-306; vol. 21, No. 3 (20 pgs).
  • Remotedepositcapture, URL:www.remotedepositcapture.com, Cited in U.S. Pat. No. 7,900,822, as dated 2006 (5 pgs).
  • RemoteDepositCapture.com, “PNC Bank to Offer Ease of Online Deposit Service Integrated with QuickBooks to Small Businesses”, Remote Deposit Capture News Articles from Jul. 24, 2006, (2 pgs).
  • RemoteDepositCapture.com, Remote Deposit Capture News Articles from Jul. 6, 2006, “BankServ Announces New Remote Deposit Product Integrated with QuickBooks” (3 pgs).
  • Remotedepsitcapture.com, LLC, “Remote Deposit Capture Overview,” ROC Overview, http://remotedepositcapture.com/overview/RDC—overview.htm, Cited in U.S. Pat. No. 7,900,822, as dated Mar. 12, 2007 (4 pgs).
  • Richey, J. C. et al., “EE 4530 Check Imaging,” Nov. 18, 2008 (10 pgs).
  • Ritzer, J.R. “Hinky Dinky helped spearhead POS, remote banking movement”, Bank Systems and Equipment, vol. 21, No. 12, Dec. 1984 (1 pg).
  • Rivlin, Alice M. et al., Chair, Vice Chair—Board of Governors, Committee on the Federal Reserve in the Payments Mechanism—Federal Reserve System, “ The Federal Reserve in the Payments Mechanism”, Jan. 1998 (41 pgs).
  • Rose, Sarah et al., “Best of the We: The Top 50 Financial Websites”, Money, New York, Dec. 1999, vol. 28, Iss. 12 (8 pgs).
  • Shelby, Hon. Richard C. (Committee on Banking, Housing and Urban Affairs); “Check Truncation Act of 2003”, calendar No. 168, 108th Congress, 1st Session Senate report 108-79, Jun. 2003 (27 pgs).
  • SoyBank Anywhere, “Consumer Internet Banking Service Agreement,” Dec. 6, 2004 (6 pgs).
  • Teixeira, D., “Comment: Time to Overhaul Deposit Processing Systems,” American Banker, Dec. 10, 1998, vol. 163, No. 235, p. 15 (3 pgs).
  • Thailandguru.com: How and where to Pay Bills @ www.thailandguru.com/paying-bills.html, © 1999-2007 (2 pgs).
  • The Automated Clearinghouse, “Retail Payment Systems; Payment Instruments Clearing and Settlement: The Automated Clearinghouse (ACH)”, www.ffiec.gov/ffiecinfobase/booklets/retailretail—02d.html, Cited in U.S. Pat. No. 7,900,822, as dated Dec. 2005 (3 pgs).
  • The Green Sheet 2.0: Newswire, “Co-Op adds home deposit capabilities to suite of check imaging products”, www.greensheet.com/newswire.php?newswire—id=8799, Mar. 5, 2008 (2 pgs).
  • Tygar, J.D., Atomicity in Electronic Commerce, in ACM Networker, 2:2, Apr./May 1998 (12 pgs).
  • Valentine, Lisa, “Remote Deposit Capture Hot Just Got Hotter,” ABA Banking Journal, Mar. 2006, pp. 1-9.
  • Wade, Will, “Early Notes: Updating Consumers on Check 21” American Banker Aug. 10, 2004 (3 pgs).
  • Wallison, Peter J., “Wal-Mart Case Exposes Flaws in Banking-Commerce Split”, American Banker, vol. 167. No. 8, Jan. 11, 2002 (3 pgs).
  • Wells Fargo 2005 News Releases, “The New Wells Fargo Electronic Deposit Services Break Through Banking Boundaries in the Age of Check 21”, San Francisco Mar. 28, 2005, www.wellsfargo.com/press/3282005—check21Year=2005 (1 pg).
  • Wells Fargo Commercial, “Remote Deposit”, www.wellsfargo.com/com/treasury mgmtlreceivables/electronic/remote deposit, Copyright 2008 (1 pg).
  • White, J.M. et al., “Image Thresholding for Optical Character Recognition and Other Applications Requiring Character Image Extraction”, IBM J. Res. Development, Jul. 1983, vol. 27, No. 4 (12 pgs).
  • Whitney et al., “Reserve Banks to Adopt DSTU X9.37-2003 Format for Check 21 Image Services”, American Bankers Association, May 18, 2004, http://www.aba/com/NR/rdonlyres/CBDC1 A5C-43E3-43CC-B733-BE417C638618/35930/DSTUFormat.pdf (2 pages).
  • Wikipedia ®, “Remote Deposit,” http://en.wikipedia.org/wiki/Remote—deposit, 2007 (3 pgs).
  • Windowsfordevices.com, “Software lets camera phone users deposit checks, pay bills”, www.windowsfordevices.com/news/NS3934956670.html, Jan. 29, 2008 (3 pgs).
  • Wolfe, Daniel, “Check Image Group Outlines Agenda,” American Banker, New York, NY: Feb. 13, 2009, vol. 174, Iss. 30, p. 12. (2 pgs).
  • Woody Baird Associated Press, “Pastor's Wife got Scammed—She Apparently Fell for Overseas Money Scheme,” The Commercial Appeal, Jul. 1, 2006, p. A. 1.
  • Zhang, C.Y., “Robust Estimation and Image Combining” Astronomical Data Analysis Software and Systems IV, ASP Conference Series, 1995 (5 pgs).
  • Zions Bancorporation, “Moneytech, the technology of money in our world: Remote Deposit,” http://www.bankjunior.com/pground/moneytech/remote—deposit.jsp, 2007 (2 pgs).
  • Application as filed on Apr. 3, 2008 for U.S. Appl. No. 12/062,143 (27 pgs).
  • Application as filed on Aug. 19, 2010 for U.S. Appl. No. 12/859,741 (235 pgs).
  • Application as filed on Aug. 21, 2008 for U.S. Appl. No. 12/195,723 (38 pgs).
  • Application as filed on Aug. 21, 2009 for U.S. Appl. No. 12/545,127 (45 pgs).
  • Application as filed on Aug. 28, 2009 for U.S. Appl. No. 12/549,443 (41 pgs).
  • Application as filed on Dec. 20, 2006 for U.S. Appl. No. 11/613,656 (21 pgs).
  • Application as filed on Dec. 29, 2005 for U.S. Appl. No. 11/321,025 (19 pgs).
  • Application as filed on Dec. 30, 2010 for U.S. Appl. No. 12/982,494 (280 pgs).
  • Application as filed on Dec. 30, 2010 for U.S. Appl. No. 12/982,561 (275 pgs).
  • Application as filed on Dec. 30, 2010 for U.S. Appl. No. 12/982,578 (274 pgs).
  • Application as filed on Dec. 30, 2010 for U.S. Appl. No. 12/982,594 (275 pgs).
  • Application as filed on Feb. 15, 2012 for U.S. Appl. No. 13/397,405 (19 pgs).
  • Application as filed on Feb. 18, 2009 for U.S. Appl. No. 12/388,005 (37 pgs).
  • Application as filed on Jan. 7, 2013 for U.S. Appl. 13/735,678 (30 pgs).
  • Application as filed on Jul. 13, 2006 for U.S. Appl. No. 11/487,537 (23 pgs).
  • Application as filed on Jul. 27, 2009 for U.S. Appl. No. 12/509,613 (48 pgs).
  • Application as filed on Jul. 27, 2009 for U.S. Appl. No. 12/509,680 (41 pgs).
  • Application as filed on Jun. 11, 2008 for U.S. Appl. No. 12/137,051 (29 pgs).
  • Application as filed on Jun. 8, 2011 for U.S. Appl. No. 13/155,976 (352 pgs).
  • Application as filed on Jun. 8, 2011 for U.S. Appl. No. 13/156,007 (356 pgs).
  • Application as filed on Jun. 8, 2011 for U.S. Appl. No. 13/156,018 (353 pgs).
  • Application as filed on Mar. 15, 2007 for U.S. Appl. No. 11/686,924 (34 pgs).
  • Application as filed on Mar. 15, 2007 for U.S. Appl. No. 11/686,928 (36 pgs).
  • Application as filed on Mar. 15, 2013 for U.S. Appl. No. 13/842,112 (62 pgs).
  • Application as filed on Mar. 4, 2009 for U.S. Appl. No. 12/397,671 (40 pgs).
  • Application as filed on Mar. 4, 2009 for U.S. Appl. No. 12/397,930 (37 pgs).
  • Application as filed on May 10, 2007 for U.S. Appl. No. 11/747,222 (35 pgs).
  • Application as filed on Oct. 17, 2008 for U.S. Appl. No. 12/253,278 (42 pgs).
  • Application as filed on Oct. 17, 2013 for U.S. Appl. No. 14/056,565 (53 pgs).
  • Application as filed on Oct. 23, 2007 for U.S. Appl. No. 11/876,925 (36 pgs).
  • Application as filed on Oct. 23, 2007 for U.S. Appl. No. 11/877,335 (29 pgs).
  • Application as filed on Oct. 25, 2007 for U.S. Appl. No. 11/923,839 (22 pgs).
  • Application as filed on Oct. 29, 2007 for U.S. Appl. No. 11/926,388 (23 pgs).
  • Application as filed on Oct. 30, 2007 for U.S. Appl. No. 11/928,297 (26 pgs).
  • Application as filed on Oct. 31, 2006 for U.S. Appl. No. 11/590,974 (31 pgs).
  • Application as filed on Oct. 31, 2006 for U.S. Appl. No. 11/591,008 (27 pgs).
  • Application as filed on Oct. 31, 2006 for U.S. Appl. No. 11/591,227 (58 pgs).
  • Application as filed on Oct. 31, 2006 for U.S. Appl. No. 11/591,273 (56 pgs).
  • Application as filed on Oct. 31, 2007 for U.S. Appl. No. 11/930,537 (27 pgs).
  • Application as filed on Oct. 31, 2007 for U.S. Appl. No. 11/931,670 (47 pgs).
  • Application as filed on Oct. 8, 2007 for U.S. Appl. No. 11/868,878 (30 pgs).
  • Application as filed on Oct. 8, 2007 for U.S. Appl. No. 11/868,884 (30 pgs).
  • Application as filed on Sep. 28, 2007 for U.S. Appl. No. 11/864,569 (35 pgs).
  • Application as filed on Sep. 8, 2008 for U.S. Appl. No. 12/205,996 (30 pgs).
  • Claims as filed on Apr. 1, 2013 for U.S. Appl. No. 13/854,521 (5 pgs).
  • Claims as filed on Apr. 3, 2008 for U.S. Appl. No. 12/062,163 (3 pgs).
  • Claims as filed on Apr. 3, 2008 for U.S. Appl. No. 12/062,175 (3 pgs).
  • Claims as filed on Apr. 30, 2013 for U.S. Appl. No. 13/874,145 (5 pgs).
  • Claims as filed on Aug. 19, 2010 for U.S. Appl. No. 12/859,752 (5 pgs).
  • Claims as filed on Aug. 21, 2009 for U.S. Appl. No. 12/545,127 (5 pgs).
  • Claims as filed on Dec. 15, 2011 for U.S. Appl. No. 13/327,478 (4 pgs).
  • Claims as filed on Dec. 20, 2006 for U.S. Appl. No. 11/613,671 (3 pgs).
  • Claims as filed on Dec. 20, 2012 for U.S. Appl. No. 13/722,576 (4 pgs).
  • Claims as filed on Dec. 29, 2005 for U.S. Appl. No. 11/320,998 (3 pgs).
  • Claims as filed on Dec. 29, 2005 for U.S. Appl. No. 11/321,027 (3 pgs).
  • Claims as filed on Dec. 8, 2010 for U.S. Appl. No. 12/963,513 (7 pgs).
  • Claims as filed on Feb. 12, 2013 for U.S. Appl. No. 13/765,412 (1 pg).
  • Claims as filed on Feb. 15, 2012 for U.S. Appl. No. 13/397,437 (6 pgs).
  • Claims as filed on Feb. 16, 2011 for U.S. Appl. No. 13/028,477 (3 pgs).
  • Claims as filed on Feb. 16, 2015 for U.S. Appl. No. 14/623,179 (10 pgs).
  • Claims as filed on Feb. 19, 2013 for U.S. Appl. No. 13/770,048 (4 pgs).
  • Claims as filed on Jan. 20, 2011 for U.S. Appl. No. 13/010,644 (9 pgs).
  • Claims as filed on Jan. 31, 2011 for U.S. Appl. No. 13/017,865 (11 pgs).
  • Claims as filed on Jun. 13, 2012 for U.S. Appl. No. 13/495,971 (36 pgs).
  • Claims as filed on Jun. 20, 2013 for U.S. Appl. No. 13/922,686 (7 pgs).
  • Claims as filed on Jun. 9, 2014 for U.S. Appl. No. 14/299,456 (36 pgs).
  • Claims as filed on Mar. 15, 2007 for U.S. Appl. No. 11/686,925 (5 pgs).
  • Claims as filed on Mar. 25, 2014 for U.S. Appl. No. 14/220,799 (1 pg).
  • Claims as filed on Mar. 25, 2014 for U.S. Appl. No. 14/224,944 (4 pgs).
  • Claims as filed on Mar. 25, 2014 for U.S. Appl. No. 14/225,090 (1 pg).
  • Claims as filed on Mar. 3, 2014 for U.S. Appl. No. 14/195,482 (4 pgs).
  • Claims as filed on May 10, 2007 for U.S. Appl. No. 11/747,223 (4 pgs).
  • Claims as filed on May 18, 2011 for U.S. Appl. No. 13/110,077 (9 pgs).
  • Claims as filed on May 2, 2011 for U.S. Appl. No. 13/098,566 (10 pgs).
  • Claims as filed on Nov. 20, 2012 for U.S. Appl. No. 13/682,268 (4 pgs).
  • Claims as filed on Oct. 16, 2014 for U.S. Appl. No. 14/516,335 (4 pgs).
  • Claims as filed on Oct. 16, 2014 for U.S. Appl. No. 14/516,350 (4 pgs).
  • Claims as filed on Oct. 16, 2014 for U.S. Appl. No. 14/516,364 (4 pgs).
  • Claims as filed on Oct. 23, 2007 for U.S. Appl. No. 11/877,382 (6 pgs).
  • Claims as filed on Oct. 24, 2008 for U.S. Appl. No. 12/257,471 (4 pgs).
  • Claims as filed on Oct. 31, 2006 for U.S. Appl. No. 11/590,963 (3 pgs).
  • Claims as filed on Oct. 31, 2006 for U.S. Appl. No. 11/590,995 (3 pgs).
  • Claims as filed on Oct. 31, 2006 for U.S. Appl. No. 11/590,998 (4 pgs).
  • Claims as filed on Oct. 31, 2006 for U.S. Appl. No. 11/591,131 (4 pgs).
  • Claims as filed on Oct. 31, 2007 for U.S. Appl. No. 11/931,804 (4 pgs).
  • Claims as filed on Oct. 8, 2007 for U.S. Appl. No. 11/868,878 (4 pgs).
  • Claims as filed on Sep. 14, 2012 for U.S. Appl. No. 13/619,026 (3 pgs).
  • Claims as filed on Sep. 2, 2008 for U.S. Appl. No. 12/202,781 (4 pgs).
  • Claims as filed on Sep. 8, 2008 for U.S. Appl. No. 12/206,001 (3 pgs).
  • Claims as filed on Sep. 8, 2008 for U.S. Appl. No. 12/206,007 (3 pgs).
Patent History
Patent number: 9158966
Type: Grant
Filed: Oct 17, 2013
Date of Patent: Oct 13, 2015
Assignee: United Services Automobile Association (San Antonio, TX)
Inventor: Adam S. Newman (San Antonio, TX)
Primary Examiner: Abolfazl Tabatabai
Application Number: 14/056,565
Classifications
Current U.S. Class: Remote Banking (e.g., Home Banking) (705/42)
International Classification: G06K 9/00 (20060101); G03B 7/08 (20140101);