Image Vectorization with Depth: convexified shape layers with depth ordering

Ho Law, Sung Ha Kang
{"title":"Image Vectorization with Depth: convexified shape layers with depth ordering","authors":"Ho Law, Sung Ha Kang","doi":"arxiv-2409.06648","DOIUrl":null,"url":null,"abstract":"Image vectorization is a process to convert a raster image into a scalable\nvector graphic format. Objective is to effectively remove the pixelization\neffect while representing boundaries of image by scaleable parameterized\ncurves. We propose new image vectorization with depth which considers depth\nordering among shapes and use curvature-based inpainting for convexifying\nshapes in vectorization process.From a given color quantized raster image, we\nfirst define each connected component of the same color as a shape layer, and\nconstruct depth ordering among them using a newly proposed depth ordering\nenergy. Global depth ordering among all shapes is described by a directed\ngraph, and we propose an energy to remove cycle within the graph. After\nconstructing depth ordering of shapes, we convexify occluded regions by Euler's\nelastica curvature-based variational inpainting, and leverage on the stability\nof Modica-Mortola double-well potential energy to inpaint large regions. This\nis following human vision perception that boundaries of shapes extend smoothly,\nand we assume shapes are likely to be convex. Finally, we fit B\\'{e}zier curves\nto the boundaries and save vectorization as a SVG file which allows\nsuperposition of curvature-based inpainted shapes following the depth ordering.\nThis is a new way to vectorize images, by decomposing an image into scalable\nshape layers with computed depth ordering. This approach makes editing shapes\nand images more natural and intuitive. We also consider grouping shape layers\nfor semantic vectorization. We present various numerical results and\ncomparisons against recent layer-based vectorization methods to validate the\nproposed model.","PeriodicalId":501174,"journal":{"name":"arXiv - CS - Graphics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Image vectorization is a process to convert a raster image into a scalable vector graphic format. Objective is to effectively remove the pixelization effect while representing boundaries of image by scaleable parameterized curves. We propose new image vectorization with depth which considers depth ordering among shapes and use curvature-based inpainting for convexifying shapes in vectorization process.From a given color quantized raster image, we first define each connected component of the same color as a shape layer, and construct depth ordering among them using a newly proposed depth ordering energy. Global depth ordering among all shapes is described by a directed graph, and we propose an energy to remove cycle within the graph. After constructing depth ordering of shapes, we convexify occluded regions by Euler's elastica curvature-based variational inpainting, and leverage on the stability of Modica-Mortola double-well potential energy to inpaint large regions. This is following human vision perception that boundaries of shapes extend smoothly, and we assume shapes are likely to be convex. Finally, we fit B\'{e}zier curves to the boundaries and save vectorization as a SVG file which allows superposition of curvature-based inpainted shapes following the depth ordering. This is a new way to vectorize images, by decomposing an image into scalable shape layers with computed depth ordering. This approach makes editing shapes and images more natural and intuitive. We also consider grouping shape layers for semantic vectorization. We present various numerical results and comparisons against recent layer-based vectorization methods to validate the proposed model.
带深度的图像矢量化:带深度排序的凸形图层
图像矢量化是将光栅图像转换为可缩放矢量图形格式的过程。其目的是有效消除像素化效应,同时用可缩放的参数化曲线表示图像的边界。我们提出了新的深度图像矢量化方法,它考虑了形状之间的深度排序,并在矢量化过程中使用基于曲率的内绘来凸化形状。从给定的彩色量化光栅图像中,我们首先将相同颜色的每个连接分量定义为一个形状层,并使用新提出的深度排序能量来构建它们之间的深度排序。所有形状的全局深度排序由一个有向图描述,我们提出了一种能量来消除图中的循环。在构建了形状的深度排序后,我们通过基于欧拉曲率的变分涂色来凸显遮挡区域,并利用莫迪卡-莫托拉双井势能的稳定性来涂色大面积区域。这符合人类视觉对形状边界平滑延伸的感知,而且我们假设形状很可能是凸形的。最后,我们将 B\'{e}zier 曲线拟合到边界上,并将矢量化保存为 SVG 文件,这样就可以按照深度排序对基于曲率的内绘形状进行叠加。这种方法使形状和图像的编辑更加自然和直观。我们还考虑对形状层进行分组,以实现语义矢量化。我们展示了各种数值结果,并与近期基于图层的矢量化方法进行了比较,以验证所提出的模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信