View All Items
(1 - 2 of 2)
- Title
- AUTONOMOUS REPAIR OF OPTICAL CHARACTER RECOGNITION DATA THROUGH SIMPLE VOTING AND MULTI-DIMENSIONAL INDEXING TECHNIQUES.
- Creator
-
Sprague, Christopher, Weeks, Arthur, University of Central Florida
- Abstract / Description
-
The three major optical character recognition (OCR) engines (ExperVision, Scansoft OCR, and Abby OCR) in use today are all capable of recognizing text at near perfect percentages. The remaining errors however have proven very difficult to identify within a single engine. Recent research has shown that a comparison between the errors of the three engines proved to have very little correlation, and thus, when used in conjunction, may be useful to increase accuracy of the final result. This...
Show moreThe three major optical character recognition (OCR) engines (ExperVision, Scansoft OCR, and Abby OCR) in use today are all capable of recognizing text at near perfect percentages. The remaining errors however have proven very difficult to identify within a single engine. Recent research has shown that a comparison between the errors of the three engines proved to have very little correlation, and thus, when used in conjunction, may be useful to increase accuracy of the final result. This document discusses the implementation and results of a simple voting system designed to prove the hypothesis and show a statistical improvement in overall accuracy. Additional aspects of implementing an improved OCR scheme such as dealing with multiple engine data output alignment and recognizing application specific solutions are also addressed in this research. Although voting systems are currently in use by many major OCR engine developers, this research focuses on the addition of a collaborative system which is able to utilize the various positive aspects of multiple engines while also addressing the immediate need for practical industry applications such as litigation and forms processing. Doculex TM, a major developer and leader in the document imaging industry, has provided the funding for this research.
Show less - Date Issued
- 2005
- Identifier
- CFE0000380, ucf:46337
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0000380
- Title
- H(&)#252;ckel Energy of a Graph: Its Evolution From Quantum Chemistry to Mathematics.
- Creator
-
Zimmerman, Steven, Mohapatra, Ram, Song, Zixia, Brigham, Robert, University of Central Florida
- Abstract / Description
-
The energy of a graph began with German physicist, Erich H(&)#252;ckel's 1931 paper, QuantenttheoretischeBeitr(&)#228;ge zum Benzolproblem. His work developed a method for computing thebinding energy of the ?-electrons for a certain class of organic molecules. The vertices of thegraph represented the carbon atoms while the single edge between each pair of distinct verticesrepresented the hydrogen bonds between the carbon atoms. In turn, the chemical graphswere represented by an n (&)#215; n...
Show moreThe energy of a graph began with German physicist, Erich H(&)#252;ckel's 1931 paper, QuantenttheoretischeBeitr(&)#228;ge zum Benzolproblem. His work developed a method for computing thebinding energy of the ?-electrons for a certain class of organic molecules. The vertices of thegraph represented the carbon atoms while the single edge between each pair of distinct verticesrepresented the hydrogen bonds between the carbon atoms. In turn, the chemical graphswere represented by an n (&)#215; n matrix used in solving Schr(&)#246;dinger's eigenvalue/eigenvectorequation. The sum of the absolute values of these graph eigenvalues represented the total?-electron energy. The criteria for constructing these chemical graphs and the chemical interpretationsof all the quantities involved made up the H(&)#252;ckel Molecular Orbital theoryor HMO theory. In this paper, we will show how the chemical interpretation of H(&)#252;ckel'sgraph energy evolved to a mathematical interpretation of graph energy that Ivan Gutmanprovided for us in his famous 1978 definition of the energy of a graph. Next, we will presentCharles Coulson's 1940 theorem that expresses the energy of a graph as a contour integraland prove some of its corollaries. These corollaries allow us to order the energies of acyclicand bipartite graphs by the coefficients of their characteristic polynomial. Following Coulson'stheorem and its corollaries we will look at McClelland's first theorem on the boundsfor the energy of a graph. In the corollaries that follow McClelland's 1971 theorem, we willprove the corollaries that show a direct variation between the energy of a graph and thenumber of its vertices and edges. Finally, we will see how this relationship led to Gutman'sconjecture that the complete graph on n vertices has maximal energy. Although this wasdisproved by Chris Godsil in 1981, we will provide an independent counterexample with thehelp of the software, Maple 13.
Show less - Date Issued
- 2011
- Identifier
- CFE0004184, ucf:49027
- Format
- Document (PDF)
- PURL
- http://purl.flvc.org/ucf/fd/CFE0004184
