AustralieFrV1, PascalFrancis, Checkpoint, bibRecord, 005912

Decomposition of partially occluded strings in the presence of errors

Identifieur interne : 005912 ( PascalFrancis/Checkpoint ); précédent : 005911; suivant : 005913

Decomposition of partially occluded strings in the presence of errors

Auteurs : Costas S. Iliopoulos [Royaume-Uni, Australie] ; James F. Reid [Royaume-Uni, Italie]

Source :

International journal of pattern recognition and artificial intelligence [ 0218-0014 ] ; 2001.

RBID : Pascal:02-0104925

Descripteurs français

Pascal (Inist)
- Estimation erreur, Chevauchement, Occultation, Reconnaissance forme, Occlusion, Structure donnée, Traitement image.

English descriptors

KwdEn :
- Data structure, Error estimation, Image processing, Occlusion, Occultation, Overlap, Pattern recognition.

Abstract

A partially occluded scene in an image consists of a number of objects that are partially obstructed by others. By validating a partially occluded image one aims to generate a sequence of concatenated and possibly overlapping objects that corresponds to the input image. This is a theoretical study of partially occluded strings (considered as one-dimensional images) allowing for the presence of errors in each occluded object appearing in the input. Using the unit cost edit distance as our measure of errors, for some small integer k > 0, we present a sequential algorithm for validating a k-approximate one-dimensional image x of length n over a dictionary D of m objects each having equal length r in O(nd) time where d = mr is the size of the dictionary.

Affiliations:

Australie, Italie, Royaume-Uni

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 005993
to stream PascalFrancis, to step Curation: 000746

Links to Exploration step

Pascal:02-0104925

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Decomposition of partially occluded strings in the presence of errors</title>
<author><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, King's College London</s1>
<s2>Strand, London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Strand, London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>School of Computing, Curtin University of Technology</s1>
<s2>Perth, WA 6102</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>Perth, WA 6102</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Reid, James F" sort="Reid, James F" uniqKey="Reid J" first="James F." last="Reid">James F. Reid</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, King's College London</s1>
<s2>Strand, London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Strand, London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>LNCIB, AREA Science Park, Padriciano 99</s1>
<s2>Trieste 34012</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
<wicri:noRegion>Trieste 34012</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0104925</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0104925 INIST</idno>
<idno type="RBID">Pascal:02-0104925</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">005993</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000746</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">005912</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">005912</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Decomposition of partially occluded strings in the presence of errors</title>
<author><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, King's College London</s1>
<s2>Strand, London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Strand, London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>School of Computing, Curtin University of Technology</s1>
<s2>Perth, WA 6102</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Australie</country>
<wicri:noRegion>Perth, WA 6102</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Reid, James F" sort="Reid, James F" uniqKey="Reid J" first="James F." last="Reid">James F. Reid</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, King's College London</s1>
<s2>Strand, London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Royaume-Uni</country>
<wicri:noRegion>Strand, London WC2R 2LS</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>LNCIB, AREA Science Park, Padriciano 99</s1>
<s2>Trieste 34012</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
<wicri:noRegion>Trieste 34012</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">International journal of pattern recognition and artificial intelligence</title>
<title level="j" type="abbreviated">Int. j. pattern recogn. artif. intell.</title>
<idno type="ISSN">0218-0014</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">International journal of pattern recognition and artificial intelligence</title>
<title level="j" type="abbreviated">Int. j. pattern recogn. artif. intell.</title>
<idno type="ISSN">0218-0014</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Data structure</term>
<term>Error estimation</term>
<term>Image processing</term>
<term>Occlusion</term>
<term>Occultation</term>
<term>Overlap</term>
<term>Pattern recognition</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Estimation erreur</term>
<term>Chevauchement</term>
<term>Occultation</term>
<term>Reconnaissance forme</term>
<term>Occlusion</term>
<term>Structure donnée</term>
<term>Traitement image</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A partially occluded scene in an image consists of a number of objects that are partially obstructed by others. By validating a partially occluded image one aims to generate a sequence of concatenated and possibly overlapping objects that corresponds to the input image. This is a theoretical study of partially occluded strings (considered as one-dimensional images) allowing for the presence of errors in each occluded object appearing in the input. Using the unit cost edit distance as our measure of errors, for some small integer k > 0, we present a sequential algorithm for validating a k-approximate one-dimensional image x of length n over a dictionary D of m objects each having equal length r in O(nd) time where d = mr is the size of the dictionary.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0218-0014</s0>
</fA01>
<fA03 i2="1"><s0>Int. j. pattern recogn. artif. intell.</s0>
</fA03>
<fA05><s2>15</s2>
</fA05>
<fA06><s2>7</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Decomposition of partially occluded strings in the presence of errors</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Combinatorial Image Analysis</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>ILIOPOULOS (Costas S.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>REID (James F.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>MALGOUYRES (Rémy)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Department of Computer Science, King's College London</s1>
<s2>Strand, London WC2R 2LS</s2>
<s3>GBR</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>School of Computing, Curtin University of Technology</s1>
<s2>Perth, WA 6102</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LNCIB, AREA Science Park, Padriciano 99</s1>
<s2>Trieste 34012</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>LLAIC, IUT Dépt. Informatique</s1>
<s2>63172 Aubière</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>1129-1142</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>22088</s2>
<s5>354000094291440080</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>12 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0104925</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>International journal of pattern recognition and artificial intelligence</s0>
</fA64>
<fA66 i1="01"><s0>SGP</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A partially occluded scene in an image consists of a number of objects that are partially obstructed by others. By validating a partially occluded image one aims to generate a sequence of concatenated and possibly overlapping objects that corresponds to the input image. This is a theoretical study of partially occluded strings (considered as one-dimensional images) allowing for the presence of errors in each occluded object appearing in the input. Using the unit cost edit distance as our measure of errors, for some small integer k > 0, we present a sequential algorithm for validating a k-approximate one-dimensional image x of length n over a dictionary D of m objects each having equal length r in O(nd) time where d = mr is the size of the dictionary.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Estimation erreur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Error estimation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Estimación error</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Chevauchement</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Overlap</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Imbricación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Occultation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Occultation</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Ocultación</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Occlusion</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Occlusion</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Oclusión</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Structure donnée</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Data structure</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Estructura datos</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Traitement image</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Image processing</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Procesamiento imagen</s0>
<s5>07</s5>
</fC03>
<fN21><s1>056</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Australie</li>
<li>Italie</li>
<li>Royaume-Uni</li>
</country>
</list>
<tree><country name="Royaume-Uni"><noRegion><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
</noRegion>
<name sortKey="Reid, James F" sort="Reid, James F" uniqKey="Reid J" first="James F." last="Reid">James F. Reid</name>
</country>
<country name="Australie"><noRegion><name sortKey="Iliopoulos, Costas S" sort="Iliopoulos, Costas S" uniqKey="Iliopoulos C" first="Costas S." last="Iliopoulos">Costas S. Iliopoulos</name>
</noRegion>
</country>
<country name="Italie"><noRegion><name sortKey="Reid, James F" sort="Reid, James F" uniqKey="Reid J" first="James F." last="Reid">James F. Reid</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005912 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 005912 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:02-0104925
   |texte=   Decomposition of partially occluded strings in the presence of errors
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	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.

Serveur d'exploration sur les relations entre la France et l'Australie

Decomposition of partially occluded strings in the presence of errors

Decomposition of partially occluded strings in the presence of errors

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri