Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.05.012
Phu Tran Tin , Minh-Sang Van Nguyen , Tran Trung Duy , Van Huy Pham , Byung-Seo Kim
Non-orthogonal multiple access (NOMA) and reconfigurable intelligent surface (RIS) are critical technologies for future wireless communications that provide spectral efficiency while consuming little power. In this research, we explore the security of a downlink NOMA wireless relay network that incorporates the RIS and Fountain Codes (FCs) technique. To assess system performance and security, we compute closed-form formulas for outage probability (OP) and intercept probability (IP). Furthermore, deep neural networks (DNNs) are used in the system model to evaluate and optimize OP and IP. Monte Carlo simulations are used to validate the theoretical conclusions, yielding the following major insights: (i) The major goal of these simulations is to validate analytical expressions. (ii) This study greatly improves our understanding of RIS-NOMA systems, setting the groundwork for future research into actual implementations. (iii) The results further illustrate the better performance of RIS-NOMA by evaluating important system factors such as the number of reflecting elements, the user threshold rate and the maximum number of encoded packets.
{"title":"Combination of RIS and Fountain Codes in NOMA relay wireless networks for enhancing system performance and security","authors":"Phu Tran Tin , Minh-Sang Van Nguyen , Tran Trung Duy , Van Huy Pham , Byung-Seo Kim","doi":"10.1016/j.icte.2025.05.012","DOIUrl":"10.1016/j.icte.2025.05.012","url":null,"abstract":"<div><div>Non-orthogonal multiple access (NOMA) and reconfigurable intelligent surface (RIS) are critical technologies for future wireless communications that provide spectral efficiency while consuming little power. In this research, we explore the security of a downlink NOMA wireless relay network that incorporates the RIS and Fountain Codes (FCs) technique. To assess system performance and security, we compute closed-form formulas for outage probability (OP) and intercept probability (IP). Furthermore, deep neural networks (DNNs) are used in the system model to evaluate and optimize OP and IP. Monte Carlo simulations are used to validate the theoretical conclusions, yielding the following major insights: (i) The major goal of these simulations is to validate analytical expressions. (ii) This study greatly improves our understanding of RIS-NOMA systems, setting the groundwork for future research into actual implementations. (iii) The results further illustrate the better performance of RIS-NOMA by evaluating important system factors such as the number of reflecting elements, the user threshold rate and the maximum number of encoded packets.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 909-913"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289705","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.08.007
Kexun Li, Zhijun Gao
To address the high complexity, poor real-time performance, and the prevalence of false positives and false negatives in current algorithms for detecting small-target pollutants on UAV-based building facades, this study proposes SDS-YOLOv8. The spatial pyramid pooling structure in the backbone is enhanced to improve feature representation. DySample is incorporated into the neck to adaptively adjust sampling points based on the image feature distribution. Additionally, the SCAM module is introduced to improve the memory of important information, and the loss function is further optimized. Experimental results demonstrate that the accuracy of the proposed algorithm is significantly improved, exhibiting strong generalization capability.
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.07.007
MinGi Kim , DongHyun Shin , WooHyung Ko , YoungBeom Kim , Seog Chung Seo
In this paper, we present an optimized implementation of SMAUG-T, one of Round 2 Key Encapsulation Mechanism algorithms in Korean Post-quantum Cryptography Competition, on a widely used 16-bit MSP430 MCU. To achieve performance efficiency of polynomial multiplication, one of the most time-consuming operations in SMAUG-T, we find the optimal method by investigating several latest algorithms such as the Toom–Cook method and the Number-Theoretic Transform (NTT)-based methods (32-bit single moduli version and 16-bit multi-moduli version). Through the investigation, we found that 32-bit single moduli version is the best approach for polynomial multiplication in SMAUG-T on 16-bit MSP430 MCU. To enhance the performance of NTT-based polynomial multiplication, we proposed an improved 32-bit signed Montgomery multiplication method with a newly found Montgomery prime (0x250001) and the intrinsic hardware multiplier. We also apply the state-of-the-art techniques for NTT and inverse NTT (iNTT) such as the layer merging, CT butterfly by tuning them proper to the target device. As a result, our NTT implementation achieves around 35% of improved performance compared to the previous best result of 32-bit single moduli version implementation proposed for Dilithium on 16-bit MSP430 MCU. Finally, our SMAUG-T implementation with the proposed NTT implementation provides 43%–63%, 92%–99%, and 85%–95% of improved performance for key generation, encapsulation, and decapsulation compared to the reference implementation, respectively.
{"title":"Optimized implementation of SMAUG-T on resource-constrained 16-bit MSP430 MCU","authors":"MinGi Kim , DongHyun Shin , WooHyung Ko , YoungBeom Kim , Seog Chung Seo","doi":"10.1016/j.icte.2025.07.007","DOIUrl":"10.1016/j.icte.2025.07.007","url":null,"abstract":"<div><div>In this paper, we present an optimized implementation of SMAUG-T, one of Round 2 Key Encapsulation Mechanism algorithms in Korean Post-quantum Cryptography Competition, on a widely used 16-bit MSP430 MCU. To achieve performance efficiency of polynomial multiplication, one of the most time-consuming operations in SMAUG-T, we find the optimal method by investigating several latest algorithms such as the Toom–Cook method and the Number-Theoretic Transform (NTT)-based methods (32-bit single moduli version and 16-bit multi-moduli version). Through the investigation, we found that 32-bit single moduli version is the best approach for polynomial multiplication in SMAUG-T on 16-bit MSP430 MCU. To enhance the performance of NTT-based polynomial multiplication, we proposed an improved 32-bit signed Montgomery multiplication method with a newly found Montgomery prime (0x250001) and the intrinsic hardware multiplier. We also apply the state-of-the-art techniques for NTT and inverse NTT (iNTT) such as the layer merging, CT butterfly by tuning them proper to the target device. As a result, our NTT implementation achieves around 35% of improved performance compared to the previous best result of 32-bit single moduli version implementation proposed for Dilithium on 16-bit MSP430 MCU. Finally, our SMAUG-T implementation with the proposed NTT implementation provides 43%–63%, 92%–99%, and 85%–95% of improved performance for key generation, encapsulation, and decapsulation compared to the reference implementation, respectively.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 851-857"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289695","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.08.001
Md Ilias Bappi , Jannat Afrin Juthy , Kyungbaek Kim
Diabetic Retinopathy (DR) is a leading cause of vision impairment and blindness worldwide. Early diagnosis is crucial for preventing irreversible vision loss, but manual screening methods are time-consuming and often inconsistent. Deep learning (DL) techniques have shown promise in automating DR detection; however, many existing models still struggle to capture subtle lesions and distinguish fine-grained severity stages. In this survey, we comprehensively review recent DL-based approaches for DR classification, emphasizing attention mechanisms, feature fusion strategies, and stage-wise grading. To address current gaps, we propose a hybrid taxonomy that identifies effective combinations such as texture-based attention, CNN-Transformer fusion, and multi-modal integration. Additionally, we validate our previously published model, STMFNet, a spatial texture-aware attention network based on EfficientNet, across four benchmark datasets. On EyePACS and Messidor, STMFNet achieves up to 98.10% accuracy, outperforming several state-of-the-art (SOTA) models under similar settings. This study provides both a consolidated overview of DR detection advancements and a practical benchmark framework to guide future research in AI-assisted DR classification.
{"title":"Deep learning-based diabetic retinopathy recognition and grading: Challenges, gaps, and an improved approach — A survey","authors":"Md Ilias Bappi , Jannat Afrin Juthy , Kyungbaek Kim","doi":"10.1016/j.icte.2025.08.001","DOIUrl":"10.1016/j.icte.2025.08.001","url":null,"abstract":"<div><div>Diabetic Retinopathy (DR) is a leading cause of vision impairment and blindness worldwide. Early diagnosis is crucial for preventing irreversible vision loss, but manual screening methods are time-consuming and often inconsistent. Deep learning (DL) techniques have shown promise in automating DR detection; however, many existing models still struggle to capture subtle lesions and distinguish fine-grained severity stages. In this survey, we comprehensively review recent DL-based approaches for DR classification, emphasizing attention mechanisms, feature fusion strategies, and stage-wise grading. To address current gaps, we propose a hybrid taxonomy that identifies effective combinations such as texture-based attention, CNN-Transformer fusion, and multi-modal integration. Additionally, we validate our previously published model, STMFNet, a spatial texture-aware attention network based on EfficientNet, across four benchmark datasets. On EyePACS and Messidor, STMFNet achieves up to 98.10% accuracy, outperforming several state-of-the-art (SOTA) models under similar settings. This study provides both a consolidated overview of DR detection advancements and a practical benchmark framework to guide future research in AI-assisted DR classification.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 993-1013"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289691","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.07.001
DongCheon Kim , JunHyeok Choi , SeungYong Yoon , Seog Chung Seo
In March 2025, NIST selected HQC as a standardized PQC algorithm. Since HQC relies on binary polynomial operations, optimizations for prime-field schemes like Kyber are not directly applicable. Furthermore, optimizing HQC on Cortex-M4 involves constraints that complicate objective performance evaluation, which has hindered active research in this area. We address these issues and optimize dense-dense polynomial multiplication, HQC’s main computational bottleneck. Using the PQM4 benchmark framework, our implementation achieves speedups of 1139.53–1347.69% in key generation, 1139.53–1253.73% in encapsulation, and 1042.09–1198.78% in decapsulation over PQClean, and 38.78–45.81%, 38.18–45.58%, and 34.76–43.56% improvements over the NTL-based reference, depending on the security level.
{"title":"Optimized implementation of HQC on Cortex-M4","authors":"DongCheon Kim , JunHyeok Choi , SeungYong Yoon , Seog Chung Seo","doi":"10.1016/j.icte.2025.07.001","DOIUrl":"10.1016/j.icte.2025.07.001","url":null,"abstract":"<div><div>In March 2025, NIST selected HQC as a standardized PQC algorithm. Since HQC relies on binary polynomial operations, optimizations for prime-field schemes like Kyber are not directly applicable. Furthermore, optimizing HQC on Cortex-M4 involves constraints that complicate objective performance evaluation, which has hindered active research in this area. We address these issues and optimize dense-dense polynomial multiplication, HQC’s main computational bottleneck. Using the PQM4 benchmark framework, our implementation achieves speedups of 1139.53–1347.69% in key generation, 1139.53–1253.73% in encapsulation, and 1042.09–1198.78% in decapsulation over PQClean, and 38.78–45.81%, 38.18–45.58%, and 34.76–43.56% improvements over the NTL-based reference, depending on the security level.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 939-944"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289828","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.07.011
Mansoo Jung , Sunbeom Jeong , Youngwook Kim , Jungwoo Lee
Test-time adaptation (TTA) is a method of updating model parameters during inference using only unlabeled test data. Unlike supervised learning where labels are provided, data augmentation may not function effectively in TTA settings due to discrepancies between predictions using original and augmented samples. We address this limitation by introducing a novel approach that employs selected augmentations with distinct adaptation strategies customized for each transformation. Our approach is designed as a plug-in solution that can easily be integrated into existing methods. Extensive experiments demonstrate that our approach outperforms existing baselines in the ImageNet-C, VisDA2021, and ImageNet-Sketch dataset under various challenging scenarios.
{"title":"EDAS: Effective Data Augmentation Strategies for test-time adaptation","authors":"Mansoo Jung , Sunbeom Jeong , Youngwook Kim , Jungwoo Lee","doi":"10.1016/j.icte.2025.07.011","DOIUrl":"10.1016/j.icte.2025.07.011","url":null,"abstract":"<div><div>Test-time adaptation (TTA) is a method of updating model parameters during inference using only unlabeled test data. Unlike supervised learning where labels are provided, data augmentation may not function effectively in TTA settings due to discrepancies between predictions using original and augmented samples. We address this limitation by introducing a novel approach that employs selected augmentations with distinct adaptation strategies customized for each transformation. Our approach is designed as a plug-in solution that can easily be integrated into existing methods. Extensive experiments demonstrate that our approach outperforms existing baselines in the ImageNet-C, VisDA2021, and ImageNet-Sketch dataset under various challenging scenarios.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 888-893"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289837","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.05.007
Md. Alamgir Hossain
With the increasing sophistication of cyber threats, traditional Intrusion Detection Systems (IDS) often fail to adapt to evolving attack patterns, leading to high false positive rates and inadequate detection of zero-day attacks. This study proposes the Deep Q-Learning Intrusion Detection System (DQ-IDS), a novel reinforcement learning (RL)-based approach designed to dynamically learn network attack behaviors and continuously enhance detection performance. Unlike conventional machine learning (ML) and deep learning (DL)-based IDS models that depend on static, pre-trained classifiers, DQ-IDS employs Deep Q-Networks (DQN) with experience replay and adaptive ε-greedy exploration to autonomously classify benign and malicious network traffic. The integration of experience replay mitigates catastrophic forgetting, while adaptive exploration ensures an optimal trade-off between learning efficiency and threat detection. A reward-driven training mechanism reinforces correct classifications and penalizes errors, thereby reducing both false positive and false negative rates. Extensive empirical evaluations on real-world network datasets demonstrate that DQ-IDS achieves a detection accuracy of 97.18%, significantly outperforming conventional IDS solutions in both attack detection and computational efficiency. This work introduces a paradigm shift toward adaptive, self-learning cybersecurity systems capable of real-time, robust threat mitigation in dynamic network environments.
{"title":"Deep Q-learning intrusion detection system (DQ-IDS): A novel reinforcement learning approach for adaptive and self-learning cybersecurity","authors":"Md. Alamgir Hossain","doi":"10.1016/j.icte.2025.05.007","DOIUrl":"10.1016/j.icte.2025.05.007","url":null,"abstract":"<div><div>With the increasing sophistication of cyber threats, traditional Intrusion Detection Systems (IDS) often fail to adapt to evolving attack patterns, leading to high false positive rates and inadequate detection of zero-day attacks. This study proposes the Deep Q-Learning Intrusion Detection System (DQ-IDS), a novel reinforcement learning (RL)-based approach designed to dynamically learn network attack behaviors and continuously enhance detection performance. Unlike conventional machine learning (ML) and deep learning (DL)-based IDS models that depend on static, pre-trained classifiers, DQ-IDS employs Deep Q-Networks (DQN) with experience replay and adaptive ε-greedy exploration to autonomously classify benign and malicious network traffic. The integration of experience replay mitigates catastrophic forgetting, while adaptive exploration ensures an optimal trade-off between learning efficiency and threat detection. A reward-driven training mechanism reinforces correct classifications and penalizes errors, thereby reducing both false positive and false negative rates. Extensive empirical evaluations on real-world network datasets demonstrate that DQ-IDS achieves a detection accuracy of 97.18%, significantly outperforming conventional IDS solutions in both attack detection and computational efficiency. This work introduces a paradigm shift toward adaptive, self-learning cybersecurity systems capable of real-time, robust threat mitigation in dynamic network environments.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 875-880"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289699","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.06.012
Yangyang Zhao , Jiannan Su , Wenjun Li , Zhiyong Yu , Xiaowei Dai
Remote sensing image fusion plays a crucial role in enhancing image information. However, the limitations of existing fusion technologies in terms of computational resources and storage capacity make real-time processing difficult. Therefore, a lightweight fusion method based on knowledge distillation is proposed for vehicle remote sensing image fusion. The knowledge distillation technology is used to transfer the complex teacher model knowledge to the lightweight student model, which realizes the significant reduction of model complexity while maintaining high fusion accuracy. Experimental results show that the proposed method performs well on DroneVehicle dataset and the model weight is only 0.641M.
2025 The Korean Institute of Communications and Information Sciences. Publishing Services by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
{"title":"A lightweight remote sensing image fusion method for vehicle perception","authors":"Yangyang Zhao , Jiannan Su , Wenjun Li , Zhiyong Yu , Xiaowei Dai","doi":"10.1016/j.icte.2025.06.012","DOIUrl":"10.1016/j.icte.2025.06.012","url":null,"abstract":"<div><div>Remote sensing image fusion plays a crucial role in enhancing image information. However, the limitations of existing fusion technologies in terms of computational resources and storage capacity make real-time processing difficult. Therefore, a lightweight fusion method based on knowledge distillation is proposed for vehicle remote sensing image fusion. The knowledge distillation technology is used to transfer the complex teacher model knowledge to the lightweight student model, which realizes the significant reduction of model complexity while maintaining high fusion accuracy. Experimental results show that the proposed method performs well on DroneVehicle dataset and the model weight is only 0.641M.</div><div>2025 The Korean Institute of Communications and Information Sciences. Publishing Services by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (<span><span>http://creativecommons.org/licenses/by-nc-nd/4.0/</span><svg><path></path></svg></span>).</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 933-938"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289827","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.08.003
Jamshidjon Ganiev , Deok-Woong Kim , Seung-Hwan Bae
NGBoost has shown promising results in probabilistic and point estimation tasks. However, it is vague still whether this method can be scalable to neural architecture system since its base learner is based on decision trees. To resolve this, we design a Neural-NGBoost framework by replacing the base learner with lightweight neural networks and introducing joint gradient estimation for boosting procedure. Based on natural gradient boosting, we iteratively update the neural based learner by inferring natural gradient and update the parameter score with its probabilistic distribution. Experimental results show Neural-NGBoost achieves superior performance across various datasets compared to other boosting methods.
{"title":"Neural-NGBoost: Natural gradient boosting with neural network base learners","authors":"Jamshidjon Ganiev , Deok-Woong Kim , Seung-Hwan Bae","doi":"10.1016/j.icte.2025.08.003","DOIUrl":"10.1016/j.icte.2025.08.003","url":null,"abstract":"<div><div>NGBoost has shown promising results in probabilistic and point estimation tasks. However, it is vague still whether this method can be scalable to neural architecture system since its base learner is based on decision trees. To resolve this, we design a Neural-NGBoost framework by replacing the base learner with lightweight neural networks and introducing joint gradient estimation for boosting procedure. Based on natural gradient boosting, we iteratively update the neural based learner by inferring natural gradient and update the parameter score with its probabilistic distribution. Experimental results show Neural-NGBoost achieves superior performance across various datasets compared to other boosting methods.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 974-980"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289834","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}
Pub Date : 2025-10-01DOI: 10.1016/j.icte.2025.05.011
Seung-Yeol Lee , Hyuntai Kim
This research presents a deep neural network (DNN) approach for predicting the refractive index profile in graded-index multimode fibers (GRIN MMFs). The model was trained using simulated data and achieved an average loss less than 1% across both selected (or structured) and random test sets. This artificial intelligence-driven approach has potential applications in custom fiber design, nonlinear optics, and rapid fiber performance characterization. Future developments may include the use of real-world data and the extension of the model to predict refractive index profiles, further enhancing its versatility.
{"title":"Artificial intelligence based prediction of refractive index profile of graded refractive index optical fiber","authors":"Seung-Yeol Lee , Hyuntai Kim","doi":"10.1016/j.icte.2025.05.011","DOIUrl":"10.1016/j.icte.2025.05.011","url":null,"abstract":"<div><div>This research presents a deep neural network (DNN) approach for predicting the refractive index profile in graded-index multimode fibers (GRIN MMFs). The model was trained using simulated data and achieved an average loss less than 1% across both selected (or structured) and random test sets. This artificial intelligence-driven approach has potential applications in custom fiber design, nonlinear optics, and rapid fiber performance characterization. Future developments may include the use of real-world data and the extension of the model to predict refractive index profiles, further enhancing its versatility.</div></div>","PeriodicalId":48526,"journal":{"name":"ICT Express","volume":"11 5","pages":"Pages 870-874"},"PeriodicalIF":4.2,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145289698","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}