Abstract:
An image based optical character recognition method for auditing, maintaining and storing articles according to an ordered classification scheme not requiring exact physical positions.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    Not Applicable 
       STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT 
       [0002]    Not Applicable 
       REFERENCE TO SEQUENCE LISTING, A TABLE, OR A COMPUTER PROGRAM LISTING COMPACT DISC APPENDIX 
       [0003]    Not Applicable 
       BACKGROUND OF THE INVENTION 
       [0004]    The present invention relates to inventory systems for libraries or cataloging operation and control. More specifically to an improved inventory method that uses image processing and inventory data and cataloging applications for new inventory control strategies for article placement and position. By more precisely knowing the current ordered location of the articles in inventory and the proper ordered location of the articles but not necessarily exact physical position sorting algorithms are used to minimize the number of articles to be moved to maintain article order. 
         [0005]    It is known in the field of Library Circulation Control System U.S. Pat. No. 4,141,078 inventory operation and control to be provided with a means of inventory control by implementation of a barcode placed on the article usually on the front cover or other location but not usually on the spine. Libraries correlate the bar code to the call number and title of the book. This requires staff to maintain both the call number on the spine and the bar code on the cover. With an optical character recognition, OCR, means that reads the call number, the bar code requirement becomes redundant. An exception to the redundancy is the possibility that multiple copies may be on hand. An extension to the Classification System in use could easily accommodate multiple copies. 
         [0006]    Within the current art of tracking and inventory control is the use of smart chips such as RFIDs, radio frequency identification device. The RFID would transmit its id when queried by a suitable device indicating its presence but not its order or position within a closely grouped collection such as described within U.S. Pat. No. 5,963,134 inventory with RFID and US Patent Application 0040111335 RFID space monitoring and asset inventory system. Redundancy is required to maintain the inventory label and the RFID tag. The library patron would not have the RFID reader in hand and continues to use the article label to rapidly locate the article. 
         [0007]    Recently, patent applications 080143584, Method and system for determining the distance between an RFID reader and an RFID tag using phase, and 080186174, Item level inventory with a radio frequency identification (RFID) system, use multiple transmitters and receivers to refine position information of items using RFID. Again redundancy is required and the patron is required to have a reader to rapidly locate the article. 
         [0008]    A substantial saving to the library exists lowering order based inventory audit costs by increasing speed of audits without substantial resources expended on RFID systems. A substantial benefit to the library patron exists since the library articles will more frequently be in the proper location without the significant added costs of the numerous RFID communication equipment which could be used to obtain additional library articles. 
         [0009]    Further article dimensions may be gathered as to attributes such as width and height to calculate the optimum placement to optimize the use of available shelving space that exist at any moment in time. 
         [0010]    Such RFID inventory control systems as previously described possess significant added cost that detract from their overall utility within organizations that consume financial resources; a library typically does not charge for article loans. Thus there is a need for improved capability as to accurate placement method that overcome the aforementioned audit and maintenance disadvantages. 
         [0011]    A further significant advantage is due to the lower cost of construction and maintenance by reducing the component count. 
         [0012]    Various inventory control system configurations, and methods are referenced within and the entire teachings of which and their references sited therein are expressly incorporated by reference herein. 
       BRIEF SUMMARY OF THE INVENTION 
       [0013]    An object of the invention is to reduce labor and fatigue associated with auditing and maintaining ordered inventories. The present invention represents a an improved method for inventory verification and placement for articles maintained in an ordered system using labeling normally visible and avoiding the necessity to move an article to observe a bar code. The method overcomes fatigue generated by the tedious attention required to maintain order. The method provides guidance for minimizing the number articles to be moved to maintain the ordered inventory and as an aid to placing articles. A simple RFID system is limited by separation distance of the articles possessing an RFID tag. A complex RFID system capable of overcoming separation distances has added complexity and associated increased costs. 
     
    
     
       BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING 
         [0014]      FIG. 1  shows a sketch of several articles on a shelf as would be seen in a library. 
           [0015]      FIG. 2  shows a portion of the several articles of  FIG. 1 . 
           [0016]      FIGS. 3A to 3  shows an image area passing over the articles of  FIG. 1 . 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0017]    The following paragraphs describe the method in use for a shelf of articles. 
         [0018]      FIGS. 1 ,  2  and  3 A to  3 R describe the method with a brief sequence of articles using a general layout of several articles on a shelf as would be seen in a library. The articles are labled using a fictitious sequence generally in accordance with the U.S. Library of Congress classification scheme; the call number. The sequence order in general is determined by the organizational requirements. 
         [0019]      FIG. 1  shows the fictitious sequence comprising of 5 articles which may be identified for this discussion as N 1  for Q 1 .N 1   2010 , N 2  for Q 1 .N 2   2010 , N 3  for Q 1 .N 3   2010 , N 4  for Q 1 .N 4   2010  and N 5  for Q 1 .N 5   2010  where N 1  is leftmost, N 5  is rightmost and N 3  is a thin book with the label not on the spine. 
         [0020]      FIG. 2  shows a portion of the fictitious sequence described in  FIG. 1  with significant edges labeled. The left article edge of N 1  is also the shelf vertical left side inside edge. The right article edge of N 1  is in common with the left article edge N 2 ; vertical N 1 ,N 2 . The right article edge of N 2  is in common with the left article edge N 3 ; vertical N 2 ,N 3 . The right article edge of N 3  is in common with the left article edge N 4 ; vertical N 3 ,N 4 . The right article edge of N 4  is in common with the left article edge N 5 ; vertical N 4 ,N 5 . In general the left and right edges may not be common due to gaps, leaning books, etc. The right article edge of N 5  is last; vertical N 5 . The top surface of shelf is also the bottom edge of the articles N 1  to N 5 . 
         [0021]      FIGS. 3A to 3R  have significant edges labeled. Shelf edges are marked by  17 ,  18  and  24 ; where  24  is also an article&#39;s bottom edge. Article N 1  edges are marked by  18 ,  19  and  24  with the call number label marked by  1 ,  2 ,  3  and  4 . Article N 2  edges are marked by  19 ,  20  and  24  with the call number label marked by  5 ,  6 ,  7  and  8 . Article N 3  edges are marked by  20 ,  21  and  24  with the call number label not on the article&#39;s spine. Article N 4  edges are marked by  21 ,  22  and  24  with the call number label marked by  9 ,  10 ,  11  and  12  where  12  is the call number label edge that lays along the article spine edge. Article N 5  edges are marked by  22 ,  23  and  24  with the call number label marked by  13 ,  14 ,  15  and  16 . 
         [0022]      FIGS. 3A to 3R  show a rectangular area moved from left to right for processing. The rectangular area may be a single image, a composite image or section of a larger image; where said composite image is a collection of smaller overlapping images not necessarily in the same plane may be assembled to create a reasonable equivalent image of the call number. Hereafter the image is any of the described and need not be rectangular in shape as shown in the sequences. The frequency of image collection may be based on time or movement or both, dynamic. 
         [0023]      FIG. 3A  shows the image area containing edge portions  17 ,  18 ,  24 ,  1 ,  3  and  4  and a significant portion of of the identification sequence, the call number. Edges  1 ,  3 ,  4  and and the image edge make a bounded area within the image. If the bounded area is sent to the OCR, a sequence would be returned. The sequence contains formatting; letter(s), number(s), period, letter(s), number(s), number(s). The sequence has incomplete consistency; last character may not be whole or no space to indicate the end of the number. The formatted but incomplete sequence suggests edge  4  is a call number label edge and asserts edges  1  and  3  are incomplete call number label edges. 
         [0024]    Image processing establishes coordinates for edge determination, etc. The image coordinates are related to the physical coordinates. Initial candidate coordinates for establishing relative coordinates lay at the intersection of edges  18  and  24  or edges  3  and  4 . 
         [0025]      FIG. 3B  shows another image containing edge portions  24 ,  1 ,  2 ,  3  and  4 . The current image together with the previous images edge  2  is recognized and edges  1 ,  3  and  24  are recognized as increasing in length. Edges  1 ,  2 ,  3  and  4  make a bounded area. If the bounded area is sent to the OCR, a sequence would be returned. The sequenced is consistent by format. The sequence may be validated by comparison to a known list. The edges  1 ,  2 ,  3  and  4  are marked as label boundaries. The label dimensions have been learned for this article. Elements of the previous image are updated; edges  1 ,  3  and  4  are label boundaries. The image of  FIG. 3A  combined with the current image form a larger composite image which will allow width calculation. Edges  18  and  24  are not identified as article edges; the edges may be some other type of mark. 
         [0026]    The candidate origin coordinate is not necessarily determined. If a local policy of using the lower left corner of the call number label, the origin may be set as such and all edge location information updated accordingly. On the other hand if the local policy is using an article corner, then the origin cannot be determined without ambiguity; operator input may be required. For the remainder of the discussion, let position information be based on label position. The list has N 1  at the origin. 
         [0027]      FIG. 3C  shows another image containing edge portions  19 ,  24 ,  1 ,  2 ,  3  and  4 . The current image together with the previous images edges  1 ,  2 ,  3  and  4  are recognized and edge  24  is recognized as increasing in length. Edges  18  and  24  are not identified as article edges; the edges may be some other type of mark. Similarly for edge  19 . 
         [0028]    If the call number were not on a label, no label edges, the edges  18 ,  19 ,  24  and the upper image edge would make up a bounded area when a larger composite image is used. If the bounded area is sent to the OCR, a sequence would be returned. The sequenced is consistent by format. The sequence may be validated by comparison to a known list. The edges  18 ,  19  and  24  are marked as boundaries. If the call number for N 2  were not on a label the edge  19  would be identified as an article boundary when the method determined the sequence. An alternative location for the origin would be used. 
         [0029]    Further discussion will continue using the call number label. 
         [0030]      FIG. 3D  shows another image containing edge portions  19 ,  24 ,  1 ,  2 ,  3 ,  5 ,  7  and  8 . The current image together with the previous images edges  1 ,  2 ,  3  and  19  are recognized and edge  24  is recognized as increasing in length. Edge  8  is identified as a possible label edge due to its length. The bounded area of  5 ,  7 ,  8  and the image edge is sent to the OCR, a sequence would be returned. The sequence contains formatting; letter(s), number(s), period, letter(s), number(s), number(s). The sequence has incomplete consistency; a character is not complete. The sequence with incomplete consistency, edge  8  is a possible call number label edge and asserts edges  5  and  7  as possible call number label edges. If edges  5 ,  7  and  8  are designated call number label edges at this time then edge  19  may be inferred to be the right article edge for N 1  and the left article edge of N 2 . 
         [0031]      FIG. 3E  shows another image containing edge portions  24 ,  5 ,  7  and  8 . The current image together with the previous images edge  8  is recognized and edges  24 ,  5  and  7  are recognized as increasing in length. The bounded area of  5 ,  7 ,  8  and image edge is sent to the OCR which returns a sequence. The sequenced is consistent by format. The sequence may be validated by comparison to a known list. Edge  8  is a call number label edge and edges  5  and  7  are incomplete call number label edges. The inference that edge  19  is the right article edge for N 1  and the left article edge of N 2  remains. 
         [0032]      FIG. 3F  shows another image containing edge portions  24 ,  5 ,  6 ,  7  and  8 . The current image together with the previous images edge  8  is recognized and edges  24 ,  5  and  7  are recognized as increasing in length. Edges  5 ,  6 ,  7  and  8  are of similar length to the learned label size of  1 ,  2 ,  3  and  4  edges for N 1 . The bounded area of edges  5 ,  6 ,  7  and  8  is sent to the OCR which returns a sequence. The additional computational time of the OCR is not required if the image is used to complete edges  1  and  3  and find the connecting edge  6 ; as well as any other edges to be address in the new portions of the image of  FIG. 3F  compared to the image of  FIG. 3E . Edges  5 ,  6 ,  7  and  8  are marked as label boundaries. The learned label size is compared to current label size and updated as necessary. If edges  5 ,  6 ,  7  and  8  were for a label of a different size the learned edges would be used for an alternative check for edge lengths for label boundaries. The inference that edge  19  is the right article edge for N 1  and the left article edge of N 2  is confirmed with the presence of 2 call numbers separated by a distance. Edge  24  may be inferred to be the article bottom edge; the shelf. Edge  24  is also possible to be some other continuous line as typically seen on a set of encyclopedias. Edge  18  is similar to edge  19  so edge  18  may be inferred to be an article edge. The article N 1  width may be calculated. The list has N 1  at the origin and N 2  at some offset from the origin. 
         [0033]      FIG. 3G  shows another image containing edge portions  20 ,  24 ,  5 ,  6 , and  7 . The current image together with the previous images edges  5 ,  6  and  7  are recognized and edge  24  is recognized as increasing in length. Edge  20  extends from edge  24  to the upper edge of image. A comparison of edge  20  to edge  19  infers that edge  20  is an article edge. The article N 2  width may be calculated. 
         [0034]      FIG. 3H  shows another image containing edge portions  20 ,  21 ,  24 ,  9 ,  11  and  12  where edge  12  lays along edge  21 . The current image together with the previous images edge  20  is recognized and  24  is recognized as increasing in length. The bounded area  9 ,  11 ,  12 , where  12  is the portion of edge  21  extending from edge  9  to  11 , and the image edge may be sent to the OCR which returns a sequence. The sequence has identification formatting. Edge  21  is similar to edge  18  and  19 . By similarity and formatting edge  21  may be inferred to be an article edge. The width described by edges  20  and  21  is too small for a label. The position is marked for manual review. 
         [0035]      FIG. 31  shows another image containing edge portions  21 ,  24 ,  9 ,  11  and  12  where edge  12  lays along edge  21 . The current image together with the previous images edge  21  and  12  are recognized and  24 ,  9  are  11  are recognized as increasing in length. The bounded area  9 ,  11 ,  12 , where  12  is the portion of edge  21  extending from edge  9  to  11  as in the image of  FIG. 3H , and the image edge may be sent to the OCR which returns a sequence. The sequence contains formatting; letter(s), number(s), period, letter(s), number(s), number(s). The sequence has incomplete consistency; a character is not complete. The sequence with incomplete consistency, edge  12  is a possible call number label edge and asserts edges  9  and  11  as possible call number label edges. 
         [0036]      FIG. 3J  shows another image containing edge portions  21 ,  22 ,  24 ,  9 ,  10  and  11  where edge  12  lays along edge  21  and where edge  10  lays along edge  22 . The current image together with the previous images edge  9 ,  11 ,  21  and  12  are recognized and  24  is recognized as increasing in length. The bounded area  9 ,  11 ,  12 , and  10 , where  10  is the portion of edge  22  extending from edge  9  is sent to the OCR which returns a sequence. The sequenced is consistent by format. The sequence may be validated by comparison to a known list. Edges  9 ,  10 ,  11  and  12  are call number label edges. Edges  21  and  22  are similar to edges  18 ,  19  and  20 . By similarity and label boundaries edges  21  and  22  may be inferred to be an article edge. The width of N 4  may be calculated. The list has N 1  at the origin, N 2  at some offset from the origin, some space requiring manual review and N 4  at some larger offset from the origin. 
         [0037]      FIG. 3K  shows another image containing edge portions  22 ,  24 ,  9 ,  10  and  11  where edge  10  lays along edge  22 . The current image together with the previous images edges  22 ,  9 ,  10  and  11  are recognized and  24  is recognized as increasing in length. No other information. 
         [0038]      FIG. 3L  shows another image containing edge portions  22 ,  24 ,  9 ,  10 ,  11 ,  13 ,  15  and  16  where edge  10  lays along edge  22 . The current image together with the previous images edges  22 ,  9 ,  10  and  11  are recognized and  24  is recognized as increasing in length. Edge  16  has a length similar to the learned label edge length. The area bounded by  13 ,  15 ,  16  and the image edge is too small to contain useful information. Displacement of images, the relative position calculation, is maintained due to changes in previously identified edges, e.g. edges  22  and  24 , and any marks if present, features. 
         [0039]      FIG. 3M  shows another image containing edge portions  24 ,  13 ,  15  and  16 . The current image together with the previous images edge  16  is recognized and edges  13 ,  15  and  24  are recognized as increasing in length. The bounded area of  13 ,  15 ,  16  and image edge is sent to the OCR which returns a sequence. The sequenced is consistent by format. The sequence may be validated by comparison to a known list. The consistent sequence suggests edge  16  is a call number label edge and asserts edges  13  and  15  are incomplete call number label edges. 
         [0040]      FIG. 3N  shows another image containing edge portions  13 ,  14 ,  15  and  16 . The current image together with the previous images edges  13 ,  15  and  16  are recognized and edge  24  is recognized as increasing in length. Edges  13 ,  14 ,  15  and  16  are of similar length to the previously learned label size. The bounded area of edges  13 ,  14 ,  15  and  16  is sent to the OCR which returns a sequence. The additional computational time of the OCR is not required if the image is used to complete edges  13  and  15  and find the connecting edge  14 ; as well as any other edges to be address in the new portions of the image of  FIG. 3N  compared to the image of  FIG. 3M . Edges  13 ,  14 ,  15  and  16  are marked as label boundaries. The list has N 1  at the origin, N 2  at some offset from the origin, some space requiring manual review, N 4  at some larger offset from the origin and N 5  at some larger offset from the origin. 
         [0041]      FIG. 3O  shows another image containing edge portions  23 ,  24 ,  13 ,  14  and  15 . The current image together with the previous images edge  13 ,  14  and  15  are recognized and  24  is recognized as increasing in length. Edge  23  is similar to edges  18 ,  19 ,  21  and  22 . By similarity and label boundary edge  14  previously identified to left of edge  23 , edge  23  may be inferred to be an article edge. The width of N 5  may be calculated. 
         [0042]      FIG. 3P  shows another image containing edge portions  23 ,  24 ,  13 ,  14  and  15 . The current image together with the previous images edges  13 ,  14 ,  15  and  23  are recognized and  24  is recognized as increasing in length. No other information when considered in comparison to the previous retained image of  FIG. 3O . Alternatively, the image of  FIG. 3O  may have been discarded since the image did not move a significant distance. If the image of  FIG. 3O  were not used then the image processing previously described for image would apply for image of  FIG. 3P  regarding article N 5 . 
         [0043]      FIG. 3Q  shows another image containing edge portions  23  and  24 . The current image together with the previous images edge  23  is recognized and  24  is recognized as increasing in length. No other information. 
         [0044]      FIG. 3R  shows another image containing edge portions  24 . The current image together with the previous images edge  24  is recognized as increasing in length. No other information. If no other features are present, relative position may be lost as for an open area or end of the articles for the shelf. 
         [0045]    As previously mentioned in the discussion of  FIG. 3P , the image of  FIG. 3O  may not be required. A similar condition may exist for images of  FIGS. 3B and 3E  thereby reducing computational time. 
         [0046]    The method in use described a left to right scan starting at N 1 . The scan could have started from right to left or in the middle. For a scan starting in the middle, say N 2 , the operator may move to left first and then to right. The data structures containing the relevant edge information and position would be updated as necessary. 
         [0047]    The method in use for a shelf of articles description ends. 
         [0048]    The method may read a single article where the call number is located in any location on an article using a single image where the image was acquired significantly parallel to the call number label. Consider the image area of  FIG. 3F  where the image is not a composite image. The image contains sufficient detail or resolution such that the call number character sequence may be determined. 
         [0049]    All or part of an image may be processed by the OCR. 
         [0050]    Generally, any image that includes the entire call number sequence will have as a minimum the image edges. Depending on the layout of the sequence, single or multi-line or many characters, etc, the image may be large and hence the area to be processed by the OCR is large. It is desirable to minimize the the image portion to be processed by the OCR to an area that contains the call number. 
         [0051]    Edges or boundaries surrounding the call number may be present such as a call number label or article edges or features such as logos. Frequently a label is attached to an article which contains the call number. Other markings such as publisher marks may indicate the preferred area. The article may not have a label as in hand-written cases. The article label may be long and narrow as in the case for CDROM or similar media cases. 
         [0052]    Edges or boundaries derived from the image for identifying a preferred area are maintained. An image may contain more that one call number hence multiple areas must to be processed by the OCR. 
         [0053]    The OCR character sequence is validated by format for the classification system in use and completeness by using preferred areas where available. The results are stored as required. 
         [0054]    The validated call number as well as supporting image may be presented to an operator for independent verification. The results are stored as required. 
         [0055]    The preferred area to process by the OCR for a call number is frequently bounded by label edges; the preferred area size, edges, may be learned. 
         [0056]    The character sequence may be checked to known items such as a database of items. The database may contain a sequence that is not alpha-numeric order based. The alpha-numeric sequence may be time ordered where the character sequence used has no time reference such as time when placed in inventory. For instance, consider some article A with a number 5003 and some article B with a number 625. If A arrives before B, the number references would be checked to known database and order established. 
         [0057]    A list of articles to be found, a search list, may be established. The search list may be for lost articles, articles to be collected for checkout etc. A call number is checked against the search list and an alert is made when the item is on the search list. 
         [0058]    The method may employ a collection of images to make a composite image such as a panoramic image may be created from many individual using known image processing techniques. The composite image contains sufficient detail such that the call number character sequence may be determined. A plurality of images, each making up an area not necessarily containing the entire call number or poor quality image areas or other may be combine to create a composite image. The poor quality image areas may be due to the curvature of the surface the label attached or the sequence is written, physical limitations of imaging equipment, etc. In this manner the composite image may use both look ahead and look behind to capture pertinent features of the articles such as as spine curvature. As the camera or article move, multiple timestamped images, each with relative coordinates permits relative movement and relative speed to be calculated using the overlapping features within each image. Image acquisition rates, frames per second, are dynamically adjusted to maintain composite image quality. The plurality of images making up a composite image are timestamped such that relative position may be determined for each image or by comparing feature movement within adjacent images. Relevant data is stored. 
         [0059]    The a plurality of images making up a composite image may be extended for multiple articles such that many articles may be checked in a continuous manner as for a shelf of articles. 
         [0060]    When many articles are checked, articles may be thin requiring the label to be placed in a location not on the spine. An alert is generated such that a manual entry may be made or a individual scan. 
         [0061]    As the list is created the list is checked for out or order character sequences indicating an article that is out of its ordered position. An alert is made. 
         [0062]    Multiple shelves may be scanned simultaneously with each shelf having a list. Scan may be from left to right or right to left so both sides of an aisle may be scanned at the same time. 
         [0063]    Sorting algorithms are used to identify an article or plurality of articles that must be moved to maintain proper order requiring the least number of movements. Consider articles with the fictitious labels B 1 , B 5 , B 2 , B 3 , B 4 , B 6 . In a situation where the scan is from left to right, the B 2  or B 5  may be considered out of order. If corrected immediately by moving B 5  the sequence is B 1 , B 2 , B 5 , B 3 , B 4 , B 6 . Similar out of order alerts are found for B 3  and B 4  resulting in a total of 3 shelving operations. If action is deferred, B 5  would be identified as the most out of order resulting in a single shelving operation. Using the same fictitious sequence and scan from right to left, a single shelving operation would be required regardless if the shelving operation were immediate or deferred. 
         [0064]    A plurality of lists may be checked for order in that the call number order will have a maximum and minimum in general for any set of ordered articles; e.g. a shelf of books. For a list A that is before list B, a maximum article of list A will not belong to list B. If an item in list would belong to list B, let it be designated article C, C would be a maximum item in list A. Similarly the set of articles in list B that are less than the C may be moved to shelf A before article C. It is desirable to move the least number of out of sequence articles. Without loss of generality the order may be high to low or a custom sequence. 
         [0065]    The present invention is distinguished in one aspect from the prior art of circulation control in that the prior art does not assist users to shelve articles. The user or operator of the method application will read an article to be shelved label to acquire the article&#39;s sequence. Stacks typically have a general label at each end while the individual shelves will not be labeled to contain a specific sequence range. The user or operator will periodically read a label of a shelved article for its sequence. The method application will compare the sequences including communication to a sequence database if required. The comparison results will be used to guide the user or operator to the correct location. In this manner, the inventory can be arranged or designed such that the shelving time is reduced, simplified and provides for increased operational efficiency due to the control of the item placement according to a data map wherein proper arrangement can be known and conveyed to the application interface. A notification device which can be audio and/or visual wherein audio would signal to stop movement and a laser pointer would show the position required of the book according to a data map for that particular article on the cart which needs to be placed on the shelve. 
         [0066]    The realization of this method may take many forms; handheld device as a completely integrated unit, a handheld camera and some portable computer; many cameras and a portable computer, etc. 
         [0067]    The method preferred embodiment includes a learning period such that the image processing may be faster and more accurate. The learning should include the locally implemented label type details. Frequently used fonts and font size would be used to help distinguish between publisher marks and call numbers. The label dimensions and label color which assists in limiting the size of image to be processed by the optical character recognition engine. Labels may have location information, e.g. building name as when institution has multiple libraries, or organizational logos. The building name has importance for finding misplaced articles. Both the building name and logos would help identify the label location faster.