TY - JOUR

T1 - Base-object 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

N1 - Publisher Copyright:
© 2013 Elsevier B.V.

PY - 2014

Y1 - 2014

N2 - A base-monotone region with a base is a subset of the cells in a pixel grid such that if a cell is contained in the region then so are the ones on a shortest path from the cell to the base. The problem of decomposing a pixel grid into disjoint base-monotone regions was first studied in the context of image segmentation. It is known that for a given pixel grid and base-lines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions with respect to the given base-lines (Chun et al., 2012 [4]). We continue this line of research and show the NP-hardness of the problem of optimally locating k base-lines in a given n×n pixel grid. We then present an O(n3)-time 2-approximation algorithm for this problem. We also study two related problems, the k base-segment problem and the quad-decomposition problem, and present some complexity results for them.

AB - A base-monotone region with a base is a subset of the cells in a pixel grid such that if a cell is contained in the region then so are the ones on a shortest path from the cell to the base. The problem of decomposing a pixel grid into disjoint base-monotone regions was first studied in the context of image segmentation. It is known that for a given pixel grid and base-lines, one can compute in polynomial time a maximum-weight region that can be decomposed into disjoint base-monotone regions with respect to the given base-lines (Chun et al., 2012 [4]). We continue this line of research and show the NP-hardness of the problem of optimally locating k base-lines in a given n×n pixel grid. We then present an O(n3)-time 2-approximation algorithm for this problem. We also 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=84926279139&partnerID=8YFLogxK

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

U2 - 10.1016/j.tcs.2013.11.030

DO - 10.1016/j.tcs.2013.11.030

M3 - Article

AN - SCOPUS:84926279139

VL - 555

SP - 71

EP - 84

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -