An Active Contour Model for Silhouette Vectorization using Bézier Curves

• URL: http://arxiv.org/abs/2505.05132v2
• Date: Sat, 10 May 2025 11:54:39 GMT
• Title: An Active Contour Model for Silhouette Vectorization using Bézier Curves
• Authors: Luis Alvarez, Jean-Michel Morel,
• Abstract summary: We propose an active contour model for silhouette vectorization using cubic B'ezier curves.<n>The proposed method significantly reduces the average distance between the silhouette boundary and its vectorization.
• Score: 6.948976192408852
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In this paper, we propose an active contour model for silhouette vectorization using cubic B\'ezier curves. Among the end points of the B\'ezier curves, we distinguish between corner and regular points where the orientation of the tangent vector is prescribed. By minimizing the distance of the B\'ezier curves to the silhouette boundary, the active contour model optimizes the location of the B\'ezier curves end points, the orientation of the tangent vectors in the regular points, and the estimation of the B\'ezier curve parameters. This active contour model can use the silhouette vectorization obtained by any method as an initial guess. The proposed method significantly reduces the average distance between the silhouette boundary and its vectorization obtained by the world-class graphic software Inkscape, Adobe Illustrator, and a curvature-based vectorization method, which we introduce for comparison. Our method also allows us to impose additional regularity on the B\'ezier curves by reducing their lengths.

Related papers

• Curve-Aware Gaussian Splatting for 3D Parametric Curve Reconstruction [14.628742412460346]
  This paper presents an end-to-end framework for reconstructing 3D parametric curves directly from multi-view edge maps.<n>We propose a novel bi-directional coupling mechanism between parametric curves and edge-oriented Gaussian components.<n>Our method significantly reduces the parameter count during training, achieving both higher efficiency and superior performance compared to existing approaches.
  arXiv  Detail & Related papers  (2025-06-26T15:48:08Z)
• WIR3D: Visually-Informed and Geometry-Aware 3D Shape Abstraction [13.645442589551354]
  WIR3D is a technique for abstracting 3D shapes through a sparse set of visually meaningful curves in 3D.<n>We optimize the parameters of Bezier curves such that they faithfully represent both the geometry and salient visual features.<n>We successfully apply our method for shape abstraction over a broad dataset of shapes.
  arXiv  Detail & Related papers  (2025-05-07T21:28:05Z)
• BG-Triangle: Bézier Gaussian Triangle for 3D Vectorization and Rendering [60.240908644910874]
  Differentiable rendering enables efficient optimization by allowing gradients to be computed through the rendering process.<n>Existing solutions approximate or re-formulate traditional rendering operations using smooth, probabilistic proxies.<n>We present a novel hybrid representation that combines B'ezier triangle-based vector graphics primitives with Gaussian-based probabilistic models.
  arXiv  Detail & Related papers  (2025-03-18T06:53:52Z)
• Segmentation-guided Layer-wise Image Vectorization with Gradient Fills [6.037332707968933]
  We propose a segmentation-guided vectorization framework to convert images into concise vector graphics with gradient fills. With the guidance of an embedded gradient-aware segmentation, our approach progressively appends gradient-filled B'ezier paths to the output.
  arXiv  Detail & Related papers  (2024-08-28T12:08:25Z)
• Neural Gradient Learning and Optimization for Oriented Point Normal Estimation [53.611206368815125]
  We propose a deep learning approach to learn gradient vectors with consistent orientation from 3D point clouds for normal estimation. We learn an angular distance field based on local plane geometry to refine the coarse gradient vectors. Our method efficiently conducts global gradient approximation while achieving better accuracy and ability generalization of local feature description.
  arXiv  Detail & Related papers  (2023-09-17T08:35:11Z)
• End-to-End Vectorized HD-map Construction with Piecewise Bezier Curve [9.129634919566026]
  HD-map construction has attracted significant research interest in the autonomous driving community. We introduce a simple yet effective architecture, named Piecewise Bezier HD-map Network (BeMapNet), which is formulated as a direct set prediction paradigm and postprocessing-free. In addition, based on the progressively restoration of Bezier curve, we also present an efficient Point-Curve-Region Loss for supervising more robust and precise HD-map modeling.
  arXiv  Detail & Related papers  (2023-06-16T09:05:52Z)
• CurveCloudNet: Processing Point Clouds with 1D Structure [49.137477909835276]
  We introduce a new point cloud processing scheme and backbone, called CurveCloudNet. CurveCloudNet parameterizes the point cloud as a collection of polylines, establishing a local surface-aware ordering on the points. We demonstrate that CurveCloudNet outperforms both point-based and sparse-voxel backbones in various segmentation settings.
  arXiv  Detail & Related papers  (2023-03-21T17:41:36Z)
• ContourRender: Detecting Arbitrary Contour Shape For Instance Segmentation In One Pass [48.57232627854642]
  We argue that the difficulty in regressing the contour points in one pass is mainly due to the ambiguity when discretizing a smooth contour into a polygon. To address the ambiguity, we propose a novel differentiable rendering-based approach named textbfContourRender. It first predicts a contour generated by an invertible shape signature, and then optimize the contour with the more stable silhouette by converting it to a contour mesh and rendering the mesh to a 2D map.
  arXiv  Detail & Related papers  (2021-06-07T07:23:03Z)
• Cloud2Curve: Generation and Vectorization of Parametric Sketches [109.02932608241227]
  We present Cloud2Curve, a generative model for scalable high-resolution vector sketches. We evaluate the generation and vectorization capabilities of our model on Quick, Draw! and KMNIST datasets.
  arXiv  Detail & Related papers  (2021-03-29T12:09:42Z)
• Channel-Directed Gradients for Optimization of Convolutional Neural Networks [50.34913837546743]
  We introduce optimization methods for convolutional neural networks that can be used to improve existing gradient-based optimization in terms of generalization error. We show that defining the gradients along the output channel direction leads to a performance boost, while other directions can be detrimental.
  arXiv  Detail & Related papers  (2020-08-25T00:44:09Z)
• Accelerating Smooth Games by Manipulating Spectral Shapes [51.366219027745174]
  We use matrix iteration theory to characterize acceleration in smooth games. We describe gradient-based methods, such as extragradient, as transformations on the spectral shape. We propose an optimal algorithm for bilinear games.
  arXiv  Detail & Related papers  (2020-01-02T19:21:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.