首页 > 最新文献

Big Data Research最新文献

英文 中文
Optimizing image captioning: The effectiveness of vision transformers and VGG networks for remote sensing 优化图像字幕:遥感视觉转换器和 VGG 网络的有效性
IF 3.5 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-13 DOI: 10.1016/j.bdr.2024.100477
Huimin Han , Bouba oumarou Aboubakar , Mughair Bhatti , Bandeh Ali Talpur , Yasser A. Ali , Muna Al-Razgan , Yazeed Yasid Ghadi

This study presents a comprehensive evaluation of two prominent deep learning models, Vision Transformer (ViT) and VGG16, within the domain of image captioning for remote sensing data. By leveraging the BLEU score, a widely accepted metric for assessing the quality of text generated by machine learning models against a set of reference captions, this research aims to dissect and understand the capabilities and performance nuances of these models across various sample sizes: 25, 50, 75, and 100 samples. Our findings reveal that the Vision Transformer model generally outperforms the VGG16 model across all evaluated sample sizes, achieving its peak performance at 50 samples with a BLEU score of 0.5507. This performance shows that ViT benefits from its ability to capture global dependencies within the data, providing a more nuanced understanding of the images. However, the performance slightly decreases as the sample size increases beyond 50, indicating potential challenges in scalability or overfitting to the training data. Conversely, the VGG16 model shows a different performance trajectory, starting with a lower BLEU score for smaller sample sizes but demonstrating a consistent improvement as the sample size increases, culminating in its highest BLEU score of 0.4783 for 100 samples. This pattern suggests that VGG16 may require a larger dataset to adequately learn and generalize from the data, although it achieves a more modest performance ceiling compared to ViT. Through a detailed analysis of these findings, the study underscores the strengths and limitations of each model in the context of image captioning. The Vision Transformer's superior performance highlights its potential for applications requiring high accuracy in text generation from images. In contrast, the gradual improvement exhibited by VGG16 suggests its utility in scenarios where large datasets are available, and scalability is a priority. This study contributes to the ongoing discourse in the AI community regarding the selection and optimization of deep learning models for complex tasks such as image captioning, offering insights that could guide future research and application development in this field.

本研究对遥感数据图像标题领域的两个著名深度学习模型--Vision Transformer(ViT)和 VGG16 进行了全面评估。BLEU 分数是评估机器学习模型根据一组参考标题生成的文本质量的一个广为接受的指标,本研究利用这一指标,旨在剖析和了解这些模型在不同样本量(25、50、75 和 100 个样本)下的能力和性能细微差别。我们的研究结果表明,在所有评估的样本量中,Vision Transformer 模型的性能普遍优于 VGG16 模型,在 50 个样本时达到最高性能,BLEU 得分为 0.5507。这一性能表明,ViT 能够捕捉数据中的全局依赖关系,从而提供对图像更细致入微的理解。不过,随着样本量增加到 50 个以上,性能略有下降,这表明在可扩展性或过度拟合训练数据方面存在潜在挑战。相反,VGG16 模型则显示出不同的性能轨迹,开始时样本量较小,BLEU 分数较低,但随着样本量的增加,BLEU 分数不断提高,最终在 100 个样本时达到最高的 0.4783。这种模式表明,VGG16 可能需要更大的数据集才能从数据中充分学习和泛化,尽管与 ViT 相比,它的性能上限更低。通过对这些发现的详细分析,本研究强调了每个模型在图像字幕方面的优势和局限性。Vision Transformer 的卓越性能凸显了它在要求高精度图像文本生成的应用中的潜力。相比之下,VGG16 所表现出的渐进式改进表明,它适用于有大型数据集的场景,而且可扩展性是优先考虑的问题。这项研究为人工智能界正在进行的有关为图像字幕等复杂任务选择和优化深度学习模型的讨论做出了贡献,并提供了可指导该领域未来研究和应用开发的见解。
{"title":"Optimizing image captioning: The effectiveness of vision transformers and VGG networks for remote sensing","authors":"Huimin Han ,&nbsp;Bouba oumarou Aboubakar ,&nbsp;Mughair Bhatti ,&nbsp;Bandeh Ali Talpur ,&nbsp;Yasser A. Ali ,&nbsp;Muna Al-Razgan ,&nbsp;Yazeed Yasid Ghadi","doi":"10.1016/j.bdr.2024.100477","DOIUrl":"10.1016/j.bdr.2024.100477","url":null,"abstract":"<div><p>This study presents a comprehensive evaluation of two prominent deep learning models, Vision Transformer (ViT) and VGG16, within the domain of image captioning for remote sensing data. By leveraging the BLEU score, a widely accepted metric for assessing the quality of text generated by machine learning models against a set of reference captions, this research aims to dissect and understand the capabilities and performance nuances of these models across various sample sizes: 25, 50, 75, and 100 samples. Our findings reveal that the Vision Transformer model generally outperforms the VGG16 model across all evaluated sample sizes, achieving its peak performance at 50 samples with a BLEU score of 0.5507. This performance shows that ViT benefits from its ability to capture global dependencies within the data, providing a more nuanced understanding of the images. However, the performance slightly decreases as the sample size increases beyond 50, indicating potential challenges in scalability or overfitting to the training data. Conversely, the VGG16 model shows a different performance trajectory, starting with a lower BLEU score for smaller sample sizes but demonstrating a consistent improvement as the sample size increases, culminating in its highest BLEU score of 0.4783 for 100 samples. This pattern suggests that VGG16 may require a larger dataset to adequately learn and generalize from the data, although it achieves a more modest performance ceiling compared to ViT. Through a detailed analysis of these findings, the study underscores the strengths and limitations of each model in the context of image captioning. The Vision Transformer's superior performance highlights its potential for applications requiring high accuracy in text generation from images. In contrast, the gradual improvement exhibited by VGG16 suggests its utility in scenarios where large datasets are available, and scalability is a priority. This study contributes to the ongoing discourse in the AI community regarding the selection and optimization of deep learning models for complex tasks such as image captioning, offering insights that could guide future research and application development in this field.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141415449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on the legal system of economic-ecological synergistic compensation in carbon neutral marine cities with a background in big data 以大数据为背景的碳中和海洋城市经济生态协同补偿法律制度研究
IF 3.5 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-13 DOI: 10.1016/j.bdr.2024.100476

With the increasingly severe global carbon emissions problem and the serious threat ecosystems face, carbon neutrality has gradually attracted widespread attention. This study provides an in-depth analysis of practical cases of international carbon neutrality initiatives and relevant experiences of marine cities, focusing on the construction and implementation of a legal system for economic, ecologically coordinated compensation. To evaluate the actual effectiveness of the legal system in marine cities, this study used a multiple linear regression model, considering factors such as the strictness of the legal system, enforcement efforts, and the level of participation of local enterprises and residents. The research results indicate that carbon emissions have significantly decreased in cities where legal systems are effectively enforced, from an average of 1.5 million tons per year to 1 million tons. At the same time, the economic growth rate of these cities has also significantly improved, increasing by about 2.5 percentage points from the original annual average of 4 % to 6.5 %. The study also found that the biodiversity index of these cities increased by 15 %, far higher than the average increase of 5 % in other cities, indicating the positive role of legal systems in protecting biodiversity. The public's participation rate in environmental protection activities has also increased from 25 % to 45 %, and the growth rate of green investment has reached an average of 8 % per year, far exceeding the 3 % growth rate of other cities. In terms of the ecosystem, data shows that the distribution of the ecosystem is stable, with an average ecological index of 508, which is in a relatively ideal state. The annual average growth rate of ecosystem restoration is about 3.5 %, further proving the effectiveness of ecological protection measures. Comprehensive empirical analysis shows that implementing the new legal system effectively reduces carbon emissions, enhances biodiversity, and promotes sustainable economic development. The economic growth rate increased from an average of 4.2 % to 5.1 % per year after implementing the new legal system, fully demonstrating the important role of the economic, ecologically coordinated compensation legal system in promoting carbon neutrality goals in marine cities.

随着全球碳排放问题日益严峻,生态系统面临严重威胁,碳中和逐渐受到广泛关注。本研究深入分析了国际碳中和倡议的实践案例和海洋城市的相关经验,重点探讨了经济、生态协调补偿法律制度的构建与实施。为评价海洋城市法律制度的实际效果,本研究采用多元线性回归模型,综合考虑了法律制度的严格程度、执行力度、当地企业和居民的参与程度等因素。研究结果表明,在法律制度得到有效执行的城市,碳排放量明显下降,从平均每年 1.同时,这些城市的经济增长率也显著提高,从原来的年均 4% 提高到 6.5%,提高了约 2.5 个百分点。研究还发现,这些城市的生物多样性指数提高了 15%,远高于其他城市 5%的平均增幅,说明法律制度在保护生物多样性方面发挥了积极作用。公众参与环保活动的比例也从 25% 提高到 45%,绿色投资的年均增长率达到 8%,远远超过其他城市 3% 的增长率。在生态系统方面,数据显示生态系统分布稳定,平均生态指数为 508,处于较为理想的状态。生态系统恢复的年均增长率约为 3.5%,进一步证明了生态保护措施的有效性。综合实证分析表明,新法律体系的实施有效减少了碳排放,提高了生物多样性,促进了经济的可持续发展。实施新法律体系后,经济增长率从平均每年 4.2% 提高到 5.1%,充分证明了经济、生态协调补偿法律体系在促进海洋城市碳中和目标中的重要作用。
{"title":"Research on the legal system of economic-ecological synergistic compensation in carbon neutral marine cities with a background in big data","authors":"","doi":"10.1016/j.bdr.2024.100476","DOIUrl":"10.1016/j.bdr.2024.100476","url":null,"abstract":"<div><p>With the increasingly severe global carbon emissions problem and the serious threat ecosystems face, carbon neutrality has gradually attracted widespread attention. This study provides an in-depth analysis of practical cases of international carbon neutrality initiatives and relevant experiences of marine cities, focusing on the construction and implementation of a legal system for economic, ecologically coordinated compensation. To evaluate the actual effectiveness of the legal system in marine cities, this study used a multiple linear regression model, considering factors such as the strictness of the legal system, enforcement efforts, and the level of participation of local enterprises and residents. The research results indicate that carbon emissions have significantly decreased in cities where legal systems are effectively enforced, from an average of 1.5 million tons per year to 1 million tons. At the same time, the economic growth rate of these cities has also significantly improved, increasing by about 2.5 percentage points from the original annual average of 4 % to 6.5 %. The study also found that the biodiversity index of these cities increased by 15 %, far higher than the average increase of 5 % in other cities, indicating the positive role of legal systems in protecting biodiversity. The public's participation rate in environmental protection activities has also increased from 25 % to 45 %, and the growth rate of green investment has reached an average of 8 % per year, far exceeding the 3 % growth rate of other cities. In terms of the ecosystem, data shows that the distribution of the ecosystem is stable, with an average ecological index of 508, which is in a relatively ideal state. The annual average growth rate of ecosystem restoration is about 3.5 %, further proving the effectiveness of ecological protection measures. Comprehensive empirical analysis shows that implementing the new legal system effectively reduces carbon emissions, enhances biodiversity, and promotes sustainable economic development. The economic growth rate increased from an average of 4.2 % to 5.1 % per year after implementing the new legal system, fully demonstrating the important role of the economic, ecologically coordinated compensation legal system in promoting carbon neutrality goals in marine cities.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.5,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141412546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep Learning Techniques for Enhanced Mangrove Land use and Land change from Remote Sensing Imagery: A Blue Carbon Perspective 从遥感图像中增强红树林土地利用和土地变化的深度学习技术:蓝碳视角
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-06-01 DOI: 10.1016/j.bdr.2024.100478
Huimin Han, Zeeshan Zeeshan, Muhammad Assam, Dr Faheem Ullah Khan, Wasiat Khan, Muhammad Asif, U. Bhatti, Ahmad Hasnain, Emad Mahrous Awwad, Nadia Sarhan
{"title":"Deep Learning Techniques for Enhanced Mangrove Land use and Land change from Remote Sensing Imagery: A Blue Carbon Perspective","authors":"Huimin Han, Zeeshan Zeeshan, Muhammad Assam, Dr Faheem Ullah Khan, Wasiat Khan, Muhammad Asif, U. Bhatti, Ahmad Hasnain, Emad Mahrous Awwad, Nadia Sarhan","doi":"10.1016/j.bdr.2024.100478","DOIUrl":"https://doi.org/10.1016/j.bdr.2024.100478","url":null,"abstract":"","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141399955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scalable Diversified Top-k Pattern Matching in Big Graphs 大图中的可扩展多样化 Top-k 模式匹配
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-05-14 DOI: 10.1016/j.bdr.2024.100464
Aissam Aouar , Saïd Yahiaoui , Lamia Sadeg , Kadda Beghdad Bey

Typically, graph pattern matching is expressed in terms of subgraph isomorphism. Graph simulation and its variants were introduced to reduce the time complexity and obtain more meaningful results in big graphs. Among these models, the matching subgraphs obtained by tight simulation are more compact and topologically closer to the pattern graph than results produced by other approaches. However, the number of resulting subgraphs can be huge, overlapping each other and unequally relaxed from the pattern graph. Hence, we introduce a ranking and diversification method for tight simulation results, which allows the user to obtain the most diversified and relevant matching subgraphs. This approach exploits the weights on edges of the big graph to express the interest of the matching subgraph by tight simulation. Furthermore, we provide distributed scalable algorithms to evaluate the proposed methods based on distributed programming paradigms. The experiments on real data graphs succeed in demonstrating the effectiveness of the proposed models and the efficiency of the associated algorithms. The result diversification reached 123% within a time frame that does not exceed 40%, on average, of the duration required for tight simulation graph pattern matching.

通常,图模式匹配用子图同构来表示。图模拟及其变体的引入是为了降低时间复杂性,并在大型图中获得更有意义的结果。在这些模型中,通过紧密模拟得到的匹配子图比其他方法得到的结果更紧凑,拓扑上更接近模式图。然而,所得到的子图数量可能非常庞大,相互重叠,与模式图的松弛程度也不相等。因此,我们为严密的模拟结果引入了一种排序和多样化方法,使用户能够获得最多样化和最相关的匹配子图。这种方法利用了大图边上的权重,通过严密模拟来表达匹配子图的相关性。此外,我们还提供了基于分布式编程范式的分布式可扩展算法来评估所提出的方法。在真实数据图上的实验成功证明了所提模型的有效性和相关算法的效率。在平均不超过严密模拟图模式匹配所需时间 40% 的情况下,结果多样化达到了 123%。
{"title":"Scalable Diversified Top-k Pattern Matching in Big Graphs","authors":"Aissam Aouar ,&nbsp;Saïd Yahiaoui ,&nbsp;Lamia Sadeg ,&nbsp;Kadda Beghdad Bey","doi":"10.1016/j.bdr.2024.100464","DOIUrl":"10.1016/j.bdr.2024.100464","url":null,"abstract":"<div><p>Typically, graph pattern matching is expressed in terms of subgraph isomorphism. Graph simulation and its variants were introduced to reduce the time complexity and obtain more meaningful results in big graphs. Among these models, the matching subgraphs obtained by tight simulation are more compact and topologically closer to the pattern graph than results produced by other approaches. However, the number of resulting subgraphs can be huge, overlapping each other and unequally relaxed from the pattern graph. Hence, we introduce a ranking and diversification method for tight simulation results, which allows the user to obtain the most diversified and relevant matching subgraphs. This approach exploits the weights on edges of the big graph to express the interest of the matching subgraph by tight simulation. Furthermore, we provide distributed scalable algorithms to evaluate the proposed methods based on distributed programming paradigms. The experiments on real data graphs succeed in demonstrating the effectiveness of the proposed models and the efficiency of the associated algorithms. The result diversification reached 123% within a time frame that does not exceed 40%, on average, of the duration required for tight simulation graph pattern matching.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141043195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Heterogeneous Transfer Learning 分布式异构迁移学习
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-05-14 DOI: 10.1016/j.bdr.2024.100456
Paolo Mignone , Gianvito Pio , Michelangelo Ceci

Transfer learning has proved to be effective for building predictive models even in complex conditions with a low amount of available labeled data, by constructing a predictive model for a target domain also using the knowledge coming from a separate domain, called source domain. However, several existing transfer learning methods assume identical feature spaces between the source and the target domains. This assumption limits the possible real-world applications of such methods, since two separate, although related, domains could be described by totally different feature spaces. Heterogeneous transfer learning methods aim to overcome this limitation, but they usually i) make other assumptions on the features, such as requiring the same number of features, ii) are not generally able to distribute the workload over multiple computational nodes, iii) cannot work in the Positive-Unlabeled (PU) learning setting, which we also considered in this study, or iv) their applicability is limited to specific application domains, i.e., they are not general-purpose methods.

In this manuscript, we present a novel distributed heterogeneous transfer learning method, implemented in Apache Spark, that overcomes all the above-mentioned limitations. Specifically, it is able to work also in the PU learning setting by resorting to a clustering-based approach, and can align totally heterogeneous feature spaces, without exploiting peculiarities of specific application domains. Moreover, our distributed approach allows us to process large source and target datasets.

Our experimental evaluation was performed in three different application domains that can benefit from transfer learning approaches, namely the reconstruction of the human gene regulatory network, the prediction of cerebral stroke in hospital patients, and the prediction of customer energy consumption in power grids. The results show that the proposed approach is able to outperform 4 state-of-the-art heterogeneous transfer learning approaches and 3 baselines, and exhibits ideal performances in terms of scalability.

事实证明,迁移学习可以有效地构建预测模型,即使在可用标注数据较少的复杂条件下,也能利用来自另一个领域(称为源领域)的知识构建目标领域的预测模型。然而,现有的几种迁移学习方法都假设源域和目标域的特征空间完全相同。这一假设限制了此类方法在现实世界中的应用,因为两个独立的领域虽然相关,但可能由完全不同的特征空间来描述。异构迁移学习方法旨在克服这一限制,但它们通常 i) 对特征做出其他假设,如要求特征数量相同;ii) 通常无法在多个计算节点上分配工作量;iii) 无法在正向无标记(PU)学习环境中工作,我们在本研究中也考虑了这一点;或者 iv) 它们的适用性仅限于特定的应用领域,也就是说,它们不是通用方法、在本手稿中,我们介绍了一种在 Apache Spark 中实现的新型分布式异构迁移学习方法,它克服了上述所有局限。具体来说,它通过采用基于聚类的方法,也能在 PU 学习环境中工作,并能对齐完全异构的特征空间,而无需利用特定应用领域的特殊性。此外,我们的分布式方法允许我们处理大型源数据集和目标数据集。我们在三个不同的应用领域进行了实验评估,这些应用领域可以从迁移学习方法中获益,即人类基因调控网络的重建、医院病人脑中风的预测以及电网客户能源消耗的预测。结果表明,所提出的方法能够超越 4 种最先进的异构迁移学习方法和 3 种基线方法,并且在可扩展性方面表现理想。
{"title":"Distributed Heterogeneous Transfer Learning","authors":"Paolo Mignone ,&nbsp;Gianvito Pio ,&nbsp;Michelangelo Ceci","doi":"10.1016/j.bdr.2024.100456","DOIUrl":"10.1016/j.bdr.2024.100456","url":null,"abstract":"<div><p>Transfer learning has proved to be effective for building predictive models even in complex conditions with a low amount of available labeled data, by constructing a predictive model for a target domain also using the knowledge coming from a separate domain, called source domain. However, several existing transfer learning methods assume identical feature spaces between the source and the target domains. This assumption limits the possible real-world applications of such methods, since two separate, although related, domains could be described by totally different feature spaces. Heterogeneous transfer learning methods aim to overcome this limitation, but they usually <em>i)</em> make other assumptions on the features, such as requiring the same number of features, <em>ii)</em> are not generally able to distribute the workload over multiple computational nodes, <em>iii)</em> cannot work in the Positive-Unlabeled (PU) learning setting, which we also considered in this study, or <em>iv)</em> their applicability is limited to specific application domains, i.e., they are not general-purpose methods.</p><p>In this manuscript, we present a novel distributed heterogeneous transfer learning method, implemented in Apache Spark, that overcomes all the above-mentioned limitations. Specifically, it is able to work also in the PU learning setting by resorting to a clustering-based approach, and can align totally heterogeneous feature spaces, without exploiting peculiarities of specific application domains. Moreover, our distributed approach allows us to process large source and target datasets.</p><p>Our experimental evaluation was performed in three different application domains that can benefit from transfer learning approaches, namely the reconstruction of the human gene regulatory network, the prediction of cerebral stroke in hospital patients, and the prediction of customer energy consumption in power grids. The results show that the proposed approach is able to outperform 4 state-of-the-art heterogeneous transfer learning approaches and 3 baselines, and exhibits ideal performances in terms of scalability.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214579624000327/pdfft?md5=33cf99e10874514291bfc635b26d260f&pid=1-s2.0-S2214579624000327-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141025163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SD-SLAM: A semantic SLAM approach for dynamic scenes based on LiDAR point clouds SD-SLAM:基于激光雷达点云的动态场景语义 SLAM 方法
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-05-08 DOI: 10.1016/j.bdr.2024.100463
Feiya Li , Chunyun Fu , Dongye Sun , Jian Li , Jianwen Wang

Point cloud maps generated via LiDAR sensors using extensive remotely sensed data are commonly used by autonomous vehicles and robots for localization and navigation. However, dynamic objects contained in point cloud maps not only downgrade localization accuracy and navigation performance but also jeopardize the map quality. In response to this challenge, we propose in this paper a novel semantic SLAM approach for dynamic scenes based on LiDAR point clouds, referred to as SD-SLAM hereafter. The main contributions of this work are in three aspects: 1) introducing a semantic SLAM framework dedicatedly for dynamic scenes based on LiDAR point clouds, 2) employing semantics and Kalman filtering to effectively differentiate between dynamic and semi-static landmarks, and 3) making full use of semi-static and pure static landmarks with semantic information in the SD-SLAM process to improve localization and mapping performance. To evaluate the proposed SD-SLAM, tests were conducted using the widely adopted KITTI odometry dataset. Results demonstrate that the proposed SD-SLAM effectively mitigates the adverse effects of dynamic objects on SLAM, improving vehicle localization and mapping performance in dynamic scenes, and simultaneously constructing a static semantic map with multiple semantic classes for enhanced environment understanding.

通过使用大量遥感数据的激光雷达传感器生成的点云图通常被自动驾驶车辆和机器人用于定位和导航。然而,点云图中包含的动态物体不仅会降低定位精度和导航性能,还会损害地图质量。为了应对这一挑战,我们在本文中提出了一种基于激光雷达点云的新型动态场景语义 SLAM 方法,以下简称 SD-SLAM。这项工作的主要贡献体现在三个方面:1)基于激光雷达点云为动态场景引入专用的语义 SLAM 框架;2)采用语义学和卡尔曼滤波技术有效区分动态和半静态地标;3)在 SD-SLAM 过程中充分利用半静态和纯静态地标的语义信息,提高定位和绘图性能。为了评估所提出的 SD-SLAM,我们使用广泛采用的 KITTI 测速数据集进行了测试。结果表明,所提出的 SD-SLAM 能有效减轻动态物体对 SLAM 的不利影响,提高车辆在动态场景中的定位和映射性能,并同时构建具有多个语义类别的静态语义地图,以增强对环境的理解。
{"title":"SD-SLAM: A semantic SLAM approach for dynamic scenes based on LiDAR point clouds","authors":"Feiya Li ,&nbsp;Chunyun Fu ,&nbsp;Dongye Sun ,&nbsp;Jian Li ,&nbsp;Jianwen Wang","doi":"10.1016/j.bdr.2024.100463","DOIUrl":"https://doi.org/10.1016/j.bdr.2024.100463","url":null,"abstract":"<div><p>Point cloud maps generated via LiDAR sensors using extensive remotely sensed data are commonly used by autonomous vehicles and robots for localization and navigation. However, dynamic objects contained in point cloud maps not only downgrade localization accuracy and navigation performance but also jeopardize the map quality. In response to this challenge, we propose in this paper a novel semantic SLAM approach for dynamic scenes based on LiDAR point clouds, referred to as SD-SLAM hereafter. The main contributions of this work are in three aspects: 1) introducing a semantic SLAM framework dedicatedly for dynamic scenes based on LiDAR point clouds, 2) employing semantics and Kalman filtering to effectively differentiate between dynamic and semi-static landmarks, and 3) making full use of semi-static and pure static landmarks with semantic information in the SD-SLAM process to improve localization and mapping performance. To evaluate the proposed SD-SLAM, tests were conducted using the widely adopted KITTI odometry dataset. Results demonstrate that the proposed SD-SLAM effectively mitigates the adverse effects of dynamic objects on SLAM, improving vehicle localization and mapping performance in dynamic scenes, and simultaneously constructing a static semantic map with multiple semantic classes for enhanced environment understanding.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141083349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Utilizing convolutional neural networks (CNN) and U-Net architecture for precise crop and weed segmentation in agricultural imagery: A deep learning approach 利用卷积神经网络 (CNN) 和 U-Net 架构实现农业图像中的作物和杂草精确分割:深度学习方法
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-05-08 DOI: 10.1016/j.bdr.2024.100465
Mughair Aslam Bhatti , M.S. Syam , Huafeng Chen , Yurong Hu , Li Wai Keung , Zeeshan Zeeshan , Yasser A. Ali , Nadia Sarhan

This study presents the implementation and evaluation of a convolutional neural network (CNN) based image segmentation model using the U-Net architecture for forest image segmentation. The proposed algorithm starts by preprocessing the datasets of satellite images and corresponding masks from a repository source. Data preprocessing involves resizing, normalizing, and splitting the images and masks into training and testing datasets. The U-Net model architecture, comprising encoder and decoder parts with skip connections, is defined and compiled with binary cross-entropy loss and Adam optimizer. Training includes early stopping and checkpoint saving mechanisms to prevent overfitting and retain the best model weights. Evaluation metrics such as Intersection over Union (IoU), Dice coefficient, pixel accuracy, precision, recall, specificity, and F1-score are computed to assess the model's performance. Visualization of results includes comparing predicted segmentation masks with ground truth masks for qualitative analysis. The study emphasizes the importance of training data size in achieving accurate segmentation models and highlights the potential of U-Net architecture for forest image segmentation tasks.

本研究介绍了基于卷积神经网络(CNN)的图像分割模型的实现和评估,该模型采用 U-Net 架构,用于森林图像分割。所提出的算法首先要对卫星图像数据集和来自资源库的相应掩码进行预处理。数据预处理包括调整大小、归一化以及将图像和掩码分割成训练数据集和测试数据集。U-Net 模型架构由编码器和解码器两部分组成,采用二进制交叉熵损失和亚当优化器进行定义和编译。训练包括早期停止和检查点保存机制,以防止过度拟合并保留最佳模型权重。为了评估模型的性能,还计算了一些评估指标,如联合交叉(IoU)、骰子系数、像素精度、精确度、召回率、特异性和 F1 分数。结果的可视化包括比较预测的分割掩码和地面实况掩码,以进行定性分析。该研究强调了训练数据量对实现精确分割模型的重要性,并突出了 U-Net 架构在森林图像分割任务中的潜力。
{"title":"Utilizing convolutional neural networks (CNN) and U-Net architecture for precise crop and weed segmentation in agricultural imagery: A deep learning approach","authors":"Mughair Aslam Bhatti ,&nbsp;M.S. Syam ,&nbsp;Huafeng Chen ,&nbsp;Yurong Hu ,&nbsp;Li Wai Keung ,&nbsp;Zeeshan Zeeshan ,&nbsp;Yasser A. Ali ,&nbsp;Nadia Sarhan","doi":"10.1016/j.bdr.2024.100465","DOIUrl":"10.1016/j.bdr.2024.100465","url":null,"abstract":"<div><p>This study presents the implementation and evaluation of a convolutional neural network (CNN) based image segmentation model using the U-Net architecture for forest image segmentation. The proposed algorithm starts by preprocessing the datasets of satellite images and corresponding masks from a repository source. Data preprocessing involves resizing, normalizing, and splitting the images and masks into training and testing datasets. The U-Net model architecture, comprising encoder and decoder parts with skip connections, is defined and compiled with binary cross-entropy loss and Adam optimizer. Training includes early stopping and checkpoint saving mechanisms to prevent overfitting and retain the best model weights. Evaluation metrics such as Intersection over Union (IoU), Dice coefficient, pixel accuracy, precision, recall, specificity, and F1-score are computed to assess the model's performance. Visualization of results includes comparing predicted segmentation masks with ground truth masks for qualitative analysis. The study emphasizes the importance of training data size in achieving accurate segmentation models and highlights the potential of U-Net architecture for forest image segmentation tasks.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141026200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non pilot data-aided carrier and sampling frequency offsets estimation in fast time-varying channel 快速时变信道中的非先导数据辅助载波和采样频率偏移估计
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-05-01 DOI: 10.1016/j.bdr.2024.100461
Yanan Wu, Rong Mei, Jie Xu

This paper considers the non pilot data-aided estimation of the carrier frequency offset (CFO) and sample frequency offset (SFO) of orthogonal frequency division multiplexing (OFDM) signals in fast time-varying channel. The main obstacle is the time-variant channel response, which deteriorates the estimation validity. A practical approach to mitigate this impact is to reduce the time consumption of one-shot estimation. In this way, we propose a method to reduce the time consumption to within one OFDM symbol duration. The maximum likelihood (ML) estimator is derived based on the observations of frequency domain constellations output of two FFTs on one symbol; its closed-form approximation is then derived to reduce the calculation burden. Remarkably, our method does not require any training symbol or pilot tone embedded in the signal spectrum, therefore achieves the highest spectral efficiency. Theoretical analysis and simulation results are employed to assess the performance of proposed method in comparison with existing alternatives.

本文探讨了在快速时变信道中对正交频分复用(OFDM)信号的载波频率偏移(CFO)和采样频率偏移(SFO)进行非先导数据辅助估计的问题。主要障碍是时变信道响应会降低估计的有效性。减轻这种影响的实用方法是减少单次估计的时间消耗。因此,我们提出了一种将耗时减少到一个 OFDM 符号持续时间内的方法。最大似然(ML)估计器是根据对一个符号上两个 FFT 输出的频域星座的观测结果推导出来的;然后推导出其闭式近似值,以减轻计算负担。值得注意的是,我们的方法不需要任何训练符号或嵌入信号频谱的先导音,因此实现了最高的频谱效率。通过理论分析和仿真结果,评估了拟议方法与现有替代方法的性能比较。
{"title":"Non pilot data-aided carrier and sampling frequency offsets estimation in fast time-varying channel","authors":"Yanan Wu,&nbsp;Rong Mei,&nbsp;Jie Xu","doi":"10.1016/j.bdr.2024.100461","DOIUrl":"https://doi.org/10.1016/j.bdr.2024.100461","url":null,"abstract":"<div><p>This paper considers the non pilot data-aided estimation of the carrier frequency offset (CFO) and sample frequency offset (SFO) of orthogonal frequency division multiplexing (OFDM) signals in fast time-varying channel. The main obstacle is the time-variant channel response, which deteriorates the estimation validity. A practical approach to mitigate this impact is to reduce the time consumption of one-shot estimation. In this way, we propose a method to reduce the time consumption to within one OFDM symbol duration. The maximum likelihood (ML) estimator is derived based on the observations of frequency domain constellations output of two FFTs on one symbol; its closed-form approximation is then derived to reduce the calculation burden. Remarkably, our method does not require any training symbol or pilot tone embedded in the signal spectrum, therefore achieves the highest spectral efficiency. Theoretical analysis and simulation results are employed to assess the performance of proposed method in comparison with existing alternatives.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140901432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Similarity Measurement for Graph Data: An Improved Centrality and Geometric Perspective-Based Approach 图形数据的相似性测量:基于中心性和几何视角的改进方法
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-04-30 DOI: 10.1016/j.bdr.2024.100462
Li Deng , Shihu Liu , Weihua Xu , Xianghong Lin

How to make a precise similarity measurement for graph data is considered as highly recommended research in many fields. Hereinto, the so-named graph data is the coalition of patterns and edges that connect patterns. By taking both of pattern information and edge information into consideration, this paper introduces an improved centrality and geometric perspective-based approach to measure the similarity between any two graph data. Once these two graph data are projected into a plane, the pattern distance can be calculated by Euclid metric. With the help of the area composed by length of each edge and angle that constructed by the positive X-axis and the edge, the area-based edge distance is computed. To get better measurement, position-based edge distance is used to modify the edge distance. Up to now, the global distance between any two graph data can be determined by combining the above mentioned two distance results. Finally, the letter dataset is applied for experiment to examine the proposed similarity approach. The experimental results show that the proposed approach captures the similarity of graph data commendably and gets a tradeoff between time and precision.

如何对图数据进行精确的相似性测量,是许多领域都非常推崇的研究。所谓图数据,就是由图案和连接图案的边组成的联盟。通过同时考虑模式信息和边信息,本文介绍了一种改进的基于中心性和几何透视的方法来测量任意两个图数据之间的相似性。将这两个图形数据投影到一个平面后,就可以用欧几里得度量计算出图案距离。借助由每条边的长度和正 X 轴与边的夹角构成的面积,可以计算出基于面积的边距。为了获得更好的测量结果,基于位置的边缘距离被用来修正边缘距离。至此,任何两个图形数据之间的全局距离都可以通过综合上述两种距离结果来确定。最后,应用信件数据集进行实验,检验所提出的相似性方法。实验结果表明,所提出的方法能很好地捕捉图数据的相似性,并在时间和精度之间取得了平衡。
{"title":"Similarity Measurement for Graph Data: An Improved Centrality and Geometric Perspective-Based Approach","authors":"Li Deng ,&nbsp;Shihu Liu ,&nbsp;Weihua Xu ,&nbsp;Xianghong Lin","doi":"10.1016/j.bdr.2024.100462","DOIUrl":"https://doi.org/10.1016/j.bdr.2024.100462","url":null,"abstract":"<div><p>How to make a precise similarity measurement for graph data is considered as highly recommended research in many fields. Hereinto, the so-named graph data is the coalition of patterns and edges that connect patterns. By taking both of pattern information and edge information into consideration, this paper introduces an improved centrality and geometric perspective-based approach to measure the similarity between any two graph data. Once these two graph data are projected into a plane, the pattern distance can be calculated by Euclid metric. With the help of the area composed by length of each edge and angle that constructed by the positive X-axis and the edge, the area-based edge distance is computed. To get better measurement, position-based edge distance is used to modify the edge distance. Up to now, the global distance between any two graph data can be determined by combining the above mentioned two distance results. Finally, the <span>letter dataset</span> is applied for experiment to examine the proposed similarity approach. The experimental results show that the proposed approach captures the similarity of graph data commendably and gets a tradeoff between time and precision.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140824127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Sea Surface Temperature Forecasting Problem with Deep Dilation-Erosion-Linear Models 论深层扩张-侵蚀-线性模型的海面温度预报问题
IF 3.3 3区 计算机科学 Q1 Business, Management and Accounting Pub Date : 2024-04-26 DOI: 10.1016/j.bdr.2024.100455
Ricardo de A. Araújo , Paulo S.G. de Mattos Neto , Nadia Nedjah , Sergio C.B. Soares

The sea surface temperature (SST) is considered an important measure for detecting changes in climate and marine ecosystems. So, its forecasting is essential for supporting governmental strategies to avoid side effects on the global population. In this paper, we analyze the SST time series and suggest that a combination between a linear component and a nonlinear component with long-term dependency can better represent it. Based on this assumption, we propose a deep neural network architecture with dilation-erosion-linear (DEL) processing units to deal with this particular kind of time series. An empirical analysis is performed in this work using three SST time series, where we explore three statistical measures. The experimental results demonstrate that the proposed model outperformed recent and classical literature forecasting techniques according to well-known performance metrics.

海面温度(SST)被认为是检测气候和海洋生态系统变化的重要指标。因此,对其进行预测对于支持政府避免对全球人口造成副作用的战略至关重要。在本文中,我们分析了 SST 时间序列,并提出线性分量和非线性分量之间的组合具有长期依赖性,可以更好地代表 SST。基于这一假设,我们提出了一种带有扩张-侵蚀-线性(DEL)处理单元的深度神经网络架构,以处理这种特殊的时间序列。在这项工作中,我们使用三个 SST 时间序列进行了实证分析,探索了三种统计量。实验结果表明,根据著名的性能指标,所提出的模型优于最新的经典文献预测技术。
{"title":"On the Sea Surface Temperature Forecasting Problem with Deep Dilation-Erosion-Linear Models","authors":"Ricardo de A. Araújo ,&nbsp;Paulo S.G. de Mattos Neto ,&nbsp;Nadia Nedjah ,&nbsp;Sergio C.B. Soares","doi":"10.1016/j.bdr.2024.100455","DOIUrl":"https://doi.org/10.1016/j.bdr.2024.100455","url":null,"abstract":"<div><p>The sea surface temperature (SST) is considered an important measure for detecting changes in climate and marine ecosystems. So, its forecasting is essential for supporting governmental strategies to avoid side effects on the global population. In this paper, we analyze the SST time series and suggest that a combination between a linear component and a nonlinear component with long-term dependency can better represent it. Based on this assumption, we propose a deep neural network architecture with dilation-erosion-linear (DEL) processing units to deal with this particular kind of time series. An empirical analysis is performed in this work using three SST time series, where we explore three statistical measures. The experimental results demonstrate that the proposed model outperformed recent and classical literature forecasting techniques according to well-known performance metrics.</p></div>","PeriodicalId":56017,"journal":{"name":"Big Data Research","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140813373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Big Data Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1