A Probabilistic Grouping Principle to Go from Pixels to Visual Structures
Identifieur interne : 002784 ( Main/Exploration ); précédent : 002783; suivant : 002785A Probabilistic Grouping Principle to Go from Pixels to Visual Structures
Auteurs : Agnès Desolneux [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We will describe here how the Helmholtz principle, which is a principle of visual perception, can be translated into a computational tool that can be used for many problems of discrete image analysis. The Helmholtz principle can be formulated as “we immediately perceive whatever has a low likelihood of resulting from accidental arrangement”. To translate this principle into a computational tool, we will introduce a variable called NFA (Number of False Alarms) associated to any geometric event in an image. The NFA of an event is defined as the expectation of the number of occurrences of this event in a pure noise image of same size. Meaningful events will then be events with a very low NFA. We will see how this notion can be efficiently used in many detection problems (alignments, smooth curves, edges, etc.). The common framework of these detection problems is that they can all be translated into the question of knowing whether a given group of pixels is meaningful or not. This is a joint work with Lionel Moisan and Jean-Michel Morel.
Url:
DOI: 10.1007/978-3-642-19867-0_1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001C62
- to stream Istex, to step Curation: 001C41
- to stream Istex, to step Checkpoint: 000684
- to stream Main, to step Merge: 002826
- to stream Main, to step Curation: 002784
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Probabilistic Grouping Principle to Go from Pixels to Visual Structures</title><author><name sortKey="Desolneux, Agnes" sort="Desolneux, Agnes" uniqKey="Desolneux A" first="Agnès" last="Desolneux">Agnès Desolneux</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7B30D4A5A8C4B9D1EDA215F55BBB42FE3607B8D3</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19867-0_1</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-BCXNGG8T-T/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001C62</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001C62</idno><idno type="wicri:Area/Istex/Curation">001C41</idno><idno type="wicri:Area/Istex/Checkpoint">000684</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000684</idno><idno type="wicri:doubleKey">0302-9743:2011:Desolneux A:a:probabilistic:grouping</idno><idno type="wicri:Area/Main/Merge">002826</idno><idno type="wicri:Area/Main/Curation">002784</idno><idno type="wicri:Area/Main/Exploration">002784</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Probabilistic Grouping Principle to Go from Pixels to Visual Structures</title><author><name sortKey="Desolneux, Agnes" sort="Desolneux, Agnes" uniqKey="Desolneux A" first="Agnès" last="Desolneux">Agnès Desolneux</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>MAP5 (UMR CNRS 8145), University Paris Descartes, 45 rue des Saints-Pères, 75006, Paris</wicri:regionArea><placeName><region type="region" nuts="2">Île-de-France</region><settlement type="city">Paris</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We will describe here how the Helmholtz principle, which is a principle of visual perception, can be translated into a computational tool that can be used for many problems of discrete image analysis. The Helmholtz principle can be formulated as “we immediately perceive whatever has a low likelihood of resulting from accidental arrangement”. To translate this principle into a computational tool, we will introduce a variable called NFA (Number of False Alarms) associated to any geometric event in an image. The NFA of an event is defined as the expectation of the number of occurrences of this event in a pure noise image of same size. Meaningful events will then be events with a very low NFA. We will see how this notion can be efficiently used in many detection problems (alignments, smooth curves, edges, etc.). The common framework of these detection problems is that they can all be translated into the question of knowing whether a given group of pixels is meaningful or not. This is a joint work with Lionel Moisan and Jean-Michel Morel.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Île-de-France</li></region><settlement><li>Paris</li></settlement></list><tree><country name="France"><region name="Île-de-France"><name sortKey="Desolneux, Agnes" sort="Desolneux, Agnes" uniqKey="Desolneux A" first="Agnès" last="Desolneux">Agnès Desolneux</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002784 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002784 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:7B30D4A5A8C4B9D1EDA215F55BBB42FE3607B8D3
|texte= A Probabilistic Grouping Principle to Go from Pixels to Visual Structures
}}
| This area was generated with Dilib version V0.6.33. |  |