IF 2.5 4区计算机科学

Transactions on Emerging Telecommunications Technologies Pub Date : 2025-07-01 DOI: 10.1002/ett.70212

{"title":"Correction to “Exploring Illumination and Communication: A Comprehensive Analysis of LED Lighting in Modern Interior Architectural Designs, Enhanced by Weighted Sum Model and Cluster Analysis for Informed Lighting Selection”","authors":"","doi":"10.1002/ett.70212","DOIUrl":"https://doi.org/10.1002/ett.70212","url":null,"abstract":"<p>K. Sathiamoorthy and I. Ganesan, “Exploring Illumination and Communication: A Comprehensive Analysis of LED Lighting in Modern Interior Architectural Designs, Enhanced by Weighted Sum Model and Cluster Analysis for Informed Lighting Selection,” <i>Transactions on Emerging Telecommunications Technologies</i> 36 (2025): e70036, https://doi.org/10.1002/ett.70036.</p><p>The statements in the Acknowledgement section were mistakenly repeated. The correct statements should read:</p><p>The authors express their heartfelt gratitude to Mepco Schlenk Engineering College (Autonomous), Sivakasi for providing the opportunity and resources to successfully complete this research. The authors also extend their sincere thanks to the editors and anonymous reviewers for their invaluable comments and suggestions which significantly improved the quality and precision of this article.</p><p>The online version of the article has also been updated.</p><p>We apologize for this error.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"36 7","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/ett.70212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519717","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 Container-Based Cloud Broker for Effective Service Provisioning in Multicloud Environment 多云环境中有效服务供应的基于容器的云代理

IF 5 2区计算机科学

International Journal of Intelligent Systems Pub Date : 2025-07-01 DOI: 10.1155/int/1009713

Vinothiyalakshmi P., Rajganesh Nagarajan, Ramkumar Thirunavukarasu, Arun Pandian J., Evans Kotei

{"title":"A Container-Based Cloud Broker for Effective Service Provisioning in Multicloud Environment","authors":"Vinothiyalakshmi P., Rajganesh Nagarajan, Ramkumar Thirunavukarasu, Arun Pandian J., Evans Kotei","doi":"10.1155/int/1009713","DOIUrl":"https://doi.org/10.1155/int/1009713","url":null,"abstract":"<div>\u0000 <p>Container-based cloud brokers are third-party services that act as an intermediate entity between users and multiple cloud providers. The cloud brokers intended to perform discovery and provisioning of cloud services with an affordable pricing scheme. As cloud services can be provisioned on-demand basis for multiple users, the cloud brokers are unable to provide the most suited services to the users on time. To address this issue, the proposed work introduces a novel approach for efficient cloud service provisioning by utilizing container-based cloud service brokerage and implementing service arbitrage across various cloud providers. A microservice architecture-based service discovery mechanism is developed which incorporates a service registry for tracking newly available services from the providers. Docker containers are employed to orchestrate the services, which ensures streamlined management and deployment of offered services. Further, the proposed system recommends and evaluates the services to the cloud users based on probability matrices, mapping matrices, and user feedback. The performance of the proposed model is compared with existing techniques, namely, rough multidimensional matrix (RMDM) and similarity-enhanced hybrid group recommendation approach (HGRA). Experimental results show that the proposed model outperforms the existing models in terms of clustering accuracy and execution time.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/1009713","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Admission Control and Resource Provisioning in Fog-Integrated Cloud Using Modified Genetic Adaptive Neuro-Fuzzy Inference System 基于改进遗传自适应神经模糊推理系统的雾集成云准入控制与资源分配

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2025-07-01 DOI: 10.1002/cpe.70179

Eht E. Sham, Pratibha Yadav, Deo Prakash Vidyarthi

{"title":"Admission Control and Resource Provisioning in Fog-Integrated Cloud Using Modified Genetic Adaptive Neuro-Fuzzy Inference System","authors":"Eht E. Sham, Pratibha Yadav, Deo Prakash Vidyarthi","doi":"10.1002/cpe.70179","DOIUrl":"https://doi.org/10.1002/cpe.70179","url":null,"abstract":"<div>\u0000 \u0000 <p>This study introduces a novel approach for an Admission Control Manager (ACM) for allocating users requests in Fog-integrated Cloud (FiC), based on available physical resources while ensuring Quality of Service (QoS) and Quality of Experience (QoE). The proposed ACM leverages a hybrid model combining the Genetic Algorithm (GA) and Adaptive Neuro-Fuzzy Inference System (ANFIS), referred to as GA-ANFIS. The GA-ANFIS model operates in two distinct phases to address the resource provisioning challenges of the extended three-layer FiC architecture. In the first phase, GA is employed to optimize the initial parameters of the ANFIS, ensuring better learning and convergence. In the second phase, the optimized ANFIS model processes user request parameters for job classification to decide the FiC layers for processing. The model's effectiveness is evaluated using simulations on Google trace datasets, with performance assessed via metrics such as accuracy, execution time, and convergence rate. The results demonstrate significant improvements, including a 12.63% in accuracy and a 21.66% reduction in execution time compared to state-of-the-art models. These findings establish the potential of the GA-ANFIS model as an efficient ACM to address resource provisioning challenges in FiC.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 18-20","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144524615","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

“Eco-Friendly” Micro-Services: Resource Footprint of Cloud-Native Micro-Services Written in Java—A Balance Between Build-Time and Run-Time Effects of Releases “生态友好型”微服务：用java编写的云原生微服务的资源足迹——版本构建时和运行时效果之间的平衡

IF 1.7 4区计算机科学

Journal of Software-Evolution and Process Pub Date : 2025-07-01 DOI: 10.1002/smr.70036

Alexander Poth, Olsi Rrjolli

{"title":"“Eco-Friendly” Micro-Services: Resource Footprint of Cloud-Native Micro-Services Written in Java—A Balance Between Build-Time and Run-Time Effects of Releases","authors":"Alexander Poth, Olsi Rrjolli","doi":"10.1002/smr.70036","DOIUrl":"https://doi.org/10.1002/smr.70036","url":null,"abstract":"<div>\u0000 \u0000 <p>The usage of micro-services in IT services is increasing. As this growth continues, the importance of eco-friendly design and operation becomes a significant factor. This study aims to evaluates the potential of Java frameworks that facilitate cloud-native micro-services in reducing the energy footprint throughout the release lifecycle. The release lifecycle view also looks into the development phase and its footprint impact respectively potentials to build overall more energy footprint optimized releases. Technology-driven methods and tools based on micro-service frameworks can help reduce the energy footprint at the micro-service level. However, local optimizations at the micro-service level cannot diminish the importance of more holistic approaches, such as optimizing the overall system, architecture and design of micro-services. The concepts derived from this analysis can be implemented in industrial settings, as presented by the case study. The effects are measurable and represent a positive step towards more eco-friendly cloud-native micro-service-based IT service offerings.</p>\u0000 </div>","PeriodicalId":48898,"journal":{"name":"Journal of Software-Evolution and Process","volume":"37 7","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144524874","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

Facial privacy in the digital era: A comprehensive survey on methods, evaluation, and future directions 数字时代的面部隐私：方法、评估和未来方向的综合调查

IF 13.3 1区计算机科学

Computer Science Review Pub Date : 2025-07-01 DOI: 10.1016/j.cosrev.2025.100785

Miaomiao Wang , Sheng Li , Xinpeng Zhang , Guorui Feng

{"title":"Facial privacy in the digital era: A comprehensive survey on methods, evaluation, and future directions","authors":"Miaomiao Wang , Sheng Li , Xinpeng Zhang , Guorui Feng","doi":"10.1016/j.cosrev.2025.100785","DOIUrl":"10.1016/j.cosrev.2025.100785","url":null,"abstract":"<div><div>With the advancement of computer vision technology and smart devices, images and videos containing facial information are increasingly shared on social media, making it easier for facial data to be collected and misused. As sensitive biometric data, once facial information is leaked, it may cause irreversible damage to personal privacy. Ensuring the security of facial information while benefiting from technological conveniences has become a critical research area. Many surveys have summarized existing protection measures, which often focus on specific issues or are oriented toward particular technologies, so existing methods have not been comprehensively summarized. In this paper, we categorize facial privacy-preserving methods into four paradigms: appearance-guided, identity-guided, reversible, and privacy-preserving for facial recognition systems. We offer an in-depth review of the most representative methods, emphasizing their advantages and functional characteristics. Additionally, we present commonly used datasets and evaluation metrics and analyze the performance of current methods. Finally, we discuss the challenges and opportunities for practical applications in facial privacy protection, offering insights for future research.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"58 ","pages":"Article 100785"},"PeriodicalIF":13.3,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144518885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Interval-Valued Probabilistic Dual Hesitant Fuzzy Muirhead Mean Aggregation Operators and Their Applications in Regenerative Energy Source Selection 区间值概率对偶犹豫模糊混沌平均聚集算子及其在再生能源选择中的应用

IF 5 2区计算机科学

International Journal of Intelligent Systems Pub Date : 2025-07-01 DOI: 10.1155/int/8892299

Muhammad Qiyas, Muhammad Naeem, Zahid Khan, Samuel Okyer

{"title":"Interval-Valued Probabilistic Dual Hesitant Fuzzy Muirhead Mean Aggregation Operators and Their Applications in Regenerative Energy Source Selection","authors":"Muhammad Qiyas, Muhammad Naeem, Zahid Khan, Samuel Okyer","doi":"10.1155/int/8892299","DOIUrl":"https://doi.org/10.1155/int/8892299","url":null,"abstract":"<div>\u0000 <p>As an effective addition to the hesitant fuzzy set (HFS), a probabilistic dual hesitant fuzzy set (PDHFS) has been designed in this paper. PDHFS would be an improved version of the dual hesitant fuzzy set (DHFS) where both membership and nonmembership hesitant quality is considered for all its probability of existence. Additional information on the degree of acceptance or rejection contains such allocated probabilities. More conveniently, we create a comprehensive type of PDHFS called interval-valued PDHFS (IVPDHFS) to interpret the probability data that exist in the hesitancy. This study describes several basic operating laws by stressing the advantages and enriching the utility of IVPDHFS in MAGDM. To aggregate IVPDHF information in MAGDM problems and extend its applications, we present the Muirhead mean (MM) operator of IVPDHFSs and study some attractive properties of the suggested operator. Besides that, in order to compute attribute weights, a new organizational framework is designed by using partial knowledge of the decision makers (DMs). Subsequently, a standardized technique with the suggested operator for MAGDM is introduced, and the realistic usage of the operator is illustrated by the use of a problem of regenerative energy source selection. We discuss the influence of the parameter vector on the ranking results. Finally, to address the benefits and limitations of the recommended MAGDM approach, the findings of the proposal are contrasted with other approaches.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2025 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/int/8892299","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144519630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Large language models to accelerate organic chemistry synthesis 大型语言模型，加速有机化学合成

IF 23.8 1区计算机科学

Nature Machine Intelligence Pub Date : 2025-07-01 DOI: 10.1038/s42256-025-01066-y

Yu Zhang, Yang Han, Shuai Chen, Ruijie Yu, Xin Zhao, Xianbin Liu, Kaipeng Zeng, Mengdi Yu, Jidong Tian, Feng Zhu, Xiaokang Yang, Yaohui Jin, Yanyan Xu

{"title":"Large language models to accelerate organic chemistry synthesis","authors":"Yu Zhang, Yang Han, Shuai Chen, Ruijie Yu, Xin Zhao, Xianbin Liu, Kaipeng Zeng, Mengdi Yu, Jidong Tian, Feng Zhu, Xiaokang Yang, Yaohui Jin, Yanyan Xu","doi":"10.1038/s42256-025-01066-y","DOIUrl":"https://doi.org/10.1038/s42256-025-01066-y","url":null,"abstract":"<p>Chemical synthesis, as a foundational methodology in the creation of transformative molecules, exerts substantial influence across diverse sectors from life sciences to materials and energy. Current chemical synthesis practices emphasize laborious and costly trial-and-error workflows, underscoring the urgent needs for advanced AI assistants. Recently, large language models, typified by GPT-4, have been introduced as an efficient tool to facilitate scientific research. Here we present Chemma, a fully fine-tuned large language model with 1.28 million pairs of questions and answers about reactions, as an assistant to accelerate organic chemistry synthesis. Chemma surpasses the best-known results in multiple chemical tasks, for example, single-step retrosynthesis and yield prediction, which highlights the potential of general artificial intelligence for organic chemistry. By predicting yields across the experimental reaction space, Chemma significantly improves the reaction exploration capability of Bayesian optimization. More importantly, integrated in an active learning framework, Chemma exhibits advanced potentials of autonomously experimental exploration and optimization in open reaction spaces. For an unreported Suzuki–Miyaura cross-coupling reaction of cyclic aminoboronates and aryl halides for the synthesis of α-aryl N-heterocycles, the human–artificial intelligence collaboration successfully explored a suitable ligand (tri(1-adamantyl)phosphine) and solvent (1,4-dioxane) within only 15 runs, achieving an isolated yield of 67%. These results reveal that, without quantum-chemical calculations, Chemma can comprehend and extract chemical insights from reaction data, in a manner akin to human experts. This work opens avenues for accelerating organic chemistry synthesis with adapted large language models.</p>","PeriodicalId":48533,"journal":{"name":"Nature Machine Intelligence","volume":"41 1","pages":""},"PeriodicalIF":23.8,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144520683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A flexible tri-stage dual-population evolutionary algorithm for constrained multi-objective optimization 约束多目标优化的柔性三阶段双种群进化算法

IF 7.5 1区计算机科学

Expert Systems with Applications Pub Date : 2025-07-01 DOI: 10.1016/j.eswa.2025.128810

Junhua Zhu , Xiaobing Yu , Zhengpeng Hu , Yaqi Mao , Feng Wang

{"title":"A flexible tri-stage dual-population evolutionary algorithm for constrained multi-objective optimization","authors":"Junhua Zhu , Xiaobing Yu , Zhengpeng Hu , Yaqi Mao , Feng Wang","doi":"10.1016/j.eswa.2025.128810","DOIUrl":"10.1016/j.eswa.2025.128810","url":null,"abstract":"<div><div>Constrained multi-objective optimization problems (CMOPs) have garnered significant attention in recent years, leading to the development of numerous constrained multi-objective evolutionary algorithms (CMOEAs). For certain CMOPs with complex frontier landscapes and small feasible domains, efficiently allocating limited computing resources to accurately identify the constrained Pareto front (CPF) is a significant challenge. To address these challenges, this paper introduces a flexible tri-stage CMOEA designed to optimize the allocation of computational resources. The algorithm consists of three distinct stages: the exploration stage, the cooperation stage, and the convergence stage. Each optimization stage involves offspring generation and environmental selection by distinct populations tailored to the specific goals of that stage. Additionally, the paper proposes two effective stage transition conditions that accurately assess the population’s current state, ensuring a smooth progression through the optimization process. The proposed algorithm was evaluated on 43 instances from four test suites and compared against 11 state-of-the-art CMOEAs. The results demonstrate that TriSEA effectively allocates computing resources, leading to competitive experimental outcomes.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"294 ","pages":"Article 128810"},"PeriodicalIF":7.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144518120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Nonrestricted impulsive sampling control for synchronization of uncertain neural networks with hybrid discrete-delayed and distributed-delayed couplings: A new Halanay-like impulsive differential comparative lemma 具有离散-延迟和分布-延迟混合耦合的不确定神经网络同步的非限制脉冲采样控制：一个新的类halanay脉冲微分比较引理

IF 7.5 1区计算机科学

Expert Systems with Applications Pub Date : 2025-07-01 DOI: 10.1016/j.eswa.2025.128748

Hongguang Fan , Jiahui Tang , Zizhao Guo

{"title":"Nonrestricted impulsive sampling control for synchronization of uncertain neural networks with hybrid discrete-delayed and distributed-delayed couplings: A new Halanay-like impulsive differential comparative lemma","authors":"Hongguang Fan , Jiahui Tang , Zizhao Guo","doi":"10.1016/j.eswa.2025.128748","DOIUrl":"10.1016/j.eswa.2025.128748","url":null,"abstract":"<div><div>This article discusses the exponential synchronization challenge for uncertain neural networks with non-delayed coupling, discrete-delayed and distributed-delayed couplings. To tackle the effect of various couplings and large delays on network stabilization, a new Halanay-like impulsive differential comparative lemma is established by strict mathematical induction and reductio ad absurdum, which relaxes the conventional limitations on coefficient constraints. Based on the novel comparative lemma and Lyapunov function method, exponential synchronization criteria with the Kronecker product for the studied neural networks can be derived using a novel impulsive control protocol with current information and historical state communication. Traditional impulsive sampling control mechanisms require each sampling delay to be less than the sampling interval. Unlike conventional works, the impulsive control protocol and comparative lemma proposed in this study ensure the successful implementation of exponential synchronization in the considered neural networks, regardless of whether the impulsive sampling delay is larger or smaller than the sampling interval. In other words, our impulsive control intervals are nonrestricted by the size of sampling delays, which means the impulsive sampling scheme in this paper can effectively save control costs and increase communication security in practical applications.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"294 ","pages":"Article 128748"},"PeriodicalIF":7.5,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144518123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Low-complexity DQED: Advancing dual-scenario quantum edge detection for enhanced image analysis 低复杂度DQED：推进双场景量子边缘检测，增强图像分析

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-07-01 DOI: 10.1016/j.compeleceng.2025.110545

Zheng Xing, Xiaochen Yuan, Chan-Tong Lam, Sio-Kei Im

{"title":"Low-complexity DQED: Advancing dual-scenario quantum edge detection for enhanced image analysis","authors":"Zheng Xing, Xiaochen Yuan, Chan-Tong Lam, Sio-Kei Im","doi":"10.1016/j.compeleceng.2025.110545","DOIUrl":"10.1016/j.compeleceng.2025.110545","url":null,"abstract":"<div><div>To address the existing problems of complex process, including complex pixel operations, high complexity and cost, and single scenario of existing quantum edge detection, we propose a low-complexity Dual-Scenario Quantum Image Edge Detection (DQED) method which applies for dual scenarios: Contour Edge Detection (CED) for coarse edge detection and Texture Edge Detection (TED) for detail edge detection. In DQED, edge information is detected using only one Controlled-Controlled-NOT gate (CCNOT) gate without complex operations. To simplify the detection process, we propose the Neighborhood Quantum State-based Edge Extraction (NQEE) method, which uses only the binary image of the object image and the Highest Weight Qubit (HWQ) plane to detect the edge. Moreover, to reduce the complexity, we discard the complex pixel-based operations by using only XOR operations in the NQEE. In addition, to refine the edge image, we propose the Quantum Edge Refinement (QER) algorithm, which is used in both the CED and TED processes to obtain the contour edge and the texture edge. This paper clearly describes the proposed methods and designs the quantum circuits in detail. Finally, we fully evaluate our method with images from seven databases that are of different characteristics. We also consider quantum channel noise and evaluate it. Comparison with the existing state-of-the-art research results show that our method has the advantages of generalization, dual scenarios, simplicity, and low complexity.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"127 ","pages":"Article 110545"},"PeriodicalIF":4.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144518127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

计算机科学最新文献