{"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.