Fast constrained image segmentation using optimal spanning trees

Stanislav Harizanov, Svetozar Margenov, Ludmil Zikatanov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We propose a graph theoretical algorithm for image segmentation which preserves both the volume and the connectivity of the solid (non-void) phase of the image. The approach uses three stages. Each step optimizes the approximation error between the image intensity vector and piece-wise constant (indicator) vector characterizing the segmentation of the underlying image. The different norms in which this approximation can be measured give rise to different methods. The running time of our algorithm is O(N logN) for an image with N voxels.

Original languageEnglish (US)
Title of host publicationLarge-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers
EditorsIvan Lirkov, Svetozar D. Margenov, Jerzy Waśniewski
PublisherSpringer Verlag
Pages15-29
Number of pages15
ISBN (Print)9783319265193
DOIs
StatePublished - Jan 1 2015
Event10th International Conference on Large-Scale Scientific Computing, LSSC 2015 - Sozopol, Bulgaria
Duration: Jun 8 2015Jun 12 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9374
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Large-Scale Scientific Computing, LSSC 2015
CountryBulgaria
CitySozopol
Period6/8/156/12/15

Fingerprint

Spanning tree
Image segmentation
Image Segmentation
Voxel
Approximation Error
Connectivity
Segmentation
Optimise
Norm
Approximation
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Harizanov, S., Margenov, S., & Zikatanov, L. (2015). Fast constrained image segmentation using optimal spanning trees. In I. Lirkov, S. D. Margenov, & J. Waśniewski (Eds.), Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers (pp. 15-29). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9374). Springer Verlag. https://doi.org/10.1007/978-3-319-26520-9_2
Harizanov, Stanislav ; Margenov, Svetozar ; Zikatanov, Ludmil. / Fast constrained image segmentation using optimal spanning trees. Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers. editor / Ivan Lirkov ; Svetozar D. Margenov ; Jerzy Waśniewski. Springer Verlag, 2015. pp. 15-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7c5d1b8d106b4e9681e1a2200aa7b135,
title = "Fast constrained image segmentation using optimal spanning trees",
abstract = "We propose a graph theoretical algorithm for image segmentation which preserves both the volume and the connectivity of the solid (non-void) phase of the image. The approach uses three stages. Each step optimizes the approximation error between the image intensity vector and piece-wise constant (indicator) vector characterizing the segmentation of the underlying image. The different norms in which this approximation can be measured give rise to different methods. The running time of our algorithm is O(N logN) for an image with N voxels.",
author = "Stanislav Harizanov and Svetozar Margenov and Ludmil Zikatanov",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-319-26520-9_2",
language = "English (US)",
isbn = "9783319265193",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "15--29",
editor = "Ivan Lirkov and Margenov, {Svetozar D.} and Jerzy Waśniewski",
booktitle = "Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers",
address = "Germany",

}

Harizanov, S, Margenov, S & Zikatanov, L 2015, Fast constrained image segmentation using optimal spanning trees. in I Lirkov, SD Margenov & J Waśniewski (eds), Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9374, Springer Verlag, pp. 15-29, 10th International Conference on Large-Scale Scientific Computing, LSSC 2015, Sozopol, Bulgaria, 6/8/15. https://doi.org/10.1007/978-3-319-26520-9_2

Fast constrained image segmentation using optimal spanning trees. / Harizanov, Stanislav; Margenov, Svetozar; Zikatanov, Ludmil.

Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers. ed. / Ivan Lirkov; Svetozar D. Margenov; Jerzy Waśniewski. Springer Verlag, 2015. p. 15-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9374).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Fast constrained image segmentation using optimal spanning trees

AU - Harizanov, Stanislav

AU - Margenov, Svetozar

AU - Zikatanov, Ludmil

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We propose a graph theoretical algorithm for image segmentation which preserves both the volume and the connectivity of the solid (non-void) phase of the image. The approach uses three stages. Each step optimizes the approximation error between the image intensity vector and piece-wise constant (indicator) vector characterizing the segmentation of the underlying image. The different norms in which this approximation can be measured give rise to different methods. The running time of our algorithm is O(N logN) for an image with N voxels.

AB - We propose a graph theoretical algorithm for image segmentation which preserves both the volume and the connectivity of the solid (non-void) phase of the image. The approach uses three stages. Each step optimizes the approximation error between the image intensity vector and piece-wise constant (indicator) vector characterizing the segmentation of the underlying image. The different norms in which this approximation can be measured give rise to different methods. The running time of our algorithm is O(N logN) for an image with N voxels.

UR - http://www.scopus.com/inward/record.url?scp=84952761859&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84952761859&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-26520-9_2

DO - 10.1007/978-3-319-26520-9_2

M3 - Conference contribution

AN - SCOPUS:84952761859

SN - 9783319265193

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 15

EP - 29

BT - Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers

A2 - Lirkov, Ivan

A2 - Margenov, Svetozar D.

A2 - Waśniewski, Jerzy

PB - Springer Verlag

ER -

Harizanov S, Margenov S, Zikatanov L. Fast constrained image segmentation using optimal spanning trees. In Lirkov I, Margenov SD, Waśniewski J, editors, Large-Scale Scientific Computing - 10th International Conference, LSSC 2015, Revised Selected Papers. Springer Verlag. 2015. p. 15-29. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-26520-9_2