Conference Paper

Generative Object Definition and Semantic Recognition.

DOI: 10.2312/3DOR/3DOR11/001-008 Conference: Eurographics Workshop on 3D Object Retrieval 2011, Llandudno, UK, April 10, 2011. Proceedings
Source: DBLP

ABSTRACT ''What is the difference between a cup and a door?'' These kinds of questions have to be answered in the context of digital libraries. This semantic information, which describes an object on a high, abstract level, is needed in order to provide digital library services such as indexing, markup and retrieval. In this paper we present a new approach to encode and to extract such semantic information. We use generative modeling techniques to describe a class of objects: each class is represented by one algorithm; and each object is one set of high-level parameters, which reproduces the object if passed to the algorithm. Furthermore, the algorithm is annotated with semantic information, i.e. a human-readable description of the object class it represents. We use such an object description to recognize objects in real-world data e.g. laser scans. Using an algorithmic object description, we are able to identify 3D subparts, which can be described and generated by the algorithm. Furthermore, we can determine the needed input parameters. In this way, we can classify objects, recognize them semantically and we can determine their parameters (cup's height, radius, etc.).

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: "Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. Perlis Many natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a compact representation of their Euclidean symmetries. These symmetries can be partial, approximate, or both. The method is based on matching simple local shape signatures in pairs and using these matches to accumulate evidence for symmetries in an appropriate transformation space. A clustering stage extracts potential significant symmetries of the object, followed by a verification step. Based on a statistical sampling analysis, we provide theoretical guarantees on the success rate of our algorithm. The extracted symmetry graph representation captures important high-level information about the structure of a geometric model which in turn enables a large set of further processing operations, including shape compression, segmentation, consistent editing, symmetrization, indexing for retrieval, etc. Copyright © 2006 by the Association for Computing Machinery, Inc.
    ACM Transactions on Graphics 07/2006; · 3.36 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are similar to the exemplar. We consider local similarity, i.e., each local neighborhood of the newly created object must match some local neighborhood of the exemplar. We show that we can find explicit shape modification rules that guarantee strict local similarity by looking at the structure of the partial symmetries of the object. By cutting the object into pieces along curves within symmetric areas, we can build shape operations that maintain local similarity by construction. We systematically collect such editing operations and analyze their dependency to build a shape grammar. We discuss how to extract general rewriting systems, context free hierarchical rules, and grid-based rules. All of this information is derived directly from the model, without user interaction. The extracted rules are then used to implement tools for semi-automatic shape modeling by example, which are demonstrated on a number of different example data sets. Overall, our paper provides a concise theoretical and practical framework for inverse procedural modeling of 3D objects.
    ACM Transactions on Graphics 07/2010; 29. · 3.36 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The theory of shape grammars defines a formalism to address the ambiguity that quantitative and symbolic computations mostly help us rule out in creative processes. The theory was first launched by Stiny and Gips in 1972 and has evolved into a groundbreaking pragmatist philosophy of shape and design since. The course, composed of a 2 hour lecture and an optional one-day workshop for 10-12 participants, introduces the fundamentals of the theory and optionally a venue for attendees to put these to practice in a hands-on workshop. The lecture will focus on giving some basic knowledge of shapes, shape algebras, and shape rules in order to explain how shape grammars translate visual and spatial thinking into design computation. Multiple examples of generative designs produced using shape grammars will be presented. The workshop consists of one exercise where participants will explore spatial relations between a number of shapes, leading to the production of a series of designs to be built by hand, out of a prescribed material such as wooden blocks or paper.