Weighted shapes for embedding perceived wholes

2012-01-01
Keles, Hacer Yalim
Özkar Kabakçıoğlu, Mine
Tarı, Zehra Sibel
Embedding parts is a key problem in computing when dealing with continuous matter such as shapes rather than discrete matter such as symbols. For computing part relations such as embedding, a technical framework that uses weighted shapes is introduced and implemented. In the proposed framework, for any given two-dimensional shape, the entire canvas is defined as a weighted shape and serves as a registration mark in detecting embedded parts. The approach treats shapes as perceived wholes rather than composed and eliminates the technical distinction between shape categories such as line, curve, or plane. The implementation is shown for two-dimensional shapes but is extendable to three dimensions. As demonstrated on a Seljuk geometric pattern, the framework allows for embedding multiple and various perceived wholes, thus exploring emerging shapes and shape relations to be used for analysis and synthesis in design.
ENVIRONMENT AND PLANNING B-PLANNING & DESIGN

Suggestions

Coarse-to-Fine Isometric Shape Correspondence by Tracking Symmetric Flips
Sahillioğlu, Yusuf; Yemez, Y. (2013-02-01)
We address the symmetric flip problem that is inherent to multi-resolution isometric shape matching algorithms. To this effect, we extend our previous work which handles the dense isometric correspondence problem in the original 3D Euclidean space via coarse-to-fine combinatorial matching. The key idea is based on keeping track of all optimal solutions, which may be more than one due to symmetry especially at coarse levels, throughout denser levels of the shape matching process. We compare the resulting den...
Fixed-frequency slice computation of discrete Cohen's bilinear class of time-frequency representations
Ozgen, MT (2000-02-01)
This communication derives DFT-sample-based discrete formulas directly in the spectral-correlation domain for computing fixed-frequency slices of discrete Cohen's class members with reduced computational cost, both for one-dimensional and multidimensional (specifically two-dimensional (2-D)) finite-extent sequence cases. Frequency domain integral expressions that define discrete representations are discretized to obtain these discrete implementation formulas. 2-D ambiguity function domain kernels are chosen...
Coloring 3D symmetry set: perceptual meaning and significance in 3D
Tarı, Zehra Sibel (1999-12-01)
A computational implementation for assigning perceptual meaning and significance to the points in the symmetry is presented. The coloring scheme allows recovery of the features of interest such as the shape skeletons from the complicated symmetry representation. The method is applicable to arbitrary data including color and multi-modality images. On the computational side, for a 256 × 256 binary image, two minutes on a low-end Pentium machine is enough to compute both the distance function and the colored n...
Embedding Shapes without Predefined Parts
Keles, Hacer Yalim; Özkar, Mine; Tarı, Zehra Sibel (SAGE Publications, 2010-8)
For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed 'overcomplete graphs', comprise boundary elements of shapes and how they are assembled, and are utilized in a two-phase algorithm that systematically searches for embedded parts. The associated implementation is developed to receiv...
Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence
Sahillioğlu, Yusuf; Yemez, Y. (2011-08-01)
We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse-to-fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum-distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on...
Citation Formats
H. Y. Keles, M. Özkar Kabakçıoğlu, and Z. S. Tarı, “Weighted shapes for embedding perceived wholes,” ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, pp. 360–375, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32700.