Methods of object search and recognition -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
10/23/08 - USPTO Class 707 |  1 views | #20080263021 | Prev - Next | About this Page  707 rss/xml feed  monitor keywords

Methods of object search and recognition

USPTO Application #: 20080263021
Title: Methods of object search and recognition
Abstract: The proposed technical solution allows processing of machine-readable forms of unfixed format. An auxiliary brief description may be optionally specified to determine the spatial orientation of the image. A method of searching for elements of a document comprises the following main operations in addition to the operations of preliminary image processing: selecting the varieties of structural description from several available variants, determining the orientation of the image, selecting the text objects, where the text must be recognized, and determining the minimal required volume of recognition, recognizing the text objects, searching for elements of the form. Searching for elements of the form comprises the following actions: selecting a searched element in the structural description, gaining the algorithm of search constraints from the structural description, searching for the element, testing the obtained variants. (end of abstract)



USPTO Applicaton #: 20080263021 - Class: 707 5 (USPTO)

Methods of object search and recognition description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20080263021, Methods of object search and recognition.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords

The present invention relates generally to image recognition and particularly to the recognition of non-text and/or text objects contained in a bit-mapped image of a document.

The mentioned methods are also applied for, but not limited to, recognition of data input forms, containing typographical and hand-written texts as well as a set of special text-marks for document navigation. Documents as supposed herein are inquiry lists, questionnaires, bank documents with rigid or arbitrary arrangement of data fields.

The mentioned methods may be applied for recognition of predefined form objects contained in an electronic graphical image.

PRIOR ART

Methods of structure assignment and document element search in an electronic graphical image are known in the art (U.S. Pat. No. 5,416,849 Huang, May 16, 1995).

The capability of the known methods to process only fixed forms, not allowing deviations in field arrangement, is the shortcoming of the methods.

Anyone of the described methods and the system may be taken as a prototype.

The technical result consists in the improvement of searching capabilities as well as the accuracy of identification of obtained image objects, the increase of noise immunity during the process of object search on the image.

SUMMARY OF THE INVENTION

The declared technical result is achieved by using tools for search and identification of objects on an image; with further assignment of the estimate of correspondence of the search result to the description. Numbers from 0 to 1 are used for the evaluation. The accuracy of evaluation is 10−5 (ten to the power of minus five). The value equal to 1 means the absolute correspondence of the obtained result to the description. If the estimate differs from zero, the application of flexible structural description also comprises the stage of forming block regions, i.e. evaluation of the arrangement of the required fields on the basis of the information about the obtained objects.

Structural description comprises the description of spatial and parametric characteristics of document elements, and the logical connections between document elements.

The method of preliminary assignment of a document structure consists in setting a description of the document's logical structure in the form of interdependences of spatial and parametric characteristics of elements, algorithms of obtaining the parameters of the search for each element, methods of identifying the obtained elements, methods of decreasing the number of obtained variants of an element, acceleration of the search for the best variant.

The method of searching and recognizing the elements (fields or field fragments) of a document on a graphical (bit-mapped) image consists in using of a predefined logical structure of the document in the form of structural description, algorithms of obtaining the parameters of the search for each element, methods of identifying the obtained elements, methods of decreasing the number of obtained variants of an element, acceleration of the search for the best variant.

Searching for elements with the help of a flexible structural description is performed sequentially in the order in which they are described in the flexible structural description, top-down through the “tree” (hierarchy) of elements, in accordance with the logical structure of the document description. For each element in the assigned search area, several variants of image objects or sets of image objects corresponding to the description of the element in the structural description may be found. Various obtained variants of objects are considered to be the variants of the position of the element on the image. An estimate of the degree of correspondence of the variant to the element description is assigned to each obtained variant (i.e. the estimate of the quality of the variant).

The accuracy of the obtained position of the object determines the accuracy of obtaining the positions of objects described further in the description relative to this object. Searching for the next dependent object is performed separately for each obtained variant of the current object. Therefore, the variants of objects obtained on the image comprise a hierarchical tree, considerable more branched than the hierarchical tree of elements in a structural description.

If an element or an object is compound, i.e. composed of several parts, the whole group also represents an element, which requires generating several possible variants, the number of which corresponds to the number of complete chains of group sub-elements (dependent elements of a lower level). The chain is considered complete if all its obtained sub-elements (elements of a lower level) have sufficient quality. The total estimate of the quality of a variant of a compound element is calculated by multiplying the estimates of the quality of element variants forming the compound element. A flexible structural description as a whole also represents a compound element, therefore, the quality of the correspondence of the variant to the flexible structural description is determined by multiplying the quality of its elements.

Application of a flexible structural description comprises searching for the best complete branch in the whole tree of variants, i.e. the branch that include all the elements, from first to last. A general solution of such a task implies taking into consideration all the possible combinations of hypotheses for all elements, construction of a total multitude of complete branches and selecting the best among them. However, in practice, such a solution requires too much resources, and is therefore impractical. Moreover, an abrupt increase in the number of variants taken into consideration is possible, caused by an increase in the number of elements and a lack of rigid restrictions on the search area and element parameters.

To limit the time required to analyze the variants, one of the several methods of decreasing the volume is used.

Each element gets the maximum allowed number of acceptable variants, rated in the order of decreasing quality. These variants will be used in the further search, i.e. when searching for the next element. Any variants beyond this number will be discarded. Usually this number is 5 (five) for simple elements and 1 (one) for compound elements. This means that, if 15 variants are obtained for a simple element in the assigned search area, five variants with the best quality rating will be selected. Other 10 chains of variants will not be complete and will not be taken into consideration. A compound element is identified with a greater quality rating than a simple element, because the quality of identification is determined not only by multiplying the quality ratings of the constituent simple elements, but also by several additional (mainly qualitative) characteristics, such as mutual arrangement, object size, correspondence to the conditions of mutual arrangement several elements, and so on.

Since a compound element is identified with a greater quality rating than a simple element, its best variant usually turns out to be accurate.

The process of searching for objects almost always includes generating several incomplete chains of variants of obtained objects and, therefore, several directions of further search. Search for the best hypothesis is performed by using an algorithm of “broad searching”, i.e. the search is always directed through the chain of variants which has the best quality rating at the current step, regardless of the length of the chain. For example, if in a flexible structural description of 30 elements 2 chains are obtained during search, one of which consists of 30 elements with the quality rating of 0.89 and the other chain has 2 elements with the quality rating of 0.92, then the second chain will be pursued until its total quality becomes lower than that of the first chain.

The following rule of quality optimization is used for compound elements: if an ideal complete chain for this element is obtained, i.e. the quality of the obtained chain equals 1, other variants of sub-elements composition of this compound element are not taken into consideration.

Moreover, the maximum number of variants for every element in the entire hypothesis tree is restricted to 1000.



Continue reading about Methods of object search and recognition...
Full patent description for Methods of object search and recognition

Brief Patent Description - Full Patent Description - Patent Application Claims

Click on the above for other options relating to this Methods of object search and recognition patent application.

Patent Applications in related categories:

20090292695 - Automated selection of generic blocking criteria - Field probabilities associated with fields in a database may be used to create one or more blocking criteria. The blocking criteria may be a set of fields that should be equal among two or more records in a database, so that a search of the records in the database according ...

20090292696 - Computer-implemented search using result matching - A computer search system compares search results received for searches falling within a defined parameter envelope used for grouping search requests. The parameter envelope may be defined by various parameters, for example, time of search, origin or search request, language, or other non-keyword data associated with each search request, excluding ...

20090292686 - Disambiguating tags in folksonomy tagging systems - Allowing users of a folksonomy tagging system to use any phrase they feel is relevant to the resource can lead to ambiguities within the system. For example, a user may tag a picture of a gift with the keyword “bow”. Another user may tag a picture of a bow and ...

20090292692 - Information search method and information processing apparatus - According to one embodiment, an information processing apparatus includes an information acquisition processing module, a scheduling module and a control module. The information acquisition processing module performs an information acquisition process of acquiring information corresponding to an input keyword via an Internet by transmitting the keyword to a predetermined server ...

20090292690 - Method and system for automatic event administration and viewing - This is a method and system for automated calendar event creation from unstructured text, with assisted administration and viewing. ...

20090292697 - Method and system for lexical mapping between document sets having a common topic - Terms (e.g., words) used in an expert domain that correspond to terms in a naïve domain are detected when there are no vocabulary pairs or document pairs available for the expert and naive domains. Documents known to be descriptions of identical topics and written in the expert and naive domains ...

20090292698 - Method for extracting a compact representation of the topical content of an electronic text - An electronic document is parsed to remove irrelevant text and to identify the significant elements of the retained text. The elements are assigned scores representing their significance to the topical content of the document. A matrix of element-pairs is constructed such that the matrix nodes represent the result of one ...

20090292688 - Ordering relevant content by time for determining top picks - A computer-readable medium encoded with computer instructions for providing relevant content on a web page for a user is provided. According to embodiments of the invention, the instructions are for determining a relevance metric for at least two articles. Each article of the at least two articles is selected from ...

20090292684 - Promoting websites based on location - A computer system, method, and media for associating locations with ranked websites are provided. The computer system includes a search engine, a log database, and a location database that are employed to respond to search requests from users by returning appropriately ranked websites to the user. The websites are ranked ...

20090292694 - Statistical record linkage calibration for multi token fields without the need for human interaction - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method utilize blended field weights to account for certain types of partial matches. The system and method apply iterative techniques such that parameters from each linking ...

20090292683 - System and method for automatically ranking lines of text - Disclosed are apparatus and methods for ranking lines of text. In one embodiment, an intent of a query is ascertained. A relevance of each one of a plurality of lines of text of a document is determined based upon the intent of the query, content of the query, and content ...

20090292691 - System and method for building multi-concept network based on user's web usage data - With the system and method, web page usage data for each user for a user's interest keyword is collected to build a web page connection network. Thus, a web page connection network based on information on a variety of tendencies can be provided. A system and method for building a multi-concept ...

20090292687 - System and method for providing question and answers with deferred type evaluation - A system, method and computer program product for conducting questions and answers with deferred type evaluation based on any corpus of data. The method includes processing a query including waiting until a “Type” (i.e. a descriptor) is determined AND a candidate answer is provided; the Type is not required as ...

20090292689 - System and method of providing electronic dictionary services - A database and techniques for managing and updating the database are described. The database includes defined terms and undefined terms stored therein. While each of the defined terms is stored in the database in association with a definition thereof, each of the undefined terms is stored in the database in ...

20090292693 - Text searching method and device and text processor - The present invention provides a text searching method including the steps of: extracting initials of corresponding words in a text to be searched according to a predetermined extracting rule to form an initial character string; creating mapping relation between the extracted initial character string and the text to be searched; ...

20090292685 - Video search re-ranking via multi-graph propagation - A video search re-ranking via multi-graph propagation technique employing multimodal fusion in video search is presented. It employs not only textual and visual features, but also semantic and conceptual similarity between video shots to rank or re-rank the search results received in response to a text-based search query. In one ...


###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
3. Each week you receive an email with patent applications related to your keywords.  
Start now! - Receive info on patent apps like Methods of object search and recognition or other areas of interest.
###


Previous Patent Application:
Method and apparatus for managing peer-to-peer search results
Next Patent Application:
Portable data storage apparatus and method of allowing user to select digital data using the portable data storage apparatus
Industry Class:
Data processing: database and file management or data structures

###

FreshPatents.com Support
Thank you for viewing the Methods of object search and recognition patent info.
IP-related news and info


Results in 0.0643 seconds


Other interesting Feshpatents.com categories:
Novartis , Pfizer , Philips , Polaroid , Procter & Gamble , 174
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO