Base location problems for base-monotone regions

Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

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

1 Citation (Scopus)


The problem of decomposing a pixel grid into base-monotone regions was first studied in the context of image segmentation. It is known that for a given pixel grid and baselines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. We continue this line of research and show the NP-hardness of the problem of optimally locating k baselines in a given n ×n pixel grid. We also present an O(n3)-time 2-approximation algorithm for this problem. We then study two related problems, the k base-segment problem and the quad-decomposition problem, and present some complexity results for them.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings
Number of pages12
Publication statusPublished - 2013
Event7th International Workshop on Algorithms and Computation, WALCOM 2013 - Kharagpur, India
Duration: Feb 14 2013Feb 16 2013

Publication series

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


Other7th International Workshop on Algorithms and Computation, WALCOM 2013

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Base location problems for base-monotone regions'. Together they form a unique fingerprint.

Cite this