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

Binary Image Steganalysis Based on Symmetrical Local Residual Patterns

Chinese Journal of Electronics 2022年第4期31卷 752-763页

作者： LUO Junwei YU Mujian YIN Xiaolin LU Wei School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security TechnologyMinistry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University

Residual computation is an effective method for gray-scale image steganalysis. For binary images, the residual computation calculated by the XOR operation is also employed in the local residual patterns(LRP) model for steganalysis. A binary image steganalytic scheme based on symmetrical local residual patterns(SLRP) is proposed. The symmetrical relationships among residual patterns are introduced that make the features more compact while reducing the dimensionality of the features set. Multi-scale windows are utilized to construct three SLRP submodels which are further merged to construct the final features set instead of a single *** with higher probability to be modified after embedding are emphasized and selected to construct the feature sets for training the support vector machine classifier. The experimental results show that the proposed steganalytic scheme is effective for detecting binary image steganography.

关键词： Information hiding Steganalysis Symmetrical local residual patterns Multi-scale model

来源：评论

学校读者我要写书评

暂无评论

An Opposition-Based Learning Adaptive Chaotic Particle Swarm Optimization Algorithm

引用

Journal of Bionic engineering 2024年第6期21卷 3076-3097页

作者： Chongyang Jiao Kunjie Yu Qinglei Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Strategic Support Force Information Engineering UniversityZhengzhou450001China Henan Information Engineering School Zhengzhou Vocational College of Industrial SafetyZhengzhou450000China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou450001China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou450001China

To solve the shortcomings of Particle Swarm Optimization(PSO)algorithm,local optimization and slow convergence,an Opposition-based Learning Adaptive Chaotic PSO(LCPSO)algorithm was *** chaotic elite opposition-based learning process was applied to initialize the entire population,which enhanced the quality of the initial individuals and the population diversity,made the initial individuals distribute in the better quality areas,and accelerated the search efficiency of the *** inertia weights were adaptively customized during evolution in the light of the degree of premature convergence to balance the local and global search abilities of the algorithm,and the reverse search strategy was introduced to increase the chances of the algorithm escaping the local *** LCPSO algorithm is contrasted to other intelligent algorithms on 10 benchmark test functions with different characteristics,and the simulation experiments display that the proposed algorithm is superior to other intelligence algorithms in the global search ability,search accuracy and convergence *** addition,the robustness and effectiveness of the proposed algorithm are also verified by the simulation results of engineering design problems.

关键词： PSO Opposition-based learning Chaotic motion Inertia weight Intelligent algorithm

来源：评论

学校读者我要写书评

暂无评论

Passive on-chip isolators based on the thin-film lithium niobate platform

引用

Chinese Physics B 2025年第3期34卷 408-413页

作者： Jiacheng Liu Gongyu Xia Qilin Hong Pingyu Zhu Kai-Kai Zhang Keyu Xia Ping Xu Shiqiao Qin Zhihong Zhu College of Advanced Interdisciplinary Studies&Hunan Provincial Key Laboratory of Novel Nano Optoelectronic Information Materials and Devices National University of Defense TechnologyChangsha 410073China Institute for Quantum Information and State Key Laboratory of High-Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China College of Engineering and Applied Sciences National Laboratory of Solid State Microstructuresand Collaborative Innovation Center of Advanced MicrostructuresNanjing UniversityNanjing 210023China

Optical isolators,the photonic analogs of electronic diodes,are essential for ensuring the unidirectional flow of light in optical systems,thereby mitigating the destabilizing effects of back ***-film lithium niobate(TFLN),hailed as“the silicon of photonics,”has emerged as a pivotal material in the realm of chip-scale nonlinear optics,propelling the demand for compact optical *** report a breakthrough in the development of a fully passive,integrated optical isolator on the TFLN platform,leveraging the Kerr effect to achieve an impressive 10.3 dB of isolation with a minimal insertion loss of 1.87 *** theoretical simulations have demonstrated that our design,when applied to a microring resonator with a Q factor of 5×10^(6),can achieve 20 dB of isolation with an input power of merely 8 *** advancement underscores the immense potential of lithium niobate-based Kerr-effect isolators in propelling the integration and application of high-performance on-chip lasers,heralding a new era in integrated photonics.

关键词： thin-film lithium niobate Kerr effect optical isolator

来源：评论

学校读者我要写书评

暂无评论

Multi-scale feature fusion for facial expression recognition

引用

Neural Computing and Applications 2025年 1-22页

作者： Guo, Jiatao Peng, Junjie Huang, Yansong Chen, Gan Cai, Zesu Tan, Shuhua School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China School of Computer Science and Technology Harbin Institute of Technology Harbin China National Engineering Laboratory for Logistics Information Technology YTO Express Co. Ltd. Shanghai China

As an important computer vision task that can be used in many areas, facial expression recognition (FER) has been widely studied which much progress has been obtained especially when deep learning (DL) approaches have been introduced in FER. However, existing methods are restricted to extracting localized information or utilizing attention mechanism to focus on the region most relevant to the emotion, possibly resulting in errors in facial expression interpretation. Moreover, the inconsistency of image sizes in the wild FER datasets further increases the difficulty of the FER task. To address these issues, we propose a multi-scale feature fusion (MSFF) for FER. Specifically, our method first extracts features from facial images using multi-scale feature extraction to obtain rich multi-dimensional information. Meanwhile, extensive feature extraction at different scales is achieved by expanding the receptive field of the model, which provides the basis for more detailed analysis of facial expressions. Eventually, features at different scales are fused to enhance their synergistic effect. Subsequently, the adaptive extraction of comprehensive and valuable information from the fused features is performed, optimizing the performance of expression recognition. Extensive experimental results demonstrate that the proposed method outperforms the state-of-the-art methods on in-the-wild datasets. It is promising for FER in realistic and complex scenarios. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Double-branch fusion network with a parallel attention selection mechanism for camouflaged object detection

引用

Science China(Information Sciences) 2023年第6期66卷 258-266页

作者： Junjiang XIANG Qing PAN Zhengrong ZHANG Songnian FU Yuwen QIN Advanced Institute of Photonics Technology School of Information EngineeringGuangdong University of Technology Guangdong Provincial Key Laboratory of Photonics Information Technology Guangdong University of Technology Guangxi Key Laboratory of Multimedia Communications and Network Technology School of Computer Electronics and InformationGuangxi University

To meet the challenge of camouflaged object detection （COD）,which has a high degree of intrinsic similarity between the object and background,this paper proposes a double-branch fusion network（DBFN）with a parallel attention selection mechanism （PASM）.In detail,a schismatic receptive field block（SRF）combined with an attention mechanism for low-level information is performed to learn texture features in one branch,and an integration of the SRF,a hybrid attention mechanism （HAM）,and a depth feature polymerization module （DFPM）is employed for high-level information to extract detection features in the other ***,both texture features and detection features are input into the PASM to acquire selective expression ***,the final result is obtained after further selective matrix optimization with atrous spatial pyramid pooling （ASPP）and a residual channel attention block （RCAB）being applied *** results on three public datasets verify that our method outperforms the state-of-the-art methods in terms of four evaluation metrics,i.e.,mean absolute error （MAE）,weighted F βmeasure （Fβω）,structural measure （Sα）,and E-measure （Eφ）

关键词： camouflaged object detection attention mechanism feature extraction feature aggregation texture information fuzzy boundary

来源：评论

学校读者我要写书评

暂无评论

Accelerating the cryo-EM structure determination in RELION on GPU cluster

引用

Frontiers of computer Science 2022年第3期16卷 21-39页

作者： Xin YOU Hailong YANG Zhongzhi LUAN Depei QIAN Sino-German Joint Software Institute School of Computer Science and EngineeringBeihang UniversityBeijing 100191China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125

The cryo-electron microscopy(cryo-EM)is one of the most powerful technologies available today for structural *** RELION(Regularized Likelihood Optimization)implements a Bayesian algorithm for cryo-EM structure determination,which is one of the most widely used software in this *** researchers have devoted effort to improve the performance of RELION to satisfy the analysis for the ever-increasing volume of *** this paper,we focus on performance analysis of the most time-consuming computation steps in RELION and identify their performance bottlenecks for specific *** propose several performance optimization strategies to improve the overall performance of RELION,including optimization of expectation step,parallelization of maximization step,accelerating the computation of symmetries,and memory affinity *** experiment results show that our proposed optimizations achieve significant speedups of RELION across representative *** addition,we perform roofline model analysis to understand the effectiveness of our optimizations.

关键词： cryo-EM structure determination performance optimization GPU acceleration RELION

来源：评论

学校读者我要写书评

暂无评论

Dark Forest Algorithm:A Novel Metaheuristic Algorithm for Global Optimization Problems

引用

computers, Materials & Continua 2023年第5期75卷 2775-2803页

作者： Dongyang Li Shiyu Du Yiming Zhang Meiting Zhao Faculty of Electrical Engineering and Computer Science Ningbo UniversityNingbo315000China Engineering Laboratory of Advanced Energy Materials Ningbo Institute of Materials Technology and EngineeringChinese Academy of SciencesNingbo315000China School of Material and Chemical Engineering Ningbo UniversityNingbo315000China

Metaheuristic algorithms,as effective methods for solving optimization problems,have recently attracted considerable attention in science and engineering *** are popular and have broad applications owing to their high efficiency and low *** algorithms are generally based on the behaviors observed in nature,physical sciences,or *** study proposes a novel metaheuristic algorithm called dark forest algorithm(DFA),which can yield improved optimization results for global optimization *** DFA,the population is divided into four groups:highest civilization,advanced civilization,normal civilization,and low *** civilization has a unique way of *** verify DFA’s capability,the performance of DFA on 35 well-known benchmark functions is compared with that of six other metaheuristic algorithms,including artificial bee colony algorithm,firefly algorithm,grey wolf optimizer,harmony search algorithm,grasshopper optimization algorithm,and whale optimization *** results show that DFA provides solutions with improved efficiency for problems with low dimensions and outperforms most other algorithms when solving high dimensional *** applied to five engineering projects to demonstrate its *** results show that the performance of DFA is competitive to that of current well-known metaheuristic ***,potential upgrading routes for DFA are proposed as possible future developments.

关键词： Metaheuristic algorithm global optimization

来源：评论

学校读者我要写书评

暂无评论

Self-Triggered Consensus Filtering over Asynchronous Communication Sensor Networks

引用

computer Modeling in engineering & Sciences 2023年第2期134卷 857-871页

作者： Huiwen Xue Jiwei Wen Akshya Kumar Swain Xiaoli Luan Key Laboratory of Advanced Process Control for Light Industry(Ministry of Education) Jiangnan UniversityWuxi214000China Department of Electrical Computer and Software EngineeringUniversity of AucklandAuckland0632New Zealand

In this paper,a self-triggered consensus filtering is developed for a class of discrete-time distributed filtering *** from existing event-triggered filtering,the self-triggered one does not require to continuously judge the trigger condition at each sampling instant and can save computational burden while achieving good state *** triggering policy is presented for pre-computing the next execution time for measurements according to the filter’s own data and the latest released data of its neighbors at the current ***,a challenging problem is that data will be asynchronously transmitted within the filtering network because each node self-triggers ***,a co-design of the self-triggered policy and asynchronous distributed filter is developed to ensure consensus of the state ***,a numerical example is given to illustrate the effectiveness of the consensus filtering approach.

关键词： Self-triggered policy sensor networks distributed consensus filtering

来源：评论

学校读者我要写书评

暂无评论

An algorithm/hardware co-optimized method to accelerate CNNs with compressed convolutional weights on FPGA

An algorithm/hardware co-optimized method to accelerate CNNs...

引用

作者： Shang, Jiangwei Zhang, Zhan Zhang, Kun Li, Chuanyou Qian, Lei Liu, Hongwei School of Computer Science and Technology Harbin Institute of Technology Harbin China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China School of Computer Science and Engineering Southeast University Nanjing China

Convolutional neural networks (CNNs) have shown remarkable advantages in a wide range of domains at the expense of huge parameters and computations. Modern CNNs still tend to be more complex and larger to achieve better inference accuracy. However, the complex and large structures of CNNs could slow down the inference speed. Recently, Compressing the convolutional weights to be sparse by pruning the unimportant parameters has been demonstrated as an efficient way to reduce the computations of CNNs. On the other hand, field-programmable gate arrays (FPGAs) have been a popular hardware platform to accelerate CNN inference. In this paper, we propose an algorithm/hardware co-optimized method for accelerating CNN inference on FPGAs. For the algorithm, we take advantage of unstructured and structured parameter sparsifying methods to achieve high sparsity and keep the regularity of convolutional weights. Correspondingly, hardware-friendly index representations of sparse convolutional weights are proposed. For the hardware architecture, we propose row-wise input-stationary dataflow, which is tightly coupled with the algorithm. A row-wise computing engine (RConv Engine) is proposed, which is based on the dataflow. Inside the RConv Engine, the scalar-vector structure is applied to implement the basic processing elements (PEs). To flexibly calculate the feature map with various sizes, the PEs are organized in a 2D structure with two work modes. The experimental results demonstrate that our co-optimized method implements high sparsity of convolutional weights, and the computing engine achieves high computation efficiency. Compared with other accelerators, our co-optimized method implements a 10.9 (Formula presented.) speedup on FPS at most with the highest sparsity of convolutional weights and negligible accuracy loss. © 2024 John Wiley & Sons Ltd.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Graph Prompt Clustering

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第07期47卷 5794-5805页

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing China Guangdong University of Technology School of Information Engineering Guangzhou China South China Technology Commercialization Center Guangzhou China

Due to the wide existence of unlabeled graph-structured data (e.g. molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods. © 1979-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：