Presentation 2009-06-29
Algorithms for optimal segmentation of regions decomposable into basic shapes
Ryosei KASAI, Jinhee CHUN, Matias KORMAN, Takeshi TOKUYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider optimal segmentation problem of a shape decomposable into elementary shapes in n×n pixel grid. We give efficient algorithms for segmenting shapes decomposable into base monotone regions, rectilinear star-convex regions, and digital star shaped regions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Combinatorial Optimization / Image Segmentation / Computational Geometry
Paper # COMP2009-21
Date of Issue

Conference Information
Committee COMP
Conference Date 2009/6/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Algorithms for optimal segmentation of regions decomposable into basic shapes
Sub Title (in English)
Keyword(1) Combinatorial Optimization
Keyword(2) Image Segmentation
Keyword(3) Computational Geometry
1st Author's Name Ryosei KASAI
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Jinhee CHUN
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Matias KORMAN
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
4th Author's Name Takeshi TOKUYAMA
4th Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2009-06-29
Paper # COMP2009-21
Volume (vol) vol.109
Number (no) 108
Page pp.pp.-
#Pages 8
Date of Issue