Deformable Model Retrieval Based on Topological and Geometric Signatures

With the increasing popularity of 3D applications such as computer games, a lot of 3D geometry models are being created. To encourage sharing and reuse, techniques that support matching and retrieval of these models are emerging. However, only a few of them can handle deformable models, i.e., models of different poses, and these methods are generally very slow. In this paper, we present a novel method for efficient matching and retrieval of 3D deformable models. Our research idea stresses on using both topological and geometric features at the same time. First, we propose Topological Point Ring (TPR) analysis to locate reliable topological points and rings. Second, we capture both local and global geometric information to characterize each of these topological features. To compare the similarity of two models, we adapt the Earth Mover Distance (EMD) as the distance function, and construct an indexing tree to accelerate the retrieval process. We demonstrate the performance of the new method, both in terms of accuracy and speed, through a large number of experiments

3D object retrieval and segmentation: various approaches including 2D poisson histograms and 3D electrical charge distributions.

Nowadays 3D models play an important role in many applications: viz. games, cultural heritage, medical imaging etc. Due to the fast growth in the number of available 3D models, understanding, searching and retrieving such models have become interesting fields within computer vision. In order to search and retrieve 3D models, we present two different approaches: one is based on solving the Poisson Equation over 2D silhouettes of the models. This method uses 60 different silhouettes, which are automatically extracted from different viewangles. Solving the Poisson equation for each silhouette assigns a number to each pixel as its signature. Accumulating these signatures generates a final histogram-based descriptor for each silhouette, which we call a SilPH (Silhouette Poisson Histogram). For the second approach, we propose two new robust shape descriptors based on the distribution of charge density on the surface of a 3D model. The Finite Element Method is used to calculate the charge density on each triangular face of each model as a local feature. Then we utilize the Bag-of-Features and concentric sphere frameworks to perform global matching using these local features. In addition to examining the retrieval accuracy of the descriptors in comparison to the state-of-the-art approaches, the retrieval speeds as well as robustness to noise and deformation on different datasets are investigated. On the other hand, to understand new complex models, we have also utilized distribution of electrical charge for proposing a system to decompose models into meaningful parts. Our robust, efficient and fully-automatic segmentation approach is able to specify the segments attached to the main part of a model as well as locating the boundary parts of the segments. The segmentation ability of the proposed system is examined on the standard datasets and its timing and accuracy are compared with the existing state-of-the-art approaches

Automatic Reconstruction of Parametric, Volumetric Building Models from 3D Point Clouds

Planning, construction, modification, and analysis of buildings requires means of representing a building's physical structure and related semantics in a meaningful way. With the rise of novel technologies and increasing requirements in the architecture, engineering and construction (AEC) domain, two general concepts for representing buildings have gained particular attention in recent years. First, the concept of Building Information Modeling (BIM) is increasingly used as a modern means for representing and managing a building's as-planned state digitally, including not only a geometric model but also various additional semantic properties. Second, point cloud measurements are now widely used for capturing a building's as-built condition by means of laser scanning techniques. A particular challenge and topic of current research are methods for combining the strengths of both point cloud measurements and Building Information Modeling concepts to quickly obtain accurate building models from measured data. In this thesis, we present our recent approaches to tackle the intermeshed challenges of automated indoor point cloud interpretation using targeted segmentation methods, and the automatic reconstruction of high-level, parametric and volumetric building models as the basis for further usage in BIM scenarios. In contrast to most reconstruction methods available at the time, we fundamentally base our approaches on BIM principles and standards, and overcome critical limitations of previous approaches in order to reconstruct globally plausible, volumetric, and parametric models.Automatische Rekonstruktion von parametrischen, volumetrischen Gebäudemodellen aus 3D Punktwolken Für die Planung, Konstruktion, Modifikation und Analyse von Gebäuden werden Möglichkeiten zur sinnvollen Repräsentation der physischen Gebäudestruktur sowie dazugehöriger Semantik benötigt. Mit dem Aufkommen neuer Technologien und steigenden Anforderungen im Bereich von Architecture, Engineering and Construction (AEC) haben zwei Konzepte für die Repräsentation von Gebäuden in den letzten Jahren besondere Aufmerksamkeit erlangt. Erstens wird das Konzept des Building Information Modeling (BIM) zunehmend als ein modernes Mittel zur digitalen Abbildung und Verwaltung "As-Planned"-Zustands von Gebäuden verwendet, welches nicht nur ein geometrisches Modell sondern auch verschiedene zusätzliche semantische Eigenschaften beinhaltet. Zweitens werden Punktwolkenmessungen inzwischen häufig zur Aufnahme des "As-Built"-Zustands mittels Laser-Scan-Techniken eingesetzt. Eine besondere Herausforderung und Thema aktueller Forschung ist die Entwicklung von Methoden zur Vereinigung der Stärken von Punktwolken und Konzepten des Building Information Modeling um schnell akkurate Gebäudemodelle aus den gemessenen Daten zu erzeugen. In dieser Dissertation präsentieren wir unsere aktuellen Ansätze um die miteinander verwobenen Herausforderungen anzugehen, Punktwolken mithilfe geeigneter Segmentierungsmethoden automatisiert zu interpretieren, sowie hochwertige, parametrische und volumetrische Gebäudemodelle als Basis für die Verwendung im BIM-Umfeld zu rekonstruieren. Im Gegensatz zu den meisten derzeit verfügbaren Rekonstruktionsverfahren basieren unsere Ansätze grundlegend auf Prinzipien und Standards aus dem BIM-Umfeld und überwinden kritische Einschränkungen bisheriger Ansätze um vollständig plausible, volumetrische und parametrische Modelle zu erzeugen.</p

Measuring Community Consensus in Facial Characterization Using Spatial Databases and Fuzzy Logic

Spatial databases store geometric objects and capture spatial relationships that can be used to represent key features of the human face. One can search spatial databases for these objects, and seek the relationships between them, using fuzzy logic to provide a natural way to describe the human face for the purposes of facial characterization. This study focuses on community perception of short, average, or long nose length. Three algorithms were used to update community opinion of nose length. All three methods showed similar trends in nose length classification which could indicate that the effort to extract spatial data from images to classify nose length is not as crucial as previously thought since community consensus will ultimately give similar results. However, additional testing with larger groups is needed to further validate any conclusion that spatial data can be eliminated

EXTRACTING FLOW FEATURES USING BAG-OF-FEATURES AND SUPERVISED LEARNING TECHNIQUES

Measuring the similarity between two streamlines is fundamental to many important flow data analysis and visualization tasks such as feature detection, pattern querying and streamline clustering. This dissertation presents a novel streamline similarity measure inspired by the bag-of-features concept from computer vision. Different from other streamline similarity measures, the proposed one considers both the distribution of and the distances among features along a streamline. The proposed measure is tested in two common tasks in vector field exploration: streamline similarity query and streamline clustering. Compared with a recent streamline similarity measure, the proposed measure allows users to see the interesting features more clearly in a complicated vector field. In addition to focusing on similar streamlines through streamline similarity query or clustering, users sometimes want to group and see similar features from different streamlines. For example, it is useful to find all the spirals contained in different streamlines and present them to users. To this end, this dissertation proposes to segment each streamline into different features. This problem has not been studied extensively in flow visualization. For instance, many flow feature extraction techniques segment streamline based on simple heuristics such as accumulative curvature or arc length, and, as a result, the segments they found usually do not directly correspond to complete flow features. This dissertation proposes a machine learning-based streamline segmentation algorithm to segment each streamline into distinct features. It is shown that the proposed method can locate interesting features (e.g., a spiral in a streamline) more accurately than some other flow feature extraction methods. Since streamlines are space curves, the proposed method also serves as a general curve segmentation method and may be applied in other fields such as computer vision. Besides flow visualization, a pedagogical visualization tool DTEvisual for teaching access control is also discussed in this dissertation. Domain Type Enforcement (DTE) is a powerful abstraction for teaching students about modern models of access control in operating systems. With DTEvisual, students have an environment for visualizing a DTE-based policy using graphs, visually modifying the policy, and animating the common DTE queries in real time. A user study of DTEvisual suggests that the tool is helpful for students to understand DTE

Retrieval of 3-Dimensional Rigid and Non-Rigid Objects

Η παρούσα διδακτορική διατριβή εστιάζει στο πρόβλημα της ανάκτησης 3Δ αντικειμένων από μεγάλες βάσεις δεδομένων σε σχεδόν πραγματικό χρόνο. Για την αντιμετώπιση του προβλήματος αυτού, η έρευνα επικεντρώνεται σε τρία βασικά υποπροβλήματα του χώρου: (α) κανονικοποίηση θέσης άκαμπτων 3Δ μοντέλων με εφαρμογές στην ανάκτηση 3Δ αντικειμένων, (β) περιγραφή εύκαμπτων 3Δ αντικειμένων και (γ) αναζήτηση από βάσεις δεδομένων 3Δ αντικειμένων βασιζόμενη σε 2Δ εικόνες-ερώτησης. Σχετικά με το πρώτο υποπρόβλημα, την κανονικοποίηση θέσης 3Δ μοντέλων, παρουσιάζονται τρεις νέες μέθοδοι οι οποίες βασίζονται στις εξής αρχές: (α) Τριδιάστατη Ανακλαστική Συμμετρία Αντικειμένου (ROSy) και (β, γ) Διδιάστατη Ανακλαστική Συμμετρία Αντικειμένου υπολογιζόμενη επί Πανοραμικών Προβολών (SymPan και SymPan+). Όσον αφορά το δεύτερο υποπρόβλημα, αναπτύχθηκε μια μέθοδος ανάκτησης εύκαμπτων 3Δ αντικειμένων, η οποία συνδυάζει τις ιδιότητες της σύμμορφης γεωμετρίας και της τοπολογικής πληροφορίας βασιζόμενης σε γράφους, με ενιαίο τρόπο (ConTopo++). Επιπλέον, προτείνεται μια στρατηγική συνταιριασμού συμβολοσειρών, για τη σύγκριση των γράφων που αναπαριστούν 3Δ αντικείμενα. Σχετικά με το τρίτο υποπρόβλημα, παρουσιάζεται μια μέθοδος ανάκτησης 3Δ αντικειμένων, βασιζόμενη σε 2Δ εικόνες-ερώτησης, οι οποίες αντιπροσωπεύουν προβολές πραγματικών 3Δ αντικειμένων. Τα πλήρη 3Δ αντικείμενα της βάσης δεδομένων περιγράφονται από ένα σύνολο πανοραμικών προβολών και ένα μοντέλο Bag-of-Visual-Words δημιουργείται χρησιμοποιώντας τα χαρακτηριστικά SIFT που προέρχονται από αυτά. Οι μεθοδολογίες που αναπτύχθηκαν και περιγράφονται στην παρούσα διατριβή αξιολογούνται όσον αφορά την ακρίβεια ανάκτησης και παρουσιάζονται κάνοντας χρήση ποσοτικών και ποιοτικών μέτρων μέσω μιας εκτεταμένης και συνεκτικής αξιολόγησης σε σχέση με μεθόδους τρέχουσας τεχνολογικής στάθμης επάνω σε τυποποιημένες βάσεις δεδομένων.This dissertation focuses on the problem of 3D object retrieval from large datasets in a near realtime manner. In order to address this task we focus on three major subproblems of the field: (i) pose normalization of rigid 3D models with applications to 3D object retrieval, (ii) non-rigid 3D object description and (iii) search over rigid 3D object datasets based on 2D image queries. Regarding the first of the three subproblems, 3D model pose normalization, three novel pose normalization methods are presented, based on: (i) 3D Reflective Object Symmetry (ROSy) and (ii, iii) 2D Reflective Object Symmetry computed on Panoramic Views (SymPan and SymPan+). Considering the second subproblem, a non-rigid 3D object retrieval methodology, based on the properties of conformal geometry and graph-based topological information (ConTopo++) has been developed. Furthermore, a string matching strategy for the comparison of graphs that describe 3D objects, is proposed. Regarding the third subproblem a 3D object retrieval method, based on 2D range image queries that represent partial views of real 3D objects, is presented. The complete 3D objects of the database are described by a set of panoramic views and a Bag-of-Visual-Words model is built using SIFT features extracted from them. The methodologies developed and described in this dissertation are evaluated in terms of retrieval accuracy and demonstrated using both quantitative and qualitative measures via an extensive consistent evaluation against state-of-the-art methods on standard datasets

Efficient Point-Cloud Processing with Primitive Shapes

This thesis presents methods for efficient processing of point-clouds based on primitive shapes. The set of considered simple parametric shapes consists of planes, spheres, cylinders, cones and tori. The algorithms developed in this work are targeted at scenarios in which the occurring surfaces can be well represented by this set of shape primitives which is the case in many man-made environments such as e.g. industrial compounds, cities or building interiors. A primitive subsumes a set of corresponding points in the point-cloud and serves as a proxy for them. Therefore primitives are well suited to directly address the unavoidable oversampling of large point-clouds and lay the foundation for efficient point-cloud processing algorithms. The first contribution of this thesis is a novel shape primitive detection method that is efficient even on very large and noisy point-clouds. Several applications for the detected primitives are subsequently explored, resulting in a set of novel algorithms for primitive-based point-cloud processing in the areas of compression, recognition and completion. Each of these application directly exploits and benefits from one or more of the detected primitives' properties such as approximation, abstraction, segmentation and continuability

GEOMETRIC ANALYSIS TOOLS FOR MESH SEGMENTATION

Surface segmentation, a process which divides a surface into parts, is the basis for many surface manipulation applications which include model metamorphosis, model simplifica- tion, model retrieval, model alignment and texture mapping. This dissertation discusses novel methods for geometric surface analysis and segmentation and applications for these methods. Novel work within this dissertation includes a new 3D mesh segmentation algo- rithm which is referred to as the ridge-walking algorithm. The main benefit of this algo- rithm is that it can dynamically change the criteria it uses to identify surface parts which allows the algorithm to be adjusted to suit different types of surfaces and different segmen- tation goals. The dynamic segmentation behavior allows users to extract three different types of surface regions: (1) regions delineated by convex ridges, (2) regions delineated by concave valleys, and (3) regions delineated by both concave and convex curves. The ridge walking algorithm is quantitatively evaluated by comparing it with competing algo- rithms and human-generated segmentations. The evaluation is accompanied with a detailed geometrical analysis of a select subset of segmentation results to facilitate a better under- standing of the strengths and weaknesses of this algorithm. The ridge walking algorithm is applied to three domain-specific segmentation prob- lems. The first application uses this algorithm to partition bone fragment surfaces into three semantic parts: (1) the fracture surface, (2) the periosteal surface and (3) the articular surface. Segmentation of bone fragments is an important computational step necessary in developing quantitative methods for bone fracture analysis and for creating computational tools for virtual fracture reconstruction. The second application modifies the 3D ridge walking algorithm so that it can be applied to 2D images. In this case, the 2D image is modeled as a Monge patch and principal curvatures of the intensity surface are computed iv for each image pixel. These principal curvatures are then used by ridge walking algorithm to segment the image into meaningful parts. The third application uses the ridge walking algorithm to facilitate analysis of virtual 3D terrain models. Specifically, the algorithm is integrated as a part of a larger software system designed to enable users to browse, visualize and analyze 3D geometric data generated by NASA’s Mars Exploratory Rovers Spirit and Opportunity. In this context, the ridge walking algorithm is used to identify surface features such as rocks in the terrain models

Exploring 3D Shapes through Real Functions

This thesis lays in the context of research on representation, modelling and coding knowledge related to digital shapes, where by shape it is meant any individual object having a visual appareance which exists in some two-, three- or higher dimensional space. Digital shapes are digital representations of either physically existing or virtual objects that can be processed by computer applications. While the technological advances in terms of hardware and software have made available plenty of tools for using and interacting with the geometry of shapes, to manipulate and retrieve huge amount of data it is necessary to define methods able to effectively code them. In this thesis a conceptual model is proposed which represents a given 3D object through the coding of its salient features and defines an abstraction of the object, discarding irrelevant details. The approach is based on the shape descriptors defined with respect to real functions, which provide a very useful shape abstraction method for the analysis and structuring of the information contained in the discrete shape model. A distinctive feature of these shape descriptors is their capability of combining topological and geometrical information properties of the shape, giving an abstraction of the main shape features. To fully develop this conceptual model, both theoretical and computational aspects have been considered, related to the definition and the extension of the different shape descriptors to the computational domain. Main emphasis is devoted to the application of these shape descriptors in computational settings; to this aim we display a number of application domains that span from shape retrieval, to shape classification and to best view selection.Questa tesi si colloca nell\u27ambito di ricerca riguardante la rappresentazione, la modellazione e la codifica della conoscenza connessa a forme digitali, dove per forma si intende l\u27aspetto visuale di ogni oggetto che esiste in due, tre o pi? dimensioni. Le forme digitali sono rappresentazioni di oggetti sia reali che virtuali, che possono essere manipolate da un calcolatore. Lo sviluppo tecnologico degli ultimi anni in materia di hardware e software ha messo a disposizione una grande quantit? di strumenti per acquisire, rappresentare e processare la geometria degli oggetti; tuttavia per gestire questa grande mole di dati ? necessario sviluppare metodi in grado di fornirne una codifica efficiente. In questa tesi si propone un modello concettuale che descrive un oggetto 3D attraverso la codifica delle caratteristiche salienti e ne definisce una bozza ad alto livello, tralasciando dettagli irrilevanti. Alla base di questo approccio ? l\u27utilizzo di descrittori basati su funzioni reali in quanto forniscono un\u27astrazione della forma molto utile per analizzare e strutturare l\u27informazione contenuta nel modello discreto della forma. Una peculiarit? di tali descrittori di forma ? la capacit? di combinare propriet? topologiche e geometriche consentendo di astrarne le principali caratteristiche. Per sviluppare questo modello concettuale, ? stato necessario considerare gli aspetti sia teorici che computazionali relativi alla definizione e all\u27estensione in ambito discreto di vari descrittori di forma. Particolare attenzione ? stata rivolta all\u27applicazione dei descrittori studiati in ambito computazionale; a questo scopo sono stati considerati numerosi contesti applicativi, che variano dal riconoscimento alla classificazione di forme, all\u27individuazione della posizione pi? significativa di un oggetto