Linking Sketch Patches by Learning Synonymous Proximity for Graphic Sketch Representation
Sicong Zang, Shikui Tu, Lei Xu

TL;DR
This paper introduces a semantics-aware, order-invariant graph-based method for sketch representation that links patches based on their semantic similarity, improving sketch synthesis and healing.
Contribution
It proposes a novel, learnable, semantics-aware graph construction method for sketch patches that enhances robustness and accuracy in sketch representation tasks.
Findings
Significant improvement in sketch synthesis quality.
Enhanced performance in sketch healing tasks.
Robust patch embeddings through message passing and clustering.
Abstract
Graphic sketch representations are effective for representing sketches. Existing methods take the patches cropped from sketches as the graph nodes, and construct the edges based on sketch's drawing order or Euclidean distances on the canvas. However, the drawing order of a sketch may not be unique, while the patches from semantically related parts of a sketch may be far away from each other on the canvas. In this paper, we propose an order-invariant, semantics-aware method for graphic sketch representations. The cropped sketch patches are linked according to their global semantics or local geometric shapes, namely the synonymous proximity, by computing the cosine similarity between the captured patch embeddings. Such constructed edges are learnable to adapt to the variation of sketch drawings, which enable the message passing among synonymous patches. Aggregating the messages from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsComputer Graphics and Visualization Techniques · Interactive and Immersive Displays · Human Motion and Animation
