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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
