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

Visible-Thermal Multiple Object Tracking: Large-scale Video dataset and Progressive Fusion Approach

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Yabin Wang, Qianwu Li, Chenglong Tang, Jin Huang, Zhixiang The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University School of Public Safety and Emergency Management Anhui University of Science and Technology Hefei231131 China School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China Center for Big Data and Population Health of IHM China

The complementary benefits from visible and thermal infrared data are widely utilized in various computer vision task, such as visual tracking, semantic segmentation and object detection, but rarely explored in Multiple Object Tracking (MOT). In this work, we contribute a large-scale Visible-Thermal video benchmark for MOT, called VT-MOT. VT-MOT has the following main advantages. 1) The data is large scale and high diversity. VT-MOT includes 582 video sequence pairs, 401k frame pairs from surveillance, drone, and handheld platforms. 2) The cross-modal alignment is highly accurate. We invite several professionals to perform both spatial and temporal alignment frame by frame. 3) The annotation is dense and high-quality. VT-MOT has 3.99 million annotation boxes annotated and double-checked by professionals, including heavy occlusion and object re-acquisition (object disappear and reappear) challenges. To provide a strong baseline, we design a simple yet effective tracking framework, which effectively fuses temporal information and complementary information of two modalities in a progressive manner, for robust visible-thermal MOT. A comprehensive experiment are conducted on VT-MOT and the results prove the superiority and effectiveness of the proposed method compared with state-of-the-art methods. From the evaluation results and analysis, we specify several potential future directions for visible-thermal MOT. The project is released in https://***/wqw123wqw/PFTrack. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

学校读者我要写书评

暂无评论

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yu Jiang Xiaolong Xu Kunda Lin Weihua Duan Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781665408790

In order to select a composition scheme that meets user's needs and high performance from large-scale web services in the edge cloud, this paper proposes a trusted service composition optimization scheme called TSC-ECFA for edge cloud, which applies the predation strategy to the firefly algorithm (FA) and divides the services with the same input and output into one category, reducing the number of combinations to search for feasible solutions. The cotangent chaos theory is used to generate the initial firefly population and disturb the location of the individual to improve the overall search efficiency of FA. This paper also improves the step factor and attractiveness formula of FA to give full play to the detection ability of the step factor in the early stage of the algorithm, and balance the local search and the global search. Considering that the QoS attribute values of the service are vulnerable to be tampered with, the blockchain is used to store the QoS attribute values to ensure the tamper-proof and reliability of the QoS attribute value. Finally, simulation experiments compare the number of iterations and optimization of the three algorithms. The experimental results show that the comprehensive performance of TSC-ECFA is better than other algorithms.

关键词： Chaos Web services Conferences Sociology Quality of service Reliability theory Blockchains

A Virtual Network Mapping Method Based on Compound Particle Swarm Optimization

学校读者我要写书评

暂无评论

A Virtual Network Mapping Method Based on Compound Particle ...

Cyber security and Information Engineering (ICCSIE), International Conference on

作者： Jianhua Huang Yunlong Tang Yongjun Wei Huan Wang Haifeng Zhang Bing Zhang Liuzhou Key Laboratory of Big Data Intelligent Processing and Security Guangxi Education System Network Security Monitoring Center School of Computer Science and Technology (School of Software) Guangxi University of Science and Technology Liuzhou China Liuzhou Railway Vocational Technical College Liuzhou China

ISBN: (纸本)9781665455756

Aiming at problems of low credibility of results and low accuracy of the scheme in the mapping process of virtual networks. It is suggested to use a composite particle swarm optimization approach for virtual network mapping. Firstly, to derive the maximum number of virtual cyberspaces, we construct the virtual network model and the physical network model; secondly, resource limitations are used to build the node mapping and link mapping models, and once more, the mapping scheme of the virtual network on the physical network is solved using the composite particle swarm algorithm to improve the acceptance rate of virtual network requests. In simulation experiments, we compare our established algorithm with two algorithms, D-ViNE-SP and VNE-R-PSO, in two dimensions, and the results show that our proposed VNE-MM-PSO mapping method improves the acceptance rate of network requests by 8% and also improves on the benefit-cost ratio.

关键词： Cyberspace Compounds Particle swarm optimization Computer crime

PhotoRedshift-MML: a multimodal machine learning method for estimating photometric redshifts of quasars

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hong, Shuxin Zou, Zhiqiang Luo, A-Li Kong, Xiao Yang, Wenyu Chen, Yanli College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China CAS Key Laboratory of Optical Astronomy National Astronomical Observatories Beijing100101 China School of Astronomy and Space Science University of Chinese Academy of Sciences Beijing100049 China

We propose a Multimodal Machine Learning method for estimating the Photometric Redshifts of quasars (PhotoRedshift-MML for short), which has long been the subject of many investigations. Our method includes two main models, i.e. the feature transformation model by multimodal representation learning, and the photometric redshift estimation model by multimodal transfer learning. The prediction accuracy of the photometric redshift was significantly improved owing to the large amount of information offered by the generated spectral features learned from photometric data via the MML. A total of 415,930 quasars from Sloan Digital Sky Survey (SDSS) data Release 17, with redshifts between 1 and 5, were screened for our experiments. We used |Δz| = |(zphot− zspec)/(1 + zspec)| to evaluate the redshift prediction and demonstrated a 4.04% increase in accuracy. With the help of the generated spectral features, the proportion of data with |Δz| Copyright © 2022, The Authors. All rights reserved.

关键词： Surveys

Estimating Power Consumption of Containers and Virtual Machines in data Centers

学校读者我要写书评

暂无评论

Estimating Power Consumption of Containers and Virtual Machi...

IEEE International Conference on Cluster Computing

作者： Xusheng Zhang Ziyu Shen Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

ISBN: (数字)9781728166773

ISBN: (纸本)9781728166780

Virtualization technologies provide solutions of cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations.

关键词： Power demand Processor scheduling Estimation Containers Virtual machining data models Virtualization

Discrimination-Aware Domain Adversarial Neural Network

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2020年第2期35卷 259-267页

作者： Yun-Yun Wang Jian-Min Gu Chao Wang Song-Can Chen Hui Xue College of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing 210046China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210046China College of Computer Science and Technology/College of Artificial Intelligence Nanjing University of Aeronautics and AstronauticsNanjing 210023China Key Laboratory of Pattern Analysis and Machine Intelligence Ministry of Industry and Information Technology Nanjing 210023China School of Computer Science and Engineering Southeast UniversityNanjing 210096China

The domain adversarial neural network(DANN)methods have been successfully proposed and attracted much attention *** DANNs,a discriminator is trained to discriminate the domain labels of features generated by a generator,whereas the generator attempts to confuse it such that the distributions between domains are *** a result,it actually encourages the whole alignment or transfer between domains,while the inter-class discriminative information across domains is not *** this paper,we present a Discrimination-Aware Domain Adversarial Neural Network(DA2NN)method to introduce the discriminative information or the discrepancy of inter-class instances across domains into deep domain ***2NN considers both the alignment within the same class and the separation among different classes across domains in knowledge transfer via multiple *** results show that DA2NN can achieve better classification performance compared with the DANN methods.

关键词： adversarial learning inter-class separation deep neural network discrimination-aware domain adaptation

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024, CC BY.

关键词： Semantics

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024, CC BY.

关键词：

ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2023年

作者： He, Junwei Xu, Qianqian Jiang, Yangbangyan Wang, Zitai Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

Graph anomaly detection is crucial for identifying nodes that deviate from regular behavior within graphs, benefiting various domains such as fraud detection and social network. Although existing reconstruction-based methods have achieved considerable success, they may face the Anomaly Overfitting and Homophily Trap problems caused by the abnormal patterns in the graph, breaking the assumption that normal nodes are often better reconstructed than abnormal ones. Our observations indicate that models trained on graphs with fewer anomalies exhibit higher detection performance. Based on this insight, we introduce a novel two-stage framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD). In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. We pretrain graph autoencoders on these augmented graphs at multiple levels, which enables the graph autoencoders to capture normal patterns. In the next stage, the decoders are retrained for detection on the original graph, benefiting from the multi-level representations learned in the previous stage. Meanwhile, we propose the node anomaly distribution regularization to further alleviate Anomaly Overfitting. We validate the effectiveness of our approach through extensive experiments on both synthetic and real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection