Character count determination for a digital image

Information

  • Patent Grant
  • 9158966
  • Patent Number
    9,158,966
  • Date Filed
    Thursday, October 17, 2013
    11 years ago
  • Date Issued
    Tuesday, October 13, 2015
    9 years ago
Abstract
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.
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; anddetermining 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; anddetermining 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; andidentifying 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; andincrementing 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; anddetermining 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; andwhen the character count for the financial image document meets the minimum character count threshold: performing further image processing on the financial document image; andwhen 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; anda 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; anddetermining 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; anddetermine 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; anddetermine 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; anddetermine 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.
US Referenced Citations (805)
Number Name Date Kind
3005282 Christiansen Oct 1961 A
3341820 Grillmeier, Jr. et al. Sep 1967 A
3576972 Wood May 1971 A
3593913 Bremer Jul 1971 A
3620553 Donovan Nov 1971 A
3648242 Grosbard Mar 1972 A
3800124 Walsh Mar 1974 A
3816943 Henry Jun 1974 A
4002356 Weidmann Jan 1977 A
4060711 Buros Nov 1977 A
4070649 Wright, Jr. et al. Jan 1978 A
4128202 Buros Dec 1978 A
4136471 Austin Jan 1979 A
4205780 Burns Jun 1980 A
4264808 Owens Apr 1981 A
4305216 Skelton Dec 1981 A
4321672 Braun Mar 1982 A
4433436 Carnes Feb 1984 A
4454610 Sziklai Jun 1984 A
RE31692 Tyburski et al. Oct 1984 E
4523330 Cain Jun 1985 A
4636099 Goldstone Jan 1987 A
4640413 Kaplan Feb 1987 A
4644144 Chandek Feb 1987 A
4722444 Murphy et al. Feb 1988 A
4722544 Weber Feb 1988 A
4727435 Otani et al. Feb 1988 A
4774574 Daly et al. Sep 1988 A
4774663 Musmanno Sep 1988 A
4790475 Griffin Dec 1988 A
4806780 Yamamoto Feb 1989 A
4837693 Schotz Jun 1989 A
4890228 Longfield Dec 1989 A
4927071 Wood May 1990 A
4934587 McNabb Jun 1990 A
4960981 Benton Oct 1990 A
4975735 Bright Dec 1990 A
5022683 Barbour Jun 1991 A
5053607 Carlson Oct 1991 A
5146606 Grondalski Sep 1992 A
5157620 Shaar Oct 1992 A
5159548 Caslavka Oct 1992 A
5191525 LeBrun Mar 1993 A
5193121 Elischer et al. Mar 1993 A
5220501 Lawlor Jun 1993 A
5227863 Bilbrey et al. Jul 1993 A
5229589 Schneider Jul 1993 A
5237159 Stephens Aug 1993 A
5257320 Etherington et al. Oct 1993 A
5265008 Benton Nov 1993 A
5321816 Rogan Jun 1994 A
5347302 Simonoff Sep 1994 A
5350906 Brody Sep 1994 A
5373550 Campbell Dec 1994 A
5419588 Wood May 1995 A
5422467 Graef Jun 1995 A
5444794 Uhland, Sr. Aug 1995 A
5475403 Havlovick et al. Dec 1995 A
5504538 Tsujihara Apr 1996 A
5504677 Pollin Apr 1996 A
5528387 Kelly et al. Jun 1996 A
5577179 Blank Nov 1996 A
5583759 Geer Dec 1996 A
5590196 Moreau Dec 1996 A
5594225 Botvin Jan 1997 A
5598969 Ong Feb 1997 A
5602936 Green Feb 1997 A
5610726 Nonoshita Mar 1997 A
5611028 Shibasaki Mar 1997 A
5630073 Nolan May 1997 A
5631984 Graf et al. May 1997 A
5668897 Stolfo Sep 1997 A
5673320 Ray et al. Sep 1997 A
5677955 Doggett Oct 1997 A
5678046 Cahill et al. Oct 1997 A
5679938 Templeton Oct 1997 A
5680611 Rail Oct 1997 A
5691524 Josephson Nov 1997 A
5699452 Vaidyanathan Dec 1997 A
5734747 Vaidyanathan Mar 1998 A
5737440 Kunkler Apr 1998 A
5748780 Stolfo May 1998 A
5751842 Riach May 1998 A
5784503 Bleecker, III et al. Jul 1998 A
5830609 Warner Nov 1998 A
5832463 Funk Nov 1998 A
5838814 Moore Nov 1998 A
5863075 Rich Jan 1999 A
5870456 Rogers Feb 1999 A
5870724 Lawlor Feb 1999 A
5870725 Bellinger et al. Feb 1999 A
5878337 Joao Mar 1999 A
5893101 Balogh et al. Apr 1999 A
5897625 Gustin Apr 1999 A
5898157 Mangili et al. Apr 1999 A
5901253 Tretter May 1999 A
5903878 Talati May 1999 A
5903881 Schrader May 1999 A
5910988 Ballard Jun 1999 A
5917931 Kunkler Jun 1999 A
5924737 Schrupp Jul 1999 A
5926548 Okamoto Jul 1999 A
5930778 Geer Jul 1999 A
5937396 Konya Aug 1999 A
5940844 Cahill Aug 1999 A
5982918 Mennie Nov 1999 A
5987439 Gustin et al. Nov 1999 A
6012048 Gustin et al. Jan 2000 A
6014454 Kunkler Jan 2000 A
6021202 Anderson Feb 2000 A
6021397 Jones Feb 2000 A
6029887 Furuhashi Feb 2000 A
6030000 Diamond Feb 2000 A
6032137 Ballard Feb 2000 A
6038553 Hyde Mar 2000 A
6053405 Irwin, Jr. et al. Apr 2000 A
6073119 Bornemisza-wahr Jun 2000 A
6073121 Ramzy Jun 2000 A
6085168 Mori Jul 2000 A
6086708 Colgate Jul 2000 A
6089450 Koeple Jul 2000 A
6089610 Greene Jul 2000 A
6097834 Krouse Aug 2000 A
6097845 Ng et al. Aug 2000 A
6097885 Rayner Aug 2000 A
6105865 Hardesty Aug 2000 A
6141339 Kaplan et al. Oct 2000 A
6145738 Stinson et al. Nov 2000 A
6151426 Lee Nov 2000 A
6159585 Rittenhouse Dec 2000 A
6170744 Lee Jan 2001 B1
6178409 Weber et al. Jan 2001 B1
6188506 Kaiserman Feb 2001 B1
6189785 Lowery Feb 2001 B1
6192165 Irons Feb 2001 B1
6195694 Chen et al. Feb 2001 B1
6199055 Kara Mar 2001 B1
6236009 Emigh et al. May 2001 B1
6243689 Norton Jun 2001 B1
6278983 Ball Aug 2001 B1
6282523 Tedesco et al. Aug 2001 B1
6282826 Richards Sep 2001 B1
6293469 Masson et al. Sep 2001 B1
6304860 Martin Oct 2001 B1
6314452 Dekel Nov 2001 B1
6317727 May Nov 2001 B1
6328207 Gregoire et al. Dec 2001 B1
6330546 Gopinathan et al. Dec 2001 B1
6339658 Moccagatta Jan 2002 B1
6363162 Moed et al. Mar 2002 B1
6363164 Jones et al. Mar 2002 B1
6390362 Martin May 2002 B1
6397196 Kravetz May 2002 B1
6408084 Foley Jun 2002 B1
6411725 Rhoads Jun 2002 B1
6411737 Wesolkowski et al. Jun 2002 B2
6411938 Gates et al. Jun 2002 B1
6413305 Mehta Jul 2002 B1
6417869 Do Jul 2002 B1
6425017 Dievendorff Jul 2002 B1
6429952 Olbricht Aug 2002 B1
6439454 Masson et al. Aug 2002 B1
6449397 Che-chu Sep 2002 B1
6450403 Martens et al. Sep 2002 B1
6463220 Dance et al. Oct 2002 B1
6464134 Page Oct 2002 B1
6469745 Yamada et al. Oct 2002 B1
6470325 Leemhuis Oct 2002 B1
6505178 Flenley Jan 2003 B1
6546119 Ciolli et al. Apr 2003 B2
6574609 Downs Jun 2003 B1
6578760 Otto Jun 2003 B1
6587837 Spagna Jul 2003 B1
6606117 Windle Aug 2003 B1
6609200 Anderson Aug 2003 B2
6611598 Hayosh Aug 2003 B1
6614930 Agnihotri et al. Sep 2003 B1
6643416 Daniels Nov 2003 B1
6654487 Downs, Jr. Nov 2003 B1
6661910 Jones et al. Dec 2003 B2
6672452 Alves Jan 2004 B1
6682452 Quintus Jan 2004 B2
6695204 Stinson Feb 2004 B1
6711474 Treyz et al. Mar 2004 B1
6726097 Graef Apr 2004 B2
6728397 Mcneal Apr 2004 B2
6738496 Van Hall May 2004 B1
6742128 Joiner May 2004 B1
6745186 Testa et al. Jun 2004 B1
6754640 Bozeman Jun 2004 B2
6755340 Voss et al. Jun 2004 B1
6763226 McZeal Jul 2004 B1
6781962 Williams Aug 2004 B1
6786398 Stinson et al. Sep 2004 B1
6789054 Makhlouf Sep 2004 B1
6796491 Nakajima Sep 2004 B2
6806903 Okisu et al. Oct 2004 B1
6813733 Li Nov 2004 B1
6829704 Zhang Dec 2004 B2
6844885 Anderson Jan 2005 B2
6856965 Stinson Feb 2005 B1
6863214 Garner et al. Mar 2005 B2
6870947 Kelland Mar 2005 B2
6883140 Acker Apr 2005 B1
6898314 Kung et al. May 2005 B2
6902105 Koakutsu Jun 2005 B2
6910023 Schibi Jun 2005 B1
6913188 Wong Jul 2005 B2
6931591 Brown Aug 2005 B1
6934719 Nally Aug 2005 B2
6957770 Robinson Oct 2005 B1
6961689 Greenberg Nov 2005 B1
6970843 Forte Nov 2005 B1
6973589 Wright Dec 2005 B2
6983886 Natsukari et al. Jan 2006 B2
6993507 Meyer Jan 2006 B2
6996263 Jones et al. Feb 2006 B2
6999943 Johnson Feb 2006 B1
7003040 Yi Feb 2006 B2
7004382 Sandru Feb 2006 B2
7010155 Koakutsu et al. Mar 2006 B2
7010507 Anderson Mar 2006 B1
7016704 Pallakoff Mar 2006 B2
7039048 Monta May 2006 B1
7058036 Yu Jun 2006 B1
7062099 Li et al. Jun 2006 B2
7062456 Riehl et al. Jun 2006 B1
7062768 Kubo Jun 2006 B2
7072862 Wilson Jul 2006 B1
7076458 Lawlor et al. Jul 2006 B2
7086003 Demsky Aug 2006 B2
7092561 Downs, Jr. Aug 2006 B2
7104443 Paul et al. Sep 2006 B1
7113925 Waserstein Sep 2006 B2
7114649 Nelson Oct 2006 B2
7131571 Swift et al. Nov 2006 B2
7139594 Nagatomo Nov 2006 B2
7140539 Crews Nov 2006 B1
7163347 Lugg Jan 2007 B2
7178721 Maloney Feb 2007 B2
7181430 Buchanan et al. Feb 2007 B1
7184980 Allen-Rouman et al. Feb 2007 B2
7197173 Jones et al. Mar 2007 B2
7200255 Jones Apr 2007 B2
7204412 Foss, Jr. Apr 2007 B2
7216106 Buchanan May 2007 B1
7219082 Forte May 2007 B2
7219831 Murata May 2007 B2
7249076 Pendleton Jul 2007 B1
7252224 Verma Aug 2007 B2
7257246 Brodie et al. Aug 2007 B1
7266230 Doran Sep 2007 B2
7290034 Budd Oct 2007 B2
7299970 Ching Nov 2007 B1
7299979 Phillips Nov 2007 B2
7313543 Crane Dec 2007 B1
7314163 Crews et al. Jan 2008 B1
7321874 Dilip Jan 2008 B2
7321875 Dilip Jan 2008 B2
7325725 Foss, Jr. Feb 2008 B2
7328190 Smith et al. Feb 2008 B2
7330604 Wu et al. Feb 2008 B2
7336813 Prakash et al. Feb 2008 B2
7343320 Treyz Mar 2008 B1
7349566 Jones et al. Mar 2008 B2
7356505 March Apr 2008 B2
7377425 Ma May 2008 B1
7379978 Anderson May 2008 B2
7383227 Weinflash et al. Jun 2008 B2
7385631 Maeno Jun 2008 B2
7386511 Buchanan Jun 2008 B2
7391897 Jones et al. Jun 2008 B2
7391934 Goodall et al. Jun 2008 B2
7392935 Byrne Jul 2008 B2
7401048 Rosedale Jul 2008 B2
7403917 Larsen Jul 2008 B1
7406198 Aoki et al. Jul 2008 B2
7421107 Lugg Sep 2008 B2
7421410 Schechtman et al. Sep 2008 B1
7427016 Chimento Sep 2008 B2
7433098 Klein et al. Oct 2008 B2
7437327 Lam Oct 2008 B2
7440924 Buchanan Oct 2008 B2
7447347 Weber Nov 2008 B2
7455220 Phillips Nov 2008 B2
7455221 Sheaffer Nov 2008 B2
7460108 Tamura Dec 2008 B2
7461779 Ramachandran Dec 2008 B2
7461780 Potts Dec 2008 B2
7471818 Price Dec 2008 B1
7475040 Buchanan Jan 2009 B2
7477923 Wallmark Jan 2009 B2
7480382 Dunbar Jan 2009 B2
7480422 Ackley et al. Jan 2009 B2
7489953 Griffin Feb 2009 B2
7490242 Torres Feb 2009 B2
7497429 Reynders Mar 2009 B2
7503486 Ahles Mar 2009 B2
7505759 Rahman Mar 2009 B1
7506261 Satou Mar 2009 B2
7509287 Nutahara Mar 2009 B2
7512564 Geer Mar 2009 B1
7519560 Lam Apr 2009 B2
7520420 Phillips Apr 2009 B2
7520422 Robinson et al. Apr 2009 B1
7536354 deGroeve et al. May 2009 B1
7536440 Budd May 2009 B2
7539646 Gilder May 2009 B2
7540408 Levine Jun 2009 B2
7542598 Jones Jun 2009 B2
7545529 Borrey et al. Jun 2009 B2
7548641 Gilson et al. Jun 2009 B2
7566002 Love et al. Jul 2009 B2
7571848 Cohen Aug 2009 B2
7587066 Cordery et al. Sep 2009 B2
7587363 Cataline Sep 2009 B2
7590275 Clarke et al. Sep 2009 B2
7599543 Jones Oct 2009 B2
7599888 Manfre Oct 2009 B2
7602956 Jones Oct 2009 B2
7606762 Heit Oct 2009 B1
7609873 Foth et al. Oct 2009 B2
7609889 Guo et al. Oct 2009 B2
7619721 Jones Nov 2009 B2
7620231 Jones Nov 2009 B2
7620604 Bueche, Jr. Nov 2009 B1
7630518 Frew et al. Dec 2009 B2
7644037 Ostrovsky Jan 2010 B1
7644043 Minowa Jan 2010 B2
7647275 Jones Jan 2010 B2
7668363 Price Feb 2010 B2
7672022 Fan Mar 2010 B1
7672940 Viola Mar 2010 B2
7676409 Ahmad Mar 2010 B1
7680735 Loy Mar 2010 B1
7689482 Lam Mar 2010 B2
7697776 Wu et al. Apr 2010 B2
7698222 Bueche, Jr. Apr 2010 B1
7702588 Gilder et al. Apr 2010 B2
7720735 Anderson et al. May 2010 B2
7734545 Fogliano Jun 2010 B1
7743979 Fredman Jun 2010 B2
7753268 Robinson et al. Jul 2010 B1
7761358 Craig et al. Jul 2010 B2
7766244 Field Aug 2010 B1
7769650 Bleunven Aug 2010 B2
7792752 Kay Sep 2010 B1
7792753 Slater et al. Sep 2010 B1
7810714 Murata Oct 2010 B2
7812986 Graham et al. Oct 2010 B2
7818245 Prakash et al. Oct 2010 B2
7831458 Neumann Nov 2010 B2
7856402 Kay Dec 2010 B1
7873200 Oakes, III et al. Jan 2011 B1
7876949 Oakes, III et al. Jan 2011 B1
7885451 Walls et al. Feb 2011 B1
7885880 Prasad et al. Feb 2011 B1
7894094 Nacman et al. Feb 2011 B2
7896232 Prasad et al. Mar 2011 B1
7900822 Prasad et al. Mar 2011 B1
7903863 Jones et al. Mar 2011 B2
7904386 Kalra et al. Mar 2011 B2
7912785 Kay Mar 2011 B1
7949587 Morris et al. May 2011 B1
7950698 Popadic et al. May 2011 B2
7953441 Lors May 2011 B2
7958053 Stone Jun 2011 B2
7962411 Prasad et al. Jun 2011 B1
7970677 Oakes, III et al. Jun 2011 B1
7974899 Prasad et al. Jul 2011 B1
7978900 Nepomniachtchi et al. Jul 2011 B2
7996314 Smith et al. Aug 2011 B1
7996315 Smith et al. Aug 2011 B1
7996316 Smith et al. Aug 2011 B1
8001051 Smith et al. Aug 2011 B1
8045784 Price et al. Oct 2011 B2
8046301 Smith et al. Oct 2011 B1
8060442 Hecht et al. Nov 2011 B1
8065307 Haslam et al. Nov 2011 B2
8091778 Block et al. Jan 2012 B1
8116533 Kiplinger et al. Feb 2012 B2
8203640 Kim et al. Jun 2012 B2
8204293 Csulits et al. Jun 2012 B2
8235284 Prasad et al. Aug 2012 B1
8271385 Emerson et al. Sep 2012 B2
8290237 Burks et al. Oct 2012 B1
8320657 Burks et al. Nov 2012 B1
8351677 Oakes, III et al. Jan 2013 B1
8358826 Medina et al. Jan 2013 B1
8392332 Oakes, III et al. Mar 2013 B1
8401962 Bent et al. Mar 2013 B1
8422758 Bueche, Jr. Apr 2013 B1
8559766 Tilt et al. Oct 2013 B2
8582862 Nepomniachtchi et al. Nov 2013 B2
8732081 Oakes et al. May 2014 B1
20010004235 Maloney Jun 2001 A1
20010014881 Drummond Aug 2001 A1
20010018739 Anderson Aug 2001 A1
20010027994 Hayashida Oct 2001 A1
20010037299 Nichols et al. Nov 2001 A1
20010042171 Vermeulen Nov 2001 A1
20010042785 Walker Nov 2001 A1
20010043748 Wesolkowski et al. Nov 2001 A1
20010047330 Gephart Nov 2001 A1
20010054020 Barth et al. Dec 2001 A1
20020001393 Jones Jan 2002 A1
20020016763 March Feb 2002 A1
20020016769 Barbara et al. Feb 2002 A1
20020026418 Koppel et al. Feb 2002 A1
20020032656 Chen Mar 2002 A1
20020038289 Lawlor et al. Mar 2002 A1
20020040340 Yoshida Apr 2002 A1
20020052841 Guthrie May 2002 A1
20020052853 Munoz May 2002 A1
20020065786 Martens et al. May 2002 A1
20020072974 Pugliese Jun 2002 A1
20020075524 Blair Jun 2002 A1
20020084321 Martens Jul 2002 A1
20020087467 Mascavage, III et al. Jul 2002 A1
20020107767 McClair et al. Aug 2002 A1
20020107809 Biddle et al. Aug 2002 A1
20020116329 Serbetcioglu Aug 2002 A1
20020116335 Star Aug 2002 A1
20020118891 Rudd Aug 2002 A1
20020120562 Opiela Aug 2002 A1
20020120582 Elston et al. Aug 2002 A1
20020129249 Maillard et al. Sep 2002 A1
20020130868 Smith Sep 2002 A1
20020133409 Sawano et al. Sep 2002 A1
20020138522 Muralidhar Sep 2002 A1
20020147798 Huang Oct 2002 A1
20020150279 Scott Oct 2002 A1
20020152160 Allen-Rouman et al. Oct 2002 A1
20020152161 Aoike Oct 2002 A1
20020152164 Dutta Oct 2002 A1
20020152165 Dutta et al. Oct 2002 A1
20020152169 Dutta et al. Oct 2002 A1
20020159648 Alderson et al. Oct 2002 A1
20020171820 Okamura Nov 2002 A1
20020178112 Goeller Nov 2002 A1
20020186881 Li Dec 2002 A1
20020188564 Star Dec 2002 A1
20020195485 Pomerleau et al. Dec 2002 A1
20030005326 Flemming Jan 2003 A1
20030009420 Jones Jan 2003 A1
20030023557 Moore Jan 2003 A1
20030026609 Parulski Feb 2003 A1
20030038227 Sesek Feb 2003 A1
20030050889 Burke Mar 2003 A1
20030055756 Allan Mar 2003 A1
20030055776 Samuelson Mar 2003 A1
20030074315 Lam Apr 2003 A1
20030075596 Koakutsu Apr 2003 A1
20030075916 Gorski Apr 2003 A1
20030081824 Mennie May 2003 A1
20030093367 Allen-Rouman et al. May 2003 A1
20030093369 Ijichi et al. May 2003 A1
20030102714 Rhodes et al. Jun 2003 A1
20030105688 Brown Jun 2003 A1
20030105714 Alarcon-Luther et al. Jun 2003 A1
20030126078 Vihinen Jul 2003 A1
20030130940 Hansen et al. Jul 2003 A1
20030132384 Sugiyama et al. Jul 2003 A1
20030133610 Nagarajan et al. Jul 2003 A1
20030139999 Rowe Jul 2003 A1
20030159046 Choi et al. Aug 2003 A1
20030167225 Adams Sep 2003 A1
20030191615 Bailey Oct 2003 A1
20030191869 Williams Oct 2003 A1
20030200174 Star Oct 2003 A1
20030202690 Jones et al. Oct 2003 A1
20030212904 Randle et al. Nov 2003 A1
20030217005 Drummond et al. Nov 2003 A1
20030225705 Park et al. Dec 2003 A1
20030233278 Marshall Dec 2003 A1
20030233318 King et al. Dec 2003 A1
20040010466 Anderson Jan 2004 A1
20040012496 De Souza Jan 2004 A1
20040013284 Yu Jan 2004 A1
20040024626 Bruijning Feb 2004 A1
20040024708 Masuda Feb 2004 A1
20040030741 Wolton et al. Feb 2004 A1
20040044606 Buttridge et al. Mar 2004 A1
20040057697 Renzi Mar 2004 A1
20040058705 Morgan Mar 2004 A1
20040066031 Wong Apr 2004 A1
20040069841 Wong Apr 2004 A1
20040071333 Douglas et al. Apr 2004 A1
20040076320 Downs, Jr. Apr 2004 A1
20040078299 Down-Logan Apr 2004 A1
20040080795 Bean et al. Apr 2004 A1
20040089711 Sandru May 2004 A1
20040093303 Picciallo May 2004 A1
20040093305 Kight May 2004 A1
20040103057 Melbert et al. May 2004 A1
20040103296 Harp May 2004 A1
20040109596 Doran Jun 2004 A1
20040110975 Osinski et al. Jun 2004 A1
20040111371 Friedman Jun 2004 A1
20040117302 Weichert Jun 2004 A1
20040122754 Stevens Jun 2004 A1
20040133511 Smith et al. Jul 2004 A1
20040138974 Shimamura Jul 2004 A1
20040148235 Craig et al. Jul 2004 A1
20040158549 Matena Aug 2004 A1
20040165096 Maeno Aug 2004 A1
20040170259 Park Sep 2004 A1
20040184766 Kim et al. Sep 2004 A1
20040210515 Hughes Oct 2004 A1
20040210523 Gains et al. Oct 2004 A1
20040225604 Foss, Jr. et al. Nov 2004 A1
20040228277 Williams Nov 2004 A1
20040236647 Acharya Nov 2004 A1
20040236688 Bozeman Nov 2004 A1
20040240722 Tsuji et al. Dec 2004 A1
20040245324 Chen Dec 2004 A1
20040247199 Murai et al. Dec 2004 A1
20040248600 Kim Dec 2004 A1
20040252679 Williams Dec 2004 A1
20040260636 Marceau Dec 2004 A1
20040267666 Minami Dec 2004 A1
20050001421 Luth et al. Jan 2005 A1
20050010108 Rahn et al. Jan 2005 A1
20050015332 Chen Jan 2005 A1
20050021466 Buchanan et al. Jan 2005 A1
20050030388 Stavely et al. Feb 2005 A1
20050033645 Duphily Feb 2005 A1
20050033685 Reyes Feb 2005 A1
20050033695 Minowa Feb 2005 A1
20050035193 Gustin et al. Feb 2005 A1
20050038746 Latimer et al. Feb 2005 A1
20050038754 Geist Feb 2005 A1
20050044042 Mendiola Feb 2005 A1
20050044577 Jerding Feb 2005 A1
20050049950 Johnson Mar 2005 A1
20050071283 Randle et al. Mar 2005 A1
20050075969 Nielson et al. Apr 2005 A1
20050075974 Turgeon Apr 2005 A1
20050078336 Ferlitsch Apr 2005 A1
20050080725 Pick Apr 2005 A1
20050082364 Alvarez et al. Apr 2005 A1
20050086140 Ireland Apr 2005 A1
20050086168 Alvarez Apr 2005 A1
20050089209 Stefanuk Apr 2005 A1
20050091161 Gustin Apr 2005 A1
20050096992 Geisel May 2005 A1
20050097019 Jacobs May 2005 A1
20050097046 Singfield May 2005 A1
20050097050 Orcutt May 2005 A1
20050108164 Salafia May 2005 A1
20050108168 Halpin May 2005 A1
20050115110 Dinkins Jun 2005 A1
20050125338 Tidwell et al. Jun 2005 A1
20050125360 Tidwell et al. Jun 2005 A1
20050127160 Fujikawa Jun 2005 A1
20050131820 Rodriguez Jun 2005 A1
20050149436 Elterich Jul 2005 A1
20050168566 Tada Aug 2005 A1
20050171899 Dunn Aug 2005 A1
20050171907 Lewis Aug 2005 A1
20050177494 Kelly et al. Aug 2005 A1
20050177499 Thomas Aug 2005 A1
20050177518 Brown Aug 2005 A1
20050182710 Anderson Aug 2005 A1
20050188306 Mackenzie Aug 2005 A1
20050203430 Williams et al. Sep 2005 A1
20050205661 Taylor Sep 2005 A1
20050209961 Michelsen Sep 2005 A1
20050213805 Blake et al. Sep 2005 A1
20050218209 Heilper et al. Oct 2005 A1
20050220324 Klein et al. Oct 2005 A1
20050228733 Bent Oct 2005 A1
20050244035 Klein et al. Nov 2005 A1
20050252955 Sugai Nov 2005 A1
20050267843 Acharya et al. Dec 2005 A1
20050268107 Harris et al. Dec 2005 A1
20050269412 Chiu Dec 2005 A1
20050273368 Hutten et al. Dec 2005 A1
20050278250 Zair Dec 2005 A1
20050281448 Lugg Dec 2005 A1
20050281471 LeConte Dec 2005 A1
20050281474 Huang Dec 2005 A1
20050289030 Smith Dec 2005 A1
20050289182 Pandian et al. Dec 2005 A1
20060002426 Madour Jan 2006 A1
20060004660 Pranger Jan 2006 A1
20060025697 Kurzweil Feb 2006 A1
20060039628 Li et al. Feb 2006 A1
20060039629 Li et al. Feb 2006 A1
20060041506 Mason et al. Feb 2006 A1
20060045321 Yu Mar 2006 A1
20060047593 Naratil Mar 2006 A1
20060053056 Alspach-Goss Mar 2006 A1
20060059085 Tucker Mar 2006 A1
20060064368 Forte Mar 2006 A1
20060080245 Bahl Apr 2006 A1
20060085357 Pizarro Apr 2006 A1
20060085516 Farr et al. Apr 2006 A1
20060102704 Reynders May 2006 A1
20060106691 Sheaffer May 2006 A1
20060106717 Randle May 2006 A1
20060108168 Fischer et al. May 2006 A1
20060110063 Weiss May 2006 A1
20060112013 Maloney May 2006 A1
20060115110 Rodriguez Jun 2006 A1
20060115141 Koakutsu et al. Jun 2006 A1
20060118613 McMann Jun 2006 A1
20060124730 Maloney Jun 2006 A1
20060144924 Stover Jul 2006 A1
20060144937 Heilper et al. Jul 2006 A1
20060144950 Johnson Jul 2006 A1
20060159367 Zeineh et al. Jul 2006 A1
20060161501 Waserstein Jul 2006 A1
20060164682 Lev Jul 2006 A1
20060166178 Driedijk Jul 2006 A1
20060167818 Wentker et al. Jul 2006 A1
20060182331 Gilson et al. Aug 2006 A1
20060182332 Weber Aug 2006 A1
20060186194 Richardson et al. Aug 2006 A1
20060206506 Fitzpatrick Sep 2006 A1
20060208059 Cable et al. Sep 2006 A1
20060210138 Hilton et al. Sep 2006 A1
20060212391 Norman et al. Sep 2006 A1
20060214940 Kinoshita Sep 2006 A1
20060215204 Miyamoto et al. Sep 2006 A1
20060215230 Borrey et al. Sep 2006 A1
20060222260 Sambongi et al. Oct 2006 A1
20060229976 Jung Oct 2006 A1
20060229986 Corder Oct 2006 A1
20060238503 Smith Oct 2006 A1
20060242062 Peterson Oct 2006 A1
20060242063 Peterson Oct 2006 A1
20060249567 Byrne Nov 2006 A1
20060274164 Kimura et al. Dec 2006 A1
20060279628 Fleming Dec 2006 A1
20060282383 Doran Dec 2006 A1
20060291744 Ikeda et al. Dec 2006 A1
20070016796 Singhal Jan 2007 A1
20070019243 Sato Jan 2007 A1
20070022053 Waserstein Jan 2007 A1
20070027802 VanDeburg et al. Feb 2007 A1
20070031022 Frew Feb 2007 A1
20070038561 Vancini et al. Feb 2007 A1
20070041629 Prakash et al. Feb 2007 A1
20070050292 Yarbrough Mar 2007 A1
20070053574 Verma et al. Mar 2007 A1
20070058851 Quine Mar 2007 A1
20070063016 Myatt Mar 2007 A1
20070064991 Douglas Mar 2007 A1
20070065143 Didow et al. Mar 2007 A1
20070075772 Kokubo Apr 2007 A1
20070076940 Goodall et al. Apr 2007 A1
20070076941 Carreon et al. Apr 2007 A1
20070077921 Hayashi Apr 2007 A1
20070080207 Williams Apr 2007 A1
20070082700 Landschaft Apr 2007 A1
20070084911 Crowell Apr 2007 A1
20070086642 Foth Apr 2007 A1
20070086643 Spier Apr 2007 A1
20070094088 Mastie Apr 2007 A1
20070094140 Riney et al. Apr 2007 A1
20070100748 Dheer May 2007 A1
20070110277 Hayduchok et al. May 2007 A1
20070118472 Allen-Rouman et al. May 2007 A1
20070122024 Haas et al. May 2007 A1
20070124241 Newton May 2007 A1
20070127805 Foth et al. Jun 2007 A1
20070129955 Dalmia Jun 2007 A1
20070136198 Foth et al. Jun 2007 A1
20070140545 Rossignoli Jun 2007 A1
20070140594 Franklin Jun 2007 A1
20070143208 Varga Jun 2007 A1
20070150337 Hawkins et al. Jun 2007 A1
20070154098 Geva et al. Jul 2007 A1
20070156438 Popadic et al. Jul 2007 A1
20070168265 Rosenberger Jul 2007 A1
20070168283 Alvarez et al. Jul 2007 A1
20070171288 Inoue Jul 2007 A1
20070172107 Jones et al. Jul 2007 A1
20070172148 Hawley Jul 2007 A1
20070179883 Questembert Aug 2007 A1
20070183000 Eisen et al. Aug 2007 A1
20070183741 Lerman et al. Aug 2007 A1
20070194102 Cohen Aug 2007 A1
20070198432 Pitroda et al. Aug 2007 A1
20070203708 Polcyn et al. Aug 2007 A1
20070208816 Baldwin et al. Sep 2007 A1
20070214086 Homoki Sep 2007 A1
20070217669 Swift et al. Sep 2007 A1
20070233525 Boyle Oct 2007 A1
20070233585 Ben Simon et al. Oct 2007 A1
20070235518 Mueller et al. Oct 2007 A1
20070235520 Smith et al. Oct 2007 A1
20070241179 Davis Oct 2007 A1
20070244782 Chimento Oct 2007 A1
20070246525 Smith et al. Oct 2007 A1
20070251992 Sharma et al. Nov 2007 A1
20070255652 Tumminaro Nov 2007 A1
20070255653 Tumminaro Nov 2007 A1
20070255662 Tumminaro Nov 2007 A1
20070258634 Simonoff Nov 2007 A1
20070268540 Gaspardo et al. Nov 2007 A1
20070271182 Prakash et al. Nov 2007 A1
20070278286 Crowell et al. Dec 2007 A1
20070288380 Starrs Dec 2007 A1
20070288382 Narayanan et al. Dec 2007 A1
20070295803 Levine et al. Dec 2007 A1
20070299928 Kohli et al. Dec 2007 A1
20080002911 Eisen Jan 2008 A1
20080021802 Pendleton Jan 2008 A1
20080040280 Davis et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080059376 Davis Mar 2008 A1
20080063253 Wood Mar 2008 A1
20080068674 McIntyre Mar 2008 A1
20080071721 Wang Mar 2008 A1
20080073423 Heit et al. Mar 2008 A1
20080080760 Ronca Apr 2008 A1
20080086420 Gilder et al. Apr 2008 A1
20080086421 Gilder Apr 2008 A1
20080086770 Kulkarni et al. Apr 2008 A1
20080091599 Foss, Jr. Apr 2008 A1
20080097899 Jackson et al. Apr 2008 A1
20080103790 Abernethy May 2008 A1
20080103967 Ackert et al. May 2008 A1
20080113674 Baig May 2008 A1
20080114739 Hayes May 2008 A1
20080116257 Fickling May 2008 A1
20080117991 Peddireddy May 2008 A1
20080119178 Peddireddy May 2008 A1
20080133411 Jones et al. Jun 2008 A1
20080140579 Sanjiv Jun 2008 A1
20080147549 Rathbun Jun 2008 A1
20080155672 Sharma Jun 2008 A1
20080156438 Stumphauzer et al. Jul 2008 A1
20080162319 Breeden et al. Jul 2008 A1
20080162350 Allen-Rouman et al. Jul 2008 A1
20080162371 Rampell et al. Jul 2008 A1
20080177659 Lacey et al. Jul 2008 A1
20080180750 Feldman Jul 2008 A1
20080208727 McLauqhlin et al. Aug 2008 A1
20080214180 Cunningham et al. Sep 2008 A1
20080219543 Csulits Sep 2008 A1
20080245869 Berkun et al. Oct 2008 A1
20080247629 Gilder Oct 2008 A1
20080247655 Yano Oct 2008 A1
20080249931 Gilder et al. Oct 2008 A1
20080249951 Gilder et al. Oct 2008 A1
20080262953 Anderson Oct 2008 A1
20080275821 Bishop et al. Nov 2008 A1
20080301441 Calman et al. Dec 2008 A1
20080316542 Mindrum et al. Dec 2008 A1
20090024520 Drory et al. Jan 2009 A1
20090046938 Yoder Feb 2009 A1
20090060396 Blessan et al. Mar 2009 A1
20090066987 Inokuchi Mar 2009 A1
20090108080 Meyer Apr 2009 A1
20090110281 Hirabayashi Apr 2009 A1
20090141962 Borgia et al. Jun 2009 A1
20090164350 Sorbe et al. Jun 2009 A1
20090164370 Sorbe et al. Jun 2009 A1
20090166406 Pigg et al. Jul 2009 A1
20090167870 Caleca et al. Jul 2009 A1
20090171819 Emde et al. Jul 2009 A1
20090171825 Roman Jul 2009 A1
20090173781 Ramachandran Jul 2009 A1
20090185737 Nepomniachtchi Jul 2009 A1
20090185738 Nepomniachtchi Jul 2009 A1
20090190823 Walters Jul 2009 A1
20090192938 Amos Jul 2009 A1
20090212929 Drory et al. Aug 2009 A1
20090236413 Mueller et al. Sep 2009 A1
20090252437 Li Oct 2009 A1
20090254447 Blades Oct 2009 A1
20090263019 Tzadok et al. Oct 2009 A1
20090281904 Pharris Nov 2009 A1
20090284637 Parulski et al. Nov 2009 A1
20090290751 Ferman et al. Nov 2009 A1
20090292628 Dryer et al. Nov 2009 A1
20090313167 Dujari et al. Dec 2009 A1
20100007899 Lay Jan 2010 A1
20100027679 Sunahara et al. Feb 2010 A1
20100030687 Panthaki et al. Feb 2010 A1
20100047000 Park et al. Feb 2010 A1
20100057578 Blair et al. Mar 2010 A1
20100061446 Hands et al. Mar 2010 A1
20100082470 Walach Apr 2010 A1
20100165015 Barkley et al. Jul 2010 A1
20100225773 Lee Sep 2010 A1
20100226559 Najari et al. Sep 2010 A1
20100260408 Prakash et al. Oct 2010 A1
20100262522 Anderson et al. Oct 2010 A1
20100312705 Caruso et al. Dec 2010 A1
20110016084 Mundy et al. Jan 2011 A1
20110069180 Nijemcevic et al. Mar 2011 A1
20110112967 Anderson et al. May 2011 A1
20110251956 Cantley et al. Oct 2011 A1
20110280450 Nepomniachtchi et al. Nov 2011 A1
20110285874 Showering et al. Nov 2011 A1
20110310442 Popadic et al. Dec 2011 A1
20120047070 Pharris Feb 2012 A1
20120062732 Marman et al. Mar 2012 A1
20120185388 Pranger Jul 2012 A1
20120229872 Dolev Sep 2012 A1
20130021651 Popadic et al. Jan 2013 A9
Foreign Referenced Citations (1)
Number Date Country
0 984 410 Mar 2000 EP
Non-Patent Literature Citations (242)
Entry
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).