ICT Express最新文献

筛选
英文 中文
DNN-based algorithm for joint SIC ordering and power allocation in downlink NOMA-enabled heterogeneous networks 基于dnn的异构下行noma网络SIC联合排序与功率分配算法
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.06.004
Donghyeon Kim , Jung-Bin Kim , Haejoon Jung , In-Ho Lee
{"title":"DNN-based algorithm for joint SIC ordering and power allocation in downlink NOMA-enabled heterogeneous networks","authors":"Donghyeon Kim ,&nbsp;Jung-Bin Kim ,&nbsp;Haejoon Jung ,&nbsp;In-Ho Lee","doi":"10.1016/j.icte.2024.06.004","DOIUrl":"10.1016/j.icte.2024.06.004","url":null,"abstract":"<div><div>In the heterogeneous network (HetNet) employing downlink non-orthogonal multiple access (NOMA), we focus on the non-convex optimization problem to optimize the spectral efficiency (SE) while the users satisfy the quality-of-service (QoS) requirement. In the previous work, the optimal joint successive interference cancellation and power allocation (JSPA) algorithm for maximizing SE is proposed to solve the mixed-integer non-linear programming (MINLP) problem in NOMA-enabled HetNet. However, the optimal solution requires exponential complexity by the number of base stations (BSs). Therefore, we present a deep neural network (DNN)-based algorithm for JSPA to reduce the complexity. In particular, to deal with the MINLP-based JSPA problem, we reformulate it into an equivalently simple problem that optimizes only the power consumption of BSs. Then, we introduce the unsupervised DNN-based method for JSPA to handle the simplified problem. The presented scheme yields improved SE and outage performance compared with traditional DNN-based methods. Additionally, we propose a user selection scheme with low complexity to enhance the SE of the proposed DNN-based power allocation. Through simulations, we illustrate that the suggested DNN-based scheme can attain SE performance similar to that of the optimal scheme.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1301-1307"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094083","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
A survey on monitoring and management techniques for road traffic congestion in vehicular networks 车辆网络中道路交通拥堵监测与管理技术综述
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.10.007
Amenah S.M. Thabit , Chaker Abdelaziz Kerrache , Carlos T. Calafate
{"title":"A survey on monitoring and management techniques for road traffic congestion in vehicular networks","authors":"Amenah S.M. Thabit ,&nbsp;Chaker Abdelaziz Kerrache ,&nbsp;Carlos T. Calafate","doi":"10.1016/j.icte.2024.10.007","DOIUrl":"10.1016/j.icte.2024.10.007","url":null,"abstract":"<div><div>Nowadays, the rise in traffic density derived from the population growth in urban areas, has resulted in more traffic congestion. Despite advancements in Intelligent Transportation Systems (ITS), this still remains a considerable challenge. In this study, we provide a comprehensive survey of monitoring and management of traffic systems (MMTS) techniques. At first, we split the whole scope of research into four phases: (i) traffic data gathering, (ii) traffic data transmission, (iii) traffic data analysis, and finally (iv) traffic data dissemination. Furthermore, we discuss the security aspects of traffic monitoring and management, and discuss emerging research challenges and opportunities.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1186-1198"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143102794","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
DCOOL: Dynamic computation offloading and resource allocation for LEO satellite-assisted edge computing in a ground-space integrated framework 地空一体化框架下LEO卫星辅助边缘计算的动态计算卸载与资源分配
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.014
Jeonghwan Kim, Jeongho Kwak
{"title":"DCOOL: Dynamic computation offloading and resource allocation for LEO satellite-assisted edge computing in a ground-space integrated framework","authors":"Jeonghwan Kim,&nbsp;Jeongho Kwak","doi":"10.1016/j.icte.2024.09.014","DOIUrl":"10.1016/j.icte.2024.09.014","url":null,"abstract":"<div><div>Despite the rapid growth of the Internet industry, the provision of full Internet service to remote regions is still challenging. As a solution, the combination of Low Earth Orbit (LEO) satellite communication and Mobile Edge Computing (MEC) is gaining attention. However, considering the high speed of LEO satellites in network environments remains a significant challenge. To this end, this paper introduces a dynamic computation offloading and resource allocation framework in the LEO satellite MEC architecture. Using Lyapunov optimization, we propose an efficient <em>DCOOL</em> algorithm to minimize average power consumption and propagation delay constrained by queue stability. Finally, comparative analysis and simulations demonstrate the superior performance of <em>DCOOL</em> while achieving lower power consumption and stable workload processing.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1212-1219"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094080","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
Explainable AI (XAI) in image segmentation in medicine, industry, and beyond: A survey 可解释的人工智能(XAI)在医学、工业和其他领域的图像分割:调查
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.008
Rokas Gipiškis , Chun-Wei Tsai , Olga Kurasova
{"title":"Explainable AI (XAI) in image segmentation in medicine, industry, and beyond: A survey","authors":"Rokas Gipiškis ,&nbsp;Chun-Wei Tsai ,&nbsp;Olga Kurasova","doi":"10.1016/j.icte.2024.09.008","DOIUrl":"10.1016/j.icte.2024.09.008","url":null,"abstract":"<div><div>Explainable AI (XAI) has found numerous applications in computer vision. While image classification-based explainability techniques have garnered significant attention, their counterparts in semantic segmentation have been relatively neglected. Given the prevalent use of image segmentation, ranging from medical to industrial deployments, these techniques warrant a systematic look. In this paper, we present the first comprehensive survey on XAI in semantic image segmentation. We analyze and categorize the literature based on application categories and domains, as well as the evaluation metrics and datasets used. We also propose a taxonomy for interpretable semantic segmentation, and discuss potential challenges and future research directions.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1331-1354"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094085","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
Prior-free 3D human pose estimation in a video using limb-vectors 先验自由的三维人体姿态估计在视频中使用肢体向量
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.015
Anam Memon , Qasim Arain , Nasrullah Pirzada , Akram Shaikh , Adel Sulaiman , Mana Saleh Al Reshan , Hani Alshahrani , Asadullah Shaikh
{"title":"Prior-free 3D human pose estimation in a video using limb-vectors","authors":"Anam Memon ,&nbsp;Qasim Arain ,&nbsp;Nasrullah Pirzada ,&nbsp;Akram Shaikh ,&nbsp;Adel Sulaiman ,&nbsp;Mana Saleh Al Reshan ,&nbsp;Hani Alshahrani ,&nbsp;Asadullah Shaikh","doi":"10.1016/j.icte.2024.09.015","DOIUrl":"10.1016/j.icte.2024.09.015","url":null,"abstract":"<div><div>Estimating accurate 3D human poses from a monocular video is fundamental to various computer vision tasks. Existing methods exploit 2D-to-3D pose lifting, multiview images, and depth sensors to model spatio-temporal dependencies. However, depth ambiguities, occlusions, and larger temporal receptive fields pose challenges to these approaches. To address this, we propose a novel prior-free DCNN-based 3D human pose estimation method for monocular image sequences using limb vectors. Our method comprises two subnetworks: a limb direction estimator and a limb length estimator. The limb direction estimator utilizes a fully convolutional network to model limb direction vectors across a temporal window. We show that network complexity can be significantly reduced by utilizing dilated convolutional operations and a relatively smaller receptive field while maintaining estimation accuracy. Moreover, the limb length estimator captures stable limb length estimations from a reliable frame set. Our model has shown superior performance compared to existing methods on the Human3.6M and MPI-INF-3DHP datasets.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1266-1272"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094143","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
A review on label cleaning techniques for learning with noisy labels 噪声标签学习中的标签清洗技术综述
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.007
Jongmin Shin , Jonghyeon Won , Hyun-Suk Lee , Jang-Won Lee
{"title":"A review on label cleaning techniques for learning with noisy labels","authors":"Jongmin Shin ,&nbsp;Jonghyeon Won ,&nbsp;Hyun-Suk Lee ,&nbsp;Jang-Won Lee","doi":"10.1016/j.icte.2024.09.007","DOIUrl":"10.1016/j.icte.2024.09.007","url":null,"abstract":"<div><div>Classification models categorize objects into given classes, guided by training samples with input features and labels. In practice, however, labels can be corrupted by human error or mistakes, known as label noise, which degrades classification accuracy. To address this issue, recently, various works propose the algorithms to clean datasets with label noise. We categorize the algorithms in granular ways, and review the algorithms, such as sample selection, label correction, and select-and-correct algorithms, based on the categorization. In addition, we provide future research directions for cleaning datasets, considering practical challenges, such as class imbalance, class incremental learning, and corrupted input features.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1315-1330"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094084","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
Dynamic content-cached satellite selection and routing for power minimization in LEO satellite networks 低轨道卫星网络中功率最小化的动态内容缓存卫星选择和路由
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.004
Jeongmin Seo , Dongho Ham , Jeongho Kwak
{"title":"Dynamic content-cached satellite selection and routing for power minimization in LEO satellite networks","authors":"Jeongmin Seo ,&nbsp;Dongho Ham ,&nbsp;Jeongho Kwak","doi":"10.1016/j.icte.2024.09.004","DOIUrl":"10.1016/j.icte.2024.09.004","url":null,"abstract":"<div><div>Efficient delivery of content to areas where terrestrial Internet service is unavailable can be possible via content caching at low earth orbit (LEO) satellites. Cached content in several LEO satellites must be delivered via inter-satellite links (ISLs) with appropriate routing techniques. Until now, content caching and routing techniques have been optimized independently. To tackle this issue, the optimization of selecting a content-cached satellite and routing is jointly performed, using the example of Earth observation data cached across multiple satellites. In this paper, we first formulate a dynamic power minimization problem constrained by the queue stability of all LEO satellites, where the control variables are the selection of content-cached satellite and routing in every satellite. To solve this long-term time-averaged problem, we leverage Lyapunov optimization framework to transform the original problem into a series of slot-by-slot problems. Moreover, we prove that the average power consumption and the average queue backlog by the proposed algorithm can be upper-bounded via theoretical analysis. Finally, through extensive simulations, we demonstrate that our proposed algorithm surpasses existing independent content-retrieval algorithms in terms of power consumption, queue backlog, and fairness.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1199-1205"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143102793","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
Prediction of permissioned blockchain performance for resource scaling configurations 预测资源伸缩配置的区块链性能
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.003
Seungwoo Jung , Yeonho Yoo , Gyeongsik Yang, Chuck Yoo
{"title":"Prediction of permissioned blockchain performance for resource scaling configurations","authors":"Seungwoo Jung ,&nbsp;Yeonho Yoo ,&nbsp;Gyeongsik Yang,&nbsp;Chuck Yoo","doi":"10.1016/j.icte.2024.09.003","DOIUrl":"10.1016/j.icte.2024.09.003","url":null,"abstract":"<div><div>Blockchain is increasingly offered as blockchain-as-a-service (BaaS) by cloud service providers. However, configuring BaaS appropriately for optimal performance and reliability resorts to try-and-error. A key challenge is that BaaS is often perceived as a “black-box,” leading to uncertainties in performance and resource provisioning. Previous studies attempted to address this challenge; however, the impacts of both vertical and horizontal scaling remain elusive. To this end, we present machine learning-based models to predict network reliability and throughput based on scaling configurations. In our evaluation, the models exhibit prediction errors of <span><math><mo>∼</mo></math></span>1.9%, which is highly accurate and can be applied in the real-world.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1253-1258"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094145","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
Attention Retinex Network(A4R-Net) for face detection under low-light environment 注意视网膜网络(A4R-Net)在弱光环境下的人脸检测
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-12-01 DOI: 10.1016/j.icte.2024.09.009
Minsu Kim , Yunho Jung , Seongjoo Lee
{"title":"Attention Retinex Network(A4R-Net) for face detection under low-light environment","authors":"Minsu Kim ,&nbsp;Yunho Jung ,&nbsp;Seongjoo Lee","doi":"10.1016/j.icte.2024.09.009","DOIUrl":"10.1016/j.icte.2024.09.009","url":null,"abstract":"<div><div>The degradation of recognition rates in low-light environments is a critical issue in terms of security when using object and face recognition technologies in various locations. Existing low-light enhancement models have shown limitations in terms of computational cost and performance. However, this paper overcomes these limitations. The experimental results demonstrate that our model achieves the same performance as existing models with 13 times lower computational cost and a face detection performance of 82.2%.</div><div>The structure of this paper is as follows: Introduction, which provides the background and explains the limitations of existing models. Proposed Method, which details the structure and working principles of A4R-Net. Experimental Results, which present the evaluation of low-light enhancement performance and the comparison of face detection using YOLOv4 <span><span>[1]</span></span>. Conclusion, which discusses the contributions of this research and future research directions.</div><div>The source code and dataset is <span><span>https://github.com/Obiru2698/obiru2698.github.io/</span><svg><path></path></svg></span></div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"10 6","pages":"Pages 1206-1211"},"PeriodicalIF":4.1,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143094081","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
Semi-PKD: Semi-supervised Pseudoknowledge Distillation for saliency prediction Semi-PKD:用于显著性预测的半监督伪知识蒸馏
IF 4.1 3区 计算机科学
ICT Express Pub Date : 2024-11-28 DOI: 10.1016/j.icte.2024.11.004
Chakkrit Termritthikun , Ayaz Umer , Suwichaya Suwanwimolkul , Ivan Lee
{"title":"Semi-PKD: Semi-supervised Pseudoknowledge Distillation for saliency prediction","authors":"Chakkrit Termritthikun ,&nbsp;Ayaz Umer ,&nbsp;Suwichaya Suwanwimolkul ,&nbsp;Ivan Lee","doi":"10.1016/j.icte.2024.11.004","DOIUrl":"10.1016/j.icte.2024.11.004","url":null,"abstract":"<div><div>In saliency prediction, Knowledge Distillation (KD) is leveraged to improve the predictive performance of compact Student Networks. However, the challenge is searching for an optimal teacher–student pair while handling the unavailability of large-scale annotations in the Pseudoknowledge Distillation (PKD). To overcome this challenge, a semi-supervised method is proposed; Semi-PKD. This method involves pseudo-label generation on unlabeled data by a Teacher Network trained using the exponential moving average KD (EMA-KD) method. The EMA-KD method utilizes only the Student Network by acquiring self-knowledge, solving the problem of optimal teacher–student pair selection. Semi-PKD outperforms other state-of-the-art saliency prediction models across various evaluation metrics. The code is available at <span><span>https://github.com/chakkritte/Semi-PKD</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 2","pages":"Pages 364-370"},"PeriodicalIF":4.1,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143704908","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
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学术文献互助群
群 号:604180095
Book学术官方微信