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

Deep Learning Based Face Detection and Identification of Criminal Suspects

computers, Materials & Continua 2023年第2期74卷 2331-2343页

作者： S.Sandhya A.Balasundaram Ayesha Shaik School of Computer Science and Engineering Vellore Institute of Technology(VIT)Chennai600127India School of Computer Science and Engineering Center for Cyber Physical SystemsVellore Institute of Technology(VIT)Chennai600127India

Occurrence of crimes has been on the constant rise despite the emerging discoveries and advancements in the technological field in the past *** of the most tedious tasks is to track a suspect once a crime is *** most of the crimes are committed by individuals who have a history of felonies,it is essential for a monitoring system that does not just detect the person’s face who has committed the crime,but also their ***,a smart criminal detection and identification system that makes use of the OpenCV Deep Neural Network(DNN)model which employs a Single Shot Multibox Detector for detection of face and an auto-encoder model in which the encoder part is used for matching the captured facial images with the criminals has been *** detection and extraction of the face in the image by face cropping,the captured face is then compared with the images in the *** comparison is performed by calculating the similarity value between each pair of images that are obtained by using the Cosine Similarity *** plotting the values in a graph to find the threshold value,we conclude that the confidence rate of the encoder model is 0.75 and above.

关键词： Deep learning opencv deep neural network single shot multi-box detector auto-encoder cosine similarity

来源：评论

学校读者我要写书评

暂无评论

Structure-Sensitive Graph Dictionary Embedding for Graph Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2962-2972页

作者： Liu, Guangbu Zhang, Tong Wang, Xudong Zhao, Wenting Zhou, Chuanwei Cui, Zhen Nanjing University of Science and Technology Key Laboratory of Intelligent Perception and Systems for High-Dimensional School of Computer Science and Engineering Nanjing210094 China

Graph structure expression plays a vital role in distinguishing various graphs. In this work, we propose a structure-sensitive graph dictionary embedding (SS-GDE) framework to transform input graphs into the embedding space of a graph dictionary for the graph classification task. Instead of a plain use of a base graph dictionary, we propose the variational graph dictionary adaptation (VGDA) to generate a personalized dictionary (named adapted graph dictionary) for catering to each input graph. In particular, for the adaptation, the Bernoulli sampling is introduced to adjust substructures of base graph keys according to each input, which increases the expression capacity of the base dictionary tremendously. To make cross-graph measurement sensitive as well as stable, multisensitivity Wasserstein encoding is proposed to produce the embeddings by designing multiscale attention on optimal transport. To optimize the framework, we introduce mutual information as the objective, which further deduces variational inference of the adapted graph dictionary. We perform our SS-GDE on multiple datasets of graph classification, and the experimental results demonstrate the effectiveness and superiority over the state-of-the-art methods. © 2020 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Scheduling Dual-Arm Multi-Cluster Tools With Regulation of Post-Processing Time

引用

IEEE/CAA Journal of Automatica Sinica 2023年第8期10卷 1730-1742页

作者： Qinghua Zhu Bin Li Yan Hou Hongpeng Li Naiqi Wu IEEE the School of Computer Science and Technology Guangdong University of TechnologyGuangzhou 510006China the Institute of Systems Engineering and Collaborative Laboratory for Intelligent Science and Systems Macao University of Science and TechnologyMacao 999078China

As wafer circuit width shrinks down to less than ten nanometers in recent years,stringent quality control in the wafer manufacturing process is increasingly *** to the coupling of neighboring cluster tools and coordination of multiple robots in a multi-cluster tool,wafer production scheduling becomes rather *** a wafer is processed,due to high-temperature chemical reactions in a chamber,the robot should be controlled to take it out of the processing chamber at the right *** order to ensure the uniformity of integrated circuits on wafers,it is highly desirable to make the differences in wafer post-processing time among the individual tools in a multicluster tool as small as *** achieve this goal,for the first time,this work aims to find an optimal schedule for a dual-arm multi-cluster tool to regulate the wafer post-processing *** do so,we propose polynomial-time algorithms to find an optimal schedule,which can achieve the highest throughput,and minimize the total post-processing time of the processing *** propose a linear program model and another algorithm to balance the differences in the post-processing time between any pair of adjacent cluster *** industrial examples are given to illustrate the application and effectiveness of the proposed method.

关键词： Cluster tool optimization scheduling

来源：评论

学校读者我要写书评

暂无评论

A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion:Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows

引用

Complex System Modeling and Simulation 2024年第2期4卷 137-165页

作者： Qianhui Ji Yuyan Han Yuting Wang Biao Zhang Kaizhou Gao the School of Computer Science Liaocheng UniversityLiaocheng 252059China Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China

The hybrid flow shop group scheduling problem(HFGSP)with the delivery time windows has been widely studied owing to its better flexibility and suitability for the current just-in-time production ***,there are several unresolved challenges in problem modeling and algorithmic design tailored for *** our study,we place emphasis on the constraint of ***,this paper first constructs a mixed integer linear programming model of HFGSP with sequence-dependent setup time and delivery time windows to minimize the total weighted earliness and tardiness(TWET).Then a penalty groups-assisted iterated greedy integrating idle time insertion(PG IG ITI)is proposed to solve the above *** the PG IG ITI,a double decoding strategy is proposed based on the earliest available machine rule and the idle time insertion rule to calculate the TWET ***,to reduce the amount of computation,a skip-based destruction and reconstruction strategy is designed,and a penalty groups-assisted local search is proposed to further improve the quality of the solution by disturbing the penalized groups,i.e.,early and tardy ***,through comprehensive statistical experiments on 270 test instances,the results prove that the proposed algorithm is effective compared to four state-of-the-art algorithms.

关键词： hybrid flow shop group scheduling iterated greedy algorithm delivery time windows sequence-dependent setup time

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 528-538页

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

来源：评论

学校读者我要写书评

暂无评论

DERNNet:Dual Encoding Recurrent Neural Network Based Secure Optimal Routing in WSN

引用

computer systems science & engineering 2023年第5期45卷 1375-1392页

作者： A.Venkatesh S.Asha School of Computer Science and Engineering Vellore Institute of TechnologyChennaiIndia Centre for Cyber Physical Systems&School of Computer Science and Engineering Vellore Institute of TechnologyChennaiIndia

A Wireless Sensor Network(WSN)is constructed with numerous sensors over geographical *** basic challenge experienced while designing WSN is in increasing the network lifetime and use of low *** sensor nodes are resource constrained in nature,novel techniques are essential to improve lifetime of nodes in *** energy is considered as an important resource for sensor node which are battery powered *** WSN,energy is consumed mainly while data is being transferred among nodes in the *** research works are carried out focusing on preserving energy of nodes in the network and made network to live ***,this network is threatened by attacks like vampire attack where the network is loaded by fake ***,Dual Encoding Recurrent Neural network(DERNNet)is proposed for classifying the vampire nodes s node in the ***,the Grey Wolf Optimization(GWO)algorithm helps for transferring the data by determining best solutions to optimally select the aggregation points;thereby maximizing battery/lifetime of the network *** proposed method is evaluated with three standard approaches namely Knowledge and Intrusion Detection based Secure Atom Search Routing(KIDSASR),Risk-aware Reputation-based Trust(RaRTrust)model and Activation Function-based Trusted Neighbor Selection(AF-TNS)in terms of various *** existing methods may lead to wastage of energy due to vampire attack,which further reduce the lifetime and increase average energy consumed in the ***,the proposed DERNNet method achieves 31.4%of routing overhead,23%of end-to-end delay,78.6%of energy efficiency,94.8%of throughput,28.2%of average latency,92.4%of packet delivery ratio,85.2%of network lifetime,and 94.3%of classification accuracy.

关键词： Wireless sensor network vampire nodes lifetime optimal routing energy encryption decryption trust value optimization

来源：评论

学校读者我要写书评

暂无评论

Improved Harris Hawks Algorithm and Its Application in Feature Selection

引用

computers, Materials & Continua 2024年第10期81卷 1251-1273页

作者： Qianqian Zhang Yingmei Li Jianjun Zhan Shan Chen School of Computer Science and Information Engineering Harbin Normal UniversityHarbin150025China College of Systems Engineering National University of Defense TechnologyChangsha410073China

This research focuses on improving the Harris’Hawks Optimization algorithm(HHO)by tackling several of its shortcomings,including insufficient population diversity,an imbalance in exploration ***,and a lack of thorough exploitation *** tackle these shortcomings,it proposes enhancements from three distinct perspectives:an initialization technique for populations grounded in opposition-based learning,a strategy for updating escape energy factors to improve the equilibrium between exploitation and exploration,and a comprehensive exploitation approach that utilizes variable neighborhood search along with mutation *** effectiveness of the Improved Harris Hawks Optimization algorithm(IHHO)is assessed by comparing it to five leading algorithms across 23 benchmark test *** findings indicate that the IHHO surpasses several contemporary algorithms its problem-solving ***,this paper introduces a feature selection method leveraging the IHHO algorithm(IHHO-FS)to address challenges such as low efficiency in feature selection and high computational costs(time to find the optimal feature combination and model response time)associated with high-dimensional *** analyses between IHHO-FS and six other advanced feature selection methods are conducted across eight *** results demonstrate that IHHO-FS significantly reduces the computational costs associated with classification models by lowering data dimensionality,while also enhancing the efficiency of feature ***,IHHO-FS shows strong competitiveness relative to numerous algorithms.

关键词： HHO IHHO population diversity energy factor update strategy deep exploitation strategy feature selection

来源：评论

学校读者我要写书评

暂无评论

IMPROVEMENT OF THE ACO ALGORITHM FOR INTELLIGENT TASK SCHEDULING IN CLOUD systems

引用

Scalable Computing 2025年第2期26卷 531-539页

作者： DJEBBAR, ESMA INSAF BELALEM, GHALEM Department of Computer Science Systems Engineering National Polytechnic School of Oran-Maurie Audin Oran Algeria Department of Computer Science University of Oran1-Ahmed Ben Bella Algeria

Cloud computing involves accessing and using computing resources, such as servers, storage, and software applications, over the Internet, enabling scalable access on demand. Cloud computing systems are becoming an essential platform for scientific applications. They enable task scheduling and IT resource allocation. When these resources are not enough to meet demand, planning techniques are necessary. We propose to apply an improved ACO algorithm for intelligent task scheduling and appropriate resource allocation in a cloud environment. This work proposes a modified version of the ACO algorithm that can quickly converge to the best solution to further optimize the total response time, the average response time and the total execution cost. The algorithm suggested based on artificial intelligence application of enhanced ACO is compared with the classical ACO algorithm using Cloudsim simulator. The results obtained after the experiments and simulation are very encouraging to adopt this technique. © (2025), (West University of Timisoara). All rights reserved.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

iLIAC: An approach of identifying dissimilar groups on unstructured numerical image dataset using improved agglomerative clustering technique

引用

Multimedia Tools and Applications 2024年第39期83卷 86359-86381页

作者： S, Sreedhar Kumar Ahmed, Syed Thouheed Fathima, Afifa Salsabil Mathivanan, Sandeep Kumar Jayagopal, Prabhu Saif, Abdu Gupta, Sachin Kumar Sinha, Garima Department of Computer Science and Engineering School of Engineering and Technology CMR University Karnataka Bengaluru India Department of Electrical Engineering Indian Institute of Technology Hyderabad Telangana Kandi India School of Computer Science and Engineering REVA University Bangalore India School of Computer Science and Engineering Galgotias University Uttar Pradesh Greater Noida203201 India School of Computer Science Engineering and Information Systems Vellore Institute of Technology Tamil Nadu Vellore632014 India Department of Communication and Computer Engineering Faculty of Engineering and IT Taiz University Taiz Yemen Katra India Department of Computer Science Engineering Jain University Bangalore India

Unstructured Numerical Image Dataset Separation (UNIDS) method employing an enhanced unsupervised clustering technique. The objective is to delineate an optimal number of distinct groups within the input grayscale (G-S) image content, utilizing the improved limited iteration agglomerative clustering (iLIAC) clustering technique for the separation and enhancement of picture elements. The UNIDS method is structured into two primary stages: partitioning and validation. In the partitioning stage, the UNIDS method identifies an appropriate number of discrete clusters within the grayscale image using the iLIAC technique, eliminating the need for predetermined procedures. Subsequently, the method evaluates the similarity and deviation among data elements within the same group in the resultant image dataset. Additionally, it assesses the proximity and inters severance among clusters in the outcome of the image dataset through the partitioning process. Empirical results indicate that the UNIDS system excels in the spontaneous identification of an optimal number of discrete clusters within the input G-S image. The system demonstrates superior thickness, reduced deviation among data elements within the same cluster, increased inter-separation, and diminished inter-closeness between cluster elements. Furthermore, empirical analysis establishes the superior performance of the UNIDS approach compared to existing clustering techniques. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：