Search Results 1-5 of 5

  • Base-Object Location Problems for Base-Monotone Regions

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

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

    Theoretical Computer Science 555, 71-84, 2014-10-23

    IR  DOI 

  • 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

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

    Lecture Notes in Computer Science 7748, 53-64, 2013-02-14

    IR  DOI 

  • On the Base-Line Location Problem for the Maximum Weight Region Decomposable into Base-Monotone Shapes

    HORIYAMA Takashi , ITO Takehiro , KAOTHANTHONG Natsuda , ONO Hirotaka , OTACHI Yota , TOKUYAMA Takeshi , UEHARA Ryuhei , UNO Takeaki

    … We study the problem of decomposing a pixel grid into base-monotone regions so that the sum of the weights of the regions is maximized. … It is known that for a given n x n pixel grid with some baselines, one can compute a maximum-weight region which can be decomposed into disjoint base-monotone regions in O(n^3) time. …

    IEICE technical report. Theoretical foundations of Computing 112(21), 37-43, 2012-04-20

    References (10)

  • RA-006 Algorithms for computing the optimal image segmentation of nonintersecting union of base monotone regions  [in Japanese]

    Chun Jinhee , Kasai Ryosei , Korman Matias , Tokuyama Takeshi

    情報科学技術フォーラム講演論文集 8(1), 37-42, 2009-08-20

    IPSJ 

  • Algorithms for optimal segmentation of regions decomposable into basic shapes

    KASAI Ryosei , CHUN Jinhee , KORMAN Matias , TOKUYAMA Takeshi

    … We give efficient algorithms for segmenting shapes decomposable into base monotone regions, rectilinear star-convex regions, and digital star shaped regions. …

    IEICE technical report 109(108), 23-30, 2009-06-22

    References (9) Cited by (1)

Page Top