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

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...
Detail-Preserving Mesh Unfolding for Nonrigid Shape Retrieval
Sahillioğlu, Yusuf (2016-06-01)
We present a shape deformation algorithm that unfolds any given 3D shape into a canonical pose that is invariant to nonrigid transformations. Unlike classical approaches, such as least-squares multidimensional scaling, we preserve the geometric details of the input shape in the resulting shape, which in turn leads to a content-based nonrigid shape retrieval application with higher accuracy. Our optimization framework, fed with a triangular or a tetrahedral mesh in 3D, tries to move each vertex as far away f...
Modular exponentiation methods in cryptography
Yünüak, Hasan Bartu; Cenk, Murat; Department of Cryptography (2017)
Modular exponentiation has an important role in many cryptographic algorithms. These exponentiation methods differ in the bases used and their representations, the repeating aspect, and for which algorithms they are used for: fixed or variable base. Our research aims to compare the efficiencies and implementation timings for some selected algorithms. Also, we look at the options for using a dedicated cubing algorithm, and compare them with the current algorithms.
Spatial synthesis by disjunctive constraint satisfaction
Baykan, CA; Fox, MS (Cambridge University Press (CUP), 1997-09-01)
The spatial synthesis problem addressed in this paper is the configuration of rectangles in 2D space, where the sides of the rectangles are parallel to an orthogonal coordinate system. Variables are the locations of the edges of the rectangles and their orientations. Algebraic constraints on these variables define a layout and constitute a constraint satisfaction problem. We give a new O(n(2)) algorithm for incremental path-consistency, which is applied after adding each algebraic constraint. Problem requir...
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.