JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/13756

Title: Base location problems for base-monotone regions
Authors: Chun, Jinhee
Horiyama, Takashi
Ito, Takehiro
Kaothanthong, Natsuda
Ono, Hirotaka
Otachi, Yota
Tokuyama, Takeshi
Uehara, Ryuhei
Uno, Takeaki
Keywords: pixel grid
image segmentation
computational geometry
base-monotone regions
Issue Date: 2013-02-14
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 7748
Start page: 53
End page: 64
DOI: 10.1007/978-3-642-36065-7_7
Abstract: The problem of decomposing a pixel grid into base-monotoneregions was first studied in the context of image segmentation. It is known that for a given n × n pixel grid and baselines, one can compute in O(n^3) time a maximum-weight region that can be decomposed into disjoint base-monotone regions [Chun et al. ISAAC 2009]. To complement this fact, we first show the NP-hardness of the problem of optimally locating k baselines in a given pixel grid. Next we present an O(n^3)-time 2-approximation algorithm for this problem. We also study some polynomial-time solvable cases, and variants of the problem.
Rights: This is the author-created version of Springer, Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno, Lecture Notes in Computer Science, 7748, 2013, 53-64. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-36065-7_7
URI: http://hdl.handle.net/10119/13756
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
19058.pdf1041KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology