As-compact-as-possible vectorization for character images
Article No.: 5, Pages 1 - 4
Abstract
It is quite time-consuming to produce high-quality compact font libraries, especially for north-east Asia language systems that contain thousands of characters. However, existing vectorization algorithms either generate results with large storage requirements, or lose most stylish details after vectorization. To solve this problem, we propose a novel data-driven vectorization algorithm for character images to make the number of control points on vectorized contours as few as possible while preserving significant details. Experimental results demonstrate that our method clearly outperforms other state-of-the-art approaches by not only preserving most stylish features but also dramatically reducing the size of vectorized fonts.
Supplementary Material
Supplemental material.
- Download
- 643.76 KB
References
[1]
Pankaj K Agarwal, Sariel Har-Peled, Nabil H Mustafa, and Yusu Wang. 2005. Near-linear time approximation algorithms for curve simplification. Algorithmica 42, 3--4 (2005), 203--219.
[2]
Wing Shiu Chan and F Chin. 1996. Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry & Applications 6, 01 (1996), 59--77.
[3]
Chao Dong, Chen Change Loy, Kaiming He, and Xiaoou Tang. 2014. Learning a deep convolutional network for image super-resolution. In ECCV. Springer, 184--199.
[4]
Phillip Isola, Jun-Yan Zhu, Tinghui Zhou, and Alexei A Efros. 2016. Image-to-Image Translation with Conditional Adversarial Networks. arxiv (2016).
[5]
Donald E. Knuth. 1979. METAFONT: A System for Alphabet Design. Technical Report. Stanford, CA, USA.
[6]
Alexander Kolesnikov and Pasi FrÃd'nti. 2007. Polygonal approximation of closed discrete curves. Pattern Recognition 40, 4 (2007), 1282--1293.
[7]
Christian Ledig, Lucas Theis, Ferenc Huszár, Jose Caballero, Andrew Cunningham, Alejandro Acosta, Andrew Aitken, Alykhan Tejani, Johannes Totz, Zehan Wang, et al. 2016. Photo-realistic single image super-resolution using a generative adversarial network. arXiv preprint arXiv:1609.04802 (2016).
[8]
Zhouhui Lian, Bo Zhao, and Jianguo Xiao. 2016a. Automatic generation of large-scale handwriting fonts via style learning. In SIGGRAPH ASIA 2016 Technical Briefs. ACM, 12.
[9]
Zhouhui Lian, Bo Zhao, and Jianguo Xiao. 2016b. Automatic Generation of Large-scale Handwriting Fonts via Style Learning. In SIGGRAPH ASIA 2016 Technical Briefs. ACM.
[10]
Wanqiong Pan, Zhouhui Lian, Yingmin Tang, and Jianguo Xiao. 2014. Skeleton-guided vectorization of Chinese calligraphy images. In MMSP 2014. 1--6.
[11]
Michael Plass and Maureen C. Stone. 1983. Curve-fitting with piecewise parametric cubics. In SIGGRAPH 1983. 229--239.
[12]
Junsong Zhang, Guohong Mao, Hongwei Lin, Jinhui Yu, and Changle Zhou. 2011. Outline font generating from images of ancient Chinese calligraphy. Transactions on edutainment V 5 (2011), 122--131.
Index Terms
- As-compact-as-possible vectorization for character images
Recommendations
Outer-loop vectorization: revisited for short SIMD architectures
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniquesVectorization has been an important method of using data-level parallelism to accelerate scientific workloads on vector machines such as Cray for the past three decades. In the last decade it has also proven useful for accelerating multi-media and ...
FlexVec: auto-vectorization for irregular loops
PLDI '16Traditional vectorization techniques build a dependence graph with distance and direction information to determine whether a loop is vectorizable. Since vectorization reorders the execution of instructions across iterations, in general instructions ...
Multi-dimensional Vectorization in LLVM
WPMVP'19: Proceedings of the 5th Workshop on Programming Models for SIMD/Vector ProcessingLoop vectorization is a classic technique to exploit SIMD instructions in a productive way. In multi-dimensional vectorization, multiple loops of a loop nest are vectorized at once. This exposes opportunities for data reuse, register tiling and more ...
Comments
Information & Contributors
Information
Published In
December 2018
135 pages
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 December 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Natural Science Foundation of China
- National Key Research and Development Program of China
- National Language Committee of China
Conference
SA '18
Sponsor:
Acceptance Rates
Overall Acceptance Rate 178 of 869 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 149Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)1
Reflects downloads up to 27 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in