InforLorV4, PascalFrancis, Corpus, bibRecord, 000071

Mathematical morphology on hypergraphs, application to similarity and positive kernel

Identifieur interne : 000071 ( PascalFrancis/Corpus ); précédent : 000070; suivant : 000072

Mathematical morphology on hypergraphs, application to similarity and positive kernel

Auteurs : Isabelle Bloch ; Alain Bretto

Source :

Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2013.

RBID : Pascal:13-0182240

Descripteurs français

Pascal (Inist)
- Vision ordinateur, Morphologie mathématique, Treillis, Classification, Similitude, Opérateur mathématique, Dilatation, Métrique, Hypergraphe, ..

English descriptors

KwdEn :
- Classification, Computer vision, Dilatation, Hypergraph, Lattice, Mathematical morphology, Mathematical operator, Metric, Similarity.

Abstract

The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 1077-3142`
A02	`01`			`@0 CVIUF4`
A03		`1`		`@0 Comput. vis. image underst. : (Print)`
A05				`@2 117`
A06				`@2 4`
A08	`01`	`1`	`ENG`	`@1 Mathematical morphology on hypergraphs, application to similarity and positive kernel`
A09	`01`	`1`	`ENG`	`@1 Discrete Geometry for Computer Imagery`
A11	`01`	`1`		`@1 BLOCH (Isabelle)`
A11	`02`	`1`		`@1 BRETTO (Alain)`
A12	`01`	`1`		`@1 DEBLED-RENNESSON (Isabelle) @9 ed.`
A12	`02`	`1`		`@1 DOMENJOUD (Eric) @9 ed.`
A12	`03`	`1`		`@1 KERAUTRET (Bertrand) @9 ed.`
A12	`04`	`1`		`@1 EVEN (Philippe) @9 ed.`
A14	`01`			`@1 Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI @2 Paris @3 FRA @Z 1 aut.`
A14	`02`			`@1 Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072 @2 Caen @3 FRA @Z 2 aut.`
A15	`01`			`@1 LORIA (Lorraine Research Laboratory in Computer Science and its Applications), UMR 7503, Lorraine University @2 Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut.`
A20				`@1 342-354`
A21				`@1 2013`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 15463A @5 354000502487160040`
A44				`@0 0000 @1 © 2013 INIST-CNRS. All rights reserved.`
A45				`@0 33 ref.`
A47	`01`	`1`		`@0 13-0182240`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computer vision and image understanding : (Print)`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.
C02	`01`	`X`		`@0 001D02C03`
C02	`02`	`X`		`@0 001D02A06`
C03	`01`	`X`	`FRE`	`@0 Vision ordinateur @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer vision @5 01`
C03	`01`	`X`	`SPA`	`@0 Visión ordenador @5 01`
C03	`02`	`X`	`FRE`	`@0 Morphologie mathématique @5 06`
C03	`02`	`X`	`ENG`	`@0 Mathematical morphology @5 06`
C03	`02`	`X`	`SPA`	`@0 Morfología matemática @5 06`
C03	`03`	`X`	`FRE`	`@0 Treillis @5 07`
C03	`03`	`X`	`ENG`	`@0 Lattice @5 07`
C03	`03`	`X`	`SPA`	`@0 Enrejado @5 07`
C03	`04`	`X`	`FRE`	`@0 Classification @5 08`
C03	`04`	`X`	`ENG`	`@0 Classification @5 08`
C03	`04`	`X`	`SPA`	`@0 Clasificación @5 08`
C03	`05`	`X`	`FRE`	`@0 Similitude @5 09`
C03	`05`	`X`	`ENG`	`@0 Similarity @5 09`
C03	`05`	`X`	`SPA`	`@0 Similitud @5 09`
C03	`06`	`X`	`FRE`	`@0 Opérateur mathématique @5 18`
C03	`06`	`X`	`ENG`	`@0 Mathematical operator @5 18`
C03	`06`	`X`	`SPA`	`@0 Operador matemático @5 18`
C03	`07`	`X`	`FRE`	`@0 Dilatation @5 19`
C03	`07`	`X`	`ENG`	`@0 Dilatation @5 19`
C03	`07`	`X`	`SPA`	`@0 Dilatación @5 19`
C03	`08`	`X`	`FRE`	`@0 Métrique @5 20`
C03	`08`	`X`	`ENG`	`@0 Metric @5 20`
C03	`08`	`X`	`SPA`	`@0 Métrico @5 20`
C03	`09`	`X`	`FRE`	`@0 Hypergraphe @5 23`
C03	`09`	`X`	`ENG`	`@0 Hypergraph @5 23`
C03	`09`	`X`	`SPA`	`@0 Hipergráfico @5 23`
C03	`10`	`X`	`FRE`	`@0 . @4 INC @5 82`
N21				`@1 161`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 13-0182240 INIST
ET :	Mathematical morphology on hypergraphs, application to similarity and positive kernel
AU :	BLOCH (Isabelle); BRETTO (Alain); DEBLED-RENNESSON (Isabelle); DOMENJOUD (Eric); KERAUTRET (Bertrand); EVEN (Philippe)
AF :	Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI/Paris/France (1 aut.); Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072/Caen/France (2 aut.); LORIA (Lorraine Research Laboratory in Computer Science and its Applications), UMR 7503, Lorraine University/Nancy/France (1 aut., 2 aut., 3 aut., 4 aut.)
DT :	Publication en série; Niveau analytique
SO :	Computer vision and image understanding : (Print); ISSN 1077-3142; Coden CVIUF4; Pays-Bas; Da. 2013; Vol. 117; No. 4; Pp. 342-354; Bibl. 33 ref.
LA :	Anglais
EA :	The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.
CC :	001D02C03; 001D02A06
FD :	Vision ordinateur; Morphologie mathématique; Treillis; Classification; Similitude; Opérateur mathématique; Dilatation; Métrique; Hypergraphe; .
ED :	Computer vision; Mathematical morphology; Lattice; Classification; Similarity; Mathematical operator; Dilatation; Metric; Hypergraph
SD :	Visión ordenador; Morfología matemática; Enrejado; Clasificación; Similitud; Operador matemático; Dilatación; Métrico; Hipergráfico
LO :	INIST-15463A.354000502487160040
ID :	13-0182240

Links to Exploration step

Pascal:13-0182240

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Mathematical morphology on hypergraphs, application to similarity and positive kernel</title>
<author><name sortKey="Bloch, Isabelle" sort="Bloch, Isabelle" uniqKey="Bloch I" first="Isabelle" last="Bloch">Isabelle Bloch</name>
<affiliation><inist:fA14 i1="01"><s1>Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bretto, Alain" sort="Bretto, Alain" uniqKey="Bretto A" first="Alain" last="Bretto">Alain Bretto</name>
<affiliation><inist:fA14 i1="02"><s1>Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072</s1>
<s2>Caen</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">13-0182240</idno>
<date when="2013">2013</date>
<idno type="stanalyst">PASCAL 13-0182240 INIST</idno>
<idno type="RBID">Pascal:13-0182240</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000071</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Mathematical morphology on hypergraphs, application to similarity and positive kernel</title>
<author><name sortKey="Bloch, Isabelle" sort="Bloch, Isabelle" uniqKey="Bloch I" first="Isabelle" last="Bloch">Isabelle Bloch</name>
<affiliation><inist:fA14 i1="01"><s1>Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Bretto, Alain" sort="Bretto, Alain" uniqKey="Bretto A" first="Alain" last="Bretto">Alain Bretto</name>
<affiliation><inist:fA14 i1="02"><s1>Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072</s1>
<s2>Caen</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
<imprint><date when="2013">2013</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title>
<title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title>
<idno type="ISSN">1077-3142</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Classification</term>
<term>Computer vision</term>
<term>Dilatation</term>
<term>Hypergraph</term>
<term>Lattice</term>
<term>Mathematical morphology</term>
<term>Mathematical operator</term>
<term>Metric</term>
<term>Similarity</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Vision ordinateur</term>
<term>Morphologie mathématique</term>
<term>Treillis</term>
<term>Classification</term>
<term>Similitude</term>
<term>Opérateur mathématique</term>
<term>Dilatation</term>
<term>Métrique</term>
<term>Hypergraphe</term>
<term>.</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>1077-3142</s0>
</fA01>
<fA02 i1="01"><s0>CVIUF4</s0>
</fA02>
<fA03 i2="1"><s0>Comput. vis. image underst. : (Print)</s0>
</fA03>
<fA05><s2>117</s2>
</fA05>
<fA06><s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Mathematical morphology on hypergraphs, application to similarity and positive kernel</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Discrete Geometry for Computer Imagery</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BLOCH (Isabelle)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>BRETTO (Alain)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>DEBLED-RENNESSON (Isabelle)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>DOMENJOUD (Eric)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>KERAUTRET (Bertrand)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="04" i2="1"><s1>EVEN (Philippe)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI</s1>
<s2>Paris</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072</s1>
<s2>Caen</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>LORIA (Lorraine Research Laboratory in Computer Science and its Applications), UMR 7503, Lorraine University</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA15>
<fA20><s1>342-354</s1>
</fA20>
<fA21><s1>2013</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15463A</s2>
<s5>354000502487160040</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2013 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>33 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>13-0182240</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Computer vision and image understanding : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C03</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A06</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Vision ordinateur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer vision</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Visión ordenador</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Morphologie mathématique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Mathematical morphology</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Morfología matemática</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Treillis</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Lattice</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Enrejado</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Classification</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Classification</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Clasificación</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Similitude</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Similarity</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Similitud</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Opérateur mathématique</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Mathematical operator</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Operador matemático</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Dilatation</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Dilatation</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Dilatación</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Métrique</s0>
<s5>20</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Metric</s0>
<s5>20</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Métrico</s0>
<s5>20</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Hypergraphe</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Hypergraph</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Hipergráfico</s0>
<s5>23</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>161</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 13-0182240 INIST</NO>
<ET>Mathematical morphology on hypergraphs, application to similarity and positive kernel</ET>
<AU>BLOCH (Isabelle); BRETTO (Alain); DEBLED-RENNESSON (Isabelle); DOMENJOUD (Eric); KERAUTRET (Bertrand); EVEN (Philippe)</AU>
<AF>Institut Mines-Telecom, Telecom ParisTech, CNRS LTCI/Paris/France (1 aut.); Université de Basse Normandie Caen, Greyc Cnrs-Umr 6072/Caen/France (2 aut.); LORIA (Lorraine Research Laboratory in Computer Science and its Applications), UMR 7503, Lorraine University/Nancy/France (1 aut., 2 aut., 3 aut., 4 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Computer vision and image understanding : (Print); ISSN 1077-3142; Coden CVIUF4; Pays-Bas; Da. 2013; Vol. 117; No. 4; Pp. 342-354; Bibl. 33 ref.</SO>
<LA>Anglais</LA>
<EA>The focus of this article is to develop mathematical morphology on hypergraphs. To this aim, we define lattice structures on hypergraphs on which we build mathematical morphology operators. We show some relations between these operators and the hypergraph structure, considering in particular transversals and duality notions. Then, as another contribution, we show how mathematical morphology can be used for classification or matching problems on data represented by hypergraphs: thanks to dilation operators, we define a similarity measure between hypergraphs, and we show that it is a kernel. A distance is finally introduced using this similarity notion.</EA>
<CC>001D02C03; 001D02A06</CC>
<FD>Vision ordinateur; Morphologie mathématique; Treillis; Classification; Similitude; Opérateur mathématique; Dilatation; Métrique; Hypergraphe; .</FD>
<ED>Computer vision; Mathematical morphology; Lattice; Classification; Similarity; Mathematical operator; Dilatation; Metric; Hypergraph</ED>
<SD>Visión ordenador; Morfología matemática; Enrejado; Clasificación; Similitud; Operador matemático; Dilatación; Métrico; Hipergráfico</SD>
<LO>INIST-15463A.354000502487160040</LO>
<ID>13-0182240</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000071 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:13-0182240
   |texte=   Mathematical morphology on hypergraphs, application to similarity and positive kernel
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Mathematical morphology on hypergraphs, application to similarity and positive kernel

Mathematical morphology on hypergraphs, application to similarity and positive kernel

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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