Polyhedral Model Retrieval Using Weighted Point Sets
نویسندگان
چکیده
Due to the recent improvements in laser scanning technology, 3D visualization and modelling, there is an increasing need for tools supporting the automatic search for 3D objects in archives. In this paper we describe a new geometric approach to 3D shape comparison and retrieval for arbitrary objects described by 3D polyhedral models that may contain gaps. In contrast with existing approaches, our approach takes the overall relative spatial location into account by representing the 3D shape as a weighted point set. To compare two objects geometrically we rst apply principal components analysis to bring the objects in a standard pose, and enclose each object by a 3D grid. Then we generate for each object a signature representing a weighted point set, that contains for each non-empty grid cell a salient point. We compare three methods to select in each grid cell a salient point and a weight: (1) choose the vertex in the cell with the highest Gaussian curvature, and choose as weight a measure for that curvature, (2) choose the area-weighted mean of the vertices in the cell, and choose as weight a measure denoting the normal variation of the facets in the cell and (3) choose the centre of mass of all vertices in the cell, and choose as weight one. Finally, we compute the similarity between two shapes by comparing their signatures using a new shape similarity measure based on weight transportation that is a variation on the Earth Mover's Distance. Unlike the Earth Mover's Distance, the new shape similarity measure satis es the triangle inequality. This property makes it suitable for use in indexing schemes, which frequently depend on the triangle inequality, such as the one we introduce, based on so-called vantage objects. The strength of our approach is proven through experimental results using a database consisting of 133 models such as mugs, cars and boats, and a database consisting of 512 models, mostly air planes, classi ed into conventional air planes, delta-jets, multifuselages, biplanes, helicopters and other models.
منابع مشابه
Robust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملConstructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
The l0-minimization problem that seeks the sparsest point of a polyhedral set is a longstanding challenging problem in the fields of signal and image processing, numerical linear algebra and mathematical optimization. The weighted l1-method is one of the most plausible methods for solving this problem. In this paper, we develop a new weighted l1-method through the strict complementarity theory ...
متن کاملMIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objec...
متن کاملSet and Relation Manipulation for the Sparse Polyhedral Framework
The Sparse Polyhedral Framework (SPF) extends the Polyhedral Model by using the uninterpreted function call abstraction for the compile-time specification of run-time reordering transformations such as loop and data reordering and sparse tiling approaches that schedule irregular sets of iteration across loops. The Polyhedral Model represents sets of iteration points in imperfectly nested loops ...
متن کاملComposition of Credal Sets via Polyhedral Geometry
Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuationbased systems theories. It was designed to construct multidimensional models (in the framework of credal sets) from a system of lowdimensional credal sets. In this paper we study its potential from the computational point of view utilizing methods of polyhe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Image Graphics
دوره 3 شماره
صفحات -
تاریخ انتشار 2003