Abstract:
A method and apparatus for detecting text in real-world images comprises calculating a cascade of classifiers, the cascade comprising a plurality of stages, each stage including one or more weak classifiers, the plurality of stages organized to start out with classifiers that are most useful for ruling out non-text regions, and removing regions classified as non-text regions from the cascade prior to completion of the cascade, to further speed up processing.

Description:
RELATED APPLICATIONS  
       [0001]     The present invention claims priority to U.S. Provisional Patent Application No. 60/711,100, filed Sep. 2, 2005. 
     
    
     U.S. GOVERNMENT RIGHTS  
       [0002]     This invention was made with United States government support under Grants R44EY011821 and R44EY014487 from the National Institutes of Health (NIH). The United States Government has certain rights in this invention. 
     
    
     FIELD OF THE INVENTION  
       [0003]     The present invention relates to image analysis, and more particularly to identifying images in real-world  
       BACKGROUND  
       [0004]     The challenge of text detection has been attempted to be addressed by many efforts. The accurate detection and identification of text in documents has been achieved via optical character recognition. This method is most effective with high-quality, black and white documents that make it easy to segment the images into text and non-text regions—a much simpler problem than detecting and reading text in diverse, real-world, color images. The detection of captions in video sequences is also largely a solved problem due to fact that the position and size of captions are generally standardized, and the backgrounds change rapidly while the captions change more slowly. This too is a simpler problem than real-world text detection because of the presence of these additional image cues.  
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0005]     The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:  
         [0006]      FIG. 1  illustrates one embodiment of the data flow in the system.  
         [0007]      FIG. 2  is a flowchart of one embodiment of the process used by the system to detect text.  
         [0008]      FIG. 3  is a flowchart of one embodiment of how the detection system can be trained and customized for new applications or configurations using labeled training images.  
         [0009]      FIG. 4  is a block diagram of one embodiment of the text detection system.  
     
    
     DETAILED DESCRIPTION  
       [0010]     The method and apparatus described is designed is provide a system and method for detecting and reading text in real-world color images or video taken in a diverse range of environments, such as indoor environments and outdoor street scenes. The system and method are accurate even with different fonts and sizes of text, changes in lighting, and perspective distortions due to viewer angle. At the same time, this system and method for text detection has a rapid processing time while maintaining a low rate of false positives and negatives. The system and method uses a learning algorithm that enables it to adapt to novel image domains and new hardware components such as different cameras and mobile devices including cell phones. While the examples below address text detection, this algorithm may be used for detecting other types of data in images, such as UPC codes, or other orderly marking systems.  
         [0000]     System and Method  
         [0011]     The system receives color or black and white digital image as input and outputs outlined and labeled regions indicating where text is present in the image. In one embodiment, the “digital image” may be a frame from a video, a digitized image, a digital photograph, or any other type of data which can be presented as one or more digital images.  
         [0012]      FIG. 1  illustrates one embodiment of the data flow in the system. The user ( 1 ) submits a digital image ( 2 ) for processing by the text detection and extension system ( 3 ). The system processes the original digital image and outputs a digital image with outlined and labeled regions indicating where text is present ( 4 ). This image and its associated text regions can be loaded into a subsequent image enhancement system ( 5 ), and shown on a display device ( 6 ). Alternatively, or additionally, the image and its text regions can be binarized by the system ( 7 ), loaded into an optical character recognition system ( 8 ), and output as text ( 9 ), output in Braille or another format, read aloud via an audio output device ( 10 ), or output via other means. In one embodiment, the output may be a summary or other short version of the text. In one embodiment, the output may be further processed for outputting in a different language or different format.  
         [0013]     In its various embodiments, the system may exist as a standalone computing device, an application on a computing device, or a plug-in or extension to an existing application on a computing device.  
         [0014]      FIG. 2  is a flowchart of one embodiment of the process used by the system to detect text. In one embodiment, the digital image is broken into multiple layers of regions of various sizes ( 1 ). In one embodiment, this is done using a standard pyramid algorithm. Each individual region is fed into the detection algorithm. In one embodiment, the regions are fed into the detection algorithm in parallel. Alternatively, the regions may be analyzed in series. The ordering of the regions may be modified for optimal results in a variety of application domains and tasks.  
         [0015]     In one embodiment, the detection algorithm ( 2 ) consists of cascading levels of tests (classifiers). Each cascade level contains one or more individual tests that are performed in series. Each test uses one or more image features that detect cues indicating the possible presence of text in the region being analyzed. Each test yields a confidence value for the region; the region passes the test if its confidence value is greater than the threshold value for that test. After passing each test, the region&#39;s overall confidence value for the cascade level is updated, and the region is either submitted to the subsequent test in that level, accepted for that level, or rejected for that level depending on how its overall confidence value compares to the overall threshold value for the cascade level.  
         [0016]     If the region is rejected at any cascade level, it is not processed further ( 3 ). If the region is accepted by a cascade level, it is passed on to the next level of the cascade for further testing ( 4 ). In one embodiment, if the confidence value is high enough, the region may be accepted and not passed to further testing. Image regions which are accepted by all cascade levels are given an overall confidence value ( 5 ). In one embodiment, the overall confidence value ( 5 ) is based on the region&#39;s performance in the final level of the cascade. Alternatively, the overall confidence value may be a cumulative value based on results from multiple levels of the cascade.  
         [0017]     Once all regions have been accepted or rejected by the detection algorithm, overlapping and adjacent regions are clustered ( 6 ) to create larger contiguous regions. These larger regions are each given a confidence value based on the confidence values of their smaller constituent regions. At this stage, the specific outline of each region is determined, and the regions are labeled using their confidence values.  
         [0018]     Once the final text-containing regions have been determined, in one embodiment, an extension algorithm ( 7 ) is used to expand the regions to include nearby text or truncated characters. The region, in one embodiment, can also be binarized as desired before being output to the user or to another image processing system.  
         [0019]      FIG. 3  is a flowchart of one embodiment of how the detection system can be trained and customized for new applications or configurations using labeled training images.  
         [0020]     A set of example images from a new application domain are human-labeled to indicate regions with and without text. In another embodiment, if such a thing is available, a set of example images with known good automatically labeled regions may be utilized. In one embodiment at least 100 images are used for training. These images ( 1 ) are then fed to the system in training mode to allow it to learn to successfully detect text in the new domain. The training mode can also be used to refine the system&#39;s text detection when a new image capture device or type of image is used.  
         [0021]     In training mode, the system processes the training images using the detection algorithm ( 2 ) just as it does in regular mode. After the regions have been accepted or rejected, the system compares them to the actual labels to determine the accuracy of the algorithm. The system then adapts the algorithm, selecting the most effective features for each test, the most effective ways to order and combine the tests and cascade levels to produce more accurate results, and the most effective test weights and thresholds for the calculations. The training system seeks to reduce the number of false positive and false negative text detections. It also seeks to minimize the processing time for the first few cascade levels. This ensures that most regions of the image can be rapidly rejected by only a small number of tests, making the overall detection algorithm more time-efficient. In one embodiment, an authorized user can manually modify or refine the cascade levels, tests, and weights to further customize the system.  
         [0022]     One type of learning algorithm that may be used is the AdaBoost machine learning algorithm. The various detection cascade levels in the system can use this algorithm to process and detect text in regions of the image.  
       Tests (Classifiers) Used in One Embodiment  
       [0023]     In the preferred embodiment of this system, rectangular image regions of various sizes are used to analyze predefined image features. In one embodiment, the rectangular regions are selected using a standard pyramid algorithm. In one embodiment, luminance (brightness) values of the pixels are used in the detection process, while color information is used later in the binarization process.  
         [0024]     In one embodiment, an AdaBoost cascade with 7 layers is used. Each layer of the cascade contains 1 to 30 tests. Each test uses one or more image feature values, each of which is sorted into bins by comparing it with test-specific threshold values. The threshold values are set by the system during training as described earlier in this document. The bin numbers are used as an index to a test-specific n-dimensional matrix, where the value at the intersection is either true or false, which specifies the result of the test as a whole. The specific image features used in one embodiment of each test are listed below.  
         [0025]     In one embodiment, each test is given a weight that is used when combining the individual test results within the cascade layer into an overall result for the layer. The overall result is updated as each test is performed to determine if the image region can be accepted or rejected by the layer, or if the next test in the layer must be performed.  
         [0026]     The layers, classifiers, and image features in the preferred system embodiment are as follows. Classifier weights are given as well, but could be further refined through system training. The individual image features used in each classifier are defined later in this document. Note that these layers, classifiers, image features, and classifier weights are merely exemplary, and one of skill in the art would understand that the layers may be reorganized, altered, or removed from the cascade without changing the underlying idea.  
         [0027]     This is an exemplary cascade, including seven layers. The classifiers are explained in more detail below.  
         [0028]     Adaboost Layer 1: 1 Weak Classifier  
                                                                 Classifier   Weight                                    1   D3, D4   4.626257                  
 
         [0029]     Adaboost Layer 2: 1 Weak Classifier  
                                                                 Classifier   Weight                                    1   D0, D3   4.278939                  
 
         [0030]     Adaboost Layer 3: 5 Weak Classifiers  
                                                                 Classifier   Weight                                    1   D4, D15   3.870142       2   D0, D3   2.046390       3   D4, D15   1.947373       4   S6, D14   1.538185       5   S5, S11   1.069461                  
 
         [0031]     Adaboost Layer 4: 10 Weak Classifiers  
                                                                 Classifier   Weight                                    1   D7, D14   3.886540       2   D0, D4   1.752814       3   M0, D13   1.367982       4   D3, D14   1.274082       5   D0, D6   0.967092       6   S11, D17   0.873878       7   S3, D13   0.942438       8   D1, D14   0.840898       9   S5, S10   0.666019       10   S4, D4   0.660017                  
 
         [0032]     Adaboost Layer 5: 22 Weak Classifiers  
                                                                 Classifier   Weight                                    1   S5, D6   3.951040       2   D4, D14   1.571396       3   D0, D15   1.308625       4   S6, D3   1.025399       5   S4, D14   0.823495       6   S9, D4   0.872460       7   S4, D16   0.743971       8   D4, D13   0.736302       9   D0, D3   0.665261       10   M0, D14   0.630531       11   S5, D6   0.684585       12   S3, D3   0.587298       13   D3, D4   0.578154       14   M3, S11   0.566080       15   S3, D13   0.496378       16   S5, S10   0.490426       17   S0, D1   0.526227       18   M0, M2   0.473949       19   D4, D12   0.436995       20   M0, M2   0.490757       21   S4, D14   0.501030       22   D0, D2   0.520316                  
 
         [0033]     Adaboost Layer 6: 30 Weak Classifiers  
                                                                 Classifier   Weight                                    1   D3, D4   3.001183       2   D0, D16   1.351147       3   D3, D13   1.121551       4   S5, D4   0.758123       5   D3, D5   0.656535       6   S3, D13   0.712661       7   M0, D14   0.653778       8   D0, D4   0.601257       9   M3, S8   0.556955       10   S4, D13   0.510116       11   D0, D16   0.519914       12   S4, D4   0.548812       13   S0, D18   0.490303       14   S9, D13   0.453983       15   S3, D15   0.470483       16   D1, D15   0.526004       17   D0, D14   0.417721       18   M0, S0   0.433557       19   S4, D14   0.415910       20   S5, D2   0.444604       21   S6, D14   0.424369       22   D0, D1   0.379253       23   S3, D13   0.405478       24   D4, D13   0.472468       25   S4, D14   0.407701       26   D1, D2   0.397965       27   M2, S0   0.378079       28   S0, D3   0.387972       29   S10, D12   0.371740       30   M0, S0   0.370144                  
 
         [0034]     Adaboost Layer 7: 30 Weak Classifiers  
                                                                 Classifier   Weight                                    1   E0, E1   4.140843       2   H5, H11   0.981255       3   H6, H10   0.707663       4   H0, H3   0.644695       5   H13, E0   0.558645       6   H8, H9   0.531337       7   H1, E3   0.420097       8   H2, E0   0.407218       9   H3, H7   0.374002       10   H7, H11   0.360664       11   H10, E2   0.331540       12   H0, H1   0.302133       13   H5, H10   0.312395       14   H1, E4   0.272916       15   E0, E5   0.281763       16   H1, H9   0.290753       17   H2, E0   0.262424       18   H0, H6   0.250681       19   H10, E4   0.259521       20   H2, H3   0.252718       21   H8, H13   0.235930       22   H0, E5   0.227033       23   H10, H12   0.211346       24   H5, H11   0.250197       25   H5, E2   0.264241       26   H1, H8   0.199238       27   H9, E0   0.189235       28   H7, H11   0.194733       29   H13, E3   0.189933       30   E0, E3   0.182727                  
 
 Image Features 
 
         [0035]     In the preferred embodiment of this system, the image features used in the classifiers are grouped and defined as follows. These features as well as their positions within the cascade (described above) define only one, of many possible, configurations of the system. This particular configuration is the product of much fine tuning and is optimized to detect text in real world images.  
         [0036]     Group A. In this group, the region is divided into 3 subregions. In one embodiment the division is horizontal (like a Spanish flag). The subregions from the top have mean values of luminance of m1, m, and m2. In the current implementation, ml and m2 are of equal height, each ⅛ of the total height, while m is ¾th of the total height.  
                                   m1       m        m2                  
 
         [0037]     The classifiers of Group A are:  
         [0038]     M0. m  
         [0039]     M1. m1−m  
         [0040]     M2. m2−m  
         [0041]     M3. (m1−m)*(m2−m)  
         [0042]     Group B. This group is divided as in group A, but the values used are based on the standard deviation (STD) of the luminance values in the region. From the top the values are referred to as s1s, and s2.  
                                   s1       s        s2                  
 
         [0043]     The classifiers of Group B are:  
         [0044]     S0. s  
         [0045]     S1. s1  
         [0046]     S2. s2  
         [0047]     S3. s1/s  
         [0048]     S4. s2/s  
         [0049]     Group C. This group uses the same s, s1 and s2 as in group B, but divides the s region horizontally into two equal parts and computes the standard deviation of luminance values within the two parts of the newly divided region, referring to them as s3 and s4.  
                                   s1       s3       s4       s2                  
 
         [0050]     The classifiers of Group C are:  
         [0051]     S5. s3/s  
         [0052]     S6. s4/s  
         [0053]     Group D. This group uses the same s1 and s2 as in group B, and divides s vertically into two equal parts with STDs s5 and s6.  
                                                       s1               s5   s6           s2                      
 
         [0054]     The classifiers of Group D are:  
         [0055]     S7. s5/s  
         [0056]     S8. s6/s  
         [0057]     Group E. This group uses the same s1 and s2 as in group B, and divides s vertically into three equal parts with STDs s7, s8, and s9.  
                                           s1               s7   s8   s9       s2                  
 
         [0058]     The classifiers of Group E are:  
         [0059]     S9. s7/s  
         [0060]     S10. s8/s  
         [0061]     S11. s9/s  
         [0062]     Group F. This group uses the same divisions and s as group B, but calculates the mean of the absolute value of the horizontal gradient for all vertical-edge pixels in of the subregions: from the top, dx1, dx, and dx2.  
         [0063]     The horizontal gradient at each pixel is defined as the result of this Sobel convolution kernel:  
                                           −1   0   1       −2   0   2       −1   0   1                  
 
         [0064]     The vertical gradient at each pixel is defined as the result of this Sobel convolution kernel:  
                                             1     2     1         0     0     0       −1   −2   −1                  
 
         [0065]     If the absolute value of the vertical gradient is lager than the horizontal, the pixel is a horizontal-edge pixel, otherwise a vertical-edge pixel.  
         [0066]     The classifiers of Group F are:  
         [0067]     D0. dx/s  
         [0068]     D1. dx1/s  
         [0069]     D2. dx2/s  
         [0070]     D3. dx1/dx  
         [0071]     D4. dx2/dx  
         [0072]     Group G. This group uses the same dx as group F, and also divides that region as in group C with mean horizontal gradients dx3 and dx4.  
         [0073]     The classifiers of Group G are:  
         [0074]     D5. dx3/dx  
         [0075]     D6. dx4/dx  
         [0076]     Group H. This group uses the same dx as group F, and also divides that region as in group D with mean vertical gradients dx5 and dx6.  
         [0077]     The classifiers of Group H are:  
         [0078]     D7. dx5/dx  
         [0079]     D8. dx6/dx  
         [0080]     Group I. This group uses the same dx as group F, and also divides that region as in group E with mean vertical gradients dx7, dx8, and dx9.  
         [0081]     D9. dx7/dx  
         [0082]     D10. dx8/dx  
         [0083]     D11. dx9/dx  
         [0084]     Groups J, K, L, and M are analogous to groups F, G, H, and I but use the mean of the absolute value of the vertical gradient for all horizontal-edge pixels in of the subregions.  
         [0085]     D12-D23 are then analogous to DO-D11.  
         [0086]     Group N. This group is based on a histogram of the Sobel gradient directions in the region. Using the horizontal and vertical Sobel gradients as above for each pixel, the direction is determined as 0-8, where 0-7 signify N, NE, E, SE, S, SW, W and NW and 8 indicates a flat, edgeless region. d[n] is then the proportion of pixels with the gradient direction value n.  
         [0087]     H0. d[0]+d[4] 
         [0088]     H1. d[1]+d[5] 
         [0089]     H2. d[2]+d[6] 
         [0090]     H3. d[3]+d[7] 
         [0091]     H4. d[4] 
         [0092]     H5. d[5] 
         [0093]     H6. d[6] 
         [0094]     H7. d[7] 
         [0095]     Group O. This group is based on an adaptive histogram of the values calculated as dx, in group F, above. In the current embodiment, three buckets are used; hdx[0] is the relative number of pixels with horizontal gradients in the lowest third of the range, etc.  
         [0096]     H8. hdx[0] 
         [0097]     H9. hdx[1] 
         [0098]     H10. hdx[2] 
         [0099]     Group P. This group is analogous to group O, but uses dy.  
         [0100]     H11. hdy[0] 
         [0101]     H12. hdy[1] 
         [0102]     H13. hdy[2] 
         [0103]     Group Q. This group divides the entire region into horizontal stripes of equal size. In the current embodiment, 3 stripes are used. For each stripe, the average of the absolute value of the horizontal difference is calculated. The following convolution kernel is used:  
                                             0   0   0       −1   1   0         0   0   0                  
 
         [0104]     edx[n] is the average for the stripe n.  
         [0105]     The classifiers for Group Q are:  
         [0106]     E0. edx[0]−edx[1] 
         [0107]     E1. edx[1] Center stripe  
         [0108]     E2. edx[2]−edx[1] 
         [0109]     Group R. This group is like group Q, except for each horizontal stripe, the average of the absolute value of the vertical difference is calculated. The following convolution kernel is used:  
                                           0   −1   0       0     1   0       0     0   0                  
 
         [0110]     edy[n] is the average for the stripe n.  
         [0111]     The classifiers for Group R are:  
         [0112]     E3. edy[0]−edy[1] 
         [0113]     E4. edy[1] Center stripe  
         [0114]     E5. edy[2]−edy[1] 
         [0115]     In the preferred embodiment, the following method is used to calculate the posterior probability value for a rectangular region once it has been identified as a text region.  
                                                                                                               float CAdaBClassifier::Classify(CASample *pSample)       {                float fAlpha = 0;                // m_fSumAlpha is really 1/2\sum\alpha                float fRes = m_fSumAlpha + m_fSumAlpha;           float p, fVal;           int nClassifiers = m_vpClassifiers.size( );           for (int i = 0; i &lt; nClassifiers; i ++)           {                CAClassifier *pClassifier = m_vpClassifiers[i];           p = pClassifier-&gt;Classify(pSample);           //weak classifier returning 0 or 1           fVal = m_vfAlpha[i]; //weight from training           // 0.5 == probability of text           // this implements \sum\a_ih_i           // assuming p is 0 or 1           // this should be fAlpha += fVal * p in general           if (p &gt; 0.5)           {                fAlpha += fVal;           if (fAlpha &gt; m_fSumAlpha) break;                }           // test if can&#39;t ever reach threshold (assumes p \in[0,1])           fRes −= fVal;           if (fAlpha + fRes &lt; m_fSumAlpha) break;                }           // WARNING: final Adaboost posterior NOT fully computed in most           cases           // returns a negative number if fAlpha &lt; 0.5           return (fAlpha - m_fSumAlpha);            }                  
 
         [0116]     In on embodiment, overlapping detected rectangles are joined, and the total posterior probability is calculated:  
       p   =     1   -       ∏   i     ⁢       (     1   -     p   ⁡     (   i   )         )     .             
 
 Image Extension and Binarization 
 
         [0117]     In one embodiment of the image extension and binarization process, an algorithm is first applied to the detected regions to classify individual pixels as non-text or potential-text. In one embodiment, for each pixel the algorithm examines neighborhoods of increasing size centered at that pixel until it finds one with a luminance variance above a given variance threshold. Two neighborhood thresholds are then created, TLight=μ+kσ and TDark=μ−kσ where and p and a are the mean and variance within the selected neighborhood respectively, and k is a constant. This process produces a three-band image in which each pixel has been classified as non-text, light potential-text, or dark potential-text.  
         [0118]     Neighboring pixels within the same band (light potential-text and dark potential-text) are grouped into connected components (denoted cc&#39;s) and each connected component is then classified as text or non-text. This is accomplished using a number of statistics including the number of pixels in the cc (NP), the number of cc pixels on the border of the cc&#39;s bounding box (NB), the height of the bounding box (h), the width of the bounding box (w), the ratios h/w and NP/w*h, and a measure of the local size of the text as determined by the detection algorithm (MS).  
         [0119]     Following the removal of non-text cc&#39;s, the system groups words or stray cc&#39;s into lines of text and uses the context of nearby cc&#39;s to reject any cc&#39;s that do not fit into any group. This is accomplished by calculating the bounding box for each cc and giving it a label i. The system then calculates features like the center of the box (xi, yi), the height (hi), the average luminance intensity of the box (li).  
         [0120]     A color distance cdist (i,j) between the colors of two cc&#39;s i,j is computed, in one embodiment, by: 
        1. Computing a set for each cc consisting of the color values for each pixel in the cc in 3-dimensional YCrCb space with values in the range [0,255]. Call these C i  and C j , producing vectors of 3D points.     2. Computing the average points as the geometric center of gravity of these vectors: μ i  and μ j , both 3D points.     3. Taking the smaller of the two Mahalanobis distances D M  between one average point and the other vector. 
 
 c dist( i,j )=min( D   Mi (μ j ),  D   Mj (μ i )) 
       
 
         [0124]     The result will be in the range [0,441]. (sqrt(3·255 2 )] 
         [0125]     The distance (dist) between two cc&#39;s i, j is then defined as dist(i, j)=(w x |x i −x j |+w y |y i −y j |+w h |hi−hj|)/s+w l |l i −l j |+w C ·cdist(i,j),  
         [0126]     where s is the expected height of characters, computed as the average height of the detection rectangles that were merged to produce the detected region and w&#39;s are constants selected to maximize the performance of the system. In one embodiment the values of w used by this system are: w x =1.0, w y =0.7, w l =0.01 for l i  in [0,255], w h =0.3, w C =0.05.  
         [0127]     By using this metric, each cc is grouped with its closest neighbors. Neighbors are then grouped into lines of text. Grouping never extends beyond a constant distance T. The algorithm thus rejects a cc(k) provided dist(k, l)&gt;T, for all 1. In one embodiment the value of T used is 2.2.  
         [0000]     Recovery  
         [0128]     For each of these groups, in one embodiment, a baseline is fitted through the centers using robust regression (giving low weight to outliers). In one embodiment, every rejected cc(k) is tested against each group and recovered if all of the following conditions are true: 
        1. The cc height (hk) is close to the average height of the group (hg). T a *h g &lt;h k &lt;T b *h g .     2. The vertical distance between the center of the cc and the baseline is less than T v *h g .        
 
         [0131]      1 3. The cc&#39;s color is close to the nearest cc of the group (n). Cdist(k,n)&lt;T r    
         [0132]     In one embodiment the values for these constants are  
         [0133]     T a =0.8  
         [0134]     T b =1.5  
         [0135]     T v =0.5  
         [0136]     T r =1.1  
         [0137]     In one embodiment, if any groups adjoin the edges of the detection region, the region is expanded. Then, the above described binarization process is applied to the newly included area(s), and any cc&#39;s found there are submitted to the same recovery process as above, if originally rejected.  
         [0000]     Performance and Error Reporting and Categorization:  
         [0138]     In one embodiment, the system has the ability to store the results of the various intermediate stages into a database along with any useful annotations about those intermediate results. When the system is run in this mode on an entire dataset the database gets populated with a large amount of detailed information that can be used to calculate specific performance metrics as well as pinpoint and categorize sources of error.  
         [0139]     Used in conjunction with detailed ground truth (that has all pixels in the dataset labeled as text/non-text and each text character labeled with its value—e.g. “a”) the database can be used locate errors in virtually every step of the algorithm: 
        1. The database may include an image corresponding to the output of the initial stage of binarization in which pixels have been classified as “non-text, light potential-text, or dark potential-text.” For each region of detected text, this image can be compared to the ground truth in order to gather a set of examples where individual pixels have been mistakenly classified as text or non-text.     2. The database may also contain an image corresponding to the result of the text/non-text connected component classifier. This can be used to gather a group of examples where cc&#39;s are incorrectly classified as text or non-text.     3. The database may further contain an image corresponding to the result of the character/word grouping and can be used to find examples where characters are incorrectly grouped together into words or where they are incorrectly not grouped into words.     4. Finally the database may store the output of the OCR system which can be compared to the true characters in each word to determine in what cases the OCR system fails.        
 
         [0144]     In this way, the database may be used in conjunction with analysis to further tweak the settings of the system.  
       Hardware Implementation in One Embodiment  
       [0145]      FIG. 4  is a block diagram of one embodiment of the text detection system. In one embodiment, the entire text detection system  400  consists of a digital camera  410 , a computing device  420  (including processor, program code, and data storage), optionally a display  430 , and/or speakers  440  in a wearable configuration  405 . The system  400 , in one embodiment, is designed to be used by blind or visually impaired persons to help detect and identify text including street signs, bus numbers, shop signs, and building directories. When coupled with additional image enhancement or OCR systems, the system in the embodiment can be used to visually enhance and display these regions of text and optionally read them aloud to the user. The integration of OCR systems can also enhance the performance of the system by ruling out false positives that cannot be classified as characters and words. In one embodiment alternative outputs, such as Braille, or translated output, may also be used.  
         [0146]     In one embodiment the digital camera  410  may be integrated into a multi-function wireless communications device  470  that either (a) contains sufficient computing power to perform the computation described above in a reasonably short time, or (b) is able to transfer the digital image—or subregions thereof detected as likely text regions—to a more powerful remote computing device  450  elsewhere via a wireless communications medium  460 , wait for the remote computing device  450  to perform the computation describe above, and receive the resulting text in a response from the remote computing device  450 , all within a reasonably short time.  
         [0147]     In one embodiment, the wireless communications medium  460  may be a cellular network, a wireless connection such as a WiFi connection, or any other connection which enables the communications device  470  to communicate with a remote device. The remote computing device  450  may be a personal computer running a program, or may be a server system accessed through the Internet.  
         [0148]     Other embodiments of the system may serve as an image processing and text detection algorithm component within larger applications or computing devices. For example, applications may include (a) a sign reader to assist drivers by automatically reading street signs aloud, (b) a generalized text reader/translator for tourists or military personnel in foreign lands where they cannot understand the language—or even the alphabet—of signs and other text, or (c) a system, such as a web crawler, designed to detect and index the location and value of text in images on the world wide web or in any other set of images.  
         [0149]     In one embodiment, the present system functions well to detect text in various languages, including non-Latin languages such as Cyrillic, Chinese, Arabic, etc. Furthermore by modifying the feature choice and training the system on new datasets other embodiments may serve to detect various families of graphics such as text in other non-Latin writing systems such as Cuneiform, Hieroglyphics, etc., as well as other classes of targets such as bar codes, logos, etc. that may be derived from or resemble an orderly marking system.  
         [0150]     In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.