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.

A unified framework for detecting groups and application to shape recognition

Identifieur interne : 005F97 ( Main/Merge ); précédent : 005F96; suivant : 005F98

A unified framework for detecting groups and application to shape recognition

Auteurs : Frédéric Cao ; Julie Delon ; Agnès Desolneux ; Pablo Musé ; Frédéric Sur

Source :

RBID : CRIN:cao05a

English descriptors

Abstract

A unified a contrario detection method is proposed to solve three classical problems in clustering analysis. The first one is to evaluate the validity of a cluster candidate. The second problem is that meaningful clusters can contain or be contained in other meaningful clusters. A rule is needed to define locally optimal clusters by inclusion. The third problem is the definition of a correct merging rule between meaningful clusters, permitting to decide whether they should stay separate or unit. The motivation of this theory is shape recognition. Matching algorithms usually compute correspondences between more or less local features (called shape elements) between images to be compared. This paper intends to form spatially coherent groups between matching shape elements into a shape. Each pair of matching shape elements indeed leads to a unique transformation (similarity or affine map.) As an application, the present theory on the choice of the right clusters is used to group these shape elements into shapes by detecting clusters in the transformation space.

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


Links to Exploration step

CRIN:cao05a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="459">A unified framework for detecting groups and application to shape recognition</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:cao05a</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004154</idno>
<idno type="wicri:Area/Crin/Curation">004154</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004154</idno>
<idno type="wicri:Area/Crin/Checkpoint">000222</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000222</idno>
<idno type="wicri:Area/Main/Merge">005F97</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A unified framework for detecting groups and application to shape recognition</title>
<author>
<name sortKey="Cao, Frederic" sort="Cao, Frederic" uniqKey="Cao F" first="Frédéric" last="Cao">Frédéric Cao</name>
</author>
<author>
<name sortKey="Delon, Julie" sort="Delon, Julie" uniqKey="Delon J" first="Julie" last="Delon">Julie Delon</name>
</author>
<author>
<name sortKey="Desolneux, Agnes" sort="Desolneux, Agnes" uniqKey="Desolneux A" first="Agnès" last="Desolneux">Agnès Desolneux</name>
</author>
<author>
<name sortKey="Muse, Pablo" sort="Muse, Pablo" uniqKey="Muse P" first="Pablo" last="Musé">Pablo Musé</name>
</author>
<author>
<name sortKey="Sur, Frederic" sort="Sur, Frederic" uniqKey="Sur F" first="Frédéric" last="Sur">Frédéric Sur</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>cluster validity</term>
<term>merging criterion</term>
<term>number of false alarms</term>
<term>shape recognition</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="2858">A unified a contrario detection method is proposed to solve three classical problems in clustering analysis. The first one is to evaluate the validity of a cluster candidate. The second problem is that meaningful clusters can contain or be contained in other meaningful clusters. A rule is needed to define locally optimal clusters by inclusion. The third problem is the definition of a correct merging rule between meaningful clusters, permitting to decide whether they should stay separate or unit. The motivation of this theory is shape recognition. Matching algorithms usually compute correspondences between more or less local features (called shape elements) between images to be compared. This paper intends to form spatially coherent groups between matching shape elements into a shape. Each pair of matching shape elements indeed leads to a unique transformation (similarity or affine map.) As an application, the present theory on the choice of the right clusters is used to group these shape elements into shapes by detecting clusters in the transformation space.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005F97 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 005F97 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     CRIN:cao05a
   |texte=   A unified framework for detecting groups and application to shape recognition
}}

Wicri

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