A Data Driven Modeling of Ornaments

Adanova, Venera
Tarı, Zehra Sibel
Ornaments are created by repeating a base motif via combination of four primitive geometric repetition operations: translation, rotation, reflection, and glide reflection. The way the operations are combined defines symmetry groups. Thus, the classical study of ornaments is based on group theory. However, the discrete and inflexible nature of symmetry groups fail to capture relations among ornaments when artistic freedom is used to break symmetry via intriguing choices of base motifs and color permutations. In this work, we present a data driven modeling approach, where we go beyond group-theoretical framework and suggest continuous characterization of planar ornaments.


A Comparative evaluation of foreground / background segmentation algorithms
Pakyürek, Muhammet; Akar, Gözde; Department of Electrical and Electronics Engineering (2012)
Foreground Background segmentation is a process which separates the stationary objects from the moving objects on the scene. It plays significant role in computer vision applications. In this study, several background foreground segmentation algorithms are analyzed by changing their critical parameters individually to see the sensitivity of the algorithms to some difficulties in background segmentation applications. These difficulties are illumination level, view angles of camera, noise level, and range of ...
Multiple Shape Correspondence by Dynamic Programming
Sahillioğlu, Yusuf (2014-10-01)
We present a multiple shape correspondence method based on dynamic programming, that computes consistent bijective maps between all shape pairs in a given collection of initially unmatched shapes. As a fundamental distinction from previous work, our method aims to explicitly minimize the overall distortion, i.e., the average isometric distortion of the resulting maps over all shape pairs. We cast the problem as optimal path finding on a graph structure where vertices are maps between shape extremities. We e...
A new representation for the properties of anisotropic elastic fiber reinforced composite materials
Gaith, MS; Akgoz, CY (2005-09-01)
A new procedure based on constructing orthonormal tensor basis using the form-invariant expressions which can easily be extended to any tensor of rank n. A new decomposition, which is not in literature, of the stress tensor is presented. An innovational general form and more explicit physical property of the symmetric fourth rank elastic tensors is presented. A new method to measure the stiffness and piezoelectricity in the elastic fiber reinforced composite and piezoelectric ceramics materials using the no...
Analysis of Planar Ornament Patterns via Motif Asymmetry Assumption and Local Connections
Adanova, Venera; Tarı, Zehra Sibel (2019-03-01)
Planar ornaments, a.k.a. wallpapers, are regular repetitive patterns which exhibit translational symmetry in two independent directions. There are exactly 17 distinct planar symmetry groups. We present a fully automatic method for complete analysis of planar ornaments in 13 of these groups, specifically, the groups called p6, p6m, p4g, p4m, p4, p31m, p3m, p3, cmm, pgg, pg, p2 and p1. Given the image of an ornament fragment, we present a method to simultaneously classify the input into one of the 13 groups a...
Modeling Electromagnetic Scattering from Random Array of Objects by Form Invariance of Maxwell's Equations
ÖZGÜN, ÖZLEM; Kuzuoğlu, Mustafa (2015-07-24)
Electromagnetic scattering from a random array of objects is modeled by using special coordinate transformations that are based on the form invariance property of Maxwell's equations. The main motivation is to perform multiple realizations of Monte Carlo simulations corresponding to different positions of objects in an efficient way by using a single mesh. This is achieved by locating transformation media within the computational domain. The proposed approach is applied to finite element method and tested b...
Citation Formats
V. Adanova and Z. S. Tarı, A Data Driven Modeling of Ornaments. 2019, p. 297.