Presentation	2011-12-16 Image Segmentation Using Maximum Weight Region Jinhee CHUN, Natsuda KAOTHANTHONG, Takeshi TOKUYAMA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this paper, we present the image segmentation result using the algorithm for computing the Maximum Weight Region. An input monochrome image is represented by a weighted n × n pixel grid where each pixel corresponds to the intensity value of the input. The pixel grid is segmented into a set of disjoint elementary shapes using the algorithm proposed by Chun et al.. The quality of the segmented image can be improved by dividing the grid into (k+1)^2 cells consisting of N_t pixels using k baselines. Each cell can be computed using O(N_t^<1.5>) time and requires O(N_t) space.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Image Segmentation / Maximum Weight Region Problem
Paper #	COMP2011-44
Date of Issue

Conference Information
Committee	COMP
Conference Date	2011/12/9(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)	Image Segmentation Using Maximum Weight Region
Sub Title (in English)
Keyword(1)	Image Segmentation
Keyword(2)	Maximum Weight Region Problem
1st Author's Name	Jinhee CHUN
1st Author's Affiliation	GSIS, Tohoku University()
2nd Author's Name	Natsuda KAOTHANTHONG
2nd Author's Affiliation	GSIS, Tohoku University
3rd Author's Name	Takeshi TOKUYAMA
3rd Author's Affiliation	GSIS, Tohoku University
Date	2011-12-16
Paper #	COMP2011-44
Volume (vol)	vol.111
Number (no)	360
Page	pp.pp.-
#Pages	7
Date of Issue