Share Email Print

Proceedings Paper

From primal sketch to 2.1D sketch with contour reorganization
Author(s): Ru-xin Gao; Nong Sang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper proposed a model for 2.1D sketch based on primalsketch [6,7] and a corresponding algorithm based on SWC(Swendsen-Wang Cut)[1,2]. Given a primal sketch graph, all boundaries' color and curvature information can be gotten from the dictionary of image primitives of the primal sketch. Suppose all curves in the sketch graph can be combined into closed contours and then contour can be combined into regions. Calculating boundaries similarity energy of two regions by comparing the comparability using the color and curvature information of boundaries, then the energy is regarded as the proposal of SWC. All regions are regarded as nodes of graph space, then the 2.1D sketch problem can be looked as graph partition problem. In each step, all curves will be reorganized into contours and then contours generate regions. Some experiment results based on above model and algorithm are given in the paper.

Paper Details

Date Published: 15 November 2007
PDF: 9 pages
Proc. SPIE 6788, MIPPR 2007: Pattern Recognition and Computer Vision, 67881R (15 November 2007); doi: 10.1117/12.749978
Show Author Affiliations
Ru-xin Gao, Huazhong Univ. of Science and Technology (China)
Lotus Hill Research Institute (China)
Nong Sang, Huazhong Univ. of Science and Technology (China)

Published in SPIE Proceedings Vol. 6788:
MIPPR 2007: Pattern Recognition and Computer Vision
S. J. Maybank; Mingyue Ding; F. Wahl; Yaoting Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top