Pattern matching of 2‐D shape using hierarchical descriptions
Identifieur interne : 000830 ( Main/Exploration ); précédent : 000829; suivant : 000831Pattern matching of 2‐D shape using hierarchical descriptions
Auteurs : Satoru Morita ; Toshio Kawashima ; Yoshinao AokiSource :
- Systems and Computers in Japan [ 0882-1666 ] ; 1991.
Abstract
This paper introduces a system for hierarchical description of two‐dimensional shapes on the basis of scale space analysis. We propose a group of simple primitives for describing curved line segments; they are suitable for hierarchical analysis. To realize effective matching, nineteen rules are necessary and sufficient to derive a tree. The tree derived from the analysis yields the hierarchical structure of a shape and enables efficient matching of objects in a top‐down manner. An algorithm to create a compact database from trees is also shown. The sophisticated database is shown to be useful for recognizing objects by their category. Several examples showed that matching for skewed or occluded shapes can be done by searching for a subtree in the database.
Url:
DOI: 10.1002/scj.4690221005
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000787
- to stream Istex, to step Curation: 000753
- to stream Istex, to step Checkpoint: 000781
- to stream Main, to step Merge: 000833
- to stream Main, to step Curation: 000830
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Pattern matching of 2‐D shape using hierarchical descriptions</title>
<author><name sortKey="Morita, Satoru" sort="Morita, Satoru" uniqKey="Morita S" first="Satoru" last="Morita">Satoru Morita</name>
</author>
<author><name sortKey="Kawashima, Toshio" sort="Kawashima, Toshio" uniqKey="Kawashima T" first="Toshio" last="Kawashima">Toshio Kawashima</name>
</author>
<author><name sortKey="Aoki, Yoshinao" sort="Aoki, Yoshinao" uniqKey="Aoki Y" first="Yoshinao" last="Aoki">Yoshinao Aoki</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:A03BB84FFAADFF27C0B02692AC7696D8580D5577</idno>
<date when="1991" year="1991">1991</date>
<idno type="doi">10.1002/scj.4690221005</idno>
<idno type="url">https://api.istex.fr/document/A03BB84FFAADFF27C0B02692AC7696D8580D5577/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000787</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000787</idno>
<idno type="wicri:Area/Istex/Curation">000753</idno>
<idno type="wicri:Area/Istex/Checkpoint">000781</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000781</idno>
<idno type="wicri:doubleKey">0882-1666:1991:Morita S:pattern:matching:of</idno>
<idno type="wicri:Area/Main/Merge">000833</idno>
<idno type="wicri:Area/Main/Curation">000830</idno>
<idno type="wicri:Area/Main/Exploration">000830</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Pattern matching of 2‐D shape using hierarchical descriptions</title>
<author><name sortKey="Morita, Satoru" sort="Morita, Satoru" uniqKey="Morita S" first="Satoru" last="Morita">Satoru Morita</name>
<affiliation><wicri:noCountry code="subField">060</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Kawashima, Toshio" sort="Kawashima, Toshio" uniqKey="Kawashima T" first="Toshio" last="Kawashima">Toshio Kawashima</name>
<affiliation><wicri:noCountry code="subField">060</wicri:noCountry>
</affiliation>
</author>
<author><name sortKey="Aoki, Yoshinao" sort="Aoki, Yoshinao" uniqKey="Aoki Y" first="Yoshinao" last="Aoki">Yoshinao Aoki</name>
<affiliation><wicri:noCountry code="subField">060</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Systems and Computers in Japan</title>
<title level="j" type="abbrev">Syst. Comp. Jpn.</title>
<idno type="ISSN">0882-1666</idno>
<idno type="eISSN">1520-684X</idno>
<imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher>
<pubPlace>New York</pubPlace>
<date type="published" when="1991">1991</date>
<biblScope unit="volume">22</biblScope>
<biblScope unit="issue">10</biblScope>
<biblScope unit="page" from="40">40</biblScope>
<biblScope unit="page" to="49">49</biblScope>
</imprint>
<idno type="ISSN">0882-1666</idno>
</series>
<idno type="istex">A03BB84FFAADFF27C0B02692AC7696D8580D5577</idno>
<idno type="DOI">10.1002/scj.4690221005</idno>
<idno type="ArticleID">SCJ4690221005</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0882-1666</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper introduces a system for hierarchical description of two‐dimensional shapes on the basis of scale space analysis. We propose a group of simple primitives for describing curved line segments; they are suitable for hierarchical analysis. To realize effective matching, nineteen rules are necessary and sufficient to derive a tree. The tree derived from the analysis yields the hierarchical structure of a shape and enables efficient matching of objects in a top‐down manner. An algorithm to create a compact database from trees is also shown. The sophisticated database is shown to be useful for recognizing objects by their category. Several examples showed that matching for skewed or occluded shapes can be done by searching for a subtree in the database.</div>
</front>
</TEI>
<affiliations><list></list>
<tree><noCountry><name sortKey="Aoki, Yoshinao" sort="Aoki, Yoshinao" uniqKey="Aoki Y" first="Yoshinao" last="Aoki">Yoshinao Aoki</name>
<name sortKey="Kawashima, Toshio" sort="Kawashima, Toshio" uniqKey="Kawashima T" first="Toshio" last="Kawashima">Toshio Kawashima</name>
<name sortKey="Morita, Satoru" sort="Morita, Satoru" uniqKey="Morita S" first="Satoru" last="Morita">Satoru Morita</name>
</noCountry>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MagnificatV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000830 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000830 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Musique |area= MagnificatV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:A03BB84FFAADFF27C0B02692AC7696D8580D5577 |texte= Pattern matching of 2‐D shape using hierarchical descriptions }}
This area was generated with Dilib version V0.6.31. |