Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Annabelle Chardin

dblp:23/882 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
parameter estimation
0.011999
Unsupervised Image Classification with a Hierarchical EM Algorithm · ICCV 1999
Multimedia analysis and retrieval
image classification
0.011999
Unsupervised Image Classification with a Hierarchical EM Algorithm · ICCV 1999
Multimedia analysis and retrieval › image classification
unsupervised image classification
0.011999
Unsupervised Image Classification with a Hierarchical EM Algorithm · ICCV 1999

Methods — techniques the papers use, named apart from their topics

quadtree · 0.0gibbs sampling · 0.0EM algorithm · 0.0
YearPublicationVenuePosition
2000 Noniterative manipulation of discrete energy-based models for image analysis
Patrick Pérez, Annabelle Chardin, Jean-Marc Laferté
Pattern Recognit.2
1999 Unsupervised Image Classification with a Hierarchical EM Algorithm
abstract
This work is undertaken in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes of a quadtree which leads to non-iterative inference procedures. Nevertheless, if they circumvent the algorithmic drawbacks of grid-based models (computational load and/or great dependance on the initialization), they admit modeling shortcomings (cumbersome and somehow artificial). We investigate a new hierarchical stochastic model which benefits from both the spatial and hierarchical prior modeling. The independence graph is based on a tree which has been pollarded with nodes at the coarsest resolution exhibiting a grid-based interaction structure. For this class of model, we address the critical problem of parameter estimation. To this end, we derive an EM algorithm on the hybrid structure which mixes an exact EM algorithm on each subtree and a low cost Gibbs EM algorithm on the coarse spatial grid. Experiments on a synthetic image and multispectral satellite images are reported.
Annabelle Chardin, Patrick Pérez
ICCV1
1999 Mode of Posterior Marginals with Hierarchical Models
abstract
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. We investigate a new hybrid hierarchical structure: a Markov random field attached to the nodes of a truncated tree. It thus combines causal hierarchical prior on trees with a non-causal spatial prior at the coarsest level. We address the problem of computing posterior marginals with such a prior structure. This is performed using non-iterative two-sweep marginalizations on trees, combined with a low cost Gibbs sampler in between the two sweeps. Posterior marginals are thus obtained in a semi-iterative way. They are then used to infer unknown variables according to the IMPM estimator. This is illustrated by experiments on synthetic data and on multispectral satellite images.
Annabelle Chardin, Patrick Pérez
ICIP (1)1
1998 Semi-Iterative Inference with Hierarchical Models
abstract
This paper deals with hierarchical Markov random field models. We propose to introduce new hierarchical models based on a hybrid structure which combines a spatial grid of a reduced size at the coarsest level with sub-trees appended below it, down to the finest level. These models circumvent the algorithmic drawbacks of grid-based models (computational load and/or great dependance on the initialization) and the modeling drawbacks of tree-based approaches (cumbersome and somehow artificial structure). The hybrid structure leads to algorithms that mix a non-iterative inference on sub-trees with an iterative deterministic inference at the top of the structure. Experiments on a synthetic image demonstrate the gains provided in terms of both computational efficiency and the quality of results. Then experiments on real aerial images illustrate the ability of hybrid models to perform the multiresolution and multispectral image fusion.
Annabelle Chardin, Patrick Pérez
ICIP (1)1