scispace - formally typeset
Journal ArticleDOI

Beautification of Design Sketches Using Trainable Stroke Clustering and Curve Fitting

Reads0
Chats0
TLDR
This approach enables greater conceptual freedom during visual ideation activities by allowing designers to develop their sketches using multiple, casually drawn strokes without requiring them to indicate the separation between different stroke groups.
Abstract
We propose a new sketch parsing and beautification method that converts digitally created design sketches into beautified line drawings. Our system uses a trainable, sequential bottom-up and top-down stroke clustering method that learns how to parse input pen strokes into groups of strokes each representing a single curve, followed by point-cloud ordering that facilitates curve fitting and smoothing. This approach enables greater conceptual freedom during visual ideation activities by allowing designers to develop their sketches using multiple, casually drawn strokes without requiring them to indicate the separation between different stroke groups. With the proposed method, raw sketches are seamlessly converted into vectorized geometric models, thus, facilitating downstream assessment and editing activities.

read more

Citations
More filters
Journal ArticleDOI

Learning to simplify: fully convolutional networks for rough sketch cleanup

TL;DR: This paper presents a novel technique to simplify sketch drawings based on learning a series of convolution operators, which is able to process images of any dimensions and aspect ratio as input, and outputs a simplified sketch which has the same dimensions as the input image.
Journal ArticleDOI

Automated registration of dense terrestrial laser-scanning point clouds using curves

TL;DR: An automatic method for registering terrestrial laser scans in terms of robustness and accuracy is proposed, demonstrating a reliable and stable solution for accurately registering complex scenes without good initial alignment.
Journal ArticleDOI

Mastering Sketching: Adversarial Augmentation for Structured Prediction

TL;DR: An integral framework for training sketch simplification networks that convert challenging rough sketches into clean line drawings is presented and it is shown that, using the same framework, it is possible to train the network to perform the inverse problem, i.e., convert simple line sketches into pencil drawings, which is not possible using the standard mean squared error loss.
Journal ArticleDOI

Handwriting beautification using token means

TL;DR: This paper proposes an efficient real-time method for finding matching sets of stroke samples called tokens in a potentially large database of writings from a user, and refine the user's most recently written strokes by averaging them with the matching tokens.
Journal ArticleDOI

Fidelity vs. simplicity: a global approach to line drawing vectorization

TL;DR: This work proposes the first vectorization algorithm that explicitly balances fidelity to the input bitmap with simplicity of the output, as measured by the number of curves and their degree, and demonstrates the robustness of the algorithm on a variety of drawings, sketchy cartoons and rough design sketches.
References
More filters
Journal ArticleDOI

Snakes : Active Contour Models

TL;DR: This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.
Journal ArticleDOI

Nonlinear dimensionality reduction by locally linear embedding.

TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Journal ArticleDOI

A global geometric framework for nonlinear dimensionality reduction.

TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Journal ArticleDOI

Laplacian Eigenmaps for dimensionality reduction and data representation

TL;DR: In this article, the authors proposed a geometrically motivated algorithm for representing high-dimensional data, based on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold and the connections to the heat equation.
Related Papers (5)