A New Matching Algorithm between Trees of Shapes and its Application to Brain Tumor Segmentation

From LRDE

Revision as of 17:11, 2 March 2021 by Bot (talk | contribs) (Created page with "{{Publication | published = true | date = 2021-03-02 | authors = Nicolas Boutry, Thierry Géraud | title = A New Matching Algorithm between Trees of Shapes and its Application...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Abstract

Many approaches exist to compute the distance between two trees in pattern recognition. These trees can be structures with or without values on their nodes or edges. However, none of these distances take into account the shapes possibly associated to the nodes of the tree. For this reason, we propose in this paper a new distance between two trees of shapes based on the Hausdorff distance. This distance allows us to make inexact tree matching and to compute what we call residual trees, representing where two trees differ. We will also see that thanks to these residual trees, we can obtain good results in matter of brain tumor segmentation. This segmentation does not provide only a segmentation but also the tree of shapes corresponding to the segmentation and its depth map.


Bibtex (lrde.bib)

@InProceedings{	  boutry.21.dgmm.2,
  author	= {Nicolas Boutry and Thierry G\'eraud},
  title		= {A New Matching Algorithm between Trees of Shapes and its
		  Application to Brain Tumor Segmentation},
  booktitle	= {Proceedings of the IAPR International Conference on
		  Discrete Geometry and Mathematical Morphology (DGMM)},
  year		= 2021,
  month		= {May},
  address	= {Uppsala, Sweden},
  abstract	= {Many approaches exist to compute the distance between two
		  trees in pattern recognition. These trees can be structures
		  with or without values on their nodes or edges. However,
		  none of these distances take into account the shapes
		  possibly associated to the nodes of the tree. For this
		  reason, we propose in this paper a new distance between two
		  trees of shapes based on the Hausdorff distance. This
		  distance allows us to make inexact tree matching and to
		  compute what we call residual trees, representing where two
		  trees differ. We will also see that thanks to these
		  residual trees, we can obtain good results in matter of
		  brain tumor segmentation. This segmentation does not
		  provide only a segmentation but also the tree of shapes
		  corresponding to the segmentation and its depth map.},
  note		= {To appear}
}