{"title":"Theory of 2D nonseparable optimal m-band wavelets and its applications","authors":"Li Cui, Hua Li, Yunshi Zhou","doi":"10.1109/GMAP.2004.1290054","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290054","url":null,"abstract":"The theory of 1D generalized multiresolution analysis (GMRA) with quasi-real dilation is put forward. In this paper we will focus on the 2D extension of the optimal m-band wavelets and its applications in planar image processing. Given a class of image, we will present optimal m-band wavelets for them only by a part of samples. The efficiency and superiority of the algorithm can been seen from the processing result of datasets of the human body slices.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127279746","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":"BIUP/sup 3/: boundary topological invariant of 3D objects through front propagation at a constant speed","authors":"Franck Xia","doi":"10.1109/GMAP.2004.1290062","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290062","url":null,"abstract":"Topological features constitute the highest abstraction in object representation. Euler characteristic is one of the most widely used topological invariants. The computation of the Euler characteristic is mainly based on three well-known mathematical formulae, which calculate either on the boundary of object or on the whole object. However, as digital objects are often non-manifolds, none of the known formulae can correctly compute the genus of digital surfaces. In this paper, we show that a new topological surface invariant of 3D digital objects, called BIUP/sup 3/, can be obtained through a special homeomorphic transform: front propagation at a constant speed. BIUP/sup 3/ overcomes the theoretic weakness of the Euler characteristic and it applies to both manifolds and non-manifolds. The computation of BIUP/sup 3/ can be done efficiently through a virtual front propagation, leaving the images unaffected.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130075399","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":"Convergent discrete Laplace-Beltrami operators over triangular surfaces","authors":"Guoliang Xu","doi":"10.1109/GMAP.2004.1290041","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290041","url":null,"abstract":"The convergence property of the discrete Laplace-Beltrami operators is the foundation of convergence analysis of the numerical simulation process of some geometric partial differential equations which involve the operator. In this paper we propose several simple discretization schemes of Laplace-Beltrami operators over triangulated surfaces. Convergence results for these discrete Laplace-Beltrami operators are established under various conditions. Numerical results that support the theoretical analysis are given. Application examples of the proposed discrete Laplace-Beltrami operators in surface processing and modelling are also presented.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129381607","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":"Least squares ellipsoid specific fitting","authors":"Qingde Li, J. Griffiths","doi":"10.1109/GMAP.2004.1290055","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290055","url":null,"abstract":"In this paper, a sufficient condition for a quadric surface to be an ellipsoid has been developed and a closed-form solution for ellipsoid fitting is developed based on this constraint, which is a best fit to the given data amongst those ellipsoids whose short radii are at least half of their major radii, in the sense of algebraic distance. A simple search procedure is proposed to pursuit the 'best' ellipsoid when data cannot be well described by this type of ellipsoid. The proposed fitting algorithm is quick, stable and insensitive to small errors in the data.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126596934","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}
Peter Ashley Clifford Varley, Hiromasa Suzuki, Ralph Robert Martin
{"title":"Interpreting line drawings of objects with k-vertices","authors":"Peter Ashley Clifford Varley, Hiromasa Suzuki, Ralph Robert Martin","doi":"10.1109/GMAP.2004.1290046","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290046","url":null,"abstract":"As part of the goal of automatic creation of B-rep models of engineering objects from freehand sketches, we seek to take a single line drawing (with hidden lines removed), and from it deduce an initial 3D geometric realisation of the visible part of the drawn object. Junction and line labels, and provisional depth coordinates, are key parts of this frontal geometry. Many methods for producing frontal geometry only work correctly for drawings of trihedral objects. However, nontrihedral k-vertices commonly occur in engineering objects. We analyse the performance of a line-labelling method applied to k-vertices, and show why methods ignoring geometric considerations are inadequate. We give a new approach which produces both junction labels and provisional depth coordinates without any prior knowledge. Our results show that even a naive implementation outperforms previous methods.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133730121","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":"Handling sectional views in volume-based approach to construct 3D solid from 2D views","authors":"J. Dimri, B. Gurumoorthy","doi":"10.1109/GMAP.2004.1290048","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290048","url":null,"abstract":"This paper presents an algorithm for solid model reconstruction from 2D sectional views based on volume-based approach. None of the existing work in automatic reconstruction from 2D orthographic views have addressed sectional views in detail. It is believed that the volume-based approach is better suited to handle different types of sectional views. The volume-based approach constructs the 3D solid by a Boolean combination of elementary solids. The elementary solids are formed by sweep operation on loops identified in the input views. The only adjustment to be made for the presence of sectional views is in the identification of loops that would form the elemental solids. In the algorithm, the conventions of engineering drawing for sectional views, are used to identify the loops correctly. The algorithm is simple and intuitive in nature. Results have been obtained for full sections, offset sections and half sections. Future work will address other types of sectional views such as removed and revolved sections and broken-out sections.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133145178","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":"Interpolatory convexity preserving subdivision schemes for curves","authors":"Aidi Li","doi":"10.1109/GMAP.2004.1290064","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290064","url":null,"abstract":"This paper is concerned with the interpolatory convexity preserving subdivision schemes for curves. The schemes are nonlinear in the control points. The convergence analysis is presented. The limit curves are C/sup 1/.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132417805","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":"Efficient and stable numerical algorithms on equilibrium equations for geometric modeling","authors":"Yong-Jin Liu, K. Tang, M. Yuen","doi":"10.1109/GMAP.2004.1290050","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290050","url":null,"abstract":"In this paper the applications of equilibrium equation to geometric modeling is exploited and efficient numerical algorithms are proposed for solving the equilibrium equation. First we show that from diverse geometric modeling applications the equilibrium system can be extracted as the central framework. Second, by exploiting in-depth the special structures inherent in the geometric applications, we present simplified analytic solutions to the resulting geometric equilibrium equations via system decomposition. Finally, given the observation that the geometric equilibrium systems are extremely sensitive to both perturbations in input data and round off errors, efficient, stable and accurate numerical algorithms are proposed.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134580034","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":"Global curvature analysis and segmentation of volumetric data sets using trivariate B-spline functions","authors":"O. Soldea, G. Elber, E. Rivlin","doi":"10.1109/GMAP.2004.1290043","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290043","url":null,"abstract":"This paper presents a scheme to globally compute, bound, and analyze the Gaussian and mean curvatures of an entire volumetric data set, using a trivariate B-spline volumetric representation. The proposed scheme is not only precise and insensitive to aliasing, but also provides a method to globally segment the images into volumetric regions that contain convex or concave {elliptic) iso-surfaces, planar or cylindrical (parabolic) iso-surfaces, and volumetric regions with saddle-like (hyperbolic) iso-surfaces, regardless of the value of the iso-surface level. This scheme, which derives a new differential scalar field for a given scalar field, could easily be adapted to other differential properties.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133909401","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":"Surface interpolation of meshes with shape optimization","authors":"Xunnian Yang","doi":"10.1109/GMAP.2004.1290032","DOIUrl":"https://doi.org/10.1109/GMAP.2004.1290032","url":null,"abstract":"Subdivision surface is an efficient geometric modeling tool that is generated by repeated approximation or interpolation from an initial control mesh. For each time of subdivision the old mesh will be split and the vertexes of the mesh will be refined for a new mesh. Most existing algorithms aim to construct a smooth subdivision surface by smoothing the vertexes of the split mesh. When some features are desired, special rules or parameters should often be applied. In this paper a new nonstationary subdivision method is presented for surface modeling by recursive interpolation from an initial triangular control mesh. For each time of subdivision the mesh itself is a piecewise linear approximation to the final surface, and more details will be added to the surface when the triangles have been split and replaced by more refined subtriangles. We compute every interpolated edge vertex as a solution to the problem of least square fitting of the edge and its neighboring triangles. Sharp features as well as flat regions can be kept well during subdivision. To obtain a visually smooth subdivision surface in the limit, the normal at the vertexes of old meshes will be used as constraint for every time of subdivision. The main advantage of this new method is that the interpolated vertexes depend on the local geometry of the mesh, but not the valences of the mesh. The examples we have tested show that the interpolating surfaces by this new method can inherit the shape of initial course mesh more fairly and naturally.","PeriodicalId":323560,"journal":{"name":"Geometric Modeling and Processing, 2004. Proceedings","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127995910","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}