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)

Abstract

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
Pages53-64
Number of pages12
DOIs
Publication statusPublished - Feb 4 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

Other

Other7th International Workshop on Algorithms and Computation, WALCOM 2013
CountryIndia
CityKharagpur
Period2/14/132/16/13

Fingerprint

Location Problem
Monotone
Pixels
Pixel
Grid
Approximation algorithms
Baseline
Image segmentation
Problem Decomposition
Hardness
Polynomials
NP-hardness
Decomposition
Image Segmentation
Approximation Algorithms
Polynomial time
Disjoint
Continue
Line

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chun, J., Horiyama, T., Ito, T., Kaothanthong, N., Ono, H., Otachi, Y., ... Uno, T. (2013). Base location problems for base-monotone regions. In WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings (pp. 53-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7748 LNCS). https://doi.org/10.1007/978-3-642-36065-7_7

Base location problems for base-monotone regions. / Chun, Jinhee; Horiyama, Takashi; Ito, Takehiro; Kaothanthong, Natsuda; Ono, Hirotaka; Otachi, Yota; Tokuyama, Takeshi; Uehara, Ryuhei; Uno, Takeaki.

WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. 2013. p. 53-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7748 LNCS).

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

Chun, J, Horiyama, T, Ito, T, Kaothanthong, N, Ono, H, Otachi, Y, Tokuyama, T, Uehara, R & Uno, T 2013, Base location problems for base-monotone regions. in WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7748 LNCS, pp. 53-64, 7th International Workshop on Algorithms and Computation, WALCOM 2013, Kharagpur, India, 2/14/13. https://doi.org/10.1007/978-3-642-36065-7_7
Chun J, Horiyama T, Ito T, Kaothanthong N, Ono H, Otachi Y et al. Base location problems for base-monotone regions. In WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. 2013. p. 53-64. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-36065-7_7
Chun, Jinhee ; Horiyama, Takashi ; Ito, Takehiro ; Kaothanthong, Natsuda ; Ono, Hirotaka ; Otachi, Yota ; Tokuyama, Takeshi ; Uehara, Ryuhei ; Uno, Takeaki. / Base location problems for base-monotone regions. WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. 2013. pp. 53-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6ca1f96922164a7f95b677a990df9f85,
title = "Base location problems for base-monotone regions",
abstract = "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.",
author = "Jinhee Chun and Takashi Horiyama and Takehiro Ito and Natsuda Kaothanthong and Hirotaka Ono and Yota Otachi and Takeshi Tokuyama and Ryuhei Uehara and Takeaki Uno",
year = "2013",
month = "2",
day = "4",
doi = "10.1007/978-3-642-36065-7_7",
language = "English",
isbn = "9783642360640",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "53--64",
booktitle = "WALCOM",

}

TY - GEN

T1 - Base location problems for base-monotone regions

AU - Chun, Jinhee

AU - Horiyama, Takashi

AU - Ito, Takehiro

AU - Kaothanthong, Natsuda

AU - Ono, Hirotaka

AU - Otachi, Yota

AU - Tokuyama, Takeshi

AU - Uehara, Ryuhei

AU - Uno, Takeaki

PY - 2013/2/4

Y1 - 2013/2/4

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-642-36065-7_7

DO - 10.1007/978-3-642-36065-7_7

M3 - Conference contribution

AN - SCOPUS:84873812867

SN - 9783642360640

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

SP - 53

EP - 64

BT - WALCOM

ER -