Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Analysis of planar ornament patterns via motif asymmetry assumption and local connections (1710.04623v1)

Published 12 Oct 2017 in cs.CV

Abstract: 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 $p6m, \, p6, \, 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 and extract the so called fundamental domain (FD), the minimum region that is sufficient to reconstruct the entire ornament. A nice feature of our method is that even when the given ornament image is a small portion such that it does not contain multiple translational units, the symmetry group as well as the fundamental domain can still be defined. This is because, in contrast to common approach, we do not attempt to first identify a global translational repetition lattice. Though the presented constructions work for quite a wide range of ornament patterns, a key assumption we make is that the perceivable motifs (shapes that repeat) alone do not provide clues for the underlying symmetries of the ornament. In this sense, our main target is the planar arrangements of asymmetric interlocking shapes, as in the symmetry art of Escher.

Citations (1)

Summary

We haven't generated a summary for this paper yet.