Revisiting Shape Embedding

Date

2009-09-19

Author

Keles, Hacer Yalim
Ozkar, Mine
Tarı, Zehra Sibel

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

137
views

0
downloads

We propose and describe a working computer implementation for shape grammars that handles embedding relations in two dimensional shapes. The technical framework proposed explores a graph data structure to temporarily represent boundary elements of shapes and how they are assembled. With the associated algorithms, this structure enables a systematic search for parts. The employment of user defined constraints allows for an interactive search. In accordance with the continuous character of shapes, the study puts forth a practical part detection method, which extends to non-deterministic cases.

Subject Keywords

Shape Grammar Interpreter, Computation With Shapes, Part Relations

URI

https://hdl.handle.net/11511/55804

Conference Name

27th Conference on Education and Research in Computer Aided Architectural Design in Europe

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
Shape from silhouette using topology-adaptive mesh deformation Yemez, Y.; Sahillioğlu, Yusuf (2009-10-01) We present a computationally efficient and robust shape from silhouette method based on topology-adaptive mesh deformation, which can produce accurate, smooth, and topologically consistent 3D mesh models of complex real objects. The deformation scheme is based on the conventional snake model coupled with local mesh transform operations that control the resolution and uniformity of the deformable mesh. Based on minimum and maximum edge length constraints imposed on the mesh, we describe a fast collision dete...
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...
A probabilistic sparse skeleton based object detection Altinoklu, Burak; Ulusoy, İlkay; Tarı, Zehra Sibel (Elsevier BV, 2016-11) We present a Markov Random Field (MRF) based skeleton model for object shape and employ it in a probabilistic chamfer-matching framework for shape based object detection. Given an object category, shape hypotheses are generated from a set of sparse (coarse) skeletons guided by suitably defined unary and binary potentials at and between shape parts. The Markov framework assures that the generated samples properly reflect the observed or desired shape variability. As the model employs a sparsely sampled skele...
Extended Target Tracking Using Gaussian Processes Wahlström, Niklas; Özkan, Emre (2015-08-15) In this paper, we propose using Gaussian processes to track an extended object or group of objects, that generates multiple measurements at each scan. The shape and the kinematics of the object are simultaneously estimated, and the shape is learned online via a Gaussian process. The proposed algorithm is capable of tracking different objects with different shapes within the same surveillance region. The shape of the object is expressed analytically, with well-defined confidence intervals, which can be used ...

Citation Formats

H. Y. Keles, M. Ozkar, and Z. S. Tarı, “Revisiting Shape Embedding,” presented at the 27th Conference on Education and Research in Computer Aided Architectural Design in Europe, Istanbul, TURKEY, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55804.