Contour tree connectivity of binary images from algebraic graph theory

Dogu Baran Aydogan, Jari Hyttinen

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

6 Citations (Scopus)

Abstract

We propose a novel feature for binary images that provides connectivity information by taking into account the proximity of connected components and cavities. We start by applying the Euclidean distance transform and then we compute the contour tree. Finally, we assign the normalized algebraic connectivity of a contour tree derivative as a feature for connectivity. Our algorithm can be applied to any dimensions of data as well as topology. And the resultant connectivity index is a single real number between 0 and 1. We test and demonstrate interesting properties of our approach on various 2D and 3D images. With its intriguing properties, the proposed index is widely applicable for studying binary morphology. Especially, it is complementary to Euler number for studying connectivity of microstructures of materials such as soil, paper, filter, food products as well as biomaterials and biological tissues.

Original languageEnglish
Title of host publication2013 IEEE International Conference on Image Processing, ICIP 2013 - Proceedings
Pages3054-3058
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2013
MoE publication typeA4 Article in a conference publication
EventIEEE International Conference on Image Processing - Melbourne, Australia
Duration: 15 Sep 201318 Sep 2013
Conference number: 20

Conference

ConferenceIEEE International Conference on Image Processing
CountryAustralia
CityMelbourne
Period15/09/201318/09/2013

Keywords

  • algebraic graph theory
  • binary morphology
  • connectivity
  • contour tree
  • feature extraction

Fingerprint Dive into the research topics of 'Contour tree connectivity of binary images from algebraic graph theory'. Together they form a unique fingerprint.

Cite this