Algorithms for computing the maximum weight region decomposable into elementary shapes

Jinhi Jiyon, Ryosei Kasai, Cozzetti Matias Korman, Takeshi Tokuyama

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

8 Citations (Scopus)

Abstract

Motivated from the image segmentation problem, we consider the problem of finding the maximum weight region with a shape decomposable into elementary shapes in n ×n pixel grid where each pixel has a real valued weight. We give efficient algorithms for several interesting cases. This shows string constrast to the NP-hardness results to find the maximum weight union for the corresponding cases.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
Pages1166-1174
Number of pages9
DOIs
Publication statusPublished - 2009 Dec 1
Event20th International Symposium on Algorithms and Computation, ISAAC 2009 - Honolulu, HI, United States
Duration: 2009 Dec 162009 Dec 18

Publication series

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

Other

Other20th International Symposium on Algorithms and Computation, ISAAC 2009
CountryUnited States
CityHonolulu, HI
Period09/12/1609/12/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithms for computing the maximum weight region decomposable into elementary shapes'. Together they form a unique fingerprint.

Cite this