{"title":"Visual Similarity Based 3D Shape Retrieval Using Bag-of-Features","authors":"Z. Lian, A. Godil, Xianfang Sun","doi":"10.1109/SMI.2010.20","DOIUrl":"https://doi.org/10.1109/SMI.2010.20","url":null,"abstract":"This paper presents a novel 3D shape retrieval method, which uses Bag-of-Features and an efficient multi-view shape matching scheme. In our approach, a properly normalized object is first described by a set of depth-buffer views captured on the surrounding vertices of a given unit geodesic sphere. We then represent each view as a word histogram generated by the vector quantization of the view’s salient local features. The dissimilarity between two 3D models is measured by the minimum distance of their all (24) possible matching pairs. This paper also investigates several critical issues including the influence of the number of views, codebook, training data, and distance function. Experiments on four commonly-used benchmarks demonstrate that: 1) Our approach obtains superior performance in searching for rigid models. 2) The local feature and global feature based methods are somehow complementary. Moreover, a linear combination of them significantly outperforms the state-of-the-art in terms of retrieval accuracy.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123583869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sharp feature detection in point clouds","authors":"Christopher Weber, S. Hahmann, H. Hagen","doi":"10.1109/SMI.2010.32","DOIUrl":"https://doi.org/10.1109/SMI.2010.32","url":null,"abstract":"This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute can be identified without any user interaction. The algorithm works directly on the point cloud, no surface reconstruction is needed. Given an unstructured point cloud, our method first computes a Gauss map clustering on local neighborhoods in order to discard all points which are unlikely to belong to a sharp feature. As usual, a global sensitivity parameter is used in this stage. In a second stage, the remaining feature candidates undergo a more precise iterative selection process. Central to our method is the automatic computation of an adaptive sensitivity parameter, increasing significantly the reliability and making the identification more robust in the presence of obtuse and acute angles. The algorithm is fast and does not depend on the sampling resolution, since it is based on a local neighbor graph computation.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123105505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kanle Shi, J. Yong, Peng Liu, Jiaguang Sun, J. Paul
{"title":"The Transition Between Sharp and Rounded Features and the Manipulation of Incompatible Boundary in Filling n-sided Holes","authors":"Kanle Shi, J. Yong, Peng Liu, Jiaguang Sun, J. Paul","doi":"10.1109/SMI.2010.17","DOIUrl":"https://doi.org/10.1109/SMI.2010.17","url":null,"abstract":"N-sided hole filling plays an important role in vertex blending. Piegl and Tiller presented an algorithm to interpolate the given boundary and cross-boundary derivatives in B-spline form. To deal with the incompatible cases that their algorithm cannot handle, we propose an extension method to manipulate the transition between sharp and rounded features. The algorithm first patches n crescent-shaped extended surfaces to the boundary with G2 continuity to handle incompatibility problem in the corners. Then, we compute the inner curves and the corresponding cross-boundary derivatives fulfilling tangent and twist compatibilities. The generated B-spline Coons patches are G1-continuously connected exactly, and have epsilon-G1 continuity with the extended surfaces. Our method improves the continuity-quality of the shape and reduces the count of the inserted knots. It can be applied to all G0-continuous boundary conditions without any restrictions imposed on the boundary or cross-boundary derivatives. It generates better shapes than some popular industrial modeling systems on these incompatible occasions. Some examples underline its feasibility.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121096217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yamei Wen, Hui Zhang, Zhongmian Yu, Jiaguang Sun, J. Paul
{"title":"Reconstructing 3D Objects from 2D Sectional Views of Engineering Drawings Using Volume-Based Method","authors":"Yamei Wen, Hui Zhang, Zhongmian Yu, Jiaguang Sun, J. Paul","doi":"10.1109/SMI.2010.16","DOIUrl":"https://doi.org/10.1109/SMI.2010.16","url":null,"abstract":"Sectional views are widely used in engineering practice due to their clear and concise expression. However, it is difficult for computers to understand because of the large numbers of omitted entities and their diversified representations. This paper aims at reconstructing 3D models from 2D sectional views by improving the traditional volume based method. First, we present a two-stage loop searching algorithm to extract desired loops from sectional views. Then, sub-objects are identified by the hint-based feature identification algorithm with an intuitive loop-matching criterion. After that, a model-directed algorithm is proposed to guide the generation of sub-objects which are assembled together to form the final objects. The algorithm can handle full sections, partial sections and offset sections, as well as orthographic views. Multiple sectional views are supported in our algorithm. Moreover, the domain of objects is extended to inclined quadric surfaces and intersecting quadric surfaces with higher order curves. Experiment results show its practicability.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129041443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kai Wang, G. Lavoué, Florence Denis, A. Baskurt, Xiyan He
{"title":"A Benchmark for 3D Mesh Watermarking","authors":"Kai Wang, G. Lavoué, Florence Denis, A. Baskurt, Xiyan He","doi":"10.1109/SMI.2010.33","DOIUrl":"https://doi.org/10.1109/SMI.2010.33","url":null,"abstract":"This paper presents a benchmarking system for the evaluation of robust mesh watermarking methods. The proposed benchmark has three different components: a ''standard'' mesh model collection, a software tool and two application-oriented evaluation protocols. The software tool integrates both geometric and perceptual measurements of the distortion induced by watermark embedding, and also the implementation of a variety of attacks on watermarked meshes. The two evaluation protocols define the main steps to follow when conducting the evaluation experiments. The efficiency of the benchmark is demonstrated through the evaluation and comparison of two recent robust algorithms.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132792136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Shape Representation of Polynomial Curves with Adjustable Interpolation Points","authors":"Xuli Han","doi":"10.1109/SMI.2010.30","DOIUrl":"https://doi.org/10.1109/SMI.2010.30","url":null,"abstract":"Piecewise cubic and quartic polynomial curves with adjustable interpolation points are presented in this paper. The adjustable interpolation points are represented by local shape parameters and the given control points. Based on the choice of endpoint tangents of curve segments, piecewise cubic $C^1$, piecewise cubic $G^2$ and piecewise quartic $C^2$ curves are given. The representations of the piecewise cubic $C^1$ curves and the piecewise quartic $C^2$ curves are integrated representations of approximating and interpolating curves. By changing the values of the local shape parameters, local approximating curves and local interpolating curves can be generated respectively.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132751465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ridge Extraction from Isosurfaces of Volumetric Data Using Implicit B-Splines","authors":"Suraj Musuvathy, T. Martin, E. Cohen","doi":"10.1109/SMI.2010.29","DOIUrl":"https://doi.org/10.1109/SMI.2010.29","url":null,"abstract":"Ridges are extremal curves of principal curvatures on a surface that indicate salient intrinsic features of its shape. This paper presents a novel approach for extracting ridges of improved quality from isosurfaces of volumetric scalar-valued grids by converting them to implicit trivariate B-spline representations. A robust tracing approach demonstrated to extract ridges accurately from parametric B-spline surfaces is extended to extract ridges directly from the implicit representations resulting in accurate and hence smoother, connected ridge curves as compared to approaches that extract ridges directly from discrete representations. This approach can also be used to extract ridges directly from smooth representations such as isosurfaces of volumetric B-Spline CAD models and algebraic functions, and extended to extract ridges from polygonal meshes, as demonstrated in the paper. Most of the existing approaches for ridge extraction address only crests, a certain subset of the ridges on a surface. The approach presented in this paper enables extraction of all types of generic ridges on a surface thereby presenting a complete solution.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130811794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"X-maps: An Efficient Model for Non-manifold Modeling","authors":"David Cazier, Pierre Kraemer","doi":"10.1109/SMI.2010.22","DOIUrl":"https://doi.org/10.1109/SMI.2010.22","url":null,"abstract":"Many representation schemes have been proposed to deal with non-manifold and mixed dimensionalities objects. A majority of those models are based on incidence graphs and although they provide efficient ways to query topological adjacencies, they suffer two major drawbacks: redundancy in the storage of topological entities and relationships, and the lack of a uniform representation of those entities that leads to the development of large sets of intricate topological operators. As regards to manifold meshes -- and specifically triangular ones -- compact and efficient models are known for twenty years. Ordered topological models like combinatorial maps or half edges based data structures are widely studied and used. We propose a new representation scheme -- the extended maps or $X!$-maps -- that enhances those models to deal with non-manifold objects and mixed dimensionalities. We exhibit properties that allows an adaptive implementation of the cells and thus ensures that $X!$-maps scale well in case of large surface areas or manifold pieces. We show that the storage requirements for $X!$-maps is strongly reduced compared to the radial edge and similar structures and also present optimizations in case of triangular or tetrahedral non-manifold meshes.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131878937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-scale Feature Spaces for Shape Processing and Analysis","authors":"G. Patané, B. Falcidieno","doi":"10.1109/SMI.2010.27","DOIUrl":"https://doi.org/10.1109/SMI.2010.27","url":null,"abstract":"In digital geometry processing and shape modeling, the Laplace-Beltrami and the heat diffusion operator, together with the corresponding Laplacian eigenmaps, harmonic and geometry-aware functions, have been used in several applications, which range from surface parameterization, deformation, and compression to segmentation, clustering, and comparison. Using the linear FEM approximation of the Laplace-Beltrami operator, we derive a discrete heat kernel that is linear, stable to an irregular sampling density of the input surface, and scale covariant. With respect to previous work, this last property makes the kernel particularly suitable for shape analysis and comparison; in fact, local and global changes of the surface correspond to a re-scaling of the time parameter without affecting its spectral component. Finally, we study the scale spaces that are induced by the proposed heat kernel and exploited to provide a multi-scale approximation of scalar functions defined on 3D shapes.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132338110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Thomas Bellet, M. Poudret, A. Arnould, Laurent Fuchs, P. L. Gall
{"title":"Designing a Topological Modeler Kernel: A Rule-Based Approach","authors":"Thomas Bellet, M. Poudret, A. Arnould, Laurent Fuchs, P. L. Gall","doi":"10.1109/SMI.2010.31","DOIUrl":"https://doi.org/10.1109/SMI.2010.31","url":null,"abstract":"In this article, we present a rule-based language dedicated to topological operations and based on graph transformations. Generalized maps are described as a particular class of graphs determined by consistency constraints. Hence, topological operations over generalized maps can be specified using graph transformations. The rules we define are provided with syntactic criteria which ensure that graphs computed by applying rules on generalized maps are also generalized maps. We have developed a static analyzer of transformation rules which checks the syntactic criteria in order to ensure the preservation of generalized map consistency constraints. Based on this static analyzer, we have designed a rule-based prototype of a kernel of a topology-based modeler that is generic in dimension. Since adding a new topological operation can be reduced to write a graph transformation rule, we directly obtain an extensible prototype where handled topological objects satisfy built-in consistency. Moreover, first benchmarks show that our prototype is reasonably efficient compared to a reference implementation of 3D generalized maps which use a classical implementation style.","PeriodicalId":404708,"journal":{"name":"2010 Shape Modeling International Conference","volume":"376 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126717399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}