A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions
Identifieur interne : 001492 ( Istex/Corpus ); précédent : 001491; suivant : 001493A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions
Auteurs : Pavan Kumar ; Arun Agarwal ; Chakravarthy BhagvatiSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.
Url:
DOI: 10.1007/978-3-642-25725-4_16
Links to Exploration step
ISTEX:CD55B10CDA8FFBAD75443D3416B48C9ACD46753FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title><author><name sortKey="Kumar, Pavan" sort="Kumar, Pavan" uniqKey="Kumar P" first="Pavan" last="Kumar">Pavan Kumar</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: pavan.ppkumar@gmail.com</mods:affiliation></affiliation></author><author><name sortKey="Agarwal, Arun" sort="Agarwal, Arun" uniqKey="Agarwal A" first="Arun" last="Agarwal">Arun Agarwal</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: aruncs@uohyd.ernet.in</mods:affiliation></affiliation></author><author><name sortKey="Bhagvati, Chakravarthy" sort="Bhagvati, Chakravarthy" uniqKey="Bhagvati C" first="Chakravarthy" last="Bhagvati">Chakravarthy Bhagvati</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CD55B10CDA8FFBAD75443D3416B48C9ACD46753F</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-25725-4_16</idno><idno type="url">https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001492</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title><author><name sortKey="Kumar, Pavan" sort="Kumar, Pavan" uniqKey="Kumar P" first="Pavan" last="Kumar">Pavan Kumar</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: pavan.ppkumar@gmail.com</mods:affiliation></affiliation></author><author><name sortKey="Agarwal, Arun" sort="Agarwal, Arun" uniqKey="Agarwal A" first="Arun" last="Agarwal">Arun Agarwal</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: aruncs@uohyd.ernet.in</mods:affiliation></affiliation></author><author><name sortKey="Bhagvati, Chakravarthy" sort="Bhagvati, Chakravarthy" uniqKey="Bhagvati C" first="Chakravarthy" last="Bhagvati">Chakravarthy Bhagvati</name><affiliation><mods:affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">CD55B10CDA8FFBAD75443D3416B48C9ACD46753F</idno><idno type="DOI">10.1007/978-3-642-25725-4_16</idno><idno type="ChapterID">16</idno><idno type="ChapterID">Chap16</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>P. Pavan Kumar</name><affiliations><json:string>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</json:string><json:string>E-mail: pavan.ppkumar@gmail.com</json:string></affiliations></json:item><json:item><name>Arun Agarwal</name><affiliations><json:string>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</json:string><json:string>E-mail: aruncs@uohyd.ernet.in</json:string></affiliations></json:item><json:item><name>Chakravarthy Bhagvati</name><affiliations><json:string>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.</abstract><qualityIndicators><score>9.404</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1575</abstractCharCount><pdfWordCount>5125</pdfWordCount><pdfCharCount>28025</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>242</abstractWordCount></qualityIndicators><title>A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>16</json:string><json:string>Chap16</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2011</copyrightDate></serie><host><editor><json:item><name>Chattrakul Sombattheera</name><affiliations><json:string>Faculty of Informatics, Mahasarakham University, Khamreing, 44150, Kantarawichai, Mahasarakham, Thailand</json:string><json:string>E-mail: chattrakul.s@msu.ac.th</json:string></affiliations></json:item><json:item><name>Arun Agarwal</name><affiliations><json:string>Department of Computers and Information Science, University of Hyderabad, 500046, Hyderabad, Andhra Pradesh, India</json:string><json:string>E-mail: aruncs@uohyd.ernet.in</json:string></affiliations></json:item><json:item><name>Siba K Udgata</name><affiliations><json:string>Department of Computer and Information Sciences, University of Hyderabad, 500046, Hyderabad, India</json:string><json:string>E-mail: udgatacs@uohyd.ernet.in</json:string></affiliations></json:item><json:item><name>Kittichai Lavangnananda</name><affiliations><json:string>School of Information Technology, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand</json:string><json:string>E-mail: kitt@sit.kmutt.ac.th</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Systems Applications (incl. Internet)</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item></subject><isbn><json:string>978-3-642-25724-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Multi-disciplinary Trends in Artificial Intelligence</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>978-3-642-25725-4</json:string></bookId><volume>7080</volume><pages><last>192</last><first>181</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-642-25725-4</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-25725-4</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-25725-4_16</json:string></doi><id>CD55B10CDA8FFBAD75443D3416B48C9ACD46753F</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2011</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title><author><persName><forename type="first">P.</forename><surname>Kumar</surname></persName><email>pavan.ppkumar@gmail.com</email><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation></author><author><persName><forename type="first">Arun</forename><surname>Agarwal</surname></persName><email>aruncs@uohyd.ernet.in</email><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation></author><author><persName><forename type="first">Chakravarthy</forename><surname>Bhagvati</surname></persName><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation></author></analytic><monogr><title level="m">Multi-disciplinary Trends in Artificial Intelligence</title><title level="m" type="sub">5th International Workshop, MIWAI 2011, Hyderabad, India, December 7-9, 2011. Proceedings</title><idno type="pISBN">978-3-642-25724-7</idno><idno type="eISBN">978-3-642-25725-4</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-25725-4</idno><idno type="BookID">978-3-642-25725-4</idno><idno type="BookTitleID">300432</idno><idno type="BookSequenceNumber">7080</idno><idno type="BookVolumeNumber">7080</idno><idno type="BookChapterCount">37</idno><editor><persName><forename type="first">Chattrakul</forename><surname>Sombattheera</surname></persName><email>chattrakul.s@msu.ac.th</email><affiliation>Faculty of Informatics, Mahasarakham University, Khamreing, 44150, Kantarawichai, Mahasarakham, Thailand</affiliation></editor><editor><persName><forename type="first">Arun</forename><surname>Agarwal</surname></persName><email>aruncs@uohyd.ernet.in</email><affiliation>Department of Computers and Information Science, University of Hyderabad, 500046, Hyderabad, Andhra Pradesh, India</affiliation></editor><editor><persName><forename type="first">Siba</forename><forename type="first">K</forename><surname>Udgata</surname></persName><email>udgatacs@uohyd.ernet.in</email><affiliation>Department of Computer and Information Sciences, University of Hyderabad, 500046, Hyderabad, India</affiliation></editor><editor><persName><forename type="first">Kittichai</forename><surname>Lavangnananda</surname></persName><email>kitt@sit.kmutt.ac.th</email><affiliation>School of Information Technology, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">7080</biblScope><biblScope unit="page" from="181">181</biblScope><biblScope unit="page" to="192">192</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Randy</forename><surname>Goebel</surname></persName><affiliation>University of Alberta, Edmonton, Canada</affiliation></editor><editor><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName><affiliation>University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Wolfgang</forename><surname>Wahlster</surname></persName><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Chattrakul</forename><surname>Sombattheera</surname></persName><email>chattrakul.s@msu.ac.th</email><affiliation>Faculty of Informatics, Mahasarakham University, Khamreing, 44150, Kantarawichai, Mahasarakham, Thailand</affiliation></editor><editor><persName><forename type="first">Arun</forename><surname>Agarwal</surname></persName><email>aruncs@uohyd.ernet.in</email><affiliation>Department of Computers and Information Science, University of Hyderabad, 500046, Hyderabad, Andhra Pradesh, India</affiliation></editor><editor><persName><forename type="first">Siba</forename><forename type="first">K</forename><surname>Udgata</surname></persName><email>udgatacs@uohyd.ernet.in</email><affiliation>Department of Computer and Information Sciences, University of Hyderabad, 500046, Hyderabad, India</affiliation></editor><editor><persName><forename type="first">Kittichai</forename><surname>Lavangnananda</surname></persName><email>kitt@sit.kmutt.ac.th</email><affiliation>School of Information Technology, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand</affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope type="seriesId">1244</biblScope></series><idno type="istex">CD55B10CDA8FFBAD75443D3416B48C9ACD46753F</idno><idno type="DOI">10.1007/978-3-642-25725-4_16</idno><idno type="ChapterID">16</idno><idno type="ChapterID">Chap16</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I21017</label><label>I18040</label><label>I13022</label><label>I18032</label><label>I18024</label><label>I16021</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Information Systems Applications (incl. Internet)</term></item><item><term>Computer Communication Networks</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Database Management</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Randy</GivenName><FamilyName>Goebel</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Wolfgang</GivenName><FamilyName>Wahlster</FamilyName></EditorName></Editor><Affiliation ID="Aff16"><OrgName>University of Alberta</OrgName><OrgAddress><City>Edmonton</City><Country>Canada</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>DFKI and University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-25725-4</BookID><BookTitle>Multi-disciplinary Trends in Artificial Intelligence</BookTitle><BookSubTitle>5th International Workshop, MIWAI 2011, Hyderabad, India, December 7-9, 2011. Proceedings</BookSubTitle><BookVolumeNumber>7080</BookVolumeNumber><BookSequenceNumber>7080</BookSequenceNumber><BookDOI>10.1007/978-3-642-25725-4</BookDOI><BookTitleID>300432</BookTitleID><BookPrintISBN>978-3-642-25724-7</BookPrintISBN><BookElectronicISBN>978-3-642-25725-4</BookElectronicISBN><BookChapterCount>37</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl. Internet)</BookSubject><BookSubject Code="I13022" Priority="3" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I18032" Priority="4" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18024" Priority="5" Type="Secondary">Database Management</BookSubject><BookSubject Code="I16021" Priority="6" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Chattrakul</GivenName><FamilyName>Sombattheera</FamilyName></EditorName><Contact><Email>chattrakul.s@msu.ac.th</Email></Contact></Editor><Editor AffiliationIDS="Aff20"><EditorName DisplayOrder="Western"><GivenName>Arun</GivenName><FamilyName>Agarwal</FamilyName></EditorName><Contact><Email>aruncs@uohyd.ernet.in</Email></Contact></Editor><Editor AffiliationIDS="Aff21"><EditorName DisplayOrder="Western"><GivenName>Siba</GivenName><GivenName>K</GivenName><FamilyName>Udgata</FamilyName></EditorName><Contact><Email>udgatacs@uohyd.ernet.in</Email></Contact></Editor><Editor AffiliationIDS="Aff22"><EditorName DisplayOrder="Western"><GivenName>Kittichai</GivenName><FamilyName>Lavangnananda</FamilyName></EditorName><Contact><Email>kitt@sit.kmutt.ac.th</Email></Contact></Editor><Affiliation ID="Aff19"><OrgDivision>Faculty of Informatics</OrgDivision><OrgName>Mahasarakham University</OrgName><OrgAddress><Street>Khamreing</Street><Postcode>44150</Postcode><City>Kantarawichai</City><State>Mahasarakham</State><Country>Thailand</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgDivision>Department of Computers and Information Science</OrgDivision><OrgName>University of Hyderabad</OrgName><OrgAddress><Postcode>500046</Postcode><City>Hyderabad</City><State>Andhra Pradesh</State><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgDivision>Department of Computer and Information Sciences</OrgDivision><OrgName>University of Hyderabad</OrgName><OrgAddress><Postcode>500046</Postcode><City>Hyderabad</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff22"><OrgDivision>School of Information Technology</OrgDivision><OrgName>King Mongkut’s University of Technology</OrgName><OrgAddress><City>Thonburi</City><State>Bangkok</State><Country>Thailand</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap16" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>16</ChapterID><ChapterDOI>10.1007/978-3-642-25725-4_16</ChapterDOI><ChapterSequenceNumber>16</ChapterSequenceNumber><ChapterTitle Language="En">A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</ChapterTitle><ChapterFirstPage>181</ChapterFirstPage><ChapterLastPage>192</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>978-3-642-25725-4</BookID><BookTitle>Multi-disciplinary Trends in Artificial Intelligence</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff23"><AuthorName DisplayOrder="Western"><GivenName>P.</GivenName><GivenName>Pavan</GivenName><FamilyName>Kumar</FamilyName></AuthorName><Contact><Email>pavan.ppkumar@gmail.com</Email></Contact></Author><Author AffiliationIDS="Aff23"><AuthorName DisplayOrder="Western"><GivenName>Arun</GivenName><FamilyName>Agarwal</FamilyName></AuthorName><Contact><Email>aruncs@uohyd.ernet.in</Email></Contact></Author><Author AffiliationIDS="Aff23"><AuthorName DisplayOrder="Western"><GivenName>Chakravarthy</GivenName><FamilyName>Bhagvati</FamilyName></AuthorName></Author><Affiliation ID="Aff23"><OrgDivision>Dept. of Computer and Information Sciences</OrgDivision><OrgName>University of Hyderabad</OrgName><OrgAddress><State>Hyderabad</State><Postcode>500 046</Postcode><Country>India</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Mathematical expressions</Keyword><Keyword>connected components</Keyword><Keyword>symbol formation</Keyword><Keyword>rule-based approach</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions</title></titleInfo><name type="personal"><namePart type="given">P.</namePart><namePart type="given">Pavan</namePart><namePart type="family">Kumar</namePart><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation><affiliation>E-mail: pavan.ppkumar@gmail.com</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Arun</namePart><namePart type="family">Agarwal</namePart><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation><affiliation>E-mail: aruncs@uohyd.ernet.in</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Chakravarthy</namePart><namePart type="family">Bhagvati</namePart><affiliation>Dept. of Computer and Information Sciences, University of Hyderabad, 500 046, Hyderabad, India</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Automated understanding of mathematical expressions (MEs) is currently a challenging task due to their complex two- dimensional (2D) structure. Recognition of MEs can be online or offline and in either case, the process involves symbol recognition and analysis of 2D structure. This process is more complex for offline or printed MEs as they do not have temporal information. In our present work, we focus on the recognition of printed MEs and assume connected components (ccs) of a given ME image are labelled. Our approach to ME recognition comprises three stages,namely symbol formation, structural analysis and generation of encoding form like LATEX. In this paper, we present symbol formation process, where multi-cc symbols (like =, ≡ etc.) are formed, identity of context-dependent symbols (like a horizontal line can be MINUS, OVERBAR, FRACTION etc.) are resolved using spatial relations. Multi-line MEs like matrices and enumerated functions are also handled in this stage. A rule-based approach is proposed for the purpose, where the heuristics based on spatial relations are represented in the form of rules (knowledge) and those rules are fired depending on input data (labelled ccs). As knowledge is isolated from data like an expert system in our approach, it allows for easy adaptability and extensibility of the process. Proposed approach also handles both single-line and multi-line MEs in an unified manner. Our approach has been tested on around 800 MEs collected from various mathematical documents and experimental results are reported on them.</abstract><relatedItem type="host"><titleInfo><title>Multi-disciplinary Trends in Artificial Intelligence</title><subTitle>5th International Workshop, MIWAI 2011, Hyderabad, India, December 7-9, 2011. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Chattrakul</namePart><namePart type="family">Sombattheera</namePart><affiliation>Faculty of Informatics, Mahasarakham University, Khamreing, 44150, Kantarawichai, Mahasarakham, Thailand</affiliation><affiliation>E-mail: chattrakul.s@msu.ac.th</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Arun</namePart><namePart type="family">Agarwal</namePart><affiliation>Department of Computers and Information Science, University of Hyderabad, 500046, Hyderabad, Andhra Pradesh, India</affiliation><affiliation>E-mail: aruncs@uohyd.ernet.in</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Siba</namePart><namePart type="given">K</namePart><namePart type="family">Udgata</namePart><affiliation>Department of Computer and Information Sciences, University of Hyderabad, 500046, Hyderabad, India</affiliation><affiliation>E-mail: udgatacs@uohyd.ernet.in</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Kittichai</namePart><namePart type="family">Lavangnananda</namePart><affiliation>School of Information Technology, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand</affiliation><affiliation>E-mail: kitt@sit.kmutt.ac.th</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl. Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic></subject><identifier type="DOI">10.1007/978-3-642-25725-4</identifier><identifier type="ISBN">978-3-642-25724-7</identifier><identifier type="eISBN">978-3-642-25725-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">300432</identifier><identifier type="BookID">978-3-642-25725-4</identifier><identifier type="BookChapterCount">37</identifier><identifier type="BookVolumeNumber">7080</identifier><identifier type="BookSequenceNumber">7080</identifier><part><date>2011</date><detail type="volume"><number>7080</number><caption>vol.</caption></detail><extent unit="pages"><start>181</start><end>192</end></extent></part><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Randy</namePart><namePart type="family">Goebel</namePart><affiliation>University of Alberta, Edmonton, Canada</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Wolfgang</namePart><namePart type="family">Wahlster</namePart><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Chattrakul</namePart><namePart type="family">Sombattheera</namePart><affiliation>Faculty of Informatics, Mahasarakham University, Khamreing, 44150, Kantarawichai, Mahasarakham, Thailand</affiliation><affiliation>E-mail: chattrakul.s@msu.ac.th</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Arun</namePart><namePart type="family">Agarwal</namePart><affiliation>Department of Computers and Information Science, University of Hyderabad, 500046, Hyderabad, Andhra Pradesh, India</affiliation><affiliation>E-mail: aruncs@uohyd.ernet.in</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Siba</namePart><namePart type="given">K</namePart><namePart type="family">Udgata</namePart><affiliation>Department of Computer and Information Sciences, University of Hyderabad, 500046, Hyderabad, India</affiliation><affiliation>E-mail: udgatacs@uohyd.ernet.in</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Kittichai</namePart><namePart type="family">Lavangnananda</namePart><affiliation>School of Information Technology, King Mongkut’s University of Technology, Thonburi, Bangkok, Thailand</affiliation><affiliation>E-mail: kitt@sit.kmutt.ac.th</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Sub-Series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">CD55B10CDA8FFBAD75443D3416B48C9ACD46753F</identifier><identifier type="DOI">10.1007/978-3-642-25725-4_16</identifier><identifier type="ChapterID">16</identifier><identifier type="ChapterID">Chap16</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/CD55B10CDA8FFBAD75443D3416B48C9ACD46753F/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><monogr><title level="m" type="main">PrintedMEs.zip 2. flex++(1):fast lexical analyzer generator-Linux man page</title><imprint></imprint></monogr></biblStruct><biblStruct xml:id="b1"><monogr><title level="m" type="main">Towards handwritten mathematical expression recognition</title><author><persName><forename type="first">A.-M</forename><surname>Awal</surname></persName></author><author><persName><forename type="first">H</forename><surname>Mouchere</surname></persName></author><author><persName><forename type="first">C</forename><surname>Viard-Gaudin</surname></persName></author><imprint><date type="published" when="2009"></date><publisher>IEEE Computer Society</publisher><biblScope unit="page" from="1046" to="1050"></biblScope><pubPlace>Washington, DC</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b2"><monogr><title level="m" type="main">Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project</title><author><persName><forename type="first">B</forename><forename type="middle">G</forename><surname>Buchanan</surname></persName></author><author><persName><forename type="first">E</forename><forename type="middle">H</forename><surname>Shortliffe</surname></persName></author><imprint><date type="published" when="1984"></date><publisher>Addison-Wesley</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Mathematical expression recognition: a survey</title><author><persName><forename type="first">K.-F</forename><surname>Chan</surname></persName></author><author><persName><forename type="first">D.-Y</forename><surname>Yeung</surname></persName></author></analytic><monogr><title level="j">IJ- DAR</title><imprint><biblScope unit="volume">3</biblScope><biblScope unit="page" from="3" to="15"></biblScope><date type="published" when="2000"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">An approach for recognition and interpretation of mathematical expressions in printed document</title><author><persName><forename type="first">B</forename><forename type="middle">B</forename><surname>Chaudhuri</surname></persName></author><author><persName><forename type="first">U</forename><surname>Garain</surname></persName></author></analytic><monogr><title level="j">Pattern Analysis and Applications</title><imprint><biblScope unit="volume">3</biblScope><biblScope unit="page" from="120" to="131"></biblScope><date type="published" when="2000"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><monogr><title level="m" type="main">Mathematical formula recognition using virtual link network</title><author><persName><forename type="first">Y</forename><surname>Eto</surname></persName></author><author><persName><forename type="first">M</forename><surname>Suzuki</surname></persName></author><imprint><date type="published" when="2001"></date><publisher>IEEE Computer Society</publisher><biblScope unit="page" from="762" to="767"></biblScope><pubPlace>Washington, DC</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b6"><monogr><title level="m" type="main">A technique of mathematical expression structure analysis for the handwriting input system</title><author><persName><forename type="first">R</forename><surname>Fukuda</surname></persName></author><author><persName><forename type="first">I</forename><surname>Sou</surname></persName></author><author><persName><forename type="first">F</forename><surname>Tamari</surname></persName></author><author><persName><forename type="first">X</forename><surname>Ming</surname></persName></author><author><persName><forename type="first">M</forename><surname>Suzuki</surname></persName></author><imprint><date type="published" when="1999"></date><publisher>IEEE Computer Society</publisher><biblScope unit="page">131</biblScope><pubPlace>Washington, DC</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">Recognition of online handwritten mathematical expressions</title><author><persName><forename type="first">U</forename><surname>Garain</surname></persName></author><author><persName><forename type="first">B</forename><forename type="middle">B</forename><surname>Chaudhuri</surname></persName></author></analytic><monogr><title level="j">IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics</title><imprint><biblScope unit="volume">34</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="2366" to="2376"></biblScope><date type="published" when="2004"></date></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">Detection of matrices and segmentation of matrix elements in scanned images of scientific documents</title><author><persName><forename type="first">T</forename><surname>Kanahori</surname></persName></author><author><persName><forename type="first">M</forename><surname>Suzuki</surname></persName></author></analytic><monogr><title level="m">ICDAR 2003</title><meeting><address><addrLine>Washington, DC</addrLine></address></meeting><imprint><publisher>IEEE Computer Society</publisher><date type="published" when="2003"></date><biblScope unit="page">433</biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b9"><monogr><title level="m" type="main">Design of a mathematical expression recognition system</title><author><persName><forename type="first">H</forename><forename type="middle">J</forename><surname>Lee</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">S</forename><surname>Wang</surname></persName></author><imprint><date type="published" when="1995"></date><biblScope unit="page" from="1084" to="1087"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b10"><monogr><title level="m" type="main">Online recognition of handwritten mathematical expressions with support for matrices</title><author><persName><forename type="first">C</forename><surname>Li</surname></persName></author><author><persName><forename type="first">R</forename><forename type="middle">C</forename><surname>Zeleznik</surname></persName></author><author><persName><forename type="first">T</forename><surname>Miller</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">J</forename><surname>Laviola</surname></persName></author><imprint><date type="published" when="2008"></date><biblScope unit="page" from="1" to="4"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b11"><analytic><title level="a" type="main">Infty-an integrated OCR system for mathematical documents</title><author><persName><forename type="first">M</forename><surname>Suzuki</surname></persName></author><author><persName><forename type="first">F</forename><surname>Tamari</surname></persName></author><author><persName><forename type="first">R</forename><surname>Fukuda</surname></persName></author><author><persName><forename type="first">S</forename><surname>Uchida</surname></persName></author><author><persName><forename type="first">T</forename><surname>Kanahori</surname></persName></author></analytic><monogr><title level="m">Proceedings of ACM Symposium on Document Engineering</title><meeting>ACM Symposium on Document Engineering</meeting><imprint><publisher>ACM Press</publisher><date type="published" when="2003"></date><biblScope unit="page" from="95" to="104"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b12"><monogr><title level="m" type="main">Recognition of on-line handwritten mathematical formulas in the E-Chalk System</title><author><persName><forename type="first">E</forename><surname>Tapia</surname></persName></author><author><persName><forename type="first">R</forename><surname>Rojas</surname></persName></author><imprint><date type="published" when="2003"></date><biblScope unit="page">980</biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b13"><analytic><title level="a" type="main">Recognition of On-Line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance</title><author><persName><forename type="first">E</forename><surname>Tapia</surname></persName></author><author><persName><forename type="first">R</forename><surname>Rojas</surname></persName></author></analytic><monogr><title level="m">GREC 2003</title><editor>Lladós, J., Kwon, Y.-B.</editor><meeting><address><addrLine>Heidelberg</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="2004"></date><biblScope unit="page" from="329" to="340"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b14"><analytic><title level="a" type="main">Research on symbol recognition for mathematical expressions</title><author><persName><forename type="first">X.-D</forename><surname>Tian</surname></persName></author><author><persName><forename type="first">H.-Y</forename><surname>Li</surname></persName></author><author><persName><forename type="first">X.-F</forename><surname>Li</surname></persName></author><author><persName><forename type="first">L.-P</forename><surname>Zhang</surname></persName></author></analytic><monogr><title level="m">International Conference on Innovative Computing , Information and Control</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society</publisher><date type="published" when="2006"></date><biblScope unit="page" from="357" to="360"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b15"><analytic><title level="a" type="main">Structural analysis based on baseline in printed mathematical expressions</title><author><persName><forename type="first">X</forename><surname>Tian</surname></persName></author><author><persName><forename type="first">H</forename><surname>Fan</surname></persName></author></analytic><monogr><title level="m">International Conference on Parallel and Distributed Computing Applications and Technologies, PDCAT 2005</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society</publisher><date type="published" when="2005"></date><biblScope unit="page" from="787" to="790"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b16"><analytic><title level="a" type="main">A Recognition Method of Matrices by Using Variable Block Pattern Elements Generating Rectangular Area</title><author><persName><forename type="first">K</forename><surname>Toshihiro</surname></persName></author><author><persName><forename type="first">S</forename><surname>Masakazu</surname></persName></author></analytic><monogr><title level="m">GREC 2001</title><editor>Blostein, D., Kwon, Y.- B.</editor><meeting><address><addrLine>Heidelberg</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="2002"></date><biblScope unit="page" from="320" to="329"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b17"><analytic><title level="a" type="main">Structure analysis and recognition of mathematical expressions</title><author><persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Twaaliyondo</surname></persName></author><author><persName><forename type="first">M</forename><surname>Okamoto</surname></persName></author></analytic><monogr><title level="m">ICDAR 1995</title><meeting><address><addrLine>Washington, DC</addrLine></address></meeting><imprint><publisher>IEEE Computer Society</publisher><date type="published" when="1995"></date><biblScope unit="page">430</biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b18"><analytic><title level="a" type="main">Progressive structural analysis for dynamic recognition of on-line handwritten mathematical expressions</title><author><persName><forename type="first">B.-Q</forename><surname>Vuong</surname></persName></author><author><persName><forename type="first">S.-C</forename><surname>Hui</surname></persName></author><author><persName><forename type="first">Y</forename><surname>He</surname></persName></author></analytic><monogr><title level="j">Pattern Recognition Letters</title><imprint><biblScope unit="volume">29</biblScope><biblScope unit="page" from="647" to="655"></biblScope><date type="published" when="2008"></date></imprint></monogr></biblStruct><biblStruct xml:id="b19"><analytic><title level="a" type="main">Recognizing mathematical expressions using tree transformation</title><author><persName><forename type="first">R</forename><surname>Zanibbi</surname></persName></author><author><persName><forename type="first">D</forename><surname>Blostein</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">R</forename><surname>Cordy</surname></persName></author></analytic><monogr><title level="j">IEEE Transactions on PAMI</title><imprint><biblScope unit="volume">24</biblScope><biblScope unit="page" from="1455" to="1467"></biblScope><date type="published" when="2002"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001492 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001492 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:CD55B10CDA8FFBAD75443D3416B48C9ACD46753F
|texte= A Rule-Based Approach to Form Mathematical Symbols in Printed Mathematical Expressions
}}
| This area was generated with Dilib version V0.6.32. |  |