Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Recognition and reconstruction of primitives in music scores

Identifieur interne : 000B41 ( Istex/Corpus ); précédent : 000B40; suivant : 000B42

Recognition and reconstruction of primitives in music scores

Auteurs : K. C. Ng ; R. D. Boyle

Source :

RBID : ISTEX:941463C21D67B84996EDC75110B95E2D9B1C31AC

Abstract

Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.

Url:
DOI: 10.1016/0262-8856(95)01038-6

Links to Exploration step

ISTEX:941463C21D67B84996EDC75110B95E2D9B1C31AC

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title>Recognition and reconstruction of primitives in music scores</title>
<author>
<name sortKey="Ng, K C" sort="Ng, K C" uniqKey="Ng K" first="K. C." last="Ng">K. C. Ng</name>
<affiliation>
<mods:affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kia@scs.leeds.ac.uk</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Boyle, R D" sort="Boyle, R D" uniqKey="Boyle R" first="R. D." last="Boyle">R. D. Boyle</name>
<affiliation>
<mods:affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kia@scs.leeds.ac.uk</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:941463C21D67B84996EDC75110B95E2D9B1C31AC</idno>
<date when="1996" year="1996">1996</date>
<idno type="doi">10.1016/0262-8856(95)01038-6</idno>
<idno type="url">https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000B41</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a">Recognition and reconstruction of primitives in music scores</title>
<author>
<name sortKey="Ng, K C" sort="Ng, K C" uniqKey="Ng K" first="K. C." last="Ng">K. C. Ng</name>
<affiliation>
<mods:affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kia@scs.leeds.ac.uk</mods:affiliation>
</affiliation>
</author>
<author>
<name sortKey="Boyle, R D" sort="Boyle, R D" uniqKey="Boyle R" first="R. D." last="Boyle">R. D. Boyle</name>
<affiliation>
<mods:affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</mods:affiliation>
</affiliation>
<affiliation>
<mods:affiliation>E-mail: kia@scs.leeds.ac.uk</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Image and Vision Computing</title>
<title level="j" type="abbrev">IMAVIS</title>
<idno type="ISSN">0262-8856</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1994">1994</date>
<biblScope unit="volume">14</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="39">39</biblScope>
<biblScope unit="page" to="46">46</biblScope>
</imprint>
<idno type="ISSN">0262-8856</idno>
</series>
<idno type="istex">941463C21D67B84996EDC75110B95E2D9B1C31AC</idno>
<idno type="DOI">10.1016/0262-8856(95)01038-6</idno>
<idno type="PII">0262-8856(95)01038-6</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0262-8856</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.</div>
</front>
</TEI>
<istex>
<corpusName>elsevier</corpusName>
<author>
<json:item>
<name>K.C. Ng</name>
<affiliations>
<json:string>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</json:string>
<json:string>E-mail: kia@scs.leeds.ac.uk</json:string>
</affiliations>
</json:item>
<json:item>
<name>R.D. Boyle</name>
<affiliations>
<json:string>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</json:string>
<json:string>E-mail: kia@scs.leeds.ac.uk</json:string>
</affiliations>
</json:item>
</author>
<subject>
<json:item>
<lang>
<json:string>eng</json:string>
</lang>
<value>Document analysis</value>
</json:item>
<json:item>
<lang>
<json:string>eng</json:string>
</lang>
<value>OCR</value>
</json:item>
<json:item>
<lang>
<json:string>eng</json:string>
</lang>
<value>Score recognition</value>
</json:item>
</subject>
<language>
<json:string>eng</json:string>
</language>
<abstract>Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.</abstract>
<qualityIndicators>
<score>5.717</score>
<pdfVersion>1.2</pdfVersion>
<pdfPageSize>612 x 792 pts (letter)</pdfPageSize>
<refBibsNative>true</refBibsNative>
<keywordCount>3</keywordCount>
<abstractCharCount>789</abstractCharCount>
<pdfWordCount>4301</pdfWordCount>
<pdfCharCount>25649</pdfCharCount>
<pdfPageCount>8</pdfPageCount>
<abstractWordCount>118</abstractWordCount>
</qualityIndicators>
<title>Recognition and reconstruction of primitives in music scores</title>
<pii>
<json:string>0262-8856(95)01038-6</json:string>
</pii>
<genre>
<json:string>research-article</json:string>
</genre>
<serie>
<volume>Vol 5</volume>
<genre></genre>
<language>
<json:string>unknown</json:string>
</language>
<title>Oxford Psychology Series</title>
</serie>
<host>
<volume>14</volume>
<pii>
<json:string>S0262-8856(00)X0015-7</json:string>
</pii>
<pages>
<last>46</last>
<first>39</first>
</pages>
<issn>
<json:string>0262-8856</json:string>
</issn>
<issue>1</issue>
<genre>
<json:string>Journal</json:string>
</genre>
<language>
<json:string>unknown</json:string>
</language>
<title>Image and Vision Computing</title>
<publicationDate>1996</publicationDate>
</host>
<categories>
<wos>
<json:string>COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</json:string>
<json:string>COMPUTER SCIENCE, SOFTWARE ENGINEERING</json:string>
<json:string>COMPUTER SCIENCE, THEORY & METHODS</json:string>
<json:string>ENGINEERING, ELECTRICAL & ELECTRONIC</json:string>
<json:string>OPTICS</json:string>
</wos>
</categories>
<publicationDate>1994</publicationDate>
<copyrightDate>1996</copyrightDate>
<doi>
<json:string>10.1016/0262-8856(95)01038-6</json:string>
</doi>
<id>941463C21D67B84996EDC75110B95E2D9B1C31AC</id>
<fulltext>
<json:item>
<original>true</original>
<mimetype>application/pdf</mimetype>
<extension>pdf</extension>
<uri>https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/fulltext/pdf</uri>
</json:item>
<json:item>
<original>true</original>
<mimetype>text/plain</mimetype>
<extension>txt</extension>
<uri>https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/fulltext/txt</uri>
</json:item>
<json:item>
<original>false</original>
<mimetype>application/zip</mimetype>
<extension>zip</extension>
<uri>https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/fulltext/tei">
<teiHeader>
<fileDesc>
<titleStmt>
<title level="a">Recognition and reconstruction of primitives in music scores</title>
</titleStmt>
<publicationStmt>
<authority>ISTEX</authority>
<publisher>ELSEVIER</publisher>
<availability>
<p>ELSEVIER</p>
</availability>
<date>1996</date>
</publicationStmt>
<sourceDesc>
<biblStruct type="inbook">
<analytic>
<title level="a">Recognition and reconstruction of primitives in music scores</title>
<author>
<persName>
<forename type="first">K.C.</forename>
<surname>Ng</surname>
</persName>
<email>kia@scs.leeds.ac.uk</email>
<affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</affiliation>
</author>
<author>
<persName>
<forename type="first">R.D.</forename>
<surname>Boyle</surname>
</persName>
<email>kia@scs.leeds.ac.uk</email>
<affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</affiliation>
</author>
</analytic>
<monogr>
<title level="j">Image and Vision Computing</title>
<title level="j" type="abbrev">IMAVIS</title>
<idno type="pISSN">0262-8856</idno>
<idno type="PII">S0262-8856(00)X0015-7</idno>
<imprint>
<publisher>ELSEVIER</publisher>
<date type="published" when="1994"></date>
<biblScope unit="volume">14</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="39">39</biblScope>
<biblScope unit="page" to="46">46</biblScope>
</imprint>
</monogr>
<idno type="istex">941463C21D67B84996EDC75110B95E2D9B1C31AC</idno>
<idno type="DOI">10.1016/0262-8856(95)01038-6</idno>
<idno type="PII">0262-8856(95)01038-6</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<creation>
<date>1996</date>
</creation>
<langUsage>
<language ident="en">en</language>
</langUsage>
<abstract xml:lang="en">
<p>Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.</p>
</abstract>
<textClass>
<keywords scheme="keyword">
<list>
<head>Keywords</head>
<item>
<term>Document analysis</term>
</item>
<item>
<term>OCR</term>
</item>
<item>
<term>Score recognition</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc>
<change when="1994-04-25">Received</change>
<change when="1995-03-20">Modified</change>
<change when="1994">Published</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
</fulltext>
<metadata>
<istex:metadataXml wicri:clean="Elsevier, elements deleted: tail">
<istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType>
<istex:document>
<converted-article version="4.5.2" docsubtype="fla">
<item-info>
<jid>IMAVIS</jid>
<aid>95010386</aid>
<ce:pii>0262-8856(95)01038-6</ce:pii>
<ce:doi>10.1016/0262-8856(95)01038-6</ce:doi>
<ce:copyright type="unknown" year="1996"></ce:copyright>
</item-info>
<head>
<ce:title>Recognition and reconstruction of primitives in music scores</ce:title>
<ce:author-group>
<ce:author>
<ce:given-name>K.C.</ce:given-name>
<ce:surname>Ng</ce:surname>
<ce:e-address>kia@scs.leeds.ac.uk</ce:e-address>
</ce:author>
<ce:author>
<ce:given-name>R.D.</ce:given-name>
<ce:surname>Boyle</ce:surname>
<ce:e-address>roger@scs.leeds.ac.uk</ce:e-address>
</ce:author>
<ce:affiliation>
<ce:textfn>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</ce:textfn>
</ce:affiliation>
</ce:author-group>
<ce:date-received day="25" month="4" year="1994"></ce:date-received>
<ce:date-revised day="20" month="3" year="1995"></ce:date-revised>
<ce:abstract>
<ce:section-title>Abstract</ce:section-title>
<ce:abstract-sec>
<ce:simple-para>Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.</ce:simple-para>
</ce:abstract-sec>
</ce:abstract>
<ce:keywords>
<ce:section-title>Keywords</ce:section-title>
<ce:keyword>
<ce:text>Document analysis</ce:text>
</ce:keyword>
<ce:keyword>
<ce:text>OCR</ce:text>
</ce:keyword>
<ce:keyword>
<ce:text>Score recognition</ce:text>
</ce:keyword>
</ce:keywords>
</head>
</converted-article>
</istex:document>
</istex:metadataXml>
<mods version="3.6">
<titleInfo>
<title>Recognition and reconstruction of primitives in music scores</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA">
<title>Recognition and reconstruction of primitives in music scores</title>
</titleInfo>
<name type="personal">
<namePart type="given">K.C.</namePart>
<namePart type="family">Ng</namePart>
<affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</affiliation>
<affiliation>E-mail: kia@scs.leeds.ac.uk</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">R.D.</namePart>
<namePart type="family">Boyle</namePart>
<affiliation>Division of Artificial Intelligence, School of Computer Studies, The University of Leeds, Leeds LS2 9JT, UK</affiliation>
<affiliation>E-mail: kia@scs.leeds.ac.uk</affiliation>
<role>
<roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="Full-length article"></genre>
<originInfo>
<publisher>ELSEVIER</publisher>
<dateIssued encoding="w3cdtf">1994</dateIssued>
<dateCaptured encoding="w3cdtf">1994-04-25</dateCaptured>
<dateModified encoding="w3cdtf">1995-03-20</dateModified>
<copyrightDate encoding="w3cdtf">1996</copyrightDate>
</originInfo>
<language>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
<languageTerm type="code" authority="rfc3066">en</languageTerm>
</language>
<physicalDescription>
<internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract lang="en">Music recognition bears similarities and differences to OCR. In this paper we identify some of the problems peculiar to musical scores, and propose an approach which succeeds in a wide range of non-trivial cases. The composer customarily proceeds by writing notes, then stems, beams, ties and slurs — we have inverted this approach by segmenting and then subsegmenting scores to recapture the component parts of symbols. In this paper, we concentrate on the strategy of recognizing sub-segmented primitives, and the reassembly process which reconstructs low level graphical primitives back to musical symbols. The sub-segmentation process proves to be worthwhile, since many primitives complement each other and high level musical theory can be employed to enhance the recognition process.</abstract>
<subject>
<genre>Keywords</genre>
<topic>Document analysis</topic>
<topic>OCR</topic>
<topic>Score recognition</topic>
</subject>
<relatedItem type="host">
<titleInfo>
<title>Image and Vision Computing</title>
</titleInfo>
<titleInfo type="abbreviated">
<title>IMAVIS</title>
</titleInfo>
<genre type="Journal">journal</genre>
<originInfo>
<dateIssued encoding="w3cdtf">199602</dateIssued>
</originInfo>
<identifier type="ISSN">0262-8856</identifier>
<identifier type="PII">S0262-8856(00)X0015-7</identifier>
<part>
<date>199602</date>
<detail type="issue">
<title>Image and Vision Computing Journal on Vision-Based Aids for the Disabled</title>
</detail>
<detail type="volume">
<number>14</number>
<caption>vol.</caption>
</detail>
<detail type="issue">
<number>1</number>
<caption>no.</caption>
</detail>
<extent unit="issue pages">
<start>3</start>
<end>88</end>
</extent>
<extent unit="pages">
<start>39</start>
<end>46</end>
</extent>
</part>
</relatedItem>
<identifier type="istex">941463C21D67B84996EDC75110B95E2D9B1C31AC</identifier>
<identifier type="DOI">10.1016/0262-8856(95)01038-6</identifier>
<identifier type="PII">0262-8856(95)01038-6</identifier>
<recordInfo>
<recordContentSource>ELSEVIER</recordContentSource>
</recordInfo>
</mods>
</metadata>
<enrichments>
<istex:catWosTEI uri="https://api.istex.fr/document/941463C21D67B84996EDC75110B95E2D9B1C31AC/enrichments/catWos">
<teiHeader>
<profileDesc>
<textClass>
<classCode scheme="WOS">COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE</classCode>
<classCode scheme="WOS">COMPUTER SCIENCE, SOFTWARE ENGINEERING</classCode>
<classCode scheme="WOS">COMPUTER SCIENCE, THEORY & METHODS</classCode>
<classCode scheme="WOS">ENGINEERING, ELECTRICAL & ELECTRONIC</classCode>
<classCode scheme="WOS">OPTICS</classCode>
</textClass>
</profileDesc>
</teiHeader>
</istex:catWosTEI>
</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 000B41 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000B41 | 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:941463C21D67B84996EDC75110B95E2D9B1C31AC
   |texte=   Recognition and reconstruction of primitives in music scores
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024