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

CMANet: A CNN-Mamba aggregation network for face super-resolution

Pattern Recognition 2025年 168卷

作者： Wu, Ziyi Lu, Tao Zhang, Yanduo Chai, Xiaoyu Hubei Key Laboratory of Intelligent Robot Wuhan Institute of Technology Wuhan China Computer School Hubei University of Arts and Science Xiangyang China National Engineering Research Center for Multimedia Software Wuhan University Wuhan China

Currently, most face super-resolution (FSR) methods rely on convolutional neural networks (CNNs) or Transformers, both of which have inherent limitations: CNNs suffer from a limited receptive field, while Transformers introduce quadratic computational complexity due to self-attention. In recent years, Mamba has effectively addressed these challenges using the state space model (SSM), excelling in global modeling. However, due to the highly structured nature of face images, relying solely on global modeling is insufficient for high-quality reconstruction. It is crucial to preserve global structural information while enhancing local texture details. While Mamba excels in global modeling, it lacks the ability to effectively extract local details. To eliminate this issue, we propose the CNN-Mamba Aggregation Network (CMANet) for FSR, which consists of two branches: a CNN branch and a Mamba branch. The CNN branch is a traditional end-to-end FSR network, in which the proposed Multi-Scale Residual Block (MSRB) extracts multi-scale local details. The Mamba branch, the core of the network, is built upon a UNet architecture. Its central component is a carefully designed Dual Scan Mamba Block (DSMB), which combines the Dual Scan Mamba Module (DSMM) and Feature Refinement Feed-Forward Network (FR-FFN). The DSMM enhances the global modeling capabilities of the SSM in both plane and channel scanning directions, while the FR-FFN refines the expressiveness and adaptability of the features. Finally, CMANet reconstructs high-fidelity face images by aggregating features from both branches. Extensive experimental results show that our model significantly outperforms many advanced methods in both objective metrics and subjective image quality. © 2025 Elsevier Ltd

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Spatial Consistency and Feature Diversity Regularization in Transfer Learning for Fine-Grained Visual Categorization

Spatial Consistency and Feature Diversity Regularization in ...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Dai, Zhigang Chen, Junying Mian, Ajmal South China University of Technology Key Laboratory of Big Data and Intelligent Robot Ministry of Education School of Software Engineering Guangzhou China The University of Western Australia Department of Computer Science Perth Australia

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Fine-grained visual categorization is challenged by limited training data by localizing discriminative regions and learning diverse features. We propose an effective regularization method that simultaneously imposes spatial consistency and feature diversity on CNN feature maps from a unified perspective. The former guides different feature map channels to concentrate collaboratively on the discriminative areas while the latter ensures that the feature maps are diverse. The proposed method does not require additional supervision, and leverages the covariance matrix of multi-channel feature maps to regularize the loss at the last convolutional layer where the semantic information is the richest. This allows the influence to be backpropagated to update all convolutional layers. We perform experiments using four network architectures for transfer learning from two source domains to three target domains, and demonstrate that our regularization method improves accuracy in all different settings. The proposed regularization method achieves state-of-the-art performance on CUB-200-2011, Stanford-Cars, and Stanford-Dogs datasets with 89.8%, 94.6%, and 88.5% accuracy, respectively. © 2022 IEEE.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

RFC:a feature selection algorithm for software defect prediction

引用

Journal of Systems engineering and Electronics 2021年第2期32卷 389-398页

作者： XU Xiaolong CHEN Wen WANG Xinheng Jiangsu Key Laboratory of Big Data Security&Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China Institute of Big Data Research at Yancheng Nanjing University of Posts and TelecommunicationsYancheng 224000China School of Computing and Engineering University of West LondonLondon W55RFUK

software defect prediction(SDP)is used to perform the statistical analysis of historical defect data to find out the distribution rule of historical defects,so as to effectively predict defects in the new ***,there are redundant and irrelevant features in the software defect datasets affecting the performance of defect *** order to identify and remove the redundant and irrelevant features in software defect datasets,we propose ReliefF-based clustering(RFC),a clusterbased feature selection ***,the correlation between features is calculated based on the symmetric *** to the correlation degree,RFC partitions features into k clusters based on the k-medoids algorithm,and finally selects the representative features from each cluster to form the final feature *** the experiments,we compare the proposed RFC with classical feature selection algorithms on nine National Aeronautics and Space Administration(NASA)software defect prediction datasets in terms of area under curve(AUC)and *** experimental results show that RFC can effectively improve the performance of SDP.

关键词： software defect prediction(SDP) feature selection cluster

来源：评论

学校读者我要写书评

暂无评论

RGCNU: Recurrent Graph Convolutional Network With Uncertainty Estimation for Remaining Useful Life Prediction

引用

IEEE/CAA Journal of Automatica Sinica 2023年第7期10卷 1640-1642页

作者： Qiwu Zhu Qingyu Xiong Zhengyi Yang Yang Yu School of Big Data&Software Engineering Chongqing UniversityChongqing 400044 Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of EducationChongqing 400044China School of Biology and Engineering Guizhou Medical UniversityGuiyang 550025China

Dear Editor,This letter focuses on the problem of remaining useful life(RUL)prediction of equipment. Existing graph neural network(GCN)-based approaches merely provide the point estimation of RUL. However,the estimated RUL often varies widely due to the model parameters and the noise in data. It is important to know the uncertainty in predictions for reliable risk analysis and maintenance decision *** map the relationship between noisy condition monitoring data and RUL with uncertainty.

关键词： letter estimation prediction

来源：评论

学校读者我要写书评

暂无评论

Detail retention and enhancement for camouflaged object detection

引用

Neurocomputing 2025年

作者： Shangjing Chen Feng Xu Tao Zeng Xin Li Jiale Chen Xin Lyu College of Computer Science and Software Engineering Hohai University Nanjing 211100 China School of Computer Engineering Jiangsu Ocean University Lianyungang 222005 China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing 211100 China

The objective of camouflaged object detection is to segment objects that share similar visual attributes with their backgrounds. Existing methods leverage the consistency and variability of the object to pinpoint its location; however, when presented with samples exhibiting intricate edges, the model tends to overlook critical details. Toward this issue, we analyzed the reasons from the perspective of processing basic features and found that roughly compressing the feature channel could lead to the loss of fine features at the initial stage of the pipeline. Therefore, we introduce a multi-scale feature preprocessing approach named Soft Channel Compression prior to feature fusion, which retains key cues by enhancing the visibility of fine-grained features. We then utilize self-attention to fuse the results of multi-scale feature sampling, synthesizing contextual information between extended details and the main object. Furthermore, we propose the Hierarchical Receptive Field Complementarity module, using a divide-and-conquer strategy to enhance discriminative features with different scales in object details. This facilitates the integration of information across various ranges by employing a hierarchical manner to expand the receptive field, thereby achieving complementary information between local areas. Extensive experimental results on benchmark datasets demonstrate that the proposed method outperforms other state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strict pattern matching under non-overlapping condition

引用

Science China(Information Sciences) 2017年第1期60卷 5-20页

作者： Youxi WU Cong SHEN He JIANG Xindong WU School of Computer Science and Engineering Hebei University of Technology Hebei Province Key Laboratory of Big Data Calculation School of Computer Science and Technology Tianjin University School of Software Dalian University of Technology School of Computer Science and Information Engineering Hefei University of Technology School of Computing and Informatics University of Louisiana at Lafayette

Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences) of a pattern and then to determine whether the pattern is frequent or not. A state-of-the-art sequential pattern mining with gap constraints(or flexible wildcards) uses the number of non-overlapping occurrences to denote the frequency of a pattern. Non-overlapping means that any two occurrences cannot use the same character of the sequence at the same position of the pattern. In this paper, we investigate strict pattern matching under the non-overlapping condition. We show that the problem is in P at first. Then we propose an algorithm, called NETLAP-Best, which uses Nettree structure. NETLAP-Best transforms the pattern matching problem into a Nettree and iterates to find the rightmost root-leaf path, to prune the useless nodes in the Nettree after removing the rightmost root-leaf path. We show that NETLAP-Best is a complete algorithm and analyse the time and space complexities of the algorithm. Extensive experimental results demonstrate the correctness and efficiency of NETLAP-Best.

关键词： pattern matching sequential pattern mining gap constraint flexible wildcard non-overlapping occurrence Nettree

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua Science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Automatic Recognition of Business Process Images

Automatic Recognition of Business Process Images

引用

2019 IEEE International Conference on Computer Science and Educational Informatization, CSEI 2019

作者： Kang, Qingyi Yu, Yong Dai, Fei School of Software Yunnan University Kunming650091 China School of Software Key Laboratory in Software Engineering of Yunnan Province Yunnan University Kunming650091 China School of Big Data and Intelligent Engineering Southwest Forestry University Kunming650224 China

ISBN: (纸本)9781728123080

The Business Process Modelling Notation (BPMN) is a defacto standard for modelling business processes in the early phases of systems development. The increased adoption of business process management approaches has led organizations to model large collections of BPMN business process models. The mix of constructs in BPMN business process models can lead to semantic error. The ability to take a picture of BPMN business process models and analyze the semantic correctness of BPMN business process images is thus a desirable feature. In this paper, we propose an automatic recognition method to transform BPMN business process images into Petri nets, for which efficient analysis techniques are available. The proposed recognition has been implemented as a tool, in conjunction with existing Petri net-based tools, that enables the soundness analysis of business process images. This transformation can led to the identification of deficiencies in the BPMN business process images. © 2019 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Plausible Heterogeneous Graph k-Anonymization for Social Networks

引用

Tsinghua Science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：