Presentation 2001/2/1
GRAPH-BASED COLOR IMAGE SEGMENTATION USING EDGE MAGNITUDE FOR IMAGE UNDERSTANDING
Hiroki Takahashi, Masayuki Nakajima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes color image segmentation algorithm which is aimed to assist image understanding. The proposed method is based on graph-based approach and employs comparison function proposed by P.F.Felzenszwalb et.al.. At first, variable weighted gaussian smoothing filter, which is also proposed in this paper to remain edge property, is performed to an image. Next, graph is generated, in which eight neighbor pixels are defined as nodes and, the distance of color in L^*u^*v^* color space and edge magnitude are defined as edge weights. Based on this graph, image is segmented. Finally, the segmented regions are integrated using inclusion relation among regions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # IE2000-175
Date of Issue

Conference Information
Committee IE
Conference Date 2001/2/1(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 Image Engineering (IE)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) GRAPH-BASED COLOR IMAGE SEGMENTATION USING EDGE MAGNITUDE FOR IMAGE UNDERSTANDING
Sub Title (in English)
Keyword(1)
1st Author's Name Hiroki Takahashi
1st Author's Affiliation Graduate School of Information Science & Engineering, Tokyo Institute of Technology()
2nd Author's Name Masayuki Nakajima
2nd Author's Affiliation Graduate School of Information Science & Engineering, Tokyo Institute of Technology
Date 2001/2/1
Paper # IE2000-175
Volume (vol) vol.100
Number (no) 615
Page pp.pp.-
#Pages 4
Date of Issue