VIVA: A Variational Image Vectorization Algorithm on Dual-Primal Graph Pairs

We propose a novel variational image vectorization algorithm (VIVA) which alternatively smooths contours by affine shortening flow and eliminates spurious regions by minimizing a Mumford-Shah-type functional. We introduce dual-primal graphs representing domain partitions which allows for effective iterative computation. The method provides varying levels of simplicity on the topology of the resulted vector graphics while effectively removing pixelization. It compares favorably to the state-of-art (SOTA) vectorization methods.