Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547980
Thibault Napoléon, Tomasz Adamek, F. Schmitt, Noel E. O'Connor
We describe in this paper a method for 3D shape indexing and retrieval that we apply on three data collections of the SHREC - SHape Retrieval Contest 2008: Stability on watertight, CAD and Generic 3D models. The method is based on a set of 2D multi-views after a pose and scale normalization of the models using Continuous PCA and the enclosing sphere. In all views we extract the models silhouettes and compare them pairwise. To compute the similitude measure we consider the external contour of the silhouettes, we extract their convexities and concavities at different scale levels and we build a multiscale representation. The pairs of contours are then compared by elastic matching achieved by using dynamic programming.
{"title":"SHREC’08 entry: Multi-view 3D retrieval using multi-scale contour representation","authors":"Thibault Napoléon, Tomasz Adamek, F. Schmitt, Noel E. O'Connor","doi":"10.1109/SMI.2008.4547980","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547980","url":null,"abstract":"We describe in this paper a method for 3D shape indexing and retrieval that we apply on three data collections of the SHREC - SHape Retrieval Contest 2008: Stability on watertight, CAD and Generic 3D models. The method is based on a set of 2D multi-views after a pose and scale normalization of the models using Continuous PCA and the enclosing sphere. In all views we extract the models silhouettes and compare them pairwise. To compute the similitude measure we consider the external contour of the silhouettes, we extract their convexities and concavities at different scale levels and we build a multiscale representation. The pairs of contours are then compared by elastic matching achieved by using dynamic programming.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128269259","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547963
G. Hart
A toolbox of algorithmic techniques is presented for creating a variety of novel, visually engaging, sculptural forms that express a mathematical aesthetic embodied within a plausibly organic organization. Hyperbolic tessellations in the Poincare plane are transformed in several ways to three-dimensional networks of edges. Then these edge networks are thickened to solid struts with a simple robust "strut algorithm". By the use of different transformations and adjustable parameters in the algorithms, a variety of high-genus forms result. The techniques are robust enough to produce watertight boundary representations to be built with solid freeform fabrication equipment. The final physical sculptures satisfy the "coolness criterion," that passers by will pick them up and say "Wow, that's cool!"
{"title":"Sculptural forms from hyperbolic tessellations","authors":"G. Hart","doi":"10.1109/SMI.2008.4547963","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547963","url":null,"abstract":"A toolbox of algorithmic techniques is presented for creating a variety of novel, visually engaging, sculptural forms that express a mathematical aesthetic embodied within a plausibly organic organization. Hyperbolic tessellations in the Poincare plane are transformed in several ways to three-dimensional networks of edges. Then these edge networks are thickened to solid struts with a simple robust \"strut algorithm\". By the use of different transformations and adjustable parameters in the algorithms, a variety of high-genus forms result. The techniques are robust enough to produce watertight boundary representations to be built with solid freeform fabrication equipment. The final physical sculptures satisfy the \"coolness criterion,\" that passers by will pick them up and say \"Wow, that's cool!\"","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559123","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547943
Yu-Kun Lai, Yong-Jin Liu, Yuyang Zang, Shimin Hu
Wireframe is a modeling tool widely used in industrial geometric design. The term wireframe refers to two sets of curves, with the property that each curve from one set intersects with each curve from the other set. Akin to the mu-, v-isocurves in a tensor-product surface, the two sets of curves in a wireframe span an underlying surface. In many industrial design activities, wireframes are usually set up and adjusted by the designers before the whole surfaces are reconstructed. For adjustment, the fairness of wireframe has a direct influence on the quality of the underlying surface. Wireframe fairing is significantly different from fairing individual curves in that intersections should be preserved and kept in the same order. In this paper, we first present a technique for wireframe fairing by fixing the parameters during fairing. The limitation of fixed parameters is further released by an iterative gradient descent optimization method with step-size control. Experimental results show that our solution is efficient, and produces reasonably fairing results of the wireframes.
{"title":"Fairing wireframes in industrial surface design","authors":"Yu-Kun Lai, Yong-Jin Liu, Yuyang Zang, Shimin Hu","doi":"10.1109/SMI.2008.4547943","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547943","url":null,"abstract":"Wireframe is a modeling tool widely used in industrial geometric design. The term wireframe refers to two sets of curves, with the property that each curve from one set intersects with each curve from the other set. Akin to the mu-, v-isocurves in a tensor-product surface, the two sets of curves in a wireframe span an underlying surface. In many industrial design activities, wireframes are usually set up and adjusted by the designers before the whole surfaces are reconstructed. For adjustment, the fairness of wireframe has a direct influence on the quality of the underlying surface. Wireframe fairing is significantly different from fairing individual curves in that intersections should be preserved and kept in the same order. In this paper, we first present a technique for wireframe fairing by fixing the parameters during fairing. The limitation of fixed parameters is further released by an iterative gradient descent optimization method with step-size control. Experimental results show that our solution is efficient, and produces reasonably fairing results of the wireframes.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133770652","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547991
Yujie Liu, Xiaolan Yao, Zongmin Li, Xiuping Men
A novel methodology based on V-system polynomials for content-based search and retrieval of 3D objects is proposed and implemented in the experiment with the contest's query set and the model database. By the benchmark of the SHREC'06 to the algorithm, this method shows highly performance and improves the retrieval efficiency.
{"title":"SHREC’08 entry: 3D model retrieval based on the V system invariant moment","authors":"Yujie Liu, Xiaolan Yao, Zongmin Li, Xiuping Men","doi":"10.1109/SMI.2008.4547991","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547991","url":null,"abstract":"A novel methodology based on V-system polynomials for content-based search and retrieval of 3D objects is proposed and implemented in the experiment with the contest's query set and the model database. By the benchmark of the SHREC'06 to the algorithm, this method shows highly performance and improves the retrieval efficiency.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114788586","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547942
Ye Zhao
In this paper, we introduce a parallel numerical scheme, the Lattice Boltzmann method, to shape modeling applications. The motivation of using this originally-designed fluid dynamics solver in surface modeling is its simplicity, locality, parallelism from the cellular-automata-originated updating rules, which can directly be mapped onto modern graphics hardware. A surface is implicitly represented by the signed distance field. The distances are then used in a modified LBM scheme as its computing primitive, instead of the densities in traditional LBM. The scheme can simulate curvature motions to smooth the surface with a diffusion process. Furthermore, an initial value level set method can be implemented for surface morphing. The distance difference between a morphing surface and a target surface defines the speed function of the evolving level sets, and is used as the driving force in the LBM. Our GPU-accelerated LBM algorithm has achieved outstanding performance for the denoising and morphing examples. It has the great potential to be further applied as a general GPU computing framework to many other solid and shape modeling applications.
{"title":"GPU-accelerated surface denoising and morphing with lattice Boltzmann scheme","authors":"Ye Zhao","doi":"10.1109/SMI.2008.4547942","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547942","url":null,"abstract":"In this paper, we introduce a parallel numerical scheme, the Lattice Boltzmann method, to shape modeling applications. The motivation of using this originally-designed fluid dynamics solver in surface modeling is its simplicity, locality, parallelism from the cellular-automata-originated updating rules, which can directly be mapped onto modern graphics hardware. A surface is implicitly represented by the signed distance field. The distances are then used in a modified LBM scheme as its computing primitive, instead of the densities in traditional LBM. The scheme can simulate curvature motions to smooth the surface with a diffusion process. Furthermore, an initial value level set method can be implemented for surface morphing. The distance difference between a morphing surface and a target surface defines the speed function of the evolving level sets, and is used as the driving force in the LBM. Our GPU-accelerated LBM algorithm has achieved outstanding performance for the denoising and morphing examples. It has the great potential to be further applied as a general GPU computing framework to many other solid and shape modeling applications.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117334436","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547965
G. Elber, T. Grandine
In recent years, several quite successful attempts have been made to solve systems of polynomial constraints, using geometric design tools, by making use of subdivision based solvers. This broad class of methods includes both binary domain subdivision as well as the projected polyhedron method of Sherbrooke and Patrikalakis [13]. One of the main difficulties in using subdivision solvers is their scalability. When the given constraint is represented as a tensor product of all its independent variables, it grows exponentially in size as a function of the number of variables. In this work, we show that for many applications, especially geometric, the exponential complexity of the constraints can be reduced to a polynomial one by representing the underlying problem structure in the form of expression trees that represent the constraints. We demonstrate the applicability and scalability of this representation and compare its performance to that of tensor product constraint representation, on several examples.
{"title":"Efficient solution to systems of multivariate polynomials using expression trees","authors":"G. Elber, T. Grandine","doi":"10.1109/SMI.2008.4547965","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547965","url":null,"abstract":"In recent years, several quite successful attempts have been made to solve systems of polynomial constraints, using geometric design tools, by making use of subdivision based solvers. This broad class of methods includes both binary domain subdivision as well as the projected polyhedron method of Sherbrooke and Patrikalakis [13]. One of the main difficulties in using subdivision solvers is their scalability. When the given constraint is represented as a tensor product of all its independent variables, it grows exponentially in size as a function of the number of variables. In this work, we show that for many applications, especially geometric, the exponential complexity of the constraints can be reduced to a polynomial one by representing the underlying problem structure in the form of expression trees that represent the constraints. We demonstrate the applicability and scalability of this representation and compare its performance to that of tensor product constraint representation, on several examples.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116182867","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547951
S. S. Abeysinghe, M. Baker, W. Chiu, T. Ju
Medical imaging has produced a large number of volumetric images capturing biological structures in 3D. Computer-based understanding of these structures can often benefit from the knowledge of shape components, particularly rod-like and plate-like parts, in such volumes. Previously, skeletons have been a common tool for identifying these shape components in a solid object. However, obtaining skeletons of a grayscale volume poses new challenges due to the lack of a clear boundary between object and background. In this paper, we present a new skeletonization algorithm on grayscale volumes typical to medical imaging (e.g., MRI, CT and EM scans), for the purpose of identifying shape components. Our algorithm does not require an explicit segmentation of the volume into object and background, and is capable of producing skeletal curves and surfaces that lie centered at rod-shaped and plate-shaped parts in the grayscale volume. Our method is demonstrated on both synthetic and medical data.
{"title":"Segmentation-free skeletonization of grayscale volumes for shape understanding","authors":"S. S. Abeysinghe, M. Baker, W. Chiu, T. Ju","doi":"10.1109/SMI.2008.4547951","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547951","url":null,"abstract":"Medical imaging has produced a large number of volumetric images capturing biological structures in 3D. Computer-based understanding of these structures can often benefit from the knowledge of shape components, particularly rod-like and plate-like parts, in such volumes. Previously, skeletons have been a common tool for identifying these shape components in a solid object. However, obtaining skeletons of a grayscale volume poses new challenges due to the lack of a clear boundary between object and background. In this paper, we present a new skeletonization algorithm on grayscale volumes typical to medical imaging (e.g., MRI, CT and EM scans), for the purpose of identifying shape components. Our algorithm does not require an explicit segmentation of the volume into object and background, and is capable of producing skeletal curves and surfaces that lie centered at rod-shaped and plate-shaped parts in the grayscale volume. Our method is demonstrated on both synthetic and medical data.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840503","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547976
D. Giorgi, S. Marini
This track focuses on 3D shape classification, i.e. the assignment of a query object to one of the classes in a database. A total amount of 646 watertight models have been classified, and released as training, testing and query data. Three different levels of categorization have been taken into account, from coarse to fine.
{"title":"SHape REtrieval contest 2008: Classification of watertight models","authors":"D. Giorgi, S. Marini","doi":"10.1109/SMI.2008.4547976","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547976","url":null,"abstract":"This track focuses on 3D shape classification, i.e. the assignment of a query object to one of the classes in a database. A total amount of 646 watertight models have been classified, and released as training, testing and query data. Three different levels of categorization have been taken into account, from coarse to fine.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126012864","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547953
G. Patané, M. Spagnuolo, B. Falcidieno
Given a manifold surface M and a continuous function f : M rarr R, the Reeb graph of (M, f) is a widely-used high-level descriptor of M and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel computation of the Reeb graph that is based on the analysis of the iso-contours solely at saddle points and does not require sampling or sweeping the image of f. Furthermore, the proposed approach does not use global sorting steps of the function values and exploits only a local information on f, without handling it as a whole. By combining the minimal number of nodes in the Reeb graph with the use of a small amount of memory footprint and temporary data structures, the overall computation takes O(sn)-time, where n is the number of vertices of the triangulation of M and s is the number of saddles of f. Finally, the technique can be easily extended to compute the Reeb graphs of time-varying functions.
给定一个流形曲面M和一个连续函数f: M rarr R， (M, f)的Reeb图是M的一个广泛使用的高级描述符，它的有用性已被证明用于各种应用，范围从形状参数化和抽象到变形和比较。在这种情况下，我们提出了一种新的计算Reeb图的方法，该方法仅基于对鞍点等等高线的分析，不需要采样或扫描f的图像。此外，所提出的方法不使用函数值的全局排序步骤，只利用f的局部信息，而不处理它作为一个整体。通过将Reeb图中的最小节点数与使用少量内存占用和临时数据结构相结合，整体计算需要O(sn)时间，其中n为M三角化的顶点数，s为f的鞍座数。最后，该技术可以很容易地扩展到计算时变函数的Reeb图。
{"title":"Reeb graph computation based on a minimal contouring","authors":"G. Patané, M. Spagnuolo, B. Falcidieno","doi":"10.1109/SMI.2008.4547953","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547953","url":null,"abstract":"Given a manifold surface M and a continuous function f : M rarr R, the Reeb graph of (M, f) is a widely-used high-level descriptor of M and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel computation of the Reeb graph that is based on the analysis of the iso-contours solely at saddle points and does not require sampling or sweeping the image of f. Furthermore, the proposed approach does not use global sorting steps of the function values and exploits only a local information on f, without handling it as a whole. By combining the minimal number of nodes in the Reeb graph with the use of a small amount of memory footprint and temporary data structures, the overall computation takes O(sn)-time, where n is the number of vertices of the triangulation of M and s is the number of saddles of f. Finally, the technique can be easily extended to compute the Reeb graphs of time-varying functions.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131845087","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}
Pub Date : 2008-06-04DOI: 10.1109/SMI.2008.4547940
Ahmed Fouad El Ouafdi, D. Ziou
In this paper, we propose a manifold smoothing method based on the heat diffusion process. We start from the global equation of heat conservation and we decompose it into basic laws. The numerical scheme is derived in a straightforward way from the discretization of the basic heat transfer laws using computation algebraic topological tools CAT, thus providing a physical and topological explanation for each step of the discretization process.
{"title":"A global physical method for manifold smoothing","authors":"Ahmed Fouad El Ouafdi, D. Ziou","doi":"10.1109/SMI.2008.4547940","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547940","url":null,"abstract":"In this paper, we propose a manifold smoothing method based on the heat diffusion process. We start from the global equation of heat conservation and we decompose it into basic laws. The numerical scheme is derived in a straightforward way from the discretization of the basic heat transfer laws using computation algebraic topological tools CAT, thus providing a physical and topological explanation for each step of the discretization process.","PeriodicalId":118774,"journal":{"name":"2008 IEEE International Conference on Shape Modeling and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133173841","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：