论文标题
通过学习图形草图表示的同义词来链接草图补丁
Linking Sketch Patches by Learning Synonymous Proximity for Graphic Sketch Representation
论文作者
论文摘要
图形草图表示可有效表示草图。现有方法将草图从草图中裁剪为图形节点,并根据草图的绘图顺序或画布上的欧几里得距离构建边缘。但是,草图的绘图顺序可能不是唯一的,而草图的语义相关部分的补丁可能在画布上彼此遥远。在本文中,我们提出了一种用于图形草图表示的订单不变的语义感知方法。裁剪的草图补丁是根据其全局语义或局部几何形状(即同义近端)链接的,即通过计算捕获的贴片嵌入之间的余弦相似性来链接。可以学习这种构造的边缘以适应草图图的变化,从而使消息传递在同义补丁之间。通过图形卷积网络从同义补丁中汇总消息起着DeNoising的作用,这有助于产生可靠的补丁嵌入和准确的草图表示。此外,我们与网络学习共同对嵌入式嵌入了聚类约束。同义补丁是自组织为紧凑型簇的,其嵌入方式被引导向分配的集群质心移动。它提高了计算的同义邻近度的准确性。实验结果表明,我们的方法显着提高了可控的草图合成和草图愈合的性能。
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 synonymous patches by graph convolutional networks plays a role of denoising, which is beneficial to produce robust patch embeddings and accurate sketch representations. Furthermore, we enforce a clustering constraint over the embeddings jointly with the network learning. The synonymous patches are self-organized as compact clusters, and their embeddings are guided to move towards their assigned cluster centroids. It raises the accuracy of the computed synonymous proximity. Experimental results show that our method significantly improves the performance on both controllable sketch synthesis and sketch healing.