首页 > 最新文献

ETRI Journal最新文献

英文 中文
Performance analysis of wireless-powered cell-free massive multiple-input multiple-output system with spatial correlation in Internet of Things network 物联网网络中具有空间相关性的无线供电无蜂窝大规模多输入多输出系统的性能分析
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2025-01-05 DOI: 10.4218/etrij.2023-0216
Haiyan Wang, Xinmin Li, Yuan Fang, Xiaoqiang Zhang

The massive multiple-input multiple-output (mMIMO) approach is promising for the Internet of Things (IoT) owing to its massive connectivity and high data rate. We introduce a wireless-powered cell-free mMIMO system, in which ground IoT devices transmit pilot and uplink information by harvesting downlink power from multiantenna access points. Considering the spatial correlation, we derive closed-form expressions for the average harvested power with a nonlinear energy-harvesting model per IoT device and achievable data rate according to the random matrix theory. The analytical expressions show that spatial correlation has a negative effect on the data rate owing to the increasing interference power. In contrast, the average received power improves with increasing spatial correlation. Simulation results demonstrate that the derived analytical expressions are consistent with results from the Monte Carlo method.

大规模多输入多输出(mMIMO)方法因其大规模连接性和高数据速率而在物联网(IoT)领域大有可为。我们介绍了一种无线供电的无小区 mMIMO 系统,其中地面物联网设备通过从多天线接入点采集下行链路功率来传输先导和上行链路信息。考虑到空间相关性,我们根据随机矩阵理论,利用非线性能量采集模型推导出了每个物联网设备的平均采集功率和可实现数据速率的闭式表达式。分析表达式表明,由于干扰功率不断增加,空间相关性对数据传输率有负面影响。相反,平均接收功率会随着空间相关性的增加而提高。仿真结果表明,推导出的分析表达式与蒙特卡罗方法得出的结果一致。
{"title":"Performance analysis of wireless-powered cell-free massive multiple-input multiple-output system with spatial correlation in Internet of Things network","authors":"Haiyan Wang,&nbsp;Xinmin Li,&nbsp;Yuan Fang,&nbsp;Xiaoqiang Zhang","doi":"10.4218/etrij.2023-0216","DOIUrl":"https://doi.org/10.4218/etrij.2023-0216","url":null,"abstract":"<p>The massive multiple-input multiple-output (mMIMO) approach is promising for the Internet of Things (IoT) owing to its massive connectivity and high data rate. We introduce a wireless-powered cell-free mMIMO system, in which ground IoT devices transmit pilot and uplink information by harvesting downlink power from multiantenna access points. Considering the spatial correlation, we derive closed-form expressions for the average harvested power with a nonlinear energy-harvesting model per IoT device and achievable data rate according to the random matrix theory. The analytical expressions show that spatial correlation has a negative effect on the data rate owing to the increasing interference power. In contrast, the average received power improves with increasing spatial correlation. Simulation results demonstrate that the derived analytical expressions are consistent with results from the Monte Carlo method.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 2","pages":"208-215"},"PeriodicalIF":1.3,"publicationDate":"2025-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0216","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143835779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Detection and segmentation framework for defect detection on multi-layer ceramic capacitors 多层陶瓷电容器缺陷检测与分割框架
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-13 DOI: 10.4218/etrij.2024-0066
Hyun-Jae Kim, Sung-Bin Son, Heung-Seon Oh

Detecting defective multi-layer ceramic capacitors (MLCCs) during the inspection stage is a crucial production task to effectively manage production yield and maintain quality. However, this task presents two challenges: the necessity of pixel-level segmentation in high-resolution images and unexplored defect patterns. To address these challenges, this paper introduces an MLCC defect-detection framework based on deep learning with an MLCC dataset we constructed and a comprehensive analysis of MLCC images. Our framework employs an object-detection model to identify dielectric regions in input MLCC images, followed by a semantic segmentation model to create dielectric masks for calculating the margin ratio. This approach follows the traditional inspection process but can be performed without specialized personnel. Furthermore, we generated pseudo-defect images using generative adversarial networks to obtain sufficient training data. Experiments demonstrate the effectiveness of our framework, which achieved a defect-detection accuracy of 93.1%, as revealed by an in-depth error analysis.

在检测阶段检测出多层陶瓷电容器的缺陷是有效管理产品良率和保持产品质量的一项重要生产任务。然而,这项任务提出了两个挑战:高分辨率图像中像素级分割的必要性和未探索的缺陷模式。为了解决这些挑战,本文介绍了基于深度学习的MLCC缺陷检测框架,该框架使用了我们构建的MLCC数据集和对MLCC图像的综合分析。我们的框架采用目标检测模型来识别输入MLCC图像中的介电区域,然后使用语义分割模型来创建介电掩模以计算边缘比。这种方法遵循传统的检测过程,但可以在没有专业人员的情况下执行。此外,我们使用生成式对抗网络生成伪缺陷图像以获得足够的训练数据。实验证明了该框架的有效性,深度误差分析表明,该框架的缺陷检测准确率达到93.1%。
{"title":"Detection and segmentation framework for defect detection on multi-layer ceramic capacitors","authors":"Hyun-Jae Kim,&nbsp;Sung-Bin Son,&nbsp;Heung-Seon Oh","doi":"10.4218/etrij.2024-0066","DOIUrl":"https://doi.org/10.4218/etrij.2024-0066","url":null,"abstract":"<p>Detecting defective multi-layer ceramic capacitors (MLCCs) during the inspection stage is a crucial production task to effectively manage production yield and maintain quality. However, this task presents two challenges: the necessity of pixel-level segmentation in high-resolution images and unexplored defect patterns. To address these challenges, this paper introduces an MLCC defect-detection framework based on deep learning with an MLCC dataset we constructed and a comprehensive analysis of MLCC images. Our framework employs an object-detection model to identify dielectric regions in input MLCC images, followed by a semantic segmentation model to create dielectric masks for calculating the margin ratio. This approach follows the traditional inspection process but can be performed without specialized personnel. Furthermore, we generated pseudo-defect images using generative adversarial networks to obtain sufficient training data. Experiments demonstrate the effectiveness of our framework, which achieved a defect-detection accuracy of 93.1%, as revealed by an in-depth error analysis.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 4","pages":"685-694"},"PeriodicalIF":1.6,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144843538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
UTexGen: High-quality texture reconstruction for large-scale scenes using multi-view images UTexGen:使用多视图图像进行大规模场景的高质量纹理重建
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-11 DOI: 10.4218/etrij.2024-0320
Hye-Sun Kim, Yun-Ji Ban, Chang-Joon Park

When reconstructing extensive terrain, it is essential to partition it into smaller tiles for individual processing. This paper introduces a texture reconstruction approach that ensures seamless and consistent final outputs, even when processed tile by tile. Among the stages of multi-view image-based reconstruction, texture reconstruction presents significant challenges during tile-based processing. Relying solely on local tile-level data complicates achieving precise texture mapping. The absence of occlusion details between tiles can lead to selecting incorrect images as the best visible ones or adjusting tile texture colors differently, resulting in noticeable grid-like texture seams in the final result. To mitigate these issues, we leverage global depth maps to accurately detect occlusions between neighboring tiles. Furthermore, by utilizing a shared texture candidate list, we establish uniform targets for texture color correction across tiles. Experimental findings demonstrate that leveraging global information for texture reconstruction on a tile-by-tile basis enables the creation of smooth and realistic texture maps, as validated through comparisons with existing methodologies.

当重建广泛的地形时,必须将其划分为更小的瓦片进行单独处理。本文介绍了一种纹理重建方法,即使逐块处理,也能确保最终输出的无缝和一致。在多视图图像重建的各个阶段中,纹理重建是基于贴图处理的重要挑战。仅仅依赖局部瓷砖级别的数据会使实现精确的纹理映射变得复杂。贴图之间缺乏遮挡细节会导致选择不正确的图像作为最佳可见图像,或者不同地调整贴图纹理颜色,从而导致最终结果中出现明显的网格状纹理接缝。为了缓解这些问题,我们利用全局深度图来准确检测相邻瓷砖之间的遮挡。此外,通过使用共享纹理候选列表,我们建立了统一的纹理颜色校正目标。实验结果表明,通过与现有方法的比较,利用全局信息逐块地进行纹理重建可以创建光滑和逼真的纹理映射。
{"title":"UTexGen: High-quality texture reconstruction for large-scale scenes using multi-view images","authors":"Hye-Sun Kim,&nbsp;Yun-Ji Ban,&nbsp;Chang-Joon Park","doi":"10.4218/etrij.2024-0320","DOIUrl":"https://doi.org/10.4218/etrij.2024-0320","url":null,"abstract":"<p>When reconstructing extensive terrain, it is essential to partition it into smaller tiles for individual processing. This paper introduces a texture reconstruction approach that ensures seamless and consistent final outputs, even when processed tile by tile. Among the stages of multi-view image-based reconstruction, texture reconstruction presents significant challenges during tile-based processing. Relying solely on local tile-level data complicates achieving precise texture mapping. The absence of occlusion details between tiles can lead to selecting incorrect images as the best visible ones or adjusting tile texture colors differently, resulting in noticeable grid-like texture seams in the final result. To mitigate these issues, we leverage global depth maps to accurately detect occlusions between neighboring tiles. Furthermore, by utilizing a shared texture candidate list, we establish uniform targets for texture color correction across tiles. Experimental findings demonstrate that leveraging global information for texture reconstruction on a tile-by-tile basis enables the creation of smooth and realistic texture maps, as validated through comparisons with existing methodologies.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 5","pages":"983-995"},"PeriodicalIF":1.6,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0320","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145335539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Network function parallelism configuration with segment routing over IPv6 based on deep reinforcement learning 基于深度强化学习的 IPv6 分段路由网络功能并行性配置
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-11 DOI: 10.4218/etrij.2023-0511
Seokwon Jang, Namseok Ko, Yeunwoong Kyung, Haneul Ko, Jaewook Lee, Sangheon Pack

Network function parallelism (NFP) has gained attention for processing packets in parallel through service functions arranged in the required service function chain. While parallel processing efficiently reduces the service function chaining (SFC) completion time, it incurs a higher network overhead (e.g., network congestion) to replicate various packets for processing. To reduce the SFC completion time while maintaining a low network overhead, we propose a deep-reinforcement-learning-based NFP algorithm (DeepNFP) that provides an SFC processing policy to determine the sequential or parallel processing of every service function. In DeepNFP, deep reinforcement learning captures the network dynamics and service function conditions and iteratively finds the SFC processing policy in the network environment. Furthermore, an SFC data plane protocol based on segment routing over IPv6 configures and operates the policy in the SFC data network. Evaluation results show that DeepNFP can achieve 46% of the SFC completion time and 66% of the network overhead compared with conventional SFC and NFP, respectively.

网络功能并行化(NFP)通过在所需的服务功能链中排列的服务功能并行处理数据包,因此受到了关注。虽然并行处理能有效缩短服务功能链(SFC)的完成时间,但复制各种数据包进行处理会产生较高的网络开销(如网络拥塞)。为了缩短 SFC 完成时间,同时保持较低的网络开销,我们提出了一种基于深度强化学习的 NFP 算法(DeepNFP),该算法提供一种 SFC 处理策略,以确定每个服务功能的顺序或并行处理。在 DeepNFP 中,深度强化学习捕捉网络动态和服务功能条件,并在网络环境中迭代地找到 SFC 处理策略。此外,基于 IPv6 网段路由的 SFC 数据平面协议可在 SFC 数据网络中配置和运行该策略。评估结果表明,与传统的 SFC 和 NFP 相比,DeepNFP 可分别缩短 46% 的 SFC 完成时间和减少 66% 的网络开销。
{"title":"Network function parallelism configuration with segment routing over IPv6 based on deep reinforcement learning","authors":"Seokwon Jang,&nbsp;Namseok Ko,&nbsp;Yeunwoong Kyung,&nbsp;Haneul Ko,&nbsp;Jaewook Lee,&nbsp;Sangheon Pack","doi":"10.4218/etrij.2023-0511","DOIUrl":"https://doi.org/10.4218/etrij.2023-0511","url":null,"abstract":"<p>Network function parallelism (NFP) has gained attention for processing packets in parallel through service functions arranged in the required service function chain. While parallel processing efficiently reduces the service function chaining (SFC) completion time, it incurs a higher network overhead (e.g., network congestion) to replicate various packets for processing. To reduce the SFC completion time while maintaining a low network overhead, we propose a deep-reinforcement-learning-based NFP algorithm (DeepNFP) that provides an SFC processing policy to determine the sequential or parallel processing of every service function. In DeepNFP, deep reinforcement learning captures the network dynamics and service function conditions and iteratively finds the SFC processing policy in the network environment. Furthermore, an SFC data plane protocol based on segment routing over IPv6 configures and operates the policy in the SFC data network. Evaluation results show that DeepNFP can achieve 46% of the SFC completion time and 66% of the network overhead compared with conventional SFC and NFP, respectively.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 2","pages":"278-289"},"PeriodicalIF":1.3,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0511","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143835974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
UP-Net: A multi-head architecture for reading and efficiently segmenting distorted QR codes UP-Net:用于读取和有效分割扭曲QR码的多头架构
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-11 DOI: 10.4218/etrij.2023-0540
Ebrahim Parcham, Mahdi Ilbeygi, Vahid Hajipour, Ali Gharaei, Mahdi Mokhtari, Mostafa Foroutan

Semantic segmentation is essential in machine vision but susceptible to noise and distortions that often appear in real-world images. We propose UPlus-Net (UP-Net), a deep-learning architecture based on the U-Net encoder–decoder architecture. We address the limitations of U-Net by introducing a multi-head architecture in UP-Net to properly handle segmentation challenges. In addition, we evaluate UP-Net for decoding distorted quick-response (QR) codes heavily polluted by noise. Experimental results confirm that UP-Net outperforms existing QR reader mobile applications, highlighting the UP-Net ability to handle challenging images. Unlike existing methods focused solely on QR code reading or segmentation, UP-Net offers a combined solution, efficiently and accurately reading distorted QR codes while performing high-quality semantic segmentation. These unique characteristics render UP-Net promising for applications demanding robust image analysis in challenging environments.

语义分割在机器视觉中是必不可少的,但容易受到现实世界图像中经常出现的噪声和扭曲的影响。我们提出了upus - net (UP-Net),一种基于U-Net编码器-解码器架构的深度学习架构。我们通过在UP-Net中引入多头架构来解决U-Net的局限性,以正确处理分段挑战。此外,我们还评估了UP-Net对严重受噪声污染的扭曲快速响应(QR)码的解码效果。实验结果证实,UP-Net优于现有的QR阅读器移动应用程序,突出了UP-Net处理具有挑战性图像的能力。不像现有的方法只专注于QR码读取或分割,UP-Net提供了一个组合的解决方案,有效和准确地读取扭曲的QR码,同时执行高质量的语义分割。这些独特的特性使UP-Net在具有挑战性的环境中要求强大的图像分析的应用中具有前景。
{"title":"UP-Net: A multi-head architecture for reading and efficiently segmenting distorted QR codes","authors":"Ebrahim Parcham,&nbsp;Mahdi Ilbeygi,&nbsp;Vahid Hajipour,&nbsp;Ali Gharaei,&nbsp;Mahdi Mokhtari,&nbsp;Mostafa Foroutan","doi":"10.4218/etrij.2023-0540","DOIUrl":"https://doi.org/10.4218/etrij.2023-0540","url":null,"abstract":"<p>Semantic segmentation is essential in machine vision but susceptible to noise and distortions that often appear in real-world images. We propose UPlus-Net (UP-Net), a deep-learning architecture based on the U-Net encoder–decoder architecture. We address the limitations of U-Net by introducing a multi-head architecture in UP-Net to properly handle segmentation challenges. In addition, we evaluate UP-Net for decoding distorted quick-response (QR) codes heavily polluted by noise. Experimental results confirm that UP-Net outperforms existing QR reader mobile applications, highlighting the UP-Net ability to handle challenging images. Unlike existing methods focused solely on QR code reading or segmentation, UP-Net offers a combined solution, efficiently and accurately reading distorted QR codes while performing high-quality semantic segmentation. These unique characteristics render UP-Net promising for applications demanding robust image analysis in challenging environments.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 3","pages":"527-544"},"PeriodicalIF":1.3,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0540","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144503044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance evaluations of AI-based obfuscated and encrypted malicious script detection with feature optimization 基于特征优化的人工智能模糊加密恶意脚本检测性能评估
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-08 DOI: 10.4218/etrij.2024-0255
Kookjin Kim, Jisoo Shin, Jong-Geun Park, Jung-Tae Kim

In the digital security environment, the obfuscation and encryption of malicious scripts are primary attack methods used to evade detection. These scripts—easily spread through websites, emails, and file downloads—can be automatically executed on users' systems, posing serious security threats. To overcome the limitations of signature-based detection methods, this study proposed a methodology for real-time detection of obfuscated and encrypted malicious scripts using ML/DL models with feature optimization techniques. The obfuscated script datasets were analyzed to identify the unique characteristics, classified into 16 feature sets, to evaluate the optimal features for the best detection accuracy. Although the detection accuracy of these datasets was < 20%, when tested with commercial antivirus services, the experimental results using ML and DL models demonstrated that the proposed light gradient boosting model (LGBM) could achieve the best detection accuracy and processing speed. The LGBM outperformed other artificial intelligence models by achieving 97% accuracy and the minimum processing time in the decoded, obfuscated, and encrypted dataset cases.

在数字安全环境中,对恶意脚本进行混淆和加密是逃避检测的主要攻击手段。这些脚本很容易通过网站、电子邮件和文件下载传播,可以在用户系统上自动执行,造成严重的安全威胁。为了克服基于签名的检测方法的局限性,本研究提出了一种使用ML/DL模型和特征优化技术实时检测混淆和加密恶意脚本的方法。对混淆后的脚本数据集进行分析,识别出其独特的特征,并将其分为16个特征集,以评估最优特征以获得最佳的检测精度。虽然这些数据集的检测精度为<;20%的实验结果表明,本文提出的光梯度增强模型(LGBM)可以达到最佳的检测精度和处理速度。LGBM在解码、混淆和加密数据集的情况下,准确率达到97%,处理时间最短,优于其他人工智能模型。
{"title":"Performance evaluations of AI-based obfuscated and encrypted malicious script detection with feature optimization","authors":"Kookjin Kim,&nbsp;Jisoo Shin,&nbsp;Jong-Geun Park,&nbsp;Jung-Tae Kim","doi":"10.4218/etrij.2024-0255","DOIUrl":"https://doi.org/10.4218/etrij.2024-0255","url":null,"abstract":"<p>In the digital security environment, the obfuscation and encryption of malicious scripts are primary attack methods used to evade detection. These scripts—easily spread through websites, emails, and file downloads—can be automatically executed on users' systems, posing serious security threats. To overcome the limitations of signature-based detection methods, this study proposed a methodology for real-time detection of obfuscated and encrypted malicious scripts using ML/DL models with feature optimization techniques. The obfuscated script datasets were analyzed to identify the unique characteristics, classified into 16 feature sets, to evaluate the optimal features for the best detection accuracy. Although the detection accuracy of these datasets was &lt; 20%, when tested with commercial antivirus services, the experimental results using ML and DL models demonstrated that the proposed light gradient boosting model (LGBM) could achieve the best detection accuracy and processing speed. The LGBM outperformed other artificial intelligence models by achieving 97% accuracy and the minimum processing time in the decoded, obfuscated, and encrypted dataset cases.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 4","pages":"753-770"},"PeriodicalIF":1.6,"publicationDate":"2024-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0255","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144843346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to “NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators” 更正“NEST-C:一个用于具有人工智能加速器的异构计算系统的深度学习编译器框架”
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-12-08 DOI: 10.4218/etr2.12748
Jeman Park, Misun Yu, Jinse Kwon, Junmo Park, Jemin Lee, Yongin Kwon

NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators

https://doi.org/10.4218/etrij.2024-0139

ETRI Journal, Volume 46, Issue 5, October 2024, pp. 851–864.

In the article entitled “NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators,” the authors would like to correct the funding information of their article. It should be written as follows:

Funding information This study is supported by a grant from the Institute of Information & Communications Technology Planning & Evaluation (IITP), funded by the Korean government (MSIT) (No. RS-2023-00277060, Development of OpenEdge AI SoC hardware and software platform and No. 2018-0-00769, Neuromorphic Computing Software Platform for Artificial Intelligence Systems).

The authors would like to apologize for the inconvenience caused.

NEST-C:一个基于人工智能加速器的异构计算系统的深度学习编译器框架[//doi.org/10.4218/etrij.2024-0139ETRI Journal, Volume 46, Issue 5, October 2024, pp. 851-864]在题为“NEST-C:一个带有人工智能加速器的异构计算系统的深度学习编译器框架”的文章中,作者想纠正他们文章的资助信息。资助信息本研究由信息研究所(Institute of information &;通信技术规划&;评估(IITP),由韩国政府(MSIT)资助(No. 1)。RS-2023-00277060, OpenEdge AI SoC硬件和软件平台开发和No. 2018-0-00769,人工智能系统神经形态计算软件平台)。作者对造成的不便表示歉意。
{"title":"Correction to “NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators”","authors":"Jeman Park,&nbsp;Misun Yu,&nbsp;Jinse Kwon,&nbsp;Junmo Park,&nbsp;Jemin Lee,&nbsp;Yongin Kwon","doi":"10.4218/etr2.12748","DOIUrl":"https://doi.org/10.4218/etr2.12748","url":null,"abstract":"<p>NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators</p><p>https://doi.org/10.4218/etrij.2024-0139</p><p>ETRI Journal, Volume 46, Issue 5, October 2024, pp. 851–864.</p><p>In the article entitled “NEST-C: A deep learning compiler framework for heterogeneous computing systems with artificial intelligence accelerators,” the authors would like to correct the funding information of their article. It should be written as follows:</p><p><b>Funding information</b> This study is supported by a grant from the Institute of Information &amp; Communications Technology Planning &amp; Evaluation (IITP), funded by the Korean government (MSIT) (No. RS-2023-00277060, Development of OpenEdge AI SoC hardware and software platform and No. 2018-0-00769, Neuromorphic Computing Software Platform for Artificial Intelligence Systems).</p><p>The authors would like to apologize for the inconvenience caused.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 6","pages":"1126"},"PeriodicalIF":1.3,"publicationDate":"2024-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etr2.12748","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142860615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to “Low-complexity patch projection method for efficient and lightweight point-cloud compression” 对 "用于高效、轻量级点云压缩的低复杂度补丁投影法 "的更正
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-11-26 DOI: 10.4218/etr2.12746

Sungryeul Rhyu | Junsik Kim | Gwang Hoon Park | Kyuheon Kim

Low-complexity patch projection method for efficient and lightweight point-cloud compression

https://doi.org/10.4218/etrij.2023-0242

ETRI Journal, Volume 46, Issue 4, August 2024, pp. 683–696.

In the article entitled “Low-complexity patch projection method for efficient and lightweight point-cloud compression”, the authors would like to correct the funding information of their article. It should be written as follows:

Funding information

This study was supported by the Information Technology Research Center of the Ministry of Science and ICT, Korea (grant number: IITP-2024-2021-0-02046) and the Institute of Information & Communications Technology Planning & Evaluation, Korea (grant number: RS-2023-00227431, Development of 3D space digital media standard technology).

The authors would like to apologize for the inconvenience caused.

刘成柳|金俊植|朴光勋|金奎宪低复杂度斑块投影方法的高效轻量级点云压缩[https://doi.org/10.4218/etrij.2023-0242ETRI Journal, vol . 46, Issue 4, August 2024, pp. 683-696 .]在题为“高效轻量级点云压缩的低复杂度补丁投影方法”的文章中,作者希望更正其文章的资助信息。本研究由韩国科学和信息通信技术部信息技术研究中心(批准号:IITP-2024-2021-0-02046)和韩国信息技术研究所(iitp &;通信技术规划&;韩国评价项目(批准号:RS-2023-00227431, 3D空间数字媒体标准技术开发)。作者对造成的不便表示歉意。
{"title":"Correction to “Low-complexity patch projection method for efficient and lightweight point-cloud compression”","authors":"","doi":"10.4218/etr2.12746","DOIUrl":"https://doi.org/10.4218/etr2.12746","url":null,"abstract":"<p><b>Sungryeul Rhyu</b> | <b>Junsik Kim | Gwang Hoon Park | Kyuheon Kim</b></p><p>Low-complexity patch projection method for efficient and lightweight point-cloud compression</p><p>https://doi.org/10.4218/etrij.2023-0242</p><p><i>ETRI Journal</i>, Volume 46, Issue 4, August 2024, pp. 683–696.</p><p>In the article entitled “Low-complexity patch projection method for efficient and lightweight point-cloud compression”, the authors would like to correct the funding information of their article. It should be written as follows:</p><p><b>Funding information</b></p><p>This study was supported by the Information Technology Research Center of the Ministry of Science and ICT, Korea (grant number: IITP-2024-2021-0-02046) and the Institute of Information &amp; Communications Technology Planning &amp; Evaluation, Korea (grant number: RS-2023-00227431, Development of 3D space digital media standard technology).</p><p>The authors would like to apologize for the inconvenience caused.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 6","pages":"1125"},"PeriodicalIF":1.3,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etr2.12746","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A bi-stream transformer for single-image dehazing 用于单图像除雾的双流变压器
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-11-22 DOI: 10.4218/etrij.2024-0037
Mingrui Wang, Jinqiang Yan, Chaoying Wan, Guowei Yang, Teng Yu

Deep-learning methods, such as encoder–decoder networks, have achieved impressive results in image dehazing. However, these methods often rely only on synthesized data for training that limits their generalizability to hazy, real-world images. To leverage prior knowledge of haze properties, we propose a bi-encoder structure that integrates a prior-based encoder into a traditional encoder–decoder network. The features from both encoders were fused using a feature enhancement module. We adopted transformer blocks instead of convolutions to model local feature associations. Experimental results demonstrate that our method surpasses state-of-the-art methods for synthesized and actual hazy scenes. Therefore, we believe that our method will be a useful supplement to the collection of current artificial intelligence models and will benefit engineering applications in computer vision.

深度学习方法,如编码器-解码器网络,在图像去雾方面取得了令人印象深刻的成果。然而,这些方法通常只依赖于合成数据进行训练,这限制了它们在模糊的真实世界图像中的泛化性。为了利用雾霾特性的先验知识,我们提出了一种双编码器结构,将基于先验的编码器集成到传统的编码器-解码器网络中。两个编码器的特征使用特征增强模块进行融合。我们采用转换块代替卷积来建模局部特征关联。实验结果表明,该方法在合成和实际朦胧场景中都优于目前最先进的方法。因此,我们相信我们的方法将是对当前人工智能模型集合的有益补充,并将有利于计算机视觉的工程应用。
{"title":"A bi-stream transformer for single-image dehazing","authors":"Mingrui Wang,&nbsp;Jinqiang Yan,&nbsp;Chaoying Wan,&nbsp;Guowei Yang,&nbsp;Teng Yu","doi":"10.4218/etrij.2024-0037","DOIUrl":"https://doi.org/10.4218/etrij.2024-0037","url":null,"abstract":"<p>Deep-learning methods, such as encoder–decoder networks, have achieved impressive results in image dehazing. However, these methods often rely only on synthesized data for training that limits their generalizability to hazy, real-world images. To leverage prior knowledge of haze properties, we propose a bi-encoder structure that integrates a prior-based encoder into a traditional encoder–decoder network. The features from both encoders were fused using a feature enhancement module. We adopted transformer blocks instead of convolutions to model local feature associations. Experimental results demonstrate that our method surpasses state-of-the-art methods for synthesized and actual hazy scenes. Therefore, we believe that our method will be a useful supplement to the collection of current artificial intelligence models and will benefit engineering applications in computer vision.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 3","pages":"545-558"},"PeriodicalIF":1.3,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144503091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
High-speed end-to-edge data caching and forwarding architecture based on field programmable gate array 基于现场可编程门阵列的高速端到端数据缓存和转发体系结构
IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-11-09 DOI: 10.4218/etrij.2024-0212
Xiao Liu, Shubo Liu, Juncheng Wu, Song Song, Zhaohui Cai, Guoqing Tu

The application of the Internet of Things generates massive end-device data. Traditional end-to-edge data caching methods lack parallelism, consume numerous resources, and lack data backup mechanisms. We propose a lightweight high-speed data caching and forwarding architecture based on a field-programmable gate array. In the basic scheme, a double-data-rate memory read/write mixed control method is proposed to efficiently cache massive amounts of data. To improve reliability, we propose address-space virtualization to forward data to backup devices. To satisfy the demand for higher performance scenarios, we propose a real-time data shunting mechanism to realize an optimized scheme that supports higher data rates. These two schemes support single-link high-speed data caching and forwarding at 10 and 40 Gbps. Compared with the existing method, the basic and optimized schemes improve the performance by 25% and four times and save 66% and 40% of the resources, respectively. Thus, we provide a lightweight and reliable high-performance end-to-edge data caching solution for resource-constrained edge devices.

物联网的应用产生了海量的终端设备数据。传统的端到端数据缓存方法缺乏并行性,消耗大量资源,缺乏数据备份机制。我们提出了一种基于现场可编程门阵列的轻量级高速数据缓存和转发架构。在基本方案中,提出了一种双数据速率的存储器读写混合控制方法,以有效地缓存海量数据。为了提高可靠性,我们提出了地址空间虚拟化来将数据转发到备份设备。为了满足更高性能场景的需求,我们提出了一种实时数据分流机制,以实现支持更高数据速率的优化方案。这两种方案分别支持10gbps和40gbps的单链路高速数据缓存和转发。与现有方法相比,基本方案和优化方案的性能分别提高了25%和4倍,分别节省了66%和40%的资源。因此,我们为资源受限的边缘设备提供了一个轻量级和可靠的高性能端到端数据缓存解决方案。
{"title":"High-speed end-to-edge data caching and forwarding architecture based on field programmable gate array","authors":"Xiao Liu,&nbsp;Shubo Liu,&nbsp;Juncheng Wu,&nbsp;Song Song,&nbsp;Zhaohui Cai,&nbsp;Guoqing Tu","doi":"10.4218/etrij.2024-0212","DOIUrl":"https://doi.org/10.4218/etrij.2024-0212","url":null,"abstract":"<p>The application of the Internet of Things generates massive end-device data. Traditional end-to-edge data caching methods lack parallelism, consume numerous resources, and lack data backup mechanisms. We propose a lightweight high-speed data caching and forwarding architecture based on a field-programmable gate array. In the basic scheme, a double-data-rate memory read/write mixed control method is proposed to efficiently cache massive amounts of data. To improve reliability, we propose address-space virtualization to forward data to backup devices. To satisfy the demand for higher performance scenarios, we propose a real-time data shunting mechanism to realize an optimized scheme that supports higher data rates. These two schemes support single-link high-speed data caching and forwarding at 10 and 40 Gbps. Compared with the existing method, the basic and optimized schemes improve the performance by 25% and four times and save 66% and 40% of the resources, respectively. Thus, we provide a lightweight and reliable high-performance end-to-edge data caching solution for resource-constrained edge devices.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"47 5","pages":"946-958"},"PeriodicalIF":1.6,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145335889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
ETRI Journal
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1