检索结果-内蒙古大学图书馆

Automated face recognition using deep learning technique and center symmetric multivariant local binary pattern

Neural Computing and Applications 2025年第1期37卷 263-281页

作者： Sekhar, J.C. Josephson, P. Joel Chinnasamy, A. Maheswari, M. Sankar, S. Kalangi, Ruth Ramya Department of Computer Science and Engineering NRI Institute of Technology Andhra Pradesh Guntur India Department of Electronics and Communication Engineering Malla Reddy Engineering College Telangana Hyderabad India Department of Data Science and Business Systems School of Computing SRMIST Kattankulathur Chennai India Department of Computer Science and Engineering Panimalar Engineering College Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vijayawada India

Researchers have recently created several deep learning strategies for various tasks, and facial recognition has made remarkable progress in employing these techniques. Face recognition is a noncontact, nonobligatory, acceptable, and harmonious biometric recognition method with a promising national and social security future. The purpose of this paper is to improve the existing face recognition algorithm, investigate extensive data-driven face recognition methods, and propose a unique automated face recognition methodology based on generative adversarial networks (GANs) and the center symmetric multivariable local binary pattern (CS-MLBP). To begin, this paper employs the center symmetric multivariant local binary pattern (CS-MLBP) algorithm to extract the texture features of the face, addressing the issue that C2DPCA (column-based two-dimensional principle component analysis) does an excellent job of removing the global characteristics of the face but struggles to process the local features of the face under large samples. The extracted texture features are combined with the international features retrieved using C2DPCA to generate a multifeatured face. The proposed method, GAN-CS-MLBP, syndicates the power of GAN with the robustness of CS-MLBP, resulting in an accurate and efficient face recognition system. Deep learning algorithms, mainly neural networks, automatically extract discriminative properties from facial images. The learned features capture low-level information and high-level meanings, permitting the model to distinguish among dissimilar persons more successfully. To assess the proposed technique’s GAN-CS-MLBP performance, extensive experiments are performed on benchmark face recognition datasets such as LFW, YTF, and CASIA-WebFace. Giving to the findings, our method exceeds state-of-the-art facial recognition systems in terms of recognition accuracy and resilience. The proposed automatic face recognition system GAN-CS-MLBP provides a solid basis for a

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Gloss-driven Conditional Diffusion Models for Sign Language Production

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2025年第4期21卷 1-17页

作者： Tang, Shengeng Xue, Feng Wu, Jingjing Wang, Shuo Hong, Richang School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Software Hefei University of Technology Hefei China School of Data Science School of Information Science and Technology University of Science and Technology of China Hefei China

Sign Language Production (SLP) aims to convert text or audio sentences into sign language videos corresponding to their semantics, which is challenging due to the diversity and complexity of sign languages, and cross-modal semantic mapping issues. In this work, we propose a Gloss-driven Conditional Diffusion Model (GCDM) for SLP. The core of the GCDM is a diffusion model architecture, in which the sign gloss sequence is encoded by a Transformer-based encoder and input into the diffusion model as a semantic prior condition. In the process of sign pose generation, the textual semantic priors carried in the encoded gloss features are integrated into the embedded Gaussian noise via cross-attention. Subsequently, the model converts the fused features into sign language pose sequences through T-round denoising steps. During the training process, the model uses the ground-truth labels of sign poses as the starting point, generates Gaussian noise through T rounds of noise, and then performs T rounds of denoising to approximate the real sign language gestures. The entire process is constrained by the MAE loss function to ensure that the generated sign language gestures are as close as possible to the real labels. In the inference phase, the model directly randomly samples a set of Gaussian noise, generates multiple sign language gesture sequence hypotheses under the guidance of the gloss sequence, and outputs a high-confidence sign language gesture video by averaging multiple hypotheses. Experimental results on the Phoenix2014T dataset show that the proposed GCDM method achieves competitiveness in both quantitative performance and qualitative visualization. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Forming

来源：评论

学校读者我要写书评

暂无评论

Federated Learning-Based Offset-Free Distributed Control of Nonlinear Networked Systems With Application to IIoT

引用

IEEE Transactions on Network Science and engineering 2025年第3期12卷 1859-1871页

作者： Xu, Zeyuan Wang, Yujia Wu, Zhe Zheng, Wei Xing Hu, Cheng National University of Singapore Department of Chemical and Biomolecular Engineering 117585 Singapore Western Sydney University School of Computer Data and Mathematical Sciences SydneyNSW2751 Australia Shanghai University School of Mechatronic Engineering and Automation Shanghai200444 China

Preserving data privacy in data-driven modeling for the Industrial Internet of Things (IIoT) has become critically important due to the susceptibility of communication data from numerous devices to cyber-attacks. Given its multi-subsystem integration, nonlinear interactions, and networking characteristics, IIoT can be modeled as nonlinear networked systems (NNSs). This paper presents a federated learning-based offset-free distributed control (FL-OFDC) method for NNSs with multiple subsystems to preserve data privacy and achieve offset-free control, with potential applications to IIoT. First, a novel FL algorithm with personalized optimization (FLPO) is proposed to simultaneously obtain global and local models using a simple algorithm framework, which can preserve data privacy and address the heterogeneity issue among subsystems. Subsequently, a novel information-theoretic bound for the generalization error of the FLPO algorithm with iteration properties is constructed using individual sample mutual information. Next, an FL-OFDC scheme for NNSs under external disturbances is developed to eliminate the offset, and its closed-loop stability criteria are derived. Finally, a chemical process network, that is, a specific case of IIoT, is employed to demonstrate the practicality of the FLPO and FL-OFDC methods. © 2013 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless Networks

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Future Network of Intelligence Institute School of Science and Engineering Shenzhen518172 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen518060 China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

SPDGrNet: A Lightweight and Efficient Image Classification Network for Zea mays Diseases

引用

Journal of Crop Health 2025年第3期77卷 1-12页

作者： Xu, Laixiang Cao, Bingxu Su, Jing feng Zhang, Fengyue Song, Hongyun Zhao, Junmin School of Computer and Data Science Research Center of Smart City and Big Data Engineering of Henan Province Henan University of Urban Construction Pingdingshan 467036 China School of Information Engineering Luohe Vocational Technology College Henan Luohe China Institute of Technology University of Technology Luohe Luohe 462000 China School of Computer and Data Science Innovation Laboratory of Smart Traffic and Big Data Development of Hainan Province Henan University of Urban Construction Pingdingshan 467036 China School of Computer and Data Science Henan University of Urban Construction Pingdingshan 467036 China School of Computer and Data Science Research Center of Smart City and Big Data Engineering of Henan Province Research Center of Intelligent Campus Application Engineering of Henan Province Innovation Laboratory of Smart Traffic and Big Data Development of Hainan Province Henan University of Urban Construction Pingdingshan 467036 China

Controlling diseases on the foliage of cultivated plants has a major impact on crop yield and quality. Leaf symptoms and environmental information are the basis of crop disease and pest identification. Due to the complexity and diversity of disease leaf symptoms and environmental information, the accuracy of crop disease detection methods has decreased. Aiming at low disease identification efficiency and difficult feature modeling, we propose a new deep learning algorithm and obtain ideal results. We used improved convolutional neural networks (CNNs) SPDNet and GrNet (SPDGrNet) to perform Zea mays disease identification. The proposed research and analysis focus on four categories of Zea mays symptoms: healthy, leaf blight, southern leaf blight and grey spot. The experimental results and analysis confirm that the proposed approach outperforms other excellent plant disease recognition algorithms and achieves an overall classification accuracy of 98.96%. When compared to AlexNet, VGG-16, Inception-V4, ShuffleNet-V3, and Efficient-B7, the proposed model achieves accuracy improvements of 27.78%, 19.05%, 14.59%, 10.28%, and 7.06%, respectively, with corresponding accuracies of 71.18%, 79.91%, 84.37%, 88.68%, and 91.9%. The proposed model has outstanding generalization ability in open-source databases, such as the PlantifyDr, Plant Pathology, and New Plant Diseases dataset. The suggested strategy can provide ideas for transplanting models into mobile disease detection equipment. This is very helpful in the intelligent development of agricultural systems and crop leaf disease analysis. © The author(s), exclusively licensed to Springer-Verlag GmbH Germany, a part of Springer Nature 2025.

关键词： Crop leaf disease control Deep learning Disease detection Generalization Zea mays

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Dynamic Flexible Job Shop Scheduling With Biased Objectives via Multitask Genetic Programming

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第1期6卷 169-183页

作者： Zhang, Fangfang Shi, Gaofeng Mei, Yi Zhang, Mengjie Victoria University of Wellington Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Emerson New Plymouth4310 New Zealand

Dynamic flexible job shop scheduling is an important combinatorial optimization problem that has rich real-world applications such as product processing in manufacturing. Genetic programming has been successfully used to learn scheduling heuristics for dynamic flexible job shop scheduling. Intuitively, users prefer small and effective scheduling heuristics that can not only generate promising schedules but also are computationally efficient and easy to be understood. However, a scheduling heuristic with better effectiveness tends to have a larger size, and the effectiveness of rules and rule size are potentially conflicting objectives. With the traditional dominance relation-based multiobjective algorithms, there is a search bias toward rule size, since rule size is much easier to optimized than effectiveness, and larger rules are easily abandoned, resulting in the loss of effectiveness. To address this issue, this article develops a novel multiobjective genetic programming algorithm that takes size and effectiveness of scheduling heuristics for optimization via multitask learning mechanism. Specifically, we construct two tasks for the multiobjective optimization with biased objectives using different search mechanisms for each task. The focus of the proposed algorithm is to improve the effectiveness of learned small rules by knowledge sharing between constructed tasks which is implemented with the crossover operator. The results show that our proposed algorithm performs significantly better, i.e., with smaller and more effective scheduling heuristics, than the state-of-the-art algorithms in the examined scenarios. By analyzing the population diversity, we find that the proposed algorithm has a good balance between exploration and exploitation during the evolutionary process. © 2024 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Highly Robust and Diverse Coverless Image Steganography Against Passive and Active Steganalysis

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2771-2787页

作者： Guo, Bobiao Ping, Ping Xu, Feng Hohai University College of Computer Science and Software Engineering Nanjing210098 China Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing210098 China Jiangsu Ocean University School of Computer Engineering Lianyungang222005 China

To avoid the pixel modification traces left by steganography from being detected by passive steganalysis, and to prevent the hidden data from being destroyed by active steganalysis attacks, Coverless Image Steganography (CIS) that does not modify pixels has attracted widespread attention. However, most existing CIS methods are limited in their maximum capacity due to insufficient diversity in their hash sequences. In addition, these methods struggle to maintain high robustness against both geometric and non-geometric attacks simultaneously. To address these two issues, a new coverless image steganography method is proposed to enhance CIS methods’ applicability, security, and robustness in highly insecure networks. During the hiding process, hash sequences are generated by a SHA-256 algorithm that integrates inter-block and inter-channel fusion, providing higher diversity than other CIS methods. Consequently, the proposed CIS method achieves higher capacity on publicly available datasets. During the extraction process, an evaluation metric that combines visual and histogram similarity is designed to improve the accuracy of inverse image retrieval. The experimental results demonstrate that the proposed CIS method achieves capacity increases of 26.73% and 38.34% over other CIS methods on the VOC and COCO datasets, respectively. Moreover, this method exhibits nearly 100% robustness against common active steganalysis. © 2004-2012 IEEE.

关键词： Steganography Robustness Feature Extraction data Mining Image Retrieval Visualization Accuracy Software Indexes Histograms Coverless Image Steganography CIS Hash Generation Algorithm Inverse Image Retrieval Steganalysis High Robustness Robust Image Image Coding Hidden Information Retrieval Accuracy Visual Similarity COCO dataset Convolutional Neural Network Computational Complexity Robust Method Image dataset Bit Error Rate Types Of Attacks Auxiliary Information Scale Invariant Feature Transform Index database Histogram Bins Length Information Cover Image Military Intelligence Secret Information Center Crop Secure Transmission Salt And Pepper Noise XOR Operation Number Of Different Sequences JPEG Compression Generative Adversarial Networks Pixel Position Common Attacks

来源：评论

学校读者我要写书评

暂无评论

T³Planner: Multi-Phase Planning Across Structure-Constrained Optical, IP, and Routing Topologies

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1823-1839页

作者： Hao, Yijun Yang, Shusen Li, Fang Zhang, Yifan Zhao, Cong Ren, Xuebin Zhao, Peng Xu, Chenren Wang, Shibo Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Xi’an710049 China Xi’an Jiaotong University National Engineering Laboratory for Big Data Analytics Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an710049 China Peking University School of Computer Science Beijing100871 China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University Xi'an710049 China

Network topology planning is an essential multi-phase process to build and jointly optimize the multi-layer network topologies in wide-area networks (WANs). Most existing practices target single-phase/layer planning, and are incapable of satisfying all rigorous topological structure constraints (e.g., dual-homing rings) defined by network standards and operators, especially in large-scale networks. These significantly limit their usability and performance in production networks. We consider a general topology planning problem with typical structure constraints over three essential phases (greenfield, reconfiguration, and site expansion) and topological layers (optical, IP, and routing topologies). We present, T3Planner, a novel practical solver to this problem in production. Specifically, we develop a structure-driven encoder based on graph neural network (GNN) for concise structure encoding, and design a new learning framework with optical-centric layer compression/reconstruction and rule-aided reinforcement learning (RL) for fast convergence and high performance. Extensive experiments on nine real topologies demonstrate that T3Planner scales to large optical networks with hundreds of sites, saves 46.6% cost, and supports 3.12x more demand when compared to related existing approaches. © 1983-2012 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

A Parallel Color Image Encryption Algorithm Based on a 2D Logistic-Rulkov Neuron Map

引用

IEEE Internet of Things Journal 2025年第11期12卷 18115-18124页

作者： Gao, Suo Zhang, Zheyi Ho-Ching Iu, Herbert Ding, Siqi Mou, Jun Erkan, Uğur Toktas, Abdurrahim Li, Qi Wang, Chunpeng Cao, Yinghong The School of Information Science and Engineering Dalian Polytechnic University Dalian116034 China School of Electrical Electronic and Computer Engineering The University of Western Australia Perth6009 Australia School of Mathematical Sciences Dalian University of Technology Dalian116024 China Department of Computer Engineering Faculty of Engineering Karamanoglu Mehmetbey University Karaman70200 Turkey Department of Artificial Intelligence and Data Engineering Engineering Faculty Ankara University Ankara06830 Turkey Jinan250000 China

Images are widely used in social networks, necessitating efficient and secure transmission, especially in bandwidth-constrained environments. This paper aims to develop a color image encryption algorithm that enhances security while optimizing computational efficiency. A novel parallel color image encryption algorithm based on the 2D Logistic-Rulkov neuron map (2D-LRNM) is proposed. In this approach, the three channels of the color image are first separated. Cross-channel information interaction is introduced to form three new channels, which are then processed in parallel. During the encryption process of each channel, a block-wise parallel encryption mechanism is applied, ensuring simultaneous encryption of each block. This block-wise strategy effectively leverages parallel computing resources and balances the task load. To meet the demand for a large number of keystreams during encryption, the 2D-LRNM is introduced. It combines the simplicity and chaotic properties of the Logistic map with the multi-timescale dynamics and neurodynamic behaviors of the Rulkov map. By overcoming the dimensional limitations inherent in the single Logistic map, this approach extends the system to a two-dimensional framework, significantly increasing the complexity of chaotic behavior and improving its unpredictability. Experimental results demonstrate that the proposed encryption algorithm achieves high security and reduces computation time by approximately 83.3%. © 2014 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Service Composition Based on DQN in Multiple Clouds 24

Research on Service Composition Based on DQN in Multiple Clo...

引用

5th International Conference on computer Science and Management Technology, ICCSMT 2024

作者： Yang, Yanhua Zhan, Xinrong College of Computer Engineering Jimei University Fujian Xiamen China School of Data and Computer Science Xiamen Institute of Technology Fujian Xiamen China

ISBN: (纸本)9798400709999

Service organized all kinds of services to one for the *** the cloud environment, the services and related QoSs (Quality of Services) in every cloud may be *** this paper, how to compose those services together in the multiple clouds environment is the *** use a SCDQN (Service Composition based a Deep-Q-Network) method, and consider the execution time, privacy level, cost and availability of the service and the service request in the multiple *** show that SCDQN has a lower value in the execution time and cost while satisfying privacy level and availability requirement. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： DQN

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：