Learning a manifold of fonts

The design and manipulation of typefaces and fonts is an area requiring substantial expertise; it can take many years of study to become a proficient typographer. At the same time, the use of typefaces is ubiquitous; there are many users who, while not experts, would like to be more involved in tweaking or changing existing fonts without suffering the learning curve of professional typography packages. Given the wealth of fonts that are available today, we would like to exploit the expertise used to produce these fonts, and to enable everyday users to create, explore, and edit fonts. To this end, we build a generative manifold of standard fonts. Every location on the manifold corresponds to a unique and novel typeface, and is obtained by learning a non-linear mapping that intelligently interpolates and extrapolates existing fonts. Using the manifold, we can smoothly interpolate and move between existing fonts. We can also use the manifold as a constraint that makes a variety of new applications possible. For instance, when editing a single character, we can update all the other glyphs in a font simultaneously to keep them compatible with our changes.

[1]  Siddhartha Chaudhuri,et al.  A probabilistic model for component-based shape synthesis , 2012, ACM Trans. Graph..

[2]  Roger D. Hersch,et al.  Next generation typeface representations: revisiting parametric fonts , 2010, DocEng '10.

[3]  David Salesin,et al.  Example-based hinting of true type fonts , 2000, SIGGRAPH.

[4]  Vincent M. K. Lau Learning by example for parametric font design , 2009, SIGGRAPH ASIA '09.

[5]  Ian D. Reid,et al.  Nonlinear shape manifolds as shape priors in level set segmentation and tracking , 2011, CVPR 2011.

[6]  C. Lawrence Zitnick,et al.  Handwriting beautification using token means , 2013, ACM Trans. Graph..

[7]  Marc Alexa,et al.  As-rigid-as-possible shape interpolation , 2000, SIGGRAPH.

[8]  Neil D. Lawrence,et al.  Probabilistic Non-linear Principal Component Analysis with Gaussian Process Latent Variable Models , 2005, J. Mach. Learn. Res..

[9]  Koichi Itoh,et al.  A Curve Fitting Algorithm for Character Fonts , 1993, Electron. Publ..

[10]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[11]  Andrew W. Fitzgibbon,et al.  The Joint Manifold Model for Semi-supervised Multi-valued Regression , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[12]  Stephen DiVerdi,et al.  Learning part-based templates from large collections of 3D shapes , 2013, ACM Trans. Graph..

[13]  Ariel Shamir,et al.  Feature-Based Design of Fonts Using Constraints , 1998, EP.

[14]  Jörn Loviscach The universe of fonts, charted by machine , 2010, SIGGRAPH '10.

[15]  Donald E. Knuth,et al.  The Metafont book , 1989 .

[16]  Charles R. Giardina,et al.  Elliptic Fourier features of a closed contour , 1982, Comput. Graph. Image Process..

[17]  Roger D. Hersch,et al.  Model-based matching and hinting of fonts , 1991, SIGGRAPH.

[18]  Robert C. Bolles,et al.  Parametric Correspondence and Chamfer Matching: Two New Techniques for Image Matching , 1977, IJCAI.

[19]  Ghassan Hamarneh,et al.  A Survey on Shape Correspondence , 2011, Comput. Graph. Forum.

[20]  Roger D. Hersch,et al.  Parameterizable Fonts Based on Shape Components , 2001, IEEE Computer Graphics and Applications.

[21]  M. V. D. Panne,et al.  Displacement Interpolation Using Lagrangian Mass Transport , 2011 .

[22]  Neil D. Lawrence,et al.  Bayesian Gaussian Process Latent Variable Model , 2010, AISTATS.

[23]  Donald Ervin Knuth,et al.  The METAFONTbook , 1986 .

[24]  T. Funkhouser,et al.  Shape matching and anisotropy , 2004, SIGGRAPH 2004.

[25]  Takeo Igarashi,et al.  Example-Based Automatic Font Generation , 2010, Smart Graphics.