Share Email Print
cover

Proceedings Paper

Auto-segmentation based on graphcut and template
Author(s): Hong Zhang; Wei Zuo; Ying Mu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper, the main idea is to use the prior knowledge to guide the segmentation. Firstly the continuity among adjacent frames is used to create a motion template according to the Displaced Frame Difference's (DFD) higher character . And then the color template is established by using the k-means clustering. Based upon the information derived from the previous two templates, the segmentation image is defined as foreground, background and boundary regions. Then, the segmentation problem is formulated as an energy minimization problem. The hard edge of foreground is then obtained by implementing graph-cut algorithm. Experimental results demonstrate the effectiveness of proposed algorithm.

Paper Details

Date Published: 15 November 2007
PDF: 8 pages
Proc. SPIE 6786, MIPPR 2007: Automatic Target Recognition and Image Analysis; and Multispectral Image Acquisition, 67864W (15 November 2007); doi: 10.1117/12.751267
Show Author Affiliations
Hong Zhang, BeiHang Univ. (China)
Wei Zuo, BeiHang Univ. (China)
Ying Mu, BeiHang Univ. (China)


Published in SPIE Proceedings Vol. 6786:
MIPPR 2007: Automatic Target Recognition and Image Analysis; and Multispectral Image Acquisition

© SPIE. Terms of Use
Back to Top