{"title":"Robust curve reconstruction with k-order alpha-shapes","authors":"D. Krasnoshchekov, V. Polishchuk","doi":"10.1109/SMI.2008.4548006","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548006","url":null,"abstract":"We combine classical concepts from different disciplines - those of robust curve reconstruction with k-order alpha-shapes-hull and robust curve reconstruction with k-order alpha-shapes-shape from computational geometry, splitting data into training and test sets from artificial intelligence, density-based spatial clustering from data mining, and moving average from time series analysis - to develop a robust algorithm for reconstructing the shape of a curve from noisy samples. The novelty of our approach is two-fold. First, we introduce the notion of k-order alpha-hull and alpha-shape - generalizations of alpha-hull and alpha-shape. Second, we use white noise to \"train\" our k-order alpha-shaper, i.e., to choose the right values of alpha and k. The difference of the k-order alpha-hull and alpha-shape from the alpha-hull and alpha-shape is also two-fold. First, k-order alpha-hull and alpha-shape provide a robust estimate of the shape by ignoring outliers. Second, it reconstructs the \"inner\" shape, with the amount of \"digging\" into the data controlled by k.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"34 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":"127828454","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":"Learning 3D Face Models for shape based retrieval","authors":"M. Taniguchi, M. Tezuka, Ryutarou Ohbuchi","doi":"10.1109/SMI.2008.4548001","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548001","url":null,"abstract":"In this paper, we evaluate the effect of learning algorithms, unsupervised and supervised, for 3D face model retrieval using a global shape feature. We used the dataset and protocol of SHREC 2007 3D face models track (SHREC 2007 3DFMT) for the evaluation. Unlike the entrants for the track, we used global shape features to capture overall geometric shape of faces, e.g., that of foreheads. One of the global features, as it is, produced mean average precision highly relevant (MAPH) figure of 0.84, outperforming the top finisher of the SHREC 2007 3DFMT whose MAPH=0.66. Learning was quite effective; for the same global feature, an unsupervised learning method produced MAPH=0.90, and a simple supervised learning method produced an \"ideal\" performance of MAPH=1.0..","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"20 9-10 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":"123585891","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":"Hands on virtual clay","authors":"A. Pihuit, P. Kry, Marie-Paule Cani","doi":"10.1109/SMI.2008.4548000","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548000","url":null,"abstract":"This paper presents a new interaction system designed for hands-on 3D shape modeling and deformation through natural hand gestures. Our system is made of a Phantom haptic device coupled with a deformable foam ball that supports pressure sensors. These sensors detect forces exerted by the user's fingertips, and are used to control the configuration of a compliant virtual hand that is modeling soft virtual clay. During interaction, the user is provided both passive tactile feedback through the foam ball, and realistic visual feedback since the virtual hand deforms due to its interaction in the virtual environment. The combination of all these feedbacks provides the artist with a good immersion allowing for effective sculpting in a virtual world.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"30 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":"116738931","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 registration via the wavelet transform","authors":"J. Chalfant, N. Patrikalakis","doi":"10.1109/SMI.2008.4548005","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548005","url":null,"abstract":"We present a system for the automatic global registration of voxelized data using the wavelet transform. The huge size of current data sets makes such multi-resolution techniques appealing; however, the traditional discrete wavelet transform has the drawback of variance with translation and rotation. We employ the dual-tree complex wavelet transform (Kingsbury, 2003), which carefully adds near invariance to translation and reduced sensitivity to rotation in computationally efficient ways, thus enabling the object matching application. We employ the wavelet transform to accomplish registration by extracting features in a multi-resolutional format, thus rapidly detecting and matching feature points. The method is robust to occlusion, clutter and noise. The efficacy of the algorithm is demonstrated through examples from solid modeling and biomedical applications.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"7 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":"115424992","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":"Robust segmentation of voxel shapes using medial surfaces","authors":"D. Reniers, A. Telea","doi":"10.1109/SMI.2008.4548003","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548003","url":null,"abstract":"We present a new patch-type segmentation method for 3D voxel shapes based on the medial surface, also called surface skeleton. The boundaries of the simplified fore- and background skeletons map one-to-one to increasingly fuzzy, soft convex, respectively concave, edges of the shape. Using this property, we build a method for segmentation of 3D shapes which has several desirable properties. Our method robustly segments both noisy shapes and shapes with soft edges which vanish over low-curvature regions. As the segmentation is based on the skeleton, it reflects the symmetry of the input shape. Finally, multiscale segmentations can be obtained by varying the simplification level of the skeleton. We present a voxel-based implementation of our approach and demonstrate it on several examples.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"137 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":"116345624","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":"A memory effective two-phase approach for large scanned surface mesh simplification","authors":"Yi-Ling Chen, Xiang Zhang","doi":"10.1109/SMI.2008.4548004","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548004","url":null,"abstract":"We present a novel two-phase multi-attribute algorithm suitable for large surface mesh simplification. By employing a linear combination of error metrics to control the process, the proposed algorithm incorporates geometric error control and preserves other attributes of the original model such as the texture (vertex color) and surface normal. In the first phase, we utilize the volume- surface tree [1] (VS-Tree) for vertex clustering to achieve memory effectiveness and computational efficiency. In the second phase, an iterative edge contraction process is applied to obtain the final simplified model. We experiment the proposed algorithm to large mesh models and the results are compared with those from other state of art algorithms such as the octree clustering simplification[5] (OCS) and the original quadric error metric (QEM) based simplification (Q-Slim) ([2][3]).","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"23 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":"122495651","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":"Polygonizing skeletal sheets of CT-scanned objects by partitioin of unity approximations","authors":"Y. Nagai, Y. Ohtake, K. Kase, Hiromasa Suzuki","doi":"10.1109/SMI.2008.4547999","DOIUrl":"https://doi.org/10.1109/SMI.2008.4547999","url":null,"abstract":"The skeletal structures of solid objects play an important role in medical and industrial applications. Given a volumetrically sampled solid object, our method extracts a nice-looking skeletal structure represented as a polygon mesh. The purpose is to achieve a noise-robust extraction of the skeletal mesh from a real-world object obtained using a scanning technology such as the CT scan method. We first approximate the input through a set of spherically supported polynomials that provide an adaptively smoothed intensity field, and then perform a polygonization process to find the extremal sheet of the field, which is regarded as a skeletal sheet in this research. In our polygonization, a subset of the weighted Delaunay tetrahedrization defined by a set of spherical supports is used as an adaptively sampled grid. The derivatives for detecting extremality are analytically evaluated at the tetrahedron vertices. We also demonstrate the effectiveness of our method by extracting skeletal meshes from noisy CT images.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"126 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":"116093805","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":"Discrete shortest paths on smooth surface representations","authors":"T. Kanai, Y. Ohtake","doi":"10.1109/SMI.2008.4548008","DOIUrl":"https://doi.org/10.1109/SMI.2008.4548008","url":null,"abstract":"We introduce an algorithm for computing discrete shortest paths on smooth surface representations. For given source and target points on a surface, an initial shortest path is computed by using the Dijkstra's algorithm. Based on such an initial curve, locally-refined discrete paths are repeatedly calculated so as to get more accurate shortest path. Our algorithm is simple, easy to implement and much fast because it requires only the Dijkstra's algorithm to compute the path. Our algorithm is a versatile approach for a wide variety of smooth surface representations.","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"64 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":"124428649","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":"Affine-Invariant Skeleton of 3D Shapes (color plates 1 and 2)","authors":"M. Mortara, G. Patané","doi":"10.1109/SMA.2002.1003552","DOIUrl":"https://doi.org/10.1109/SMA.2002.1003552","url":null,"abstract":"","PeriodicalId":174679,"journal":{"name":"Shape Modeling International","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192769","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}