{"title":"Second-order Spatial Measures Low Overlap Rate Point Cloud Registration Algorithm Based On FPFH Features1","authors":"Zewei Lian, Xiaogang Wang, Junjie Lin, Liuhong Zhang, Mingming Tang","doi":"10.3233/aic-230217","DOIUrl":"https://doi.org/10.3233/aic-230217","url":null,"abstract":"When the sensor dynamically collects point cloud data for object or map reconstruction, the registration effect is poor and reconstruction application is difficult with a too low overlap rate of the collected point cloud data. The reason is that the objects are covered, the sensor rotation angle is too large and the speed of movement is too fast. Because of these problems, this paper proposes a point cloud registration algorithm based on FPFH feature matching, combined with second-order spatial measures. Firstly, using the FPFH feature extraction algorithm, the features of each point are extracted, and then feature matching is performed to generate the set of feature point pairs. Secondly, the second-order spatial measure is used to calculate the set of feature point pairs to obtain the second-order spatial measure matrix scores and sort them. Finally, the dichotomy method is used to find the appropriate second-order spatial measure scores for distinguishing the inner points (points in the overlap region) from the outer points (points that do not belong to the overlap region as well as the mismatched points and some disturbances). The contrast experiments between this algorithm and three common point cloud registration algorithms, FPFH-ICP, 4PCS-ICP, and NDT-ICP, on the Stanford dataset and 3DMatch dataset shows that the registration accuracy of the other algorithms decreases significantly with a low overlap rate. But this algorithm still has a high registration accuracy and is less affected by outliers than the other algorithms. Besides, this algorithm can still maintain a good registration effect on different data sets.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"59 47","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141804592","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":"Multimodal biometric authentication: A review","authors":"Swimpy Pahuja, Navdeep Goel","doi":"10.3233/aic-220247","DOIUrl":"https://doi.org/10.3233/aic-220247","url":null,"abstract":"Critical applications ranging from sensitive military data to restricted area access demand selective user authentication. The prevalent methods of tokens, passwords, and other commonly used techniques proved deficient as they can be easily stolen, lost, or broken to gain illegitimate access, leading to data spillage. Since data safety against tricksters is a significant issue nowadays, biometrics is one of the unique human characteristic-based techniques that may give better solutions in this regard. The technique entails biometric authentication of users based on an individual’s inimitable physiological or behavioral characteristics to provide access to a specific application or data. This paper provides a detailed description of authentication and its approaches, focusing on biometric-based authentication methods, the primary challenges they encounter, and how they have been addressed. The tabular view shows the benefits and downsides of various multimodal biometric systems, and open research challenges. To put it another way, this article lays out a roadmap for the emergence of multimodal biometric-based authentication, covering both the challenges and the solutions that have been proposed. Further, the urge to develop various multi-trait-based methods for secure authentication and data privacy is focused. Lastly, some multimodal biometric systems comprising fingerprint and iris modalities have been compared based on False Accept Rate (FAR), False Reject Rate (FRR), and accuracy to find the best secure model with easy accessibility.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"51 25","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140970582","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 multi-average based pseudo nearest neighbor classifier","authors":"Dapeng Li, Jing Guo","doi":"10.3233/aic-230312","DOIUrl":"https://doi.org/10.3233/aic-230312","url":null,"abstract":"Conventional k nearest neighbor (KNN) rule is a simple yet effective method for classification, but its classification performance is easily degraded in the case of small size training samples with existing outliers. To address this issue, A multi-average based pseudo nearest neighbor classifier (MAPNN) rule is proposed. In the proposed MAPNN rule, k ( k − 1 ) / 2 ( k > 1) local mean vectors of each class are obtained by taking the average of two points randomly from k nearest neighbors in every category, and then k pseudo nearest neighbors are chosen from k ( k − 1 ) / 2 local mean neighbors of every class to determine the category of a query point. The selected k pseudo nearest neighbors can reduce the negative impact of outliers in some degree. Extensive experiments are carried out on twenty-one numerical real data sets and four artificial data sets by comparing MAPNN to other five KNN-based methods. The experimental results demonstrate that the proposed MAPNN is effective for classification task and achieves better classification results in the small-size samples cases comparing to five relative KNN-based classifiers.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"44 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140371598","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":"The CADE-29 Automated Theorem Proving System Competition – CASC-29","authors":"Geoff Sutcliffe, Martin Desharnais","doi":"10.3233/aic-230325","DOIUrl":"https://doi.org/10.3233/aic-230325","url":null,"abstract":"The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic, Automated Theorem Proving (ATP) systems – the world championship for such systems. CASC-29 was the twenty-eighth competition in the CASC series. Twenty-four ATP systems competed in the various divisions. This paper presents an outline of the competition design and a commentated summary of the results.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"115 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140381434","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":"Doubly stochastic subdomain mining with sample reweighting for unsupervised domain adaptive person re-identification","authors":"Chunren Tang, Dingyu Xue, Dongyue Chen","doi":"10.3233/aic-220121","DOIUrl":"https://doi.org/10.3233/aic-220121","url":null,"abstract":"Clustering-based unsupervised domain adaptive person re-identification methods have achieved remarkable progress. However, existing works are easy to fall into local minimum traps due to the optimization of two variables, feature representation and pseudo labels. Besides, the model can also be hurt by the inevitable false assignment of pseudo labels. In order to solve these problems, we propose the Doubly Stochastic Subdomain Mining (DSSM) to prevent the nonconvex optimization from falling into local minima in this paper. And we also design a novel reweighting algorithm based on the similarity correlation coefficient between samples which is referred to as Maximal Heterogeneous Similarity (MHS), it can reduce the adverse effect caused by noisy labels. Extensive experiments on two popular person re-identification datasets demonstrate that our method outperforms other state-of-the-art works. The source code is available at https://github.com/Tchunansheng/DSSM.","PeriodicalId":505412,"journal":{"name":"AI Communications","volume":"40 26","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139611955","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号
