发布求助
文献互助 智能选刊 最新文献

Computer Aided Geometric Design最新文献

筛选
英文 中文
Efficient object recognition under cluttered scenes via descriptor-based matching and single point voting 通过基于描述符的匹配和单点表决实现杂乱场景下的高效物体识别
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-10-16 DOI: 10.1016/j.cagd.2024.102394
Xiaoge He , Yuanpeng Liu , Jun Zhou , Yuqi Zhang , Jun Wang
{"title":"Efficient object recognition under cluttered scenes via descriptor-based matching and single point voting","authors":"Xiaoge He ,&nbsp;Yuanpeng Liu ,&nbsp;Jun Zhou ,&nbsp;Yuqi Zhang ,&nbsp;Jun Wang","doi":"10.1016/j.cagd.2024.102394","DOIUrl":"10.1016/j.cagd.2024.102394","url":null,"abstract":"<div><div>This paper addresses the problem of recognizing multiple objects and multiple instances from point clouds. Whereas existing methods utilize descriptors on 3D fields or pointwise voting to achieve this task, our framework takes advantage of both descriptor-based and voting-based schemes to realize more robust and efficient prediction. Specifically, we propose a novel and robust descriptor called an orientation-enhanced fast point feature histogram (OE-FPFH) to describe points in both the object model and scene, and further to build the correspondence set. The OE-FPFH integrates an orientation vector through mining the geometric tensor of the local structure of a surface point, which is more representative than the original FPFH descriptor. To improve voting efficiency, we devise a novel single-point voting mechanism (SPVM), which constructs a unique local reference frame (LRF) on a single point using the orientation vector. The SPVM takes as input the corresponding point set and can generate a pose candidate for each correspondence. The process is realized by matching LRFs from two corresponding points. All pose candidates are subsequently divided into clusters and aggregated using the <em>K</em>-means clustering algorithm to deduce the poses for different objects or instances in the scene. Experiments on three challenging datasets demonstrate that our method is effective, efficient, and robust to occlusions and multiple instances.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102394"},"PeriodicalIF":1.3,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Curvature continuous corner cutting 曲率连续切角
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-10-15 DOI: 10.1016/j.cagd.2024.102392
Kai Hormann , Claudio Mancinelli
{"title":"Curvature continuous corner cutting","authors":"Kai Hormann ,&nbsp;Claudio Mancinelli","doi":"10.1016/j.cagd.2024.102392","DOIUrl":"10.1016/j.cagd.2024.102392","url":null,"abstract":"<div><div>Subdivision schemes are used to generate smooth curves by iteratively refining an initial control polygon. The simplest such schemes are corner cutting schemes, which specify two distinct points on each edge of the current polygon and connect them to get the refined polygon, thus cutting off the corners of the current polygon. While <span><span>de Boor (1987)</span></span> shows that this process always converges to a Lipschitz continuous limit curve, no matter how the points on each edge are chosen, <span><span>Gregory and Qu (1996)</span></span> discover that the limit curve is continuously differentiable under certain constraints. We extend these results and show that the limit curve can even be curvature continuous for specific sequences of cut ratios.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102392"},"PeriodicalIF":1.3,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142437820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GeoHi-GNN: Geometry-aware hierarchical graph representation learning for normal estimation GeoHi-GNN：用于正态估计的几何感知分层图表示学习
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-10-09 DOI: 10.1016/j.cagd.2024.102390
Nannan Li , Xinyuan Li , Jun Zhou , Dong Jiang , Jian Liu , Hong Qin
{"title":"GeoHi-GNN: Geometry-aware hierarchical graph representation learning for normal estimation","authors":"Nannan Li ,&nbsp;Xinyuan Li ,&nbsp;Jun Zhou ,&nbsp;Dong Jiang ,&nbsp;Jian Liu ,&nbsp;Hong Qin","doi":"10.1016/j.cagd.2024.102390","DOIUrl":"10.1016/j.cagd.2024.102390","url":null,"abstract":"<div><div>Normal estimation has been one of the key tasks in point cloud analysis, while it is challenging when facing with severe noises or complex regions. The challenges mainly come from the selection of supporting points for estimation, that is, improper selections of points and points' scale will lead to insufficient information, loss of details, etc. To this end, this paper proposes one feature-centric fitting scheme, GeoHi-GNN, by learning geometry-aware hierarchical graph representation for fitting weights estimation. The main functional module is the continuously conducted Hierarchically Geometric-aware (HG) module, consisting of two core operations, namely, the graph node construction (GNC) and the geometric-aware dynamic graph convolution (GDGC). GNC aims to aggregate the feature information onto a smaller number of nodes, providing global-to-local information while avoiding the interferences from noises in larger scales. With these nodes distributed in different scales, GDGC dynamically updates the node features regarding to both intrinsic feature and extrinsic geometric information. Finally, the hierarchical graphical features are cascaded to estimate the weights for supporting points in the surface fitting. Through the extensive experiments and comprehensive comparisons with the state-of-the-arts, our scheme has exhibited many attractive advantages such as being geometry-aware and robust, empowering further applications like more accurate surface reconstruction.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102390"},"PeriodicalIF":1.3,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142432316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing properties of subdivision schemes using small real Fourier indexed matrices 利用小实数傅里叶索引矩阵计算细分方案的特性
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-09-24 DOI: 10.1016/j.cagd.2024.102391
Cédric Gérot , Loïc Barthe , Neil A. Dodgson , Malcolm A. Sabin
{"title":"Computing properties of subdivision schemes using small real Fourier indexed matrices","authors":"Cédric Gérot ,&nbsp;Loïc Barthe ,&nbsp;Neil A. Dodgson ,&nbsp;Malcolm A. Sabin","doi":"10.1016/j.cagd.2024.102391","DOIUrl":"10.1016/j.cagd.2024.102391","url":null,"abstract":"<div><div>The quality of a subdivision scheme in the vicinity of a vertex or a face-centre is related to the eigenstructure of the subdivision matrix. When the scheme has the appropriate symmetries, a common technique, based on discrete Fourier transform, builds small complex matrices that ease the numerical analysis of the eigenelements using in particular their Fourier index. But the numerical analysis of the eigenelements remains difficult when matrix entries involve complex numbers and unknowns, for example, in cases where we are tuning a scheme. We present techniques to build similar small matrices, still associated with a Fourier index and whose eigenstructure is simply related to the full matrix, but which are real. They extend the known techniques to schemes which rotate the lattice and with vertices which do not lie topologically on symmetry axes of the studied vicinity of vertex or face centre. Our techniques make it easier to tune these subdivision schemes. We illustrate it with the analysis of the so-called Simplest Scheme at the centre of an <em>n</em>-sided face.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102391"},"PeriodicalIF":1.3,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142426603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing the cut locus, Voronoi diagram, and signed distance function of polygons 计算多边形的切割位置、沃罗诺图和符号距离函数
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-09-18 DOI: 10.1016/j.cagd.2024.102388
Csaba Bálint, Róbert Bán, Gábor Valasek
{"title":"Computing the cut locus, Voronoi diagram, and signed distance function of polygons","authors":"Csaba Bálint,&nbsp;Róbert Bán,&nbsp;Gábor Valasek","doi":"10.1016/j.cagd.2024.102388","DOIUrl":"10.1016/j.cagd.2024.102388","url":null,"abstract":"<div><p>This paper presents a new method for the computation of the generalized Voronoi diagram of planar polygons. First, we show that the vertices of the cut locus can be computed efficiently. This is achieved by enumerating the tripoints of the polygon, a superset of the cut locus vertices. This is the set of all points that are of equal distance to three distinct topological entities. Then our algorithm identifies and connects the appropriate tripoints to form the cut locus vertex connectivity graph, where edges define linear or parabolic boundary segments between the Voronoi regions, resulting in the generalized Voronoi diagram. Our proposed method is validated on complex polygon soups. We apply the algorithm to represent the exact signed distance function of the polygon by augmenting the Voronoi regions with linear and radial functions, calculating the cut locus both inside and outside.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102388"},"PeriodicalIF":1.3,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167839624001225/pdfft?md5=b31dbc2c8c3b0e635c2e304a68dca304&pid=1-s2.0-S0167839624001225-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Resultants of slice regular polynomials in two quaternionic variables 两个四元变量中切片正则多项式的结果项
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-08-21 DOI: 10.1016/j.cagd.2024.102381
Anna Gori , Giulia Sarfatti , Fabio Vlacci
{"title":"Resultants of slice regular polynomials in two quaternionic variables","authors":"Anna Gori ,&nbsp;Giulia Sarfatti ,&nbsp;Fabio Vlacci","doi":"10.1016/j.cagd.2024.102381","DOIUrl":"10.1016/j.cagd.2024.102381","url":null,"abstract":"<div><p>We introduce a non-commutative resultant, for slice regular polynomials in two quaternionic variables, defined in terms of a suitable Dieudonné determinant. We use this tool to investigate the existence of common zeros and common factors of slice regular polynomials and we give a kinematic interpretation of our results.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"114 ","pages":"Article 102381"},"PeriodicalIF":1.3,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142076946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conversion from NURBS to Bézier representation 从 NURBS 转换为贝塞尔表示法
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-08-10 DOI: 10.1016/j.cagd.2024.102380
Lanlan Yan
{"title":"Conversion from NURBS to Bézier representation","authors":"Lanlan Yan","doi":"10.1016/j.cagd.2024.102380","DOIUrl":"10.1016/j.cagd.2024.102380","url":null,"abstract":"<div><p>With the help of the Cox-de Boor recursion formula and the recurrence relation of the Bernstein polynomials, two categories of recursive algorithms for calculating the conversion matrix from an arbitrary non-uniform B-spline basis to a Bernstein polynomial basis of the same degree are presented. One is to calculate the elements of the matrix one by one, and the other is to calculate the elements of the matrix in two blocks. Interestingly, the weights in the two most basic recursion formulas are directly related to the weights in the recursion definition of the B-spline basis functions. The conversion matrix is exactly the Bézier extraction operator in isogeometric analysis, and we obtain the local extraction operator directly. With the aid of the conversion matrix, it is very convenient to determine the Bézier representation of NURBS curves and surfaces on any specified domain, that is, the isogeometric Bézier elements of these curves and surfaces.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"113 ","pages":"Article 102380"},"PeriodicalIF":1.3,"publicationDate":"2024-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141985702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
1D CNNs and face-based random walks: A powerful combination to enhance mesh understanding and 3D semantic segmentation 一维 CNN 和基于人脸的随机行走：增强网格理解和三维语义分割的强大组合
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-08-05 DOI: 10.1016/j.cagd.2024.102379
Amine Kassimi , Jamal Riffi , Khalid El Fazazy , Thierry Bertin Gardelle , Hamza Mouncif , Mohamed Adnane Mahraz , Ali Yahyaouy , Hamid Tairi
{"title":"1D CNNs and face-based random walks: A powerful combination to enhance mesh understanding and 3D semantic segmentation","authors":"Amine Kassimi ,&nbsp;Jamal Riffi ,&nbsp;Khalid El Fazazy ,&nbsp;Thierry Bertin Gardelle ,&nbsp;Hamza Mouncif ,&nbsp;Mohamed Adnane Mahraz ,&nbsp;Ali Yahyaouy ,&nbsp;Hamid Tairi","doi":"10.1016/j.cagd.2024.102379","DOIUrl":"10.1016/j.cagd.2024.102379","url":null,"abstract":"<div><p>In this paper, we present a novel face-based random walk method aimed at addressing the 3D semantic segmentation issue. Our method utilizes a one-dimensional convolutional neural network for detailed feature extraction from sequences of triangular faces and employs a stacked gated recurrent unit to gather information along the sequence during training. This approach allows us to effectively handle irregular meshes and utilize the inherent feature extraction potential present in mesh geometry. Our study's results show that the proposed method achieves competitive results compared to the state-of-the-art methods in mesh segmentation. Importantly, it requires fewer training iterations and demonstrates versatility by applying to a wide range of objects without the need for the mesh to adhere to manifold or watertight topology requirements.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"113 ","pages":"Article 102379"},"PeriodicalIF":1.3,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
De Casteljau's geometric approach to geometric design still alive 德卡斯特约的几何设计方法仍有生命力
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-08-02 DOI: 10.1016/j.cagd.2024.102378
Rachid Ait-Haddou , Marie-Laurence Mazure
{"title":"De Casteljau's geometric approach to geometric design still alive","authors":"Rachid Ait-Haddou ,&nbsp;Marie-Laurence Mazure","doi":"10.1016/j.cagd.2024.102378","DOIUrl":"10.1016/j.cagd.2024.102378","url":null,"abstract":"<div><p>With great enthusiasm and admiration we would like to pay tribute to Paul de Faget de Casteljau for his essential contribution to CAGD. Motivated by the development of automated <em>human-computer collaboration</em> for car industry, not only was he the very first pioneer in this field, but his initial geometric approach to creating <em>shapes from poles</em> was even undeniably the simplest and most remarkably effective. Two crucial points in this approach are to keep in mind: firstly, the idea of splitting one variable into several variables to facilitate the algorithmic construction of curves; secondly, the possibility of controlling shapes by means of osculating flats and corner-cutting algorithms. The present article is a partial survey on Chebyshevian blossoms intended to show that his ideas are still alive.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"113 ","pages":"Article 102378"},"PeriodicalIF":1.3,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141978922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Symmetry group detection of point clouds in 3D via a decomposition method 通过分解法检测三维点云的对称群
IF 1.3 4区 计算机科学
Computer Aided Geometric Design Pub Date : 2024-07-24 DOI: 10.1016/j.cagd.2024.102376
Michal Bizzarri , Lukáš Hruda , Miroslav Lávička , Jan Vršek
{"title":"Symmetry group detection of point clouds in 3D via a decomposition method","authors":"Michal Bizzarri ,&nbsp;Lukáš Hruda ,&nbsp;Miroslav Lávička ,&nbsp;Jan Vršek","doi":"10.1016/j.cagd.2024.102376","DOIUrl":"10.1016/j.cagd.2024.102376","url":null,"abstract":"<div><p>Analyzing the symmetries present in point clouds, which represent sets of 3D coordinates, is important for understanding their underlying structure and facilitating various applications. In this paper, we propose a novel decomposition-based method for detecting the entire symmetry group of 3D point clouds. Our approach decomposes the point cloud into simpler shapes whose symmetry groups are easier to find. The exact symmetry group of the original point cloud is then derived from the symmetries of these individual components. The method presented in this paper is a direct extension of the approach recently formulated in <span><span>Bizzarri et al. (2022a)</span></span> for discrete curves in plane. The method can be easily modified also for perturbed data. This work contributes to the advancement of symmetry analysis in point clouds, providing a foundation for further research and enhancing applications in computer vision, robotics, and augmented reality.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"113 ","pages":"Article 102376"},"PeriodicalIF":1.3,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141852180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信