Difference between revisions of "Publications/baillard.07.gretsi"

From LRDE

 
Line 7: Line 7:
 
| category = national
 
| category = national
 
| address = Troyes, France
 
| address = Troyes, France
| project = Image
 
| urllrde = 200705-GRETSI
 
 
| abstract = In this paper a new algorithm to compute the component tree is presented. As compared to the state-of-the-artthis algorithm does not use excessive memory and is able to work efficiently on images whose values are highly quantized or even with images having floating values. We also describe how it can be applied to astronomical data to identify relevant objects.
 
| abstract = In this paper a new algorithm to compute the component tree is presented. As compared to the state-of-the-artthis algorithm does not use excessive memory and is able to work efficiently on images whose values are highly quantized or even with images having floating values. We also describe how it can be applied to astronomical data to identify relevant objects.
 
| lrdeslides = http://www.lrde.epita.fr/dload/papers/baillard.07.gretsi.slides.pdf
 
| lrdeslides = http://www.lrde.epita.fr/dload/papers/baillard.07.gretsi.slides.pdf
Line 30: Line 28:
 
address = <nowiki>{</nowiki>Troyes, France<nowiki>}</nowiki>,
 
address = <nowiki>{</nowiki>Troyes, France<nowiki>}</nowiki>,
 
month = sep,
 
month = sep,
project = <nowiki>{</nowiki>Image<nowiki>}</nowiki>,
 
 
abstract = <nowiki>{</nowiki>In this paper a new algorithm to compute the component
 
abstract = <nowiki>{</nowiki>In this paper a new algorithm to compute the component
 
tree is presented. As compared to the state-of-the-art,
 
tree is presented. As compared to the state-of-the-art,

Latest revision as of 12:13, 26 April 2016

Abstract

In this paper a new algorithm to compute the component tree is presented. As compared to the state-of-the-artthis algorithm does not use excessive memory and is able to work efficiently on images whose values are highly quantized or even with images having floating values. We also describe how it can be applied to astronomical data to identify relevant objects.

Documents

Bibtex (lrde.bib)

@InProceedings{	  baillard.07.gretsi,
  author	= {Anthony Baillard and Christophe Berger and Emmanuel Bertin
		  and Thierry G\'eraud and Roland Levillain and Nicolas
		  Widynski},
  title		= {Algorithme de calcul de l'arbre des composantes avec
		  applications \`a la reconnaissance des formes en imagerie
		  satellitaire},
  booktitle	= {Proceedings of the 21st Symposium on Signal and Image
		  Processing (GRETSI)},
  category	= {national},
  year		= 2007,
  address	= {Troyes, France},
  month		= sep,
  abstract	= {In this paper a new algorithm to compute the component
		  tree is presented. As compared to the state-of-the-art,
		  this algorithm does not use excessive memory and is able to
		  work efficiently on images whose values are highly
		  quantized or even with images having floating values. We
		  also describe how it can be applied to astronomical data to
		  identify relevant objects.}
}