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

Local-Tetra-Patterns for Face Recognition Encoded on Spatial Pyramid Matching

computers, Materials & Continua 2022年第3期70卷 5039-5058页

作者： Khuram Nawaz Khayam Zahid Mehmood Hassan Nazeer Chaudhry Muhammad Usman Ashraf Usman Tariq Mohammed Nawaf Altouri Khalid Alsubhi Department of Software Engineering University of Engineering and TechnologyTaxila47050Pakistan Department of Computer Engineering University of Engineering and TechnologyTaxila47050Pakistan Department of Electronics Information and BioengineeringPolitecnico di MilanoMilano20122Italy Department of Computer Science University of Management and TechnologySialkotPakistan College of Computer Engineering and Science Prince Sattam bin Abdulaziz UniversityAlkharj16278Saudi Arabia Department of Computer Science Imam Mohammad Ibn Saud Islamic UniversityRiyadh13318Saudi Arabia Department of Computer Science King Abdulaziz UniversityJeddah21589Saudi Arabia

Face recognition is a big challenge in the research field with a lot of problems like misalignment,illumination changes,pose variations,occlusion,and *** a single solution to solve all these problems at a time is a challenging *** have put some effort to provide a solution to solving all these issues by introducing a face recognition model based on local tetra patterns and spatial pyramid *** technique is based on a procedure where the input image is passed through an algorithm that extracts local features by using spatial pyramid matching ***,the input image is recognized using a robust kernel representation method using extracted *** qualitative and quantitative analysis of the proposed method is carried on benchmark image *** results showed that the proposed method performs better in terms of standard performance evaluation parameters as compared to state-of-the-art methods on AR,ORL,LFW,and FERET face recognition datasets.

关键词： Face recognition local tetra patterns spatial pyramid matching robust kernel representation max-pooling

来源：评论

学校读者我要写书评

暂无评论

EdgeAuth: An intelligent token-based collaborative authentication scheme

EdgeAuth: An intelligent token-based collaborative authentic...

引用

作者： Jiang, Xutong Dou, Ruihan He, Qiang Zhang, Xuyun Dou, Wanchun State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Faculty of Mathematics University of Waterloo Waterloo Canada Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Department of Computing Macquarie University Sydney Australia College of Big Data and Intelligent Engineering Southwest Forestry University China

Edge computing is regarded as an extension of cloud computing that brings computing and storage resources to the network edge. For some Industrial Internet of Things (IIoT) applications such as supply-chain supervision and collaboration, Internet of Vehicles, real-time video analysis and so forth, users should be authenticated before visiting the geographically distributed edge servers. Limited by the considerable latency between the cloud and edge servers, and the limited capacity of edge servers, it is infeasible to copy the authentication method from cloud servers when users are authenticated in edge servers. In view of this challenge, this paper proposes a novel token-based authentication scheme, named EdgeAuth, that enables fast edge user authentication through collaboration among cloud servers and edge servers. Under the EdgeAuth scheme, edge servers can rapidly verify the credentials of users who have been authenticated by the cloud server. EdgeAuth can also protect users from a series of authentication attacks, for example, the replay attack, DoS attack and man-in-the-middle attack. The results of experiments conducted on a simulated edge computing environment validate the usefulness of EdgeAuth through a comparison in latency and throughput against two baseline schemes. © 2023 John Wiley & Sons Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Video2Reward: Generating Reward Function from Videos for Legged Robot Behavior Learning 27

Video2Reward: Generating Reward Function from Videos for Leg...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zeng, Runhao Zhou, Dingjie Liang, Qiwei Liu, Junlin Li, Hui Huang, Changxin Li, Jianqiang Hu, Xiping Sun, Fuchun Artificial Intelligence Research Institute Shenzhen MSU-BIT University China College of Mechatronics and Control Engineering Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781643685489

Learning behavior in legged robots presents a significant challenge due to its inherent instability and complex constraints. Recent research has proposed the use of a large language model (LLM) to generate reward functions in reinforcement learning, thereby replacing the need for manually designed rewards by experts. However, this approach, which relies on textual descriptions to define learning objectives, fails to achieve controllable and precise behavior learning with clear directionality. In this paper, we introduce a new video2reward method, which directly generates reward functions from videos depicting the behaviors to be mimicked and learned. Specifically, we first process videos containing the target behaviors, converting the motion information of individuals in the videos into keypoint trajectories represented as coordinates through a video2text transforming module. These trajectories are then fed into an LLM to generate the reward function, which in turn is used to train the policy. To enhance the quality of the reward function, we develop a video-assisted iterative reward refinement scheme that visually assesses the learned behaviors and provides textual feedback to the LLM. This feedback guides the LLM to continually refine the reward function, ultimately facilitating more efficient behavior learning. Experimental results on tasks involving bipedal and quadrupedal robot motion control demonstrate that our method surpasses the performance of state-of-the-art LLM-based reward generation methods by over 37.6% in terms of human normalized score. More importantly, by switching video inputs, we find our method can rapidly learn diverse motion behaviors such as walking and running. © 2024 The Authors.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

BiCSA-PUL: binary crow search algorithm for enhancing positive and unlabeled learning

引用

International Journal of Information Technology (Singapore) 2025年第3期17卷 1729-1743页

作者： Azizi, Nabil Ben Othmane, Mohamed Hamouma, Moumen Siam, Abderrahim Haouassi, Hichem Ledmi, Makhlouf Hamdi-Cherif, Aboubekeur Department of Computer Science Mostefa Ben Boulaid University Batna 2 Batna 05001 Algeria Department of Computer Science Abbes Laghrour University Khenchela 40004 Algeria Knowledge Engineering and IT Security Laboratory (ICOSI) Abbes Laghrour University Khenchela 40004 Algeria Department of Computer Science Ferhat Abbas University of Setif 1 Setif 19137 Algeria

This paper presents a novel metaheuristic binary crow search algorithm (CSA) designed for positive-unlabeled (PU) learning, a paradigm where only positive and unlabeled data are available, with applications in many diversified fields, such as medical diagnosis and fraud detection. The algorithm represent a useful adaptation of CSA, itself inspired by the food-hiding behavior of crows. The proposed BiCSA-PUL (binary crow search algorithm for positive-unlabeled learning) selects reliable negative samples from unlabeled data using binary vectors, and updates positions employing Hamming distance, guided by a modified F1-score, as fitness function. The algorithm was tested on 30 samples from 10 diverse datasets, outperforming seven state-of-the-art PU learning methods. The results reveal that BiCSA-PUL provides a robust and efficient approach for PU learning, significantly improving fitness and reliability. This work opens new avenues for applying metaheuristic optimization methods to challenging classification problems with limited labeled data. The main limitations are the potentially time-intensive process of parameters tuning and reliance on initial sampling. © Bharati Vidyapeeth's Institute of computer Applications and Management 2024.

关键词： Classification Machine learning Metaheuristic optimization Positive and unlabeled learning Raw search algorithm Two-step algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust graph‐based localization for industrial Internet of things in the presence of flipping ambiguities

引用

CAAI Transactions on Intelligence Technology 2023年第4期8卷 1140-1149页

作者： Mian Imtiaz ul Haq Ruhul Amin Khalil Muhannad Almutiry Ahmad Sawalmeh Tanveer Ahmad Nasir Saeed Faculty of Electrical Engineering Swedish College of Engineering and TechnologyWah CanttPakistan Department of Electrical Engineering Faculty of Electrical and Computer EngineeringUniversity of Engineering and TechnologyPeshawarPakistan Department of Electrical Engineering Remote Sensing UnitNorthern Border UniversityArarSaudi Arabia Data Science and Artificial Intelligence Department‐College of Science and Information Technology Irbid National UniversityIrbadJordan Innovation Education and Research Center for On‐Device AI Software(Bk21) Department of Computer Science and EngineeringChungnam National UniversityDaejeonRepublic of Korea Department of Electrical and Communication Engineering United Arab Emirates University(UAEU)Al AinUnited Arab Emirates

Localisation of machines in harsh Industrial Internet of Things(IIoT)environment is necessary for various ***,a novel localisation algorithm is proposed for noisy range measurements in IIoT *** position of an unknown machine device in the network is estimated using the relative distances between blind machines(BMs)and anchor machines(AMs).Moreover,a more practical and challenging scenario with the erroneous position of AM is considered,which brings additional uncertainty to the final position ***,the AMs selection algorithm for the localisation of BMs in the IIoT network is *** those AMs will participate in the localisation process,which increases the accuracy of the final location ***,the closed‐form expression of the proposed greedy successive anchorization process is derived,which prevents possible local convergence,reduces computation,and achieves Cramér‐Rao lower bound accuracy for white Gaussian measurement *** results are compared with the state‐of‐the‐art and verified through numerous simulations.

关键词： Cramér‐Rao lower bound greedy successive anchorization industrial internet of things localization

来源：评论

学校读者我要写书评

暂无评论

Person Re-Identification Based on Instance Segmentation and Pose Estimation 6

Person Re-Identification Based on Instance Segmentation and ...

引用

6th IEEE International Conference on Pattern Recognition and Artificial Intelligence, PRAI 2023

作者： Zhou, Yao Qin, Yusong Wang, Song Huang, Zengxi Zhang, Dazhi Xihua University School of Computer Science and Software Engineering Chengdu China Xihua University School of Computer and Software Engineering and the Sichuan Xihua Jiaotong Forensics Center Chengdu China Sichuan Police College Criminal Science and Technology Department Luzhou China

ISBN: (纸本)9798350325485

Person Re-Identification (ReID) is a crucial task in computer vision that aims to match persons captured from non-overlapping camera views. In this paper, to alleviate the impacts of background and occlusion, we propose to use instance segmentation and pose estimation methods to create masks for global feature extraction. Furthermore, we divide the pedestrian images into three regions according to pedestrian keypoints, trying to eliminate the alignment errors. This part-based matching strategy also helps to address the occlusion issue. Overall, we construct a deep learning network with three branches, including two global branches and a part-based branch. The two global branches extract global features using segmentation-based mask and the mask derived from pedestrian keypoint heatmaps, respectively. In the end, a weighted fusion strategy is used to combine the global scores and part-based scores for final classification. This network enables us to acquire robust global feature of pedestrians by excluding background and occlusion, and simultaneously address the alignment errors to some extent. Experimental results on these three widely used datasets demonstrate the effectiveness of our method: Specifically, it achieves 64.5% rank-1 accuracy and 54.3% mAP on Occluded-Duke, and 94.4% and 87.1% rank-1 accuracies on Market-1501 and DukeMTMC-reID, respectively. © 2023 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach 31

HPC Application Parameter Autotuning on Edge Devices: A Band...

引用

31st Annual IEEE International Conference on High Performance Computing, Data, and Analytics, HiPC 2024

作者： Hossain, Abrar Badawy, Abdel-Hameed A. Islam, Mohammad A. Patki, Tapasya Ahmed, Kishwar Department of Electrical Engineering and Computer Science The University of Toledo United States Department of Electrical and Computer Engineering New Mexico State University United States Department of Computer Science and Engineering The University of Texas Arlington United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9798331509095

The growing necessity for enhanced processing capabilities in edge devices with limited resources has led us to develop effective methods for improving high-performance computing (HPC) applications. In this paper, we introduce LASP (Lightweight Autotuning of Scientific Application Parameters), a novel strategy designed to address the parameter search space challenge in edge devices. Our strategy employs a multi-armed bandit (MAB) technique focused on online exploration and exploitation. Notably, LASP takes a dynamic approach, adapting seamlessly to changing environments. We tested LASP with four HPC applications: Lulesh, Kripke, Clomp, and Hypre. Its lightweight nature makes it particularly well-suited for resource-constrained edge devices. By employing the MAB framework to efficiently navigate the search space, we achieved significant performance improvements while adhering to the stringent computational limits of edge devices. Our experimental results demonstrate the effectiveness of LASP in optimizing parameter search on edge devices. © 2024 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Ciphertext-only fault analysis of GIFT lightweight cryptosystem

引用

science China(Information sciences) 2022年第3期65卷 263-265页

作者： Wei LI Shan CAO Dawu GU Jiayao LI Tianpei CAI Menglin WANG Li SUN Zhiqiang LIU Ya LIU School of Computer Science and Technology Donghua University Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Laboratory of Computing and Systems Shanghai Jiao Tong University Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai Jiao Tong University Department of Computer Science and Engineering University of Shanghai for Science and Technology

Dear editor,The GIFT cryptosystem was proposed by Banik et al. [1]in CHES 2017. It can be widely applied to protect RFID tags and other low-resource devices. It has an SPN structure with a fixed 128-bit key size and two flexible variants of 64-bit and 128-bit block sizes. In simulations, GIFT achieves good performance and surpasses both SIMON and SKINNY [1]. In 2013, Fuhr et al. [2] proposed a ciphertextonly fault analysis(CFA) of AES for three types of faults:zero-byte fault, zero-nibble fault,

关键词： lightweight cryptosystem GIFT ciphertext-only fault analysis cryptanalysis fault analysis

来源：评论

学校读者我要写书评

暂无评论

CA-FedRC: Codebook Adaptation Via Federated Reservoir Computing in 5G NR

引用

IEEE Transactions on Vehicular Technology 2025年第6期74卷 9995-9999页

作者： Ye, Ziqiang Liao, Sikai Gao, Yulan Fang, Shu Xiao, Yue Xiao, Ming Zammit, Saviour University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China KTH Royal Institute of Technology Division of Information Science and Engineering Stockholm10044 Sweden University of Malta Department of Communications and Computer Engineering Msida2080 Malta

With the burgeon deployment of the fifth-generation new radio (5 G NR) networks, the codebook plays a crucial role in enabling the base station (BS) to acquire the channel state information (CSI). Different 5 G NR codebooks incur varying overheads and exhibit performance disparities under diverse channel conditions, necessitating codebook adaptation based on channel conditions to reduce feedback overhead while enhancing performance. However, existing methods of 5 G NR codebooks adaptation require significant overhead for model training and feedback or fall short in performance. To address these limitations, this letter introduces a federated reservoir computing framework designed for efficient codebook adaptation in computationally and feedback resource-constrained mobile devices. This framework utilizes a novel series of indicators as input training data, striking an effective balance between performance and feedback overhead. Compared to conventional models, the proposed codebook adaptation via federated reservoir computing (CA-FedRC), achieves rapid convergence and significant loss reduction in both speed and accuracy. Extensive simulations under various channel conditions demonstrate that our algorithm not only reduces resource consumption of users but also accurately identifies channel types, thereby optimizing the trade-off between spectrum efficiency, computational complexity, and feedback overhead. © 1967-2012 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

EMARec: a sequential recommendation with exponential moving average

引用

Neural Computing and Applications 2024年第21期36卷 12917-12933页

作者： Chen, Rui Wang, Zonglin Tang, Cundong Zhang, Jianwei Li, Pu Kong, Xiangjie Huang, Min College of Software Engineering Zhengzhou University of Light Industry Zhengzhou450001 China Henan Joint International Research Laboratory of Computer Animation Implementation Technologies Zhengzhou450001 China School of Information Science and Technology Northwest University Xi’an710127 China Faculty of Information and Engineering Xuchang Vocational Technical College Xuchang461000 China College of Computer Science and Technology Zhejiang University of Technology Hangzhou310023 China

Capturing dynamic preference features from user historical behavioral data is widely applied to improve the accuracy of recommendations in sequential recommendation tasks. However, existing deep neural network-based sequential recommendation methods often ignore the noise information in user behavioral data that influence recommendation effectiveness, making recommendation models sensitive to noisy data. Additionally, these deep learning-based recommendation models often require a large number of parameters to capture user behavior patterns, leading to higher time complexity and susceptibility to overfitting due to noise fluctuations. To address these issues, in this paper, we apply the moving average concept from the field of time-series analysis to sequential recommendation tasks. The approach smooths sequence data, removes noise, making the data more stable and reliable, increases the model’s insensitivity to noise information, and better understands the evolution of user interests and behavioral patterns. Specifically, in our experiments, the moving average algorithm effectively denoises sequential data with low time complexity. Therefore, we propose a Sequential Recommendation with Exponential Moving Average with MLP architecture that makes the model more competitive in terms of time complexity. Experimental results conducted on two datasets demonstrate that EMARec outperforms state-of-the-art sequential recommendation methods across various common evaluation metrics. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：