Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging

From LRDE

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{	  berger.07.icip,
  author	= {Christophe Berger and Thierry G\'eraud and Roland
		  Levillain and Nicolas Widynski and Anthony Baillard and
		  Emmanuel Bertin},
  title		= {Effective Component Tree Computation with Application to
		  Pattern Recognition in Astronomical Imaging},
  booktitle	= {Proceedings of the IEEE International Conference on Image
		  Processing (ICIP)},
  pages		= {41--44},
  volume	= 4,
  year		= 2007,
  address	= {San Antonio, TX, USA},
  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.}
}