|
Publications de Xavier Descombes
Résultat de la recherche dans la liste des publications :
44 Articles |
41 - A Markov Pixon Information approach for low level image description. X. Descombes et F. Kruggel. IEEE Trans. Pattern Analysis ans Machine Intelligence, 21(6): pages 482-494, juin 1999.
@ARTICLE{xd99b,
|
author |
= |
{Descombes, X. and Kruggel, F.}, |
title |
= |
{A Markov Pixon Information approach for low level image description}, |
year |
= |
{1999}, |
month |
= |
{juin}, |
journal |
= |
{IEEE Trans. Pattern Analysis ans Machine Intelligence}, |
volume |
= |
{21}, |
number |
= |
{6}, |
pages |
= |
{482-494}, |
pdf |
= |
{http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=771311}, |
keyword |
= |
{} |
} |
|
42 - GMRF Parameter Estimation in a non-stationary Framework by a Renormalization Technique: Application to Remote Sensing Imaging. X. Descombes et M. Sigelle et F. Prêteux. IEEE Trans. Image Processing, 8(4): pages 490-503, 1999.
@ARTICLE{xd99a,
|
author |
= |
{Descombes, X. and Sigelle, M. and Prêteux, F.}, |
title |
= |
{GMRF Parameter Estimation in a non-stationary Framework by a Renormalization Technique: Application to Remote Sensing Imaging}, |
year |
= |
{1999}, |
journal |
= |
{IEEE Trans. Image Processing}, |
volume |
= |
{8}, |
number |
= |
{4}, |
pages |
= |
{490-503}, |
url |
= |
{https://hal.archives-ouvertes.fr/hal-00272393}, |
keyword |
= |
{} |
} |
|
43 - fMRI Signal Restoration Using an Edge Preserving Spatio-temporal Markov Random Field. X. Descombes et F. Kruggel et Y. von Cramon. NeuroImage, 8: pages 340-349, 1998. Mots-clés : fMRI, Restauration, Champs de Markov. Copyright : published in NeuroIMage by Elsevier
||http://www.elsevier.com/wps/find/homepage.cws_home
@ARTICLE{descombes98d,
|
author |
= |
{Descombes, X. and Kruggel, F. and von Cramon, Y.}, |
title |
= |
{fMRI Signal Restoration Using an Edge Preserving Spatio-temporal Markov Random Field}, |
year |
= |
{1998}, |
journal |
= |
{NeuroImage}, |
volume |
= |
{8}, |
pages |
= |
{340-349}, |
pdf |
= |
{ftp://ftp-sop.inria.fr/ariana/Articles/1998_descombes98d.pdf}, |
keyword |
= |
{fMRI, Restauration, Champs de Markov} |
} |
|
44 - Spatio-temporal fMRI analysis using Markov Random Fields. X. Descombes et F. Kruggel et Y. Von Cramon. IEEE Trans. Medical Imaging, 17(6): pages 1028-1039, 1998. Note : à paraître. Mots-clés : fMRI, Markov Random Fields.
@ARTICLE{descombes98,
|
author |
= |
{Descombes, X. and Kruggel, F. and Von Cramon, Y.}, |
title |
= |
{Spatio-temporal fMRI analysis using Markov Random Fields}, |
year |
= |
{1998}, |
journal |
= |
{IEEE Trans. Medical Imaging}, |
volume |
= |
{17}, |
number |
= |
{6}, |
pages |
= |
{1028-1039}, |
pdf |
= |
{http://www-sop.inria.fr/members/Xavier.Descombes/publis_dr/TMI1.pdf}, |
keyword |
= |
{fMRI, Markov Random Fields} |
} |
|
haut de la page
Thèse de Doctorat et Habilitation |
1 - Méthodes stochastiques en analyse d'image : des champs de Markov aux processus ponctuels marqués. X. Descombes. Habilitation à diriger des Recherches, Universite de Nice Sophia Antipolis, février 2004. Mots-clés : Champs de Markov, Geometrie stochastique.
@PHDTHESIS{Xdescombes,
|
author |
= |
{Descombes, X.}, |
title |
= |
{Méthodes stochastiques en analyse d'image : des champs de Markov aux processus ponctuels marqués}, |
year |
= |
{2004}, |
month |
= |
{février}, |
school |
= |
{Universite de Nice Sophia Antipolis}, |
type |
= |
{Habilitation à diriger des Recherches}, |
url |
= |
{https://hal.inria.fr/tel-00506084}, |
pdf |
= |
{ftp://ftp-sop.inria.fr/ariana/Articles/HDRdescombes.pdf}, |
keyword |
= |
{Champs de Markov, Geometrie stochastique} |
} |
|
haut de la page
97 Articles de conférence |
1 - Tree crown detection in high resolution optical images during the early growth stages of eucalyptus plantations in Brazil. J. Zhou et C. Proisy et X. Descombes et J. Zerubia et G. Le Maire et Y. Nouvellon et P. Couteron. Dans Asian Conference on Pattern Recognition (ACPR), Beijing, China, novembre 2011. Mots-clés : tree detection, Eucalyptus plantation, Marked point process, multi-date detection.
@INPROCEEDINGS{Zhou11,
|
author |
= |
{Zhou, J. and Proisy, C. and Descombes, X. and Zerubia, J. and Le Maire, G. and Nouvellon, Y. and Couteron, P.}, |
title |
= |
{Tree crown detection in high resolution optical images during the early growth stages of eucalyptus plantations in Brazil}, |
year |
= |
{2011}, |
month |
= |
{novembre}, |
booktitle |
= |
{Asian Conference on Pattern Recognition (ACPR)}, |
address |
= |
{Beijing, China}, |
url |
= |
{http://hal.inria.fr/hal-00740973}, |
keyword |
= |
{tree detection, Eucalyptus plantation, Marked point process, multi-date detection} |
} |
Abstract :
Individual tree detection methods are more and more present, and improve, in forestry and silviculture domains with the increasing availability of satellite metric imagery. Automatic detection on these very high spatial resolution images aims to determine the tree positions and crown sizes. In this paper, we used a mathematical model based on marked point processes, which showed advantages w.r.t. several individual tree detection algorithms for plantations, to analyze the eucalyptus plantations in Brazil, with 2 optical images acquired by the WorldView-2 satellite. A tentative detection simultaneously with 2 images of different dates (multi-date) was tested for the first time, which estimates individual tree crown variation during these dates. The relevance of detection was discussed considering the detection performance in tree localizations and crown sizes. Then, tree crown growth was deduced from detection results and compared with the expected dynamics of corresponding populations. |
|
2 - Estimation of an optimal spectral band combination to evaluate skin disease treatment efficacy using multi-spectral images. S. Prigent et D. Zugaj et X. Descombes et P. Martel et J. Zerubia. Dans Proc. IEEE International Conference on Image Processing (ICIP), Brussels, Belgium, septembre 2011.
@INPROCEEDINGS{prigent11a,
|
author |
= |
{Prigent, S. and Zugaj, D. and Descombes, X. and Martel, P. and Zerubia, J.}, |
title |
= |
{Estimation of an optimal spectral band combination to evaluate skin disease treatment efficacy using multi-spectral images}, |
year |
= |
{2011}, |
month |
= |
{septembre}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Brussels, Belgium}, |
pdf |
= |
{http://hal.inria.fr/docs/00/59/06/94/PDF/icip_final.pdf}, |
keyword |
= |
{} |
} |
Abstract :
Clinical evaluation of skin treatments consists of two steps. First, the degree of the disease is measured clinically on a group of patients by dermatologists. Then, a statistical test is used on obtained set of measures to determine the treatment efficacy. In this paper, a method is proposed to automatically measure the severity of skin hyperpigmentation. After a classification step, an objective function is designed in order to obtain an optimal linear combination of bands defining the severity criterion. Then a hypothesis test is deployed on this combination to quantify treatment efficacy. |
|
3 - A fast multiple birth and cut algorithm using belief propagation. A. Gamal Eldin et X. Descombes et Charpiat G. et J. Zerubia. Dans Proc. IEEE International Conference on Image Processing (ICIP), Brussels, Belgium, septembre 2011. Mots-clés : Multiple Birth and Cut, multiple object extraction, Graph Cut, Belief Propagation.
@INPROCEEDINGS{MBC_ICIP11,
|
author |
= |
{Gamal Eldin, A. and Descombes, X. and G., Charpiat and Zerubia, J.}, |
title |
= |
{A fast multiple birth and cut algorithm using belief propagation}, |
year |
= |
{2011}, |
month |
= |
{septembre}, |
booktitle |
= |
{Proc. IEEE International Conference on Image Processing (ICIP)}, |
address |
= |
{Brussels, Belgium}, |
url |
= |
{http://hal.inria.fr/inria-00592446/fr/}, |
keyword |
= |
{Multiple Birth and Cut, multiple object extraction, Graph Cut, Belief Propagation} |
} |
Abstract :
In this paper, we present a faster version of the newly proposed Multiple Birth and Cut (MBC) algorithm. MBC is an optimization method applied to the energy minimization of an object based model, defined by a marked point process. We show that, by proposing good candidates in the birth step of this algorithm, the speed of convergence is increased. The algorithm starts by generating a dense configuration in a special organization, the best candidates are selected using the belief propagation algorithm. Next, this candidate configuration is combined with the current configuration using binary graph cuts as presented in the original version of the MBC algorithm. We tested the performance of our algorithm on the particular problem of counting flamingos in a colony, and show that it is much faster with the modified birth step. |
|
4 - Extraction et caractérisation de régions saines et pathologiques à partir de micro-tomographie RX du système vasculaire cérébral. X. Descombes et A. Gamal Eldin et F. Plouraboue et C. Fonta et S. Serduc et G. Le Duc et T. Weitkamp. Dans Proc. GRETSI Symposium on Signal and Image Processing, Bordeaux, France, septembre 2011.
@INPROCEEDINGS{XavierGRETSI11,
|
author |
= |
{Descombes, X. and Gamal Eldin, A. and Plouraboue, F. and Fonta, C. and Serduc, S. and Le Duc, G. and Weitkamp, T.}, |
title |
= |
{Extraction et caractérisation de régions saines et pathologiques à partir de micro-tomographie RX du système vasculaire cérébral}, |
year |
= |
{2011}, |
month |
= |
{septembre}, |
booktitle |
= |
{Proc. GRETSI Symposium on Signal and Image Processing}, |
address |
= |
{Bordeaux, France}, |
url |
= |
{http://hal.inria.fr/inria-00625525/fr/}, |
keyword |
= |
{} |
} |
Abstract :
In this paper, we consider X-ray micro-tomography representing the brain vascular network. We define the local vascular territories as the regions obtained after a watershed algorithm applied on the distance map. The obtained graph is then regularized by a Markov random field approach. The optimization is performed using a graph cut algorithm. We show that the resulting segmentation exhibits three classes corresponding to normal tissue, tumour and an intermediate region. |
|
5 - Reconstruction 3D du bâti à partir d'une seule image par naissances et morts multiples. J.D. Durou et X. Descombes et P. Lukashevish et A. Kraushonak. Dans Proc. GRETSI Symposium on Signal and Image Processing, Bordeaux, France, septembre 2011.
@INPROCEEDINGS{DurouGretsi11,
|
author |
= |
{Durou, J.D. and Descombes, X. and Lukashevish, P. and Kraushonak, A.}, |
title |
= |
{Reconstruction 3D du bâti à partir d'une seule image par naissances et morts multiples}, |
year |
= |
{2011}, |
month |
= |
{septembre}, |
booktitle |
= |
{Proc. GRETSI Symposium on Signal and Image Processing}, |
address |
= |
{Bordeaux, France}, |
url |
= |
{http://hal.inria.fr/inria-00625527/fr/}, |
keyword |
= |
{} |
} |
Résumé :
Dans cet article, nous nous écartons de l’approche classique qui considère la reconstruction 3D comme un problème inverse et la
résout en mettant en correspondance deux images d’une paire stéréoscopique. Au contraire, nous montrons qu’il est plus simple de résoudre le
problème direct. Pour ce faire, nous proposons aléatoirement des configurations de bâtiments pour ne conserver que les plus pertinentes par un
algorithme de type naissances et morts multiples. Nous montrons notamment que cette approche ne nécessite pas un temps de calcul prohibitif,
grâce à la puissance de calcul d’OpenGL qui s’appuie sur la carte graphique. Les premiers résultats obtenus montrent la pertinence de l’approche
adoptée. En particulier, elle permet de résoudre des ambiguïtés pour lesquelles l’inversion du problème serait quasiment impossible. |
Abstract :
In this paper, contrary to the classical approach addressing the 3D reconstruction problem as an inverse problem and solving it by matching two images from a stereoscopic pair, we show that we can solve the direct problem in a simpler way. To do so, we randomly propose configurations of buildings while keeping only the most relevant ones, using a multiple births and deaths algorithm. Notably, we show that this approach does not imply a prohibitory computation time, thanks to the freeware OpenGL which exploits the graphic card. The first results show that the proposed approach is relevant. In particular, it allows solving ambiguities for which inverting the problem is almost impossible. |
|
haut de la page
Ces pages sont générées par
|