Abstraction of 2D shapes in terms of parts

Mi, Xiaofeng; DeCarlo, Doug; Stone, Matthew

doi:10.1145/1572614.1572617

Cited by 37 publications

(32 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem is usually referred to as abstraction [32], and is of interest to applications in shape recognition and processing. In [10], we investigated the problem of abstracting 3D surfaces as a network of curves and presented a principled framework that combines structural segmentation and shape approximation.…”

Section: Simplificationmentioning

confidence: 99%

An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

Goes

Cohen-Steiner

Alliez

et al. 2011

Computer Graphics Forum

View full text Add to dashboard Cite

We propose a robust 2D shape reconstruction and simplification algorithm which takes as input a defect‐laden point set with noise and outliers. We introduce an optimal‐transport driven approach where the input point set, considered as a sum of Dirac measures, is approximated by a simplicial complex considered as a sum of uniform measures on 0‐ and 1‐simplices. A fine‐to‐coarse scheme is devised to construct the resulting simplicial complex through greedy decimation of a Delaunay triangulation of the input point set. Our method performs well on a variety of examples ranging from line drawings to grayscale images, with or without noise, features, and boundaries.

show abstract

Section: Simplificationmentioning

confidence: 99%

An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

Goes

Cohen-Steiner

Alliez

et al. 2011

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…The system relies on the psychological findings that abstract arts are usually more ambiguous than photographs and representational arts, and accordingly tries to render abstract paintings by increasing the perceptual ambiguities of images with numerical control. Compared with past research [DeCarlo and Santella 2002;Winnemöller et al 2006;Orzan et al 2007;Rigau et al 2008;Mi et al 2009], Sisley works in the way corresponding to a different level in our biological visual system [Marr 1982], by dealing with scene/object recognition using probability density estimation and belief propagation.…”

Section: Discussionmentioning

confidence: 99%

“…Orzan et al [2007] developed a method for structure-preserving image manipulation and enhancement. Mi et al [2009] proposed a part-based computational method for the abstraction of 2D shapes. Specific abstract art styles have also been widely studied, including mosaics and collages [Finkelstein and Range 1998;Klein et al 2002;Smith et al 2005;Gal et al 2007;Orchard and Kaplan 2008], Escherization [Kaplan and Salesin 2004], cubism [Klein et al 2001;Collomosse and Hall 2003], surrealism by image fusion [Raskar et al 2004], futurism by motion emphasis cues [Collomosse and Hall 2006] and abstract texture synthesis [Morel et al 2006].…”

Section: Previous Workmentioning

confidence: 99%

Sisley the abstract painter

Zhao

Zhu

2010

Proceedings of the 8th International Symposium on Non-Photorealistic Animation and Rendering - NPAR 10

View full text Add to dashboard Cite

We present an interactive abstract painting system named Sisley. Sisley works upon the psychological principle [Berlyne 1971] that abstract arts are often characterized by their greater perceptual ambiguities than photographs, which tend to invoke moderate mental efforts of the audience for interpretation, accompanied with subtle aesthetic pleasures. Given an input photograph, Sisley decomposes it into a hierarchy/tree of its constituent image components (e.g., regions, objects of different categories) with interactive guidance from the user, then automatically generates corresponding abstract painting images, with increased ambiguities of both the scene and individual objects at desired levels. Sisley consists of three major working parts: (1) an interactive image parser executing the tasks of segmentation, labeling, and hierarchical organization, (2) a painterly rendering engine with abstract operators for transferring the image appearance, and (3) a numerical ambiguity computation and control module of servomechanism. With the help of Sisley, even an amateur user can create abstract paintings from photographs easily in minutes. We have evaluated the rendering results of Sisley using human experiments, and verified that they have similar abstract effects to original abstract paintings by artists.

show abstract

“…Consequently, a low-complexity schematization may not be possible. Mi et al [17] describe an algorithm for curved abstraction. They detect basic parts and rebuild a shape up to a given detail using these parts.…”

Section: Introductionmentioning

confidence: 99%

Exploring Curved Schematization of Territorial Outlines

Goethem

Meulemans

Speckmann

et al. 2015

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few automated approaches for curved schematization; most previous work focusses on straight lines. We present a new algorithm for areapreserving curved schematization of geographic outlines. Our algorithm converts a simple polygon into a schematic crossing-free representation using circular arcs. We use two basic operations to iteratively replace consecutive arcs until the desired complexity is reached. Our results are not restricted to arcs ending at input vertices. The method can be steered towards different degrees of "curviness": we can encourage or discourage the use of arcs with a large central angle via a single parameter. Our method creates visually pleasing results even for very low output complexities. To evaluate the effectiveness of our design choices we perform a geometric evaluation of the resulting schematizations. Besides the geometric qualities of our algorithm, we also investigate the potential of curved schematization as a concept. We conducted an online user study investigating the effectiveness of curved schematizations compared to straight-line schematizations. While the visual complexity of curved shapes was judged higher than that of straight-line shapes, users generally preferred curved schematizations. We observed that curves significantly improved the ability of users to match schematized shapes of moderate complexity to their unschematized equivalents.

show abstract

Abstraction of 2D shapes in terms of parts

Cited by 37 publications

References 32 publications

An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

An Optimal Transport Approach to Robust Reconstruction and Simplification of 2D Shapes

Sisley the abstract painter

Exploring Curved Schematization of Territorial Outlines

Contact Info

Product

Resources

About