首页 > 最新文献

ETRI Journal最新文献

英文 中文
XEM: Tensor accelerator for AB21 supercomputing artificial intelligence processor XEM:用于 AB21 超级计算人工智能处理器的张量加速器
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-10-12 DOI: 10.4218/etrij.2024-0141
Won Jeon, Mi Young Lee, Joo Hyun Lee, Chun-Gi Lyuh

As computing systems become increasingly larger, high-performance computing (HPC) is gaining importance. In particular, as hyperscale artificial intelligence (AI) applications, such as large language models emerge, HPC has become important even in the field of AI. Important operations in hyperscale AI and HPC are mainly linear algebraic operations based on tensors. An AB21 supercomputing AI processor has been proposed to accelerate such applications. This study proposes a XEM accelerator to accelerate linear algebraic operations in an AB21 processor effectively. The XEM accelerator has outer product-based parallel floating-point units that can efficiently process tensor operations. We provide hardware details of the XEM architecture and introduce new instructions for controlling the XEM accelerator. Additionally, hardware characteristic analyses based on chip fabrication and simulator-based functional verification are conducted. In the future, the performance and functionalities of the XEM accelerator will be verified using an AB21 processor.

随着计算系统变得越来越大,高性能计算(HPC)的重要性也与日俱增。特别是随着超大规模人工智能(AI)应用(如大型语言模型)的出现,高性能计算甚至在人工智能领域也变得非常重要。超大规模人工智能和 HPC 中的重要运算主要是基于张量的线性代数运算。为加速此类应用,有人提出了一种 AB21 超级计算人工智能处理器。本研究提出了一种 XEM 加速器,以有效加速 AB21 处理器中的线性代数运算。XEM 加速器具有基于外积的并行浮点运算单元,可高效处理张量运算。我们提供了 XEM 架构的硬件细节,并介绍了用于控制 XEM 加速器的新指令。此外,我们还进行了基于芯片制造的硬件特性分析和基于模拟器的功能验证。未来,我们将使用 AB21 处理器验证 XEM 加速器的性能和功能。
{"title":"XEM: Tensor accelerator for AB21 supercomputing artificial intelligence processor","authors":"Won Jeon,&nbsp;Mi Young Lee,&nbsp;Joo Hyun Lee,&nbsp;Chun-Gi Lyuh","doi":"10.4218/etrij.2024-0141","DOIUrl":"https://doi.org/10.4218/etrij.2024-0141","url":null,"abstract":"<p>As computing systems become increasingly larger, high-performance computing (HPC) is gaining importance. In particular, as hyperscale artificial intelligence (AI) applications, such as large language models emerge, HPC has become important even in the field of AI. Important operations in hyperscale AI and HPC are mainly linear algebraic operations based on tensors. An AB21 supercomputing AI processor has been proposed to accelerate such applications. This study proposes a XEM accelerator to accelerate linear algebraic operations in an AB21 processor effectively. The XEM accelerator has outer product-based parallel floating-point units that can efficiently process tensor operations. We provide hardware details of the XEM architecture and introduce new instructions for controlling the XEM accelerator. Additionally, hardware characteristic analyses based on chip fabrication and simulator-based functional verification are conducted. In the future, the performance and functionalities of the XEM accelerator will be verified using an AB21 processor.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 5","pages":"839-850"},"PeriodicalIF":1.3,"publicationDate":"2024-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0141","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524642","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
Quantum electrodynamical formulation of photochemical acid generation and its implications on optical lithography 光化学酸生成的量子电动力学公式及其对光学光刻技术的影响
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-10-12 DOI: 10.4218/etrij.2024-0127
Seungjin Lee

The photochemical acid generation is refined from the first principles of quantum electrodynamics. First, we briefly review the formulation of the quantum theory of light based on the quantum electrodynamics framework to establish the probability of acid generation at a given spacetime point. The quantum mechanical acid generation is then combined with the deprotection mechanism to obtain a probabilistic description of the deprotection density directly related to feature formation in a photoresist. A statistical analysis of the random deprotection density is presented to reveal the leading characteristics of stochastic feature formation.

光化学酸生成是从量子电动力学的第一原理提炼出来的。首先,我们简要回顾了基于量子电动力学框架的光量子理论的表述,以确定在给定时空点酸生成的概率。然后将量子力学酸生成与去保护机制相结合,得到与光刻胶中特征形成直接相关的去保护密度的概率描述。通过对随机去保护密度的统计分析,揭示了随机特征形成的主要特征。
{"title":"Quantum electrodynamical formulation of photochemical acid generation and its implications on optical lithography","authors":"Seungjin Lee","doi":"10.4218/etrij.2024-0127","DOIUrl":"https://doi.org/10.4218/etrij.2024-0127","url":null,"abstract":"<p>The photochemical acid generation is refined from the first principles of quantum electrodynamics. First, we briefly review the formulation of the quantum theory of light based on the quantum electrodynamics framework to establish the probability of acid generation at a given spacetime point. The quantum mechanical acid generation is then combined with the deprotection mechanism to obtain a probabilistic description of the deprotection density directly related to feature formation in a photoresist. A statistical analysis of the random deprotection density is presented to reveal the leading characteristics of stochastic feature formation.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 5","pages":"774-782"},"PeriodicalIF":1.3,"publicationDate":"2024-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0127","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524643","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
Mixed-mode SNN crossbar array with embedded dummy switch and mid-node pre-charge scheme 采用嵌入式假开关和中节点预充电方案的混合模式 SNN 横杆阵列
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-10-12 DOI: 10.4218/etrij.2024-0120
Kwang-Il Oh, Hyuk Kim, Taewook Kang, Sung-Eun Kim, Jae-Jin Lee, Byung-Do Yang

This paper presents a membrane computation error-minimized mixed-mode spiking neural network (SNN) crossbar array. Our approach involves implementing an embedded dummy switch scheme and a mid-node pre-charge scheme to construct a high-precision current-mode synapse. We effectively suppressed charge sharing between membrane capacitors and the parasitic capacitance of synapses that results in membrane computation error. A 400 × 20 SNN crossbar prototype chip is fabricated via a 28-nm FDSOI CMOS process, and 20 MNIST patterns with their sizes reduced to 20 × 20 pixels are successfully recognized under 411 μW of power consumed. Moreover, the peak-to-peak deviation of the normalized output spike count measured from the 21 fabricated SNN prototype chips is within 16.5% from the ideal value, including sample-wise random variations.

本文介绍了一种膜计算误差最小化混合模式尖峰神经网络(SNN)横杆阵列。我们的方法包括实施嵌入式假开关方案和中节点预充电方案,以构建高精度电流模式突触。我们有效地抑制了膜电容之间的电荷共享以及导致膜计算误差的突触寄生电容。我们采用 28 纳米 FDSOI CMOS 工艺制造了 400 × 20 SNN 横条原型芯片,并成功识别了 20 个尺寸缩小为 20 × 20 像素的 MNIST 图案,功耗仅为 411 μW。此外,从 21 个已制造的 SNN 原型芯片测得的归一化输出尖峰计数的峰峰值偏差与理想值的偏差在 16.5% 以内,其中包括样本随机变量。
{"title":"Mixed-mode SNN crossbar array with embedded dummy switch and mid-node pre-charge scheme","authors":"Kwang-Il Oh,&nbsp;Hyuk Kim,&nbsp;Taewook Kang,&nbsp;Sung-Eun Kim,&nbsp;Jae-Jin Lee,&nbsp;Byung-Do Yang","doi":"10.4218/etrij.2024-0120","DOIUrl":"https://doi.org/10.4218/etrij.2024-0120","url":null,"abstract":"<p>This paper presents a membrane computation error-minimized mixed-mode spiking neural network (SNN) crossbar array. Our approach involves implementing an embedded dummy switch scheme and a mid-node pre-charge scheme to construct a high-precision current-mode synapse. We effectively suppressed charge sharing between membrane capacitors and the parasitic capacitance of synapses that results in membrane computation error. A 400 × 20 SNN crossbar prototype chip is fabricated via a 28-nm FDSOI CMOS process, and 20 MNIST patterns with their sizes reduced to 20 × 20 pixels are successfully recognized under 411 μW of power consumed. Moreover, the peak-to-peak deviation of the normalized output spike count measured from the 21 fabricated SNN prototype chips is within 16.5% from the ideal value, including sample-wise random variations.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 5","pages":"865-877"},"PeriodicalIF":1.3,"publicationDate":"2024-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0120","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524644","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
Trends in quantum reinforcement learning: State-of-the-arts and the road ahead 量子强化学习的趋势:艺术现状与未来之路
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-10-03 DOI: 10.4218/etrij.2024-0153
Soohyun Park, Joongheon Kim

This paper presents the basic quantum reinforcement learning theory and its applications to various engineering problems. With the advances in quantum computing and deep learning technologies, various research works have focused on quantum deep learning and quantum machine learning. In this paper, quantum neural network (QNN)-based reinforcement learning (RL) models are discussed and introduced. Moreover, the pros of the QNN-based RL algorithms and models, such as fast training, high scalability, and efficient learning parameter utilization, are presented along with various research results. In addition, one of the well-known multi-agent extensions of QNN-based RL models, the quantum centralized-critic and multiple-actor network, is also discussed and its applications to multi-agent cooperation and coordination are introduced. Finally, the applications and future research directions are introduced and discussed in terms of federated learning, split learning, autonomous control, and quantum deep learning software testing.

本文介绍了量子强化学习的基本理论及其在各种工程问题中的应用。随着量子计算和深度学习技术的发展,各种研究工作都聚焦于量子深度学习和量子机器学习。本文讨论并介绍了基于量子神经网络(QNN)的强化学习(RL)模型。此外,本文还介绍了基于量子神经网络的强化学习(RL)算法和模型的优点,如快速训练、高可扩展性和高效利用学习参数等,并介绍了各种研究成果。此外,还讨论了基于 QNN 的 RL 模型的著名多代理扩展之一--量子集中批判和多代理网络,并介绍了它在多代理合作与协调方面的应用。最后,从联合学习、分裂学习、自主控制和量子深度学习软件测试等方面介绍和讨论了量子深度学习的应用和未来研究方向。
{"title":"Trends in quantum reinforcement learning: State-of-the-arts and the road ahead","authors":"Soohyun Park,&nbsp;Joongheon Kim","doi":"10.4218/etrij.2024-0153","DOIUrl":"https://doi.org/10.4218/etrij.2024-0153","url":null,"abstract":"<p>This paper presents the basic quantum reinforcement learning theory and its applications to various engineering problems. With the advances in quantum computing and deep learning technologies, various research works have focused on quantum deep learning and quantum machine learning. In this paper, quantum neural network (QNN)-based reinforcement learning (RL) models are discussed and introduced. Moreover, the pros of the QNN-based RL algorithms and models, such as fast training, high scalability, and efficient learning parameter utilization, are presented along with various research results. In addition, one of the well-known multi-agent extensions of QNN-based RL models, the quantum centralized-critic and multiple-actor network, is also discussed and its applications to multi-agent cooperation and coordination are introduced. Finally, the applications and future research directions are introduced and discussed in terms of federated learning, split learning, autonomous control, and quantum deep learning software testing.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 5","pages":"748-758"},"PeriodicalIF":1.3,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2024-0153","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524655","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
Low-complexity patch projection method for efficient and lightweight point-cloud compression 用于高效、轻量级点云压缩的低复杂度补丁投影法
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-05-15 DOI: 10.4218/etrij.2023-0242
Sungryeul Rhyu, Junsik Kim, Gwang Hoon Park, Kyuheon Kim

The point cloud provides viewers with intuitive geometric understanding but requires a huge amount of data. Moving Picture Experts Group (MPEG) has developed video-based point-cloud compression in the range of 300–700. As the compression rate increases, the complexity increases to the extent that it takes 101.36 s to compress one frame in an experimental environment using a personal computer. To realize real-time point-cloud compression processing, the direct patch projection (DPP) method proposed herein simplifies the complex patch segmentation process by classifying and projecting points according to their geometric positions. The DPP method decreases the complexity of the patch segmentation from 25.75 s to 0.10 s per frame, and the entire process becomes 8.76 times faster than the conventional one. Consequently, this proposed DPP method yields similar peak signal-to-noise ratio (PSNR) outcomes to those of the conventional method at reduced times (4.7–5.5 times) at the cost of bitrate overhead. The objective and subjective results show that the proposed DPP method can be considered when low-complexity requirements are required in lightweight device environments.

点云为观众提供了直观的几何理解,但需要大量数据。移动图像专家组(MPEG)开发了基于视频的点云压缩技术,压缩率范围为 300-700。随着压缩率的提高,复杂性也随之增加,在实验环境中使用个人电脑压缩一帧图像需要 101.36 秒。为了实现实时点云压缩处理,本文提出的直接补丁投影(DPP)方法通过根据点的几何位置对点进行分类和投影,简化了复杂的补丁分割过程。DPP 方法将斑块分割的复杂度从每帧 25.75 秒降至 0.10 秒,整个过程比传统方法快 8.76 倍。因此,所提出的 DPP 方法以比特率开销为代价,在缩短时间(4.7-5.5 倍)的情况下获得了与传统方法相似的峰值信噪比(PSNR)结果。客观和主观结果表明,在轻量级设备环境中需要低复杂度要求时,可以考虑采用所提出的 DPP 方法。
{"title":"Low-complexity patch projection method for efficient and lightweight point-cloud compression","authors":"Sungryeul Rhyu,&nbsp;Junsik Kim,&nbsp;Gwang Hoon Park,&nbsp;Kyuheon Kim","doi":"10.4218/etrij.2023-0242","DOIUrl":"10.4218/etrij.2023-0242","url":null,"abstract":"<p>The point cloud provides viewers with intuitive geometric understanding but requires a huge amount of data. Moving Picture Experts Group (MPEG) has developed video-based point-cloud compression in the range of 300–700. As the compression rate increases, the complexity increases to the extent that it takes 101.36 s to compress one frame in an experimental environment using a personal computer. To realize real-time point-cloud compression processing, the direct patch projection (DPP) method proposed herein simplifies the complex patch segmentation process by classifying and projecting points according to their geometric positions. The DPP method decreases the complexity of the patch segmentation from 25.75 s to 0.10 s per frame, and the entire process becomes 8.76 times faster than the conventional one. Consequently, this proposed DPP method yields similar peak signal-to-noise ratio (PSNR) outcomes to those of the conventional method at reduced times (4.7–5.5 times) at the cost of bitrate overhead. The objective and subjective results show that the proposed DPP method can be considered when low-complexity requirements are required in lightweight device environments.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 4","pages":"683-696"},"PeriodicalIF":1.3,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0242","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140974659","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
An efficient dual layer data aggregation scheme in clustered wireless sensor networks 集群无线传感器网络中的高效双层数据聚合方案
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-05-06 DOI: 10.4218/etrij.2023-0214
Fenting Yang, Zhen Xu, Lei Yang

In wireless sensor network (WSN) monitoring systems, redundant data from sluggish environmental changes and overlapping sensing ranges can increase the volume of data sent by nodes, degrade the efficiency of information collection, and lead to the death of sensor nodes. To reduce the energy consumption of sensor nodes and prolong the life of WSNs, this study proposes a dual layer intracluster data fusion scheme based on ring buffer. To reduce redundant data and temporary anomalous data while guaranteeing the temporal coherence of data, the source nodes employ a binarized similarity function and sliding quartile detection based on the ring buffer. Based on the improved support degree function of weighted Pearson distance, the cluster head node performs a weighted fusion on the data received from the source nodes. Experimental results reveal that the scheme proposed in this study has clear advantages in three aspects: the number of remaining nodes, residual energy, and the number of packets transmitted. The data fusion of the proposed scheme is confined to the data fusion of the same attribute environment parameters.

在无线传感器网络(WSN)监测系统中,由于环境变化缓慢和传感范围重叠而产生的冗余数据会增加节点发送的数据量,降低信息收集效率,并导致传感器节点死亡。为了降低传感器节点的能耗,延长 WSN 的寿命,本研究提出了一种基于环形缓冲区的双层簇内数据融合方案。为了减少冗余数据和临时异常数据,同时保证数据的时间一致性,源节点采用了基于环形缓冲区的二值化相似度函数和滑动四分位检测。簇首节点根据改进的加权皮尔逊距离支持度函数,对从源节点接收到的数据进行加权融合。实验结果表明,本研究提出的方案在剩余节点数、剩余能量和数据包传输数三个方面具有明显优势。所提方案的数据融合仅限于相同属性环境参数的数据融合。
{"title":"An efficient dual layer data aggregation scheme in clustered wireless sensor networks","authors":"Fenting Yang,&nbsp;Zhen Xu,&nbsp;Lei Yang","doi":"10.4218/etrij.2023-0214","DOIUrl":"10.4218/etrij.2023-0214","url":null,"abstract":"<p>In wireless sensor network (WSN) monitoring systems, redundant data from sluggish environmental changes and overlapping sensing ranges can increase the volume of data sent by nodes, degrade the efficiency of information collection, and lead to the death of sensor nodes. To reduce the energy consumption of sensor nodes and prolong the life of WSNs, this study proposes a dual layer intracluster data fusion scheme based on ring buffer. To reduce redundant data and temporary anomalous data while guaranteeing the temporal coherence of data, the source nodes employ a binarized similarity function and sliding quartile detection based on the ring buffer. Based on the improved support degree function of weighted Pearson distance, the cluster head node performs a weighted fusion on the data received from the source nodes. Experimental results reveal that the scheme proposed in this study has clear advantages in three aspects: the number of remaining nodes, residual energy, and the number of packets transmitted. The data fusion of the proposed scheme is confined to the data fusion of the same attribute environment parameters.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 4","pages":"604-618"},"PeriodicalIF":1.3,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141006889","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
Writer verification using feature selection based on genetic algorithm: A case study on handwritten Bangla dataset 利用基于遗传算法的特征选择进行作家验证:手写孟加拉语数据集案例研究
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-04-28 DOI: 10.4218/etrij.2023-0188
Jaya Paul, Kalpita Dutta, Anasua Sarkar, Kaushik Roy, Nibaran Das

Author verification is challenging because of the diversity in writing styles. We propose an enhanced handwriting verification method that combines handcrafted and automatically extracted features. The method uses a genetic algorithm to reduce the dimensionality of the feature set. We consider offline Bangla handwriting content and evaluate the proposed method using handcrafted features with a simple logistic regression, radial basis function network, and sequential minimal optimization as well as automatically extracted features using a convolutional neural network. The handcrafted features outperform the automatically extracted ones, achieving an average verification accuracy of 94.54% for 100 writers. The handcrafted features include Radon transform, histogram of oriented gradients, local phase quantization, and local binary patterns from interwriter and intrawriter content. The genetic algorithm reduces the feature dimensionality and selects salient features using a support vector machine. The top five experimental results are obtained from the optimal feature set selected using a consensus strategy. Comparisons with other methods and features confirm the satisfactory results.

由于书写风格的多样性,作者验证具有挑战性。我们提出了一种结合手工制作和自动提取特征的增强型手写验证方法。该方法使用遗传算法来降低特征集的维度。我们考虑了离线孟加拉语手写内容,并使用简单逻辑回归、径向基函数网络和顺序最小优化等手工特征以及卷积神经网络自动提取的特征对所提出的方法进行了评估。手工创建的特征优于自动提取的特征,在 100 位作家中实现了 94.54% 的平均验证准确率。手工特征包括拉顿变换、定向梯度直方图、局部相位量化以及来自作家间和作家内内容的局部二进制模式。遗传算法降低了特征维度,并使用支持向量机选择突出特征。实验结果的前五名来自使用共识策略选出的最佳特征集。与其他方法和特征的比较证实了结果令人满意。
{"title":"Writer verification using feature selection based on genetic algorithm: A case study on handwritten Bangla dataset","authors":"Jaya Paul,&nbsp;Kalpita Dutta,&nbsp;Anasua Sarkar,&nbsp;Kaushik Roy,&nbsp;Nibaran Das","doi":"10.4218/etrij.2023-0188","DOIUrl":"https://doi.org/10.4218/etrij.2023-0188","url":null,"abstract":"<p>Author verification is challenging because of the diversity in writing styles. We propose an enhanced handwriting verification method that combines handcrafted and automatically extracted features. The method uses a genetic algorithm to reduce the dimensionality of the feature set. We consider offline Bangla handwriting content and evaluate the proposed method using handcrafted features with a simple logistic regression, radial basis function network, and sequential minimal optimization as well as automatically extracted features using a convolutional neural network. The handcrafted features outperform the automatically extracted ones, achieving an average verification accuracy of 94.54% for 100 writers. The handcrafted features include Radon transform, histogram of oriented gradients, local phase quantization, and local binary patterns from interwriter and intrawriter content. The genetic algorithm reduces the feature dimensionality and selects salient features using a support vector machine. The top five experimental results are obtained from the optimal feature set selected using a consensus strategy. Comparisons with other methods and features confirm the satisfactory results.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 4","pages":"648-659"},"PeriodicalIF":1.3,"publicationDate":"2024-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0188","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141980503","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
Generative autoencoder to prevent overregularization of variational autoencoder 防止变分自动编码器过度规则化的生成自动编码器
IF 1.4 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-04-12 DOI: 10.4218/etrij.2023-0375
YoungMin Ko, SunWoo Ko, YoungSoo Kim
In machine learning, data scarcity is a common problem, and generative models have the potential to solve it. The variational autoencoder is a generative model that performs variational inference to estimate a low-dimensional posterior distribution given high-dimensional data. Specifically, it optimizes the evidence lower bound from regularization and reconstruction terms, but the two terms are imbalanced in general. If the reconstruction error is not sufficiently small to belong to the population, the generative model performance cannot be guaranteed. We propose a generative autoencoder (GAE) that uses an autoencoder to first minimize the reconstruction error and then estimate the distribution using latent vectors mapped onto a lower dimension through the encoder. We compare the Fréchet inception distances scores of the proposed GAE and nine other variational autoencoders on the MNIST, Fashion MNIST, CIFAR10, and SVHN datasets. The proposed GAE consistently outperforms the other methods on the MNIST (44.30), Fashion MNIST (196.34), and SVHN (77.53) datasets.
在机器学习中,数据稀缺是一个常见问题,而生成模型有可能解决这一问题。变分自动编码器是一种生成模型,它通过变分推理来估计给定高维数据的低维后验分布。具体来说,它优化正则化和重构项的证据下限,但这两个项一般是不平衡的。如果重构误差不够小,不属于群体,生成模型的性能就无法保证。我们提出了一种生成式自动编码器(GAE),它使用自动编码器首先使重构误差最小化,然后使用通过编码器映射到较低维度上的潜向量来估计分布。我们在 MNIST、Fashion MNIST、CIFAR10 和 SVHN 数据集上比较了所提出的 GAE 和其他九种变异自动编码器的弗雷谢特截距得分。在 MNIST(44.30)、Fashion MNIST(196.34)和 SVHN(77.53)数据集上,所提出的 GAE 始终优于其他方法。
{"title":"Generative autoencoder to prevent overregularization of variational autoencoder","authors":"YoungMin Ko, SunWoo Ko, YoungSoo Kim","doi":"10.4218/etrij.2023-0375","DOIUrl":"https://doi.org/10.4218/etrij.2023-0375","url":null,"abstract":"In machine learning, data scarcity is a common problem, and generative models have the potential to solve it. The variational autoencoder is a generative model that performs variational inference to estimate a low-dimensional posterior distribution given high-dimensional data. Specifically, it optimizes the evidence lower bound from regularization and reconstruction terms, but the two terms are imbalanced in general. If the reconstruction error is not sufficiently small to belong to the population, the generative model performance cannot be guaranteed. We propose a generative autoencoder (GAE) that uses an autoencoder to first minimize the reconstruction error and then estimate the distribution using latent vectors mapped onto a lower dimension through the encoder. We compare the Fréchet inception distances scores of the proposed GAE and nine other variational autoencoders on the MNIST, Fashion MNIST, CIFAR10, and SVHN datasets. The proposed GAE consistently outperforms the other methods on the MNIST (44.30), Fashion MNIST (196.34), and SVHN (77.53) datasets.","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"33 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140596643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Background music monitoring framework and dataset for TV broadcast audio 电视广播音频背景音乐监测框架和数据集
IF 1.3 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-04-12 DOI: 10.4218/etrij.2023-0249
Hyemi Kim, Junghyun Kim, Jihyun Park, Seongwoo Kim, Chanjin Park, Wonyoung Yoo

Music identification is widely regarded as a solved problem for music searching in quiet environments, but its performance tends to degrade in TV broadcast audio owing to the presence of dialogue or sound effects. In addition, constructing an accurate dataset for measuring the performance of background music monitoring in TV broadcast audio is challenging. We propose a framework for monitoring background music by automatic identification and introduce a background music cue sheet. The framework comprises three main components: music identification, music–speech separation, and music detection. In addition, we introduce the Cue-K-Drama dataset, which includes reference songs, audio tracks from 60 episodes of five Korean TV drama series, and corresponding cue sheets that provide the start and end timestamps of background music. Experimental results on the constructed and existing datasets demonstrate that the proposed framework, which incorporates music identification with music–speech separation and music detection, effectively enhances TV broadcast audio monitoring.

音乐识别被广泛认为是解决安静环境下音乐搜索的一个难题,但在电视广播音频中,由于对话或音效的存在,音乐识别的性能往往会下降。此外,构建一个准确的数据集来衡量电视广播音频中背景音乐监测的性能也很有挑战性。我们提出了一个通过自动识别监控背景音乐的框架,并引入了背景音乐提示表。该框架由三个主要部分组成:音乐识别、音乐语音分离和音乐检测。此外,我们还引入了 Cue-K-Drama 数据集,其中包括参考歌曲、五部韩国电视剧 60 集的音轨以及提供背景音乐开始和结束时间戳的相应提示表。在所构建的数据集和现有数据集上的实验结果表明,所提出的框架将音乐识别与音乐-语音分离和音乐检测结合在一起,有效地增强了电视广播音频监测功能。
{"title":"Background music monitoring framework and dataset for TV broadcast audio","authors":"Hyemi Kim,&nbsp;Junghyun Kim,&nbsp;Jihyun Park,&nbsp;Seongwoo Kim,&nbsp;Chanjin Park,&nbsp;Wonyoung Yoo","doi":"10.4218/etrij.2023-0249","DOIUrl":"10.4218/etrij.2023-0249","url":null,"abstract":"<p>Music identification is widely regarded as a solved problem for music searching in quiet environments, but its performance tends to degrade in TV broadcast audio owing to the presence of dialogue or sound effects. In addition, constructing an accurate dataset for measuring the performance of background music monitoring in TV broadcast audio is challenging. We propose a framework for monitoring background music by automatic identification and introduce a background music cue sheet. The framework comprises three main components: music identification, music–speech separation, and music detection. In addition, we introduce the Cue-K-Drama dataset, which includes reference songs, audio tracks from 60 episodes of five Korean TV drama series, and corresponding cue sheets that provide the start and end timestamps of background music. Experimental results on the constructed and existing datasets demonstrate that the proposed framework, which incorporates music identification with music–speech separation and music detection, effectively enhances TV broadcast audio monitoring.</p>","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"46 4","pages":"697-707"},"PeriodicalIF":1.3,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.4218/etrij.2023-0249","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140596641","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 neural network framework based on ConvNeXt for side-channel hardware Trojan detection 基于 ConvNeXt 的侧信道硬件木马检测神经网络框架
IF 1.4 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-04-08 DOI: 10.4218/etrij.2023-0448
Yuchan Gao, Jing Su, Jia Li, Shenglong Wang, Chao Li
Researchers in the field of hardware security have been dedicated to the study of hardware Trojan detection. Among the various approaches, side-channel detection methods are widely used because of their high detection accuracy and fewer constraints. However, most side-channel detection methods cannot make full use of side-channel information. In this paper, we propose a framework that utilizes the continuous wavelet transform to convert time-series information and employs an improved ConvNeXt network to detect hardware Trojans. This detection framework first converts one-dimensional time-series information into a two-dimensional time–frequency map using the continuous wavelet transform to leverage frequency information in electromagnetic side-channel signals. Then, the two-dimensional time–frequency map is fed into the improved ConvNeXt network, which increases the weight of the informative parts in the two-dimensional time–frequency map and enhances detection efficiency. The results indicate that the method proposed in this paper significantly improves the accuracy of hardware Trojan detection.
硬件安全领域的研究人员一直致力于硬件木马检测的研究。在各种方法中,侧信道检测方法因其检测精度高、限制少而被广泛使用。然而,大多数侧信道检测方法无法充分利用侧信道信息。本文提出了一种利用连续小波变换转换时间序列信息的框架,并采用改进的 ConvNeXt 网络来检测硬件木马。该检测框架首先利用连续小波变换将一维时间序列信息转换为二维时频图,以充分利用电磁侧信道信号中的频率信息。然后,将二维时频图输入改进的 ConvNeXt 网络,增加二维时频图中信息部分的权重,提高检测效率。结果表明,本文提出的方法显著提高了硬件木马检测的准确性。
{"title":"A neural network framework based on ConvNeXt for side-channel hardware Trojan detection","authors":"Yuchan Gao, Jing Su, Jia Li, Shenglong Wang, Chao Li","doi":"10.4218/etrij.2023-0448","DOIUrl":"https://doi.org/10.4218/etrij.2023-0448","url":null,"abstract":"Researchers in the field of hardware security have been dedicated to the study of hardware Trojan detection. Among the various approaches, side-channel detection methods are widely used because of their high detection accuracy and fewer constraints. However, most side-channel detection methods cannot make full use of side-channel information. In this paper, we propose a framework that utilizes the continuous wavelet transform to convert time-series information and employs an improved ConvNeXt network to detect hardware Trojans. This detection framework first converts one-dimensional time-series information into a two-dimensional time–frequency map using the continuous wavelet transform to leverage frequency information in electromagnetic side-channel signals. Then, the two-dimensional time–frequency map is fed into the improved ConvNeXt network, which increases the weight of the informative parts in the two-dimensional time–frequency map and enhances detection efficiency. The results indicate that the method proposed in this paper significantly improves the accuracy of hardware Trojan detection.","PeriodicalId":11901,"journal":{"name":"ETRI Journal","volume":"69 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140596752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1