2011
DOI: 10.1109/tvcg.2010.105
|View full text |Cite
|
Sign up to set email alerts
|

Beautification of Design Sketches Using Trainable Stroke Clustering and Curve Fitting

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 dev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
54
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 55 publications
(54 citation statements)
references
References 29 publications
0
54
0
Order By: Relevance
“…Our work is also related to the previous interactive or automatic beautification systems [Igarashi et al 1997;Orbay and Kara 2011;Zitnick 2013], none of which, however, uses a picture to guide the beautification process. We do not regard our technique as a beautification system, since drawing is a creative process and we try to preserve the original drawing style of the user.…”
Section: Related Workmentioning
confidence: 99%
“…Our work is also related to the previous interactive or automatic beautification systems [Igarashi et al 1997;Orbay and Kara 2011;Zitnick 2013], none of which, however, uses a picture to guide the beautification process. We do not regard our technique as a beautification system, since drawing is a creative process and we try to preserve the original drawing style of the user.…”
Section: Related Workmentioning
confidence: 99%
“…(5) is a slight modification of the discontinuity term introduced in the stage of stroke clustering in Ref. [18]. However, in some cases, two geometrically connected line segments may actually come from two semantically different objects.…”
Section: Coherence Line Matchingmentioning
confidence: 99%
“…While vectorization algorithms could be used to convert bitmaps into vectorial curves, state-of-the-art algorithms remain challenged by sketchy drawings [Noris et al 2013], or require the temporal information provided by digital sketching [Orbay and Kara 2011]. When applied on a rough sketch, the recent method by Noris et al [2013] produces multiple curves in the presence of overlapping strokes (Figure 3(a)(b)).…”
Section: Related Workmentioning
confidence: 99%