Algorithms for computing the maximum weight region decomposable into elementary shapes

Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


Motivated by the image segmentation problem, we consider the following geometric optimization problem: Given a weighted n × n pixel grid, find the maximum weight region whose shape is decomposable into a set of disjoint elementary shapes. We give efficient algorithms for several interesting shapes. This is in strong contrast to finding the maximum weight region that is the union of elementary shapes for the corresponding cases - a problem that we prove to be NP-hard. We implemented one of the algorithms and demonstrate its applicability for image segmentation.

Original languageEnglish
Pages (from-to)803-814
Number of pages12
JournalComputer Vision and Image Understanding
Issue number7
Publication statusPublished - 2012 Jul


  • Combinatorial optimization
  • Computational geometry
  • Image segmentation

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition


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