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

Hierarchical Graph Convolutional Networks With Latent Structure Learning for Mechanical Fault Diagnosis

IEEE/ASME Transactions on Mechatronics 2023年第6期28卷 3076-3086页

作者： Zhong, Kai Han, Bing Han, Min Chen, Hongtian Anhui University Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Shanghai Ship and Shipping Research Institute State Key Laboratory of Navigation and Safety Technology Shanghai200135 China Dalian University of Technology Key Lab. of Intelligent Contr. and Optimization for Indust. Equipment of the Ministry of Education Dalian116024 China University of Alberta Department of Chemical and Materials Engineering EdmontonABT6G 2V4 Canada

Industrial sensor signals are essentially non-Euclidean graph structures due to the interplay between process variables;thus, graph convolutional networks (GCNs) have been widely studied and applied. However, most of the existing GCN-based methods may suffer from two drawbacks: 1) it is difficult to characterize multiple interactions among nodes and 2) the input graph constructed from the original data may contain errors and missing edges, which will degenerate the fault diagnosis performance. To address the abovementioned issues, this article designs a hierarchical GCN with latent structure learning for industrial fault diagnosis, which can organize hierarchical networks to collaboratively improve the quality of latent graph structure, and enhanced diagnostic performance can be guaranteed. First, a high-quality updated graph is formed by incorporating the original graph with the new graph in the graph constructing layer, which can not only eliminate the adverse effects of noise and outliers but also characterize the multiple interactions among nodes. Then, the updated graph is fed into the multilayer GCN layer for better feature learning and enhances the node representation through intra- and inter-layer convolutional operations simultaneously. After that, the produced node embeddings are used to guide the latent structure learning process for optimal graph. Finally, the proposed method is verified in both the simulated and real industrial processes. The experimental results demonstrate that the new approach has better fault diagnosis accuracy and practicability than state-of-the-art methods. © 1996-2012 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic Coordinate Fields for Robust Correspondences

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 12004-12021页

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Huazhong University of Science and Technology The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Wuhan430074 China West Virginia University The Lane Department of Computer Science and Electrical Engineering MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. © 1979-2012 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Harry: A Scalable SIMD-based Multi-literal Pattern Matching Engine for Deep Packet Inspection 42

Harry: A Scalable SIMD-based Multi-literal Pattern Matching ...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Xu, Hao Chang, Harry Zhu, Wenjun Hong, Yang Langdale, Geoff Qiu, Kun Zhao, Jin Fudan University School of Computer Science China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Intel Asia-Pacific Research & Development Ltd. Shanghai China

ISBN: (纸本)9798350334142

Deep Packet Inspection (DPI) is a significant network security technique. It examines traffic workloads by searching for specific rules. Since every byte of packets needs to be examined by many literal rules, multi-literal matching becomes the performance bottleneck of DPI. FDR, the fastest multi-literal matching engine on CPUs, takes advantage of Single-Instruction-Multiple-Data (SIMD) to alleviate this bottleneck and achieves a performance boost over the widely-used Aho-Corasick (AC) algorithm. However, FDR does not deeply exploit the data-level parallelism of SIMD and its SIMD vector utilization is only 50%. Besides, limited by certain SIMD shift instructions, it cannot benefit from advanced SIMD instruction sets. To overcome these issues, we propose Harry, a scalable and SIMD-based multi-literal matching engine. Harry adopts a column-vector-based matching algorithm to improve the data-level parallelism and SIMD vector utilization. To support the algorithm, it takes two encoding methods to compress the mask table. Also, it utilizes shuffle instruction to implement shift. We implement Harry on commodity CPU and evaluate it with real network traffic and DPI rules. Our evaluation shows that Harry reaches a throughput of 30∼70Gbit/s, up to 52x that of AC and 2.09x of FDR. It has been successfully deployed in Hyperscan. © 2023 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

A Study on Semi-Supervised Semantic Segmentation of Ship Flame Images 29

A Study on Semi-Supervised Semantic Segmentation of Ship Fla...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Wan, Junwei Chen, Yaojie Zheng, Xuecong Wuhan University of Science and Technology Department of Computer Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

ISBN: (纸本)9798350330717

In addressing the challenges of limited semantic labeling data and imprecise segmentation regions prevalent in the semantic segmentation of ship flame images, this study introduces a semi-supervised semantic segmentation method tailored for ship flame images. This approach is grounded in the principles of pairwise similarity with strong-weak perturbations. Adopting a pseudo-label self-learning strategy, the method employs weak-strong perturbation pairwise similarity, ensuring the propagation of high-confidence predictions during label generation, and thereby enhancing performance. Additionally, to tackle the inherent difficulties presented by smoke enveloping and obscuring flame regions in ship images, we have conceived a Vertical Continuity Feature Enhancement module. This module empowers the model to discern more explicit inter-class boundaries. Empirical evaluations on our proprietary dataset substantiate the superiority of our method, registering an improvement of 4.12 percentage points in mIoU over other semi-supervised approaches. Such results attest to the efficacy of the proposed pairwise similarity approach and the Vertical Continuity Feature Enhancement module in flame semantic segmentation. © 2023 IEEE.

关键词： Feature enhancemen Pairwise similarity Semantic segmentation Semi-Supervised learning

来源：评论

学校读者我要写书评

暂无评论

FreqBlender: Enhancing DeepFake Detection by Blending Frequency Knowledge 38

FreqBlender: Enhancing DeepFake Detection by Blending Freque...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Li, Hanzhe Zhou, Jiaran Li, Yuezun Wu, Baoyuan Li, Bin Dong, Junyu School of Computer Science and Technology Ocean University of China China School of Data Science The Chinese University of Hong Kong Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

Generating synthetic fake faces, known as pseudo-fake faces, is an effective way to improve the generalization of DeepFake detection. Existing methods typically generate these faces by blending real or fake faces in spatial domain. While these methods have shown promise, they overlook the simulation of frequency distribution in pseudo-fake faces, limiting the learning of generic forgery traces in-depth. To address this, this paper introduces FreqBlender, a new method that can generate pseudo-fake faces by blending frequency knowledge. Concretely, we investigate the major frequency components and propose a Frequency Parsing Network to adaptively partition frequency components related to forgery traces. Then we blend this frequency knowledge from fake faces into real faces to generate pseudo-fake faces. Since there is no ground truth for frequency components, we describe a dedicated training strategy by leveraging the inner correlations among different frequency knowledge to instruct the learning process. Experimental results demonstrate the effectiveness of our method in enhancing DeepFake detection, making it a potential plug-and-play strategy for other methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Collaborative Search with Adaptive Heuristics and Weight Vectors for Aerospace Multi-objective Optimal Control Problems 13

Multi-Agent Collaborative Search with Adaptive Heuristics an...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Cao, Li Wang, Maocai Parsonage, Ben Maddock, Christie Dai, Guangming China University of Geosciences School of Computer China China University of Geosciences Hubei Key Laboratory of Intelligent Geo-Information Processing Wuhan430074 China University of Strathclyde Department of Mechanical & Aerospace Engineering Glasgow United Kingdom

ISBN: (纸本)9798350308365

Optimal control optimization problems are relative complex and widespread in aerospace field. The evolutionary algorithms are useful methods in solving those problems and Multi Agent Collaborative Search Algorithm (MACS) is a effective method for them. It's a mix of evolution approach and gradient-based method. The evolution part includes individualistic and social heuristics with different characteristics. The latest version of MACS is Multi-Agent Collaborative Search optimal control algorithm (MACSoc) which has good performance on multi-objective optimal control problems. However, this algorithm has two important limitations: The two kinds of heuristics are performed evenly on each individuals which may weaken the algorithm efficiency;The Pareto Front in objective space may be uneven but the initial weight vectors of MACSoc is even. This may lead to diversity losing. We proposed a new algorithm MACSoc with adaptive heuristics and weight vectors (MACSoc-AH) which contains the following improvements: The two kinds of heuristics are executed on individuals based on the their characteristics;A weight vector adjusting process with a original trigger is added to improve diversity. The new algorithm is compared with MACSoc and shows competitive results. © 2024 IEEE.

关键词： Aerospace industry

来源：评论

学校读者我要写书评

暂无评论

A Prediction-Based Multi-Objective VM Consolidation Approach for Cloud Data Centers

引用

computers, Materials & Continua 2024年第7期80卷 1601-1631页

作者： Xialin Liu Junsheng Wu Lijun Chen Jiyuan Hu School of Computer Science Northwestern Polytechnical UniversityXi’an710005China School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710021China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and TelecommunicationsXi’an710021China School of Software and Microelectronics Northwestern Polytechnical UniversityXi’an710005China School of Automation Xi’an University of Posts and TelecommunicationsXi’an710021China

Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource *** paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical *** use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)*** results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).

关键词： VM consolidation prediction multi-objective optimization machine learning

来源：评论

学校读者我要写书评

暂无评论

PLIP: Language-Image Pre-training for Person Representation Learning 38

PLIP: Language-Image Pre-training for Person Representation ...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Zuo, Jialong Hong, Jiahao Zhang, Feng Yu, Changqian Zhou, Hanyu Gao, Changxin Sang, Nong Wang, Jingdong National Key Laboratory of Multispectral Information Intelligent Processing Technology School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Skywork AI United States Department of Computer Vision Baidu Inc. China

Language-image pre-training is an effective technique for learning powerful representations in general domains. However, when directly turning to person representation learning, these general pre-training methods suffer from unsatisfactory performance. The reason is that they neglect critical person-related characteristics, i.e., fine-grained attributes and identities. To address this issue, we propose a novel language-image pre-training framework for person representation learning, termed PLIP. Specifically, we elaborately design three pretext tasks: 1) Text-guided Image Colorization, aims to establish the correspondence between the person-related image regions and the fine-grained color-part textual phrases. 2) Image-guided Attributes Prediction, aims to mine fine-grained attribute information of the person body in the image;and 3) Identity-based Vision-Language Contrast, aims to correlate the cross-modal representations at the identity level rather than the instance level. Moreover, to implement our pre-train framework, we construct a large-scale person dataset with image-text pairs named SYNTH-PEDES by automatically generating textual annotations. We pre-train PLIP on SYNTH-PEDES and evaluate our models by spanning downstream person-centric tasks. PLIP not only significantly improves existing methods on all these tasks, but also shows great ability in the zero-shot and domain generalization settings. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FBOD: An Outlier Detection Algorithm based on Data Features Suitable for processing Large-scale Datasets on Distributed Platforms 10

FBOD: An Outlier Detection Algorithm based on Data Features ...

引用

10th International Symposium on System Security, Safety, and Reliability, ISSSR 2024

作者： Zhao, Jinbo He, Jinling Song, Hu Cheng, Xinyun Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

The primary objective of outlier detection is to identify values that are significantly different from other data in the dataset. However, most of the current algorithms are effective for small-scale data and their performance is highly dependent on the choice of parameters. To this, the paper proposes an innovative outlier detection algorithm, named FBOD, which is based on data features. Specifically, FBOD utilizes the number of combinations of attribute values in each tuple across the dataset as a key feature of the tuple. This feature reflects the degree of differentiation of each data tuple from the overall dataset. By identifying data features that are significantly different from objects in the entire dataset, FBOD can accurately determine outliers. Based on the knowledge of attribute importance in Rough Set Theory, FBOD can efficiently reduce the data dimensionality, so high-dimensional datasets can be handled by FBOD. Furthermore, this paper employs a distributed parallelism approach in the algorithm. The performance of FBOD is evaluated on several datasets, including standard datasets and artificial datasets, and is compared with common outlier detection algorithms. Experimental results indicate that, compared to existing typical algorithms, FBOD achieves higher outlier detection accuracy without relying on a prior knowledge of datasets or parameter selection. It also proves the suitability of FBOD for large-scale dataset processing on distributed platforms. © 2024 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

DSAFF-Net:A Backbone Network Based on Mask R-CNN for Small Object Detection

引用

computers, Materials & Continua 2023年第2期74卷 3405-3419页

作者： Jian Peng Yifang Zhao Dengyong Zhang Feng Li Arun Kumar Sangaiah Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and TechnologyChangsha410114China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China School of Computing Science and Engineering Vellore Institute of Technology(VIT)Vellore632014India

Recently,object detection based on convolutional neural networks(CNNs)has developed *** backbone networks for basic feature extraction are an important component of the whole detection ***,we present a new feature extraction strategy in this paper,which name is *** this strategy,we design:1)a sandwich attention feature fusion module(SAFF module).Its purpose is to enhance the semantic information of shallow features and resolution of deep features,which is beneficial to small object detection after feature fusion.2)to add a new stage called D-block to alleviate the disadvantages of decreasing spatial resolution when the pooling layer increases the receptive *** method proposed in the new stage replaces the original method of obtaining the P6 feature map and uses the result as the input of the regional proposal network(RPN).In the experimental phase,we use the new strategy to extract *** experiment takes the public dataset of Microsoft Common Objects in Context(MS COCO)object detection and the dataset of Corona Virus Disease 2019(COVID-19)image classification as the experimental object *** results show that the average recognition accuracy of COVID-19 in the classification dataset is improved to 98.163%,and small object detection in object detection tasks is improved by 4.0%.

关键词： Small object detection classification RPN MS COCO COVID-19

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：