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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.