Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • Technicolor Research & Innovation
View graph of relations

Details

Original languageEnglish
Title of host publicationComputer Vision, ACCV 2012
Subtitle of host publication11th Asian Conference on Computer Vision, Revised Selected Papers
Pages745-759
Number of pages15
EditionPART 1
Publication statusPublished - 2013
Event11th Asian Conference on Computer Vision, ACCV 2012 - Daejeon, Korea, Republic of
Duration: 5 Nov 20129 Nov 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7724 LNCS
ISSN (Print)0302-9743
ISSN (electronic)1611-3349

Abstract

In this paper we propose an algorithm for image segmentation using graph cuts which can be used to efficiently solve labeling problems on high resolution images or image sequences. The basic idea of our method is to group large homogeneous regions to one single variable. Therefore we combine the appearance and the task specific similarity with Dempster's theory of evidence to compute the basic belief that two pixels/groups will have the same label in the minimum energy state. Experiments on image and video segmentation show that our grouping leads to a significant speedup and memory reduction of the labeling problem. Thus large-scale labeling problems can be solved in an efficient manner with a low approximation loss.

ASJC Scopus subject areas

Cite this

Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation. / Scheuermann, Björn; Schlosser, Markus; Rosenhahn, Bodo.
Computer Vision, ACCV 2012: 11th Asian Conference on Computer Vision, Revised Selected Papers. PART 1. ed. 2013. p. 745-759 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7724 LNCS, No. PART 1).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Scheuermann, B, Schlosser, M & Rosenhahn, B 2013, Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation. in Computer Vision, ACCV 2012: 11th Asian Conference on Computer Vision, Revised Selected Papers. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7724 LNCS, pp. 745-759, 11th Asian Conference on Computer Vision, ACCV 2012, Daejeon, Korea, Republic of, 5 Nov 2012. https://doi.org/10.1007/978-3-642-37331-2_56
Scheuermann, B., Schlosser, M., & Rosenhahn, B. (2013). Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation. In Computer Vision, ACCV 2012: 11th Asian Conference on Computer Vision, Revised Selected Papers (PART 1 ed., pp. 745-759). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7724 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-37331-2_56
Scheuermann B, Schlosser M, Rosenhahn B. Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation. In Computer Vision, ACCV 2012: 11th Asian Conference on Computer Vision, Revised Selected Papers. PART 1 ed. 2013. p. 745-759. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-37331-2_56
Scheuermann, Björn ; Schlosser, Markus ; Rosenhahn, Bodo. / Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation. Computer Vision, ACCV 2012: 11th Asian Conference on Computer Vision, Revised Selected Papers. PART 1. ed. 2013. pp. 745-759 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
Download
@inproceedings{66e0f368484e4eeca10ad9a01eb3b6cb,
title = "Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation",
abstract = "In this paper we propose an algorithm for image segmentation using graph cuts which can be used to efficiently solve labeling problems on high resolution images or image sequences. The basic idea of our method is to group large homogeneous regions to one single variable. Therefore we combine the appearance and the task specific similarity with Dempster's theory of evidence to compute the basic belief that two pixels/groups will have the same label in the minimum energy state. Experiments on image and video segmentation show that our grouping leads to a significant speedup and memory reduction of the labeling problem. Thus large-scale labeling problems can be solved in an efficient manner with a low approximation loss.",
author = "Bj{\"o}rn Scheuermann and Markus Schlosser and Bodo Rosenhahn",
year = "2013",
doi = "10.1007/978-3-642-37331-2_56",
language = "English",
isbn = "9783642373305",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "745--759",
booktitle = "Computer Vision, ACCV 2012",
edition = "PART 1",
note = "11th Asian Conference on Computer Vision, ACCV 2012 ; Conference date: 05-11-2012 Through 09-11-2012",

}

Download

TY - GEN

T1 - Efficient pixel-grouping based on Dempster's theory of evidence for image segmentation

AU - Scheuermann, Björn

AU - Schlosser, Markus

AU - Rosenhahn, Bodo

PY - 2013

Y1 - 2013

N2 - In this paper we propose an algorithm for image segmentation using graph cuts which can be used to efficiently solve labeling problems on high resolution images or image sequences. The basic idea of our method is to group large homogeneous regions to one single variable. Therefore we combine the appearance and the task specific similarity with Dempster's theory of evidence to compute the basic belief that two pixels/groups will have the same label in the minimum energy state. Experiments on image and video segmentation show that our grouping leads to a significant speedup and memory reduction of the labeling problem. Thus large-scale labeling problems can be solved in an efficient manner with a low approximation loss.

AB - In this paper we propose an algorithm for image segmentation using graph cuts which can be used to efficiently solve labeling problems on high resolution images or image sequences. The basic idea of our method is to group large homogeneous regions to one single variable. Therefore we combine the appearance and the task specific similarity with Dempster's theory of evidence to compute the basic belief that two pixels/groups will have the same label in the minimum energy state. Experiments on image and video segmentation show that our grouping leads to a significant speedup and memory reduction of the labeling problem. Thus large-scale labeling problems can be solved in an efficient manner with a low approximation loss.

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

U2 - 10.1007/978-3-642-37331-2_56

DO - 10.1007/978-3-642-37331-2_56

M3 - Conference contribution

AN - SCOPUS:84875892067

SN - 9783642373305

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

SP - 745

EP - 759

BT - Computer Vision, ACCV 2012

T2 - 11th Asian Conference on Computer Vision, ACCV 2012

Y2 - 5 November 2012 through 9 November 2012

ER -

By the same author(s)