201 research outputs found
Salient Local 3D Features for 3D Shape Retrieval
In this paper we describe a new formulation for the 3D salient local features
based on the voxel grid inspired by the Scale Invariant Feature Transform
(SIFT). We use it to identify the salient keypoints (invariant points) on a 3D
voxelized model and calculate invariant 3D local feature descriptors at these
keypoints. We then use the bag of words approach on the 3D local features to
represent the 3D models for shape retrieval. The advantages of the method are
that it can be applied to rigid as well as to articulated and deformable 3D
models. Finally, this approach is applied for 3D Shape Retrieval on the McGill
articulated shape benchmark and then the retrieval results are presented and
compared to other methods.Comment: Three-Dimensional Imaging, Interaction, and Measurement. Edited by
Beraldin, J. Angelo; Cheok, Geraldine S.; McCarthy, Michael B.;
Neuschaefer-Rube, Ulrich; Baskurt, Atilla M.; McDowall, Ian E.; Dolinsky,
Margaret. Proceedings of the SPIE, Volume 7864, pp. 78640S-78640S-8 (2011).
Conference Location: San Francisco Airport, California, USA ISBN:
9780819484017 Date: 10 March 201
Population-based fitting of medial shape models with correspondence optimization
pre-printA crucial problem in statistical shape analysis is establishing the correspondence of shape features across a population. While many solutions are easy to express using boundary representations, this has been a considerable challenge for medial representations. This paper uses a new 3-D medial model that allows continuous interpolation of the medial manifold and provides a map back and forth between it and the boundary. A measure defined on the medial surface then allows one to write integrals over the boundary and the object interior in medial coordinates, enabling the expression of important object properties in an object-relative coordinate system.We use these integrals to optimize correspondence during model construction, reducing variability due to the model parameterization that could potentially mask true shape change effects. Discrimination and hypothesis testing of populations of shapes are expected to benefit, potentially resulting in improved significance of shape differences between populations even with a smaller sample size
Matching Shape Graphs
Graphs are important structures to model complex relationships such as chemical compounds, proteins, geometric or hierarchical parts, and XML documents. Given a query graph, indexing has become a necessity to retrieve similar graphs quickly from large databases. We propose a novel technique for indexing databases, whose entries can be represented as graph structures. Our method starts by representing the topological structure of a graph as well as that of its subgraphs as vectors in which the components correspond to the sorted laplacian eigenvalues of the graph or subgraphs. By doing a nearest neighbor search around the query spectra, similar but not necessarily isomorphic graphs are retrieved
Heterogeneous Skeleton for Summarizing Continuously Distributed Demand in a Region
There has long been interest in the skeleton of a spatial object in GIScience. The reasons for this are many, as it has proven to be an extremely useful summary and explanatory representation of complex objects. While much research has focused on issues of computational complexity and efficiency in extracting the skeletal and medial axis representations as well as interpreting the final product, little attention has been paid to fundamental assumptions about the underlying object. This paper discusses the implied assumption of homogeneity associated with methods for deriving a skeleton. Further, it is demonstrated that addressing heterogeneity complicates both the interpretation and identification of a meaningful skeleton. The heterogeneous skeleton is introduced and formalized, along with a method for its identification. Application results are presented to illustrate the heterogeneous skeleton and provides comparative contrast to homogeneity assumptions
Medical Image Registration and 3D Object Matching
The great challenge in image registration and 3D object matching is to devise computationally efficient algorithms for aligning images so that their details overlap accurately and retrieving similar shapes from large databases of 3D models. The first problem addressed is this thesis is medical image registration, which we formulate as an optimization problem in the information-theoretic framework. We introduce a viable and practical image registration method by maximizing an entropic divergence measure using a modified simultaneous perturbation stochastic approximation algorithm. The feasibility of the proposed image registration approach is demonstrated through extensive experiments.
The rest of the thesis is devoted to a joint exploitation of geometry and topology of 3D objects for as parsimonious as possible representation of models and its subsequent application in 3D object representation, matching, and retrieval problems. More precisely, we introduce a skeletal graph for topological 3D shape representation using Morse theory. The proposed skeletonization algorithm encodes a 3D shape into a topological Reeb graph using a normalized mixture distance function. We also propose a novel graph
matching algorithm by comparing the relative shortest paths between the skeleton endpoints. Moreover, we describe a skeletal graph for 3D object matching and retrieval. This skeleton is constructed from the second eigenfunction of the Laplace-Beltrami operator defined on the surface of the 3D object. Using the generalized eigenvalue decomposition, a matrix computational framework based on the finite element method is presented to compute the spectrum of the Laplace-Beltrami operator. Illustrating experiments on two standard
3D shape benchmarks are provided to demonstrate the feasibility and the much improved performance of the proposed skeletal graphs as shape descriptors for 3D object matching and retrieval
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
- …