View source for Publications/carlinet.13.ismm

{{Publication
| published = true
| date = 2013-03-14
| authors = Edwin Carlinet, Thierry Géraud
| title = A comparison of many max-tree computation algorithms
| booktitle = Mathematical Morphology and Its Application to Signal and Image Processing -- Proceedings of the 11th International Symposium on Mathematical Morphology (ISMM)
| editors = C L Luengo Hendriks, G Borgefors, R Strand
| volume = 7883
| series = Lecture Notes in Computer Science Series
| address = Uppsala, Sweden
| publisher = Springer
| pages = 73 to 85
| project = Image
| urllrde = 201305-ISMMd
| abstract = With the development of connected filters in the last decade, many algorithms have been proposed to compute the max-tree. Max-tree allows computation of the most advanced connected operators in a simple way. However, no exhaustive comparison of these algorithms has been proposed so far and the choice of an algorithm over another depends on many parameters. Since the need for fast algorithms is obvious for production code, we present an in depth comparison of five algorithms and some variations of them in a unique framework. Finally, a decision tree will be proposed to help the user choose the most appropriate algorithm according to their requirements.
| lrdeposter = http://www.lrde.epita.fr/dload/papers/carlinet.13.ismm-poster.pdf
| lrdepaper = http://www.lrde.epita.fr/dload/papers/carlinet.13.ismm.pdf
| lrdekeywords = Image
| lrdenewsdate = 2013-03-14
| type = inproceedings
| id = carlinet.13.ismm
| bibtex = 
@InProceedings<nowiki>{</nowiki>	  carlinet.13.ismm,
  author	= <nowiki>{</nowiki>Edwin Carlinet and Thierry G\'eraud<nowiki>}</nowiki>,
  title		= <nowiki>{</nowiki>A comparison of many max-tree computation algorithms<nowiki>}</nowiki>,
  booktitle	= <nowiki>{</nowiki>Mathematical Morphology and Its Application to Signal and
		  Image Processing -- Proceedings of the 11th International
		  Symposium on Mathematical Morphology (ISMM)<nowiki>}</nowiki>,
  year		= 2013,
  editor	= <nowiki>{</nowiki>C.L. Luengo Hendriks and G. Borgefors and R. Strand<nowiki>}</nowiki>,
  volume	= 7883,
  series	= <nowiki>{</nowiki>Lecture Notes in Computer Science Series<nowiki>}</nowiki>,
  address	= <nowiki>{</nowiki>Uppsala, Sweden<nowiki>}</nowiki>,
  publisher	= <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
  pages		= <nowiki>{</nowiki>73--85<nowiki>}</nowiki>,
  project	= <nowiki>{</nowiki>Image<nowiki>}</nowiki>,
  abstract	= <nowiki>{</nowiki>With the development of connected filters in the last
		  decade, many algorithms have been proposed to compute the
		  max-tree. Max-tree allows computation of the most advanced
		  connected operators in a simple way. However, no exhaustive
		  comparison of these algorithms has been proposed so far and
		  the choice of an algorithm over another depends on many
		  parameters. Since the need for fast algorithms is obvious
		  for production code, we present an in depth comparison of
		  five algorithms and some variations of them in a unique
		  framework. Finally, a decision tree will be proposed to
		  help the user choose the most appropriate algorithm
		  according to their requirements.<nowiki>}</nowiki>
<nowiki>}</nowiki>

}}