A faster graph-based segmentation algorithm with statistical region merge

Ahmed Fahad, Tim Morris

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

Abstract

The paper presents a modification of a bottom up graph theoretic image segmentation algorithm to improve its performance. This algorithm uses Kruskal's algorithm to build minimum spanning trees for segmentation that reflect global properties of the image: a predicate is defined for measuring the evidence of a boundary between two regions and the algorithm makes greedy decisions to produce the final segmentation. We modify the algorithm by reducing the number of edges required for sorting based on two criteria. We also show that the algorithm produces an over segmented result and suggest a statistical region merge process that will reduce the over segmentation. We have evaluated the algorithm by segmenting various video clips Our experimental results indicate the improved performance and quality of segmentation. © Springer-Verlag Berlin Heidelberg 2006.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
Subtitle of host publication Advances in Visual Computing
PublisherSpringer Nature
Pages286-293
Number of pages7
Volume4292
ISBN (Print)978-3-540-48627-5
DOIs
Publication statusPublished - 2006
Event2nd International Symposium on Visual Computing, ISVC 2006 - Lake Tahoe, NV
Duration: 1 Jul 2006 → …
http://dblp.uni-trier.de/db/conf/isvc/isvc2006-1.html#LiuH06http://dblp.uni-trier.de/rec/bibtex/conf/isvc/LiuH06.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/isvc/LiuH06

Conference

Conference2nd International Symposium on Visual Computing, ISVC 2006
CityLake Tahoe, NV
Period1/07/06 → …
Internet address

Fingerprint

Dive into the research topics of 'A faster graph-based segmentation algorithm with statistical region merge'. Together they form a unique fingerprint.

Cite this