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

A Policy-Controlled Signature Scheme for end-to-end Secure Communication

学校读者我要写书评

暂无评论

A Policy-Controlled Signature Scheme for end-to-end Secure C...

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Linghui Meng Jing Xi Xianxian Li Qianhui Lu Weidong Zhu Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University GuiLin China Jiangsu Provincial Key Laboratory of Netwrok and Information Security University of SouthEast Nanjing China Guangxi Key Lab of Multi-Source Information Mining and Security Guangxi Normal University GuiLin China Guangxi Collaborative Innovation Center of Multi-source Information Integration and Intelligent Processing Guangxi Normal University GuiLin China

ISBN: (数字)9798331511074

ISBN: (纸本)9798331511081

In the digitalized society, end-to-end security communication is receiving increasing attention. Issues such as ma-licious sender impersonation and over-privilege communication continue to prevail in end-to-end communication. This paper pro-poses a policy-controlled signature scheme aimed at addressing these concerns through identity verification and permission man-agement, thus establishing a secure mode of communication. The scheme designs policy-controlled signatures with partial policy hiding functionality, employing expressive access structures and garbled Bloom Filter (GBF) to protect the sender's attributes. In comparison to related approaches, this scheme provides benefits in terms of signature computation cost, thereby enhancing the resilience and efficiency of the communication system against attacks.

关键词： Privacy Costs Communication systems Prevention and mitigation Big Data Computational efficiency Security Protection Resilience

Semi-Supervised Image Captioning Considering Wasserstein Graph Matching

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Yang The Nanjing University of Science and Technology Nanjing210094 China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China Ministry of Education State Key Lab. for Novel Software Technology Nanjing University China

Image captioning can automatically generate captions for the given images, and the key challenge is to learn a mapping function from visual features to natural language features. Existing approaches are mostly supervised ones, i.e., each image has a corresponding sentence in the training set. However, considering that describing images always requires a huge of manpower, we usually have limited amount of described images (i.e., image-text pairs) and a large number of undescribed images in real-world applications. Thereby, a dilemma is the "Semi-Supervised Image Captioning". To solve this problem, we propose a novel Semi-Supervised Image Captioning method considering Wasserstein Graph Matching (SSIC-WGM), which turns to adopt the raw image inputs to supervise the generated sentences. Different from traditional single modal semi-supervised methods, the difficulty of semi-supervised cross-modal learning lies in constructing intermediately comparable information among heterogeneous modalities. In this paper, SSIC-WGM adopts the successful scene graphs as intermediate information, and constrains the generated sentences from two aspects: 1) inter-modal consistency. SSIC-WGM constructs the scene graphs of the raw image and generated sentence respectively, then employs the wasserstein distance to better measure the similarity between region embeddings of different graphs. 2) intra-modal consistency. SSIC-WGM takes the data augmentation techniques for the raw images, then constrains the consistency among augmented images and generated sentences. Consequently, SSIC-WGM combines the cross-modal pseudo supervision and structure invariant measure for efficiently using the undescribed images, and learns more reasonable mapping function. Experiments show that our method can outperform state-of-the-art comparison methods on the MS-COCO "Karpathy" offline test split, under different complex semi-supervised scenarios. Copyright © 2024, The Authors. All rights reserved.

关键词： Visual languages

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wang, Jiabao Li, Yang Wei, Xiu-Shen Li, Hang Miao, Zhuang Zhang, Rui Army Engineering University of PLA Jiangsu Nanjing210007 China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Jiangsu Nanjing210094 China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nanjing210023 China

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors for the performance gap. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer ImageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on four public FGVC datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance. © 2023, The Authors. All rights reserved.

关键词： Image classification

From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm

学校读者我要写书评

暂无评论

From Node Interaction to Hop Interaction: New Effective and ...

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Jie Chen Zilong Li Yin Zhu Junping Zhang Jian Pu Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China

Existing Graph Neural Networks (GNNs) follow the message-passing mechanism that conducts information interaction among nodes iteratively. While considerable progress has been made, such node interaction paradigms still have the following limitation. First, the scalability limitation precludes the broad application of GNNs in large-scale industrial settings since the node interaction among rapidly expanding neighbors incurs high computation and memory costs. Second, the over-smoothing problem restricts the discrimination ability of nodes, i.e., node representations of different classes will converge to indistinguishable after repeated node interactions. In this work, we propose a novel hop interaction paradigm to address these limitations simultaneously. The core idea is to convert the interaction target among nodes to pre-processed multi-hop features inside each node. We design a simple yet effective HopGNN framework that can easily utilize existing GNNs to achieve hop interaction. Furthermore, we propose a multi-task learning strategy with a self-supervised learning objective to enhance HopGNN. We conduct extensive experiments on 12 benchmark datasets in a wide range of domains, scales, and smoothness of graphs. Experimental results show that our methods achieve superior performance while maintaining high scalability and efficiency. The code is at https://***/JC-202/HopGNN.

关键词：

Background Semantics Matter: Cross-Task Feature Exchange Network for Clustered Infrared Small Target Detection With Sky-Annotated Dataset

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xiao, Mengxuan Dai, Qun Zhu, Yiming Guo, Kehua Wang, Huan Shu, Xiangbo Yang, Jian Dai, Yimian School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China PCALab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security China School of Computer Science and Engineering Central South University China

Infrared small target detection poses unique challenges due to the scarcity of intrinsic target features and the abundance of similar background distractors. We argue that background semantics play a pivotal role in distinguishing visually similar objects for this task. To address this, we introduce a new task-clustered infrared small target detection, and present DenseSIRST, a novel benchmark dataset that provides per-pixel semantic annotations for background regions, enabling the transition from sparse to dense target detection. Leveraging this dataset, we propose the Background-Aware Feature Exchange Network (BAFE-Net), which transforms the detection paradigm from a single task focused on the foreground to a multi-task architecture that jointly performs target detection and background semantic segmentation. BAFE-Net introduces a dynamic cross-task feature hard-exchange mechanism to embed target and background semantics between the two tasks. Furthermore, we propose the Background-Aware Gaussian Copy-Paste (BAG-CP) method, which selectively pastes small targets into sky regions during training, avoiding the creation of false alarm targets in complex non-sky backgrounds. Extensive experiments validate the effectiveness of BAG-CP and BAFE-Net in improving target detection accuracy while reducing false alarms. The DenseSIRST dataset, code, and trained models are available at https://***/GrokCV/BAFE-Net. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

Graph Matching Optimization Network for Point Cloud Registration

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Qianliang Shen, Yaqi Jiang, Haobo Mei, Guofeng Ding, Yaqing Luo, Lei Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China The Faculty of Engineering and Information Technology University of Technology Sydney SydneyNSW2007 Australia

Point Cloud Registration is a fundamental and challenging problem in 3D computer vision. Recent works often utilize the geometric structure information in point feature embedding or outlier rejection for registration while neglecting to consider explicitly isometry-preserving constraint (e.g., point pair linked edge’s length preserving after transformation) in training. We claim that the explicit isometry-preserving constraint is also important for improving feature representation abilities in the feature training stage. To this end, we propose a Graph Matching Optimization based Network (GMONet for short), which utilizes the graph-matching optimizer to explicitly exert the isometry preserving constraints in the point feature training to improve the point feature representation. Specifically, we exploit a partial graph-matching optimizer to optimize the super point (i.e., down-sampled key points) features and a full graph-matching optimizer to optimize fine-level point features in the overlap region. Meanwhile, we leverage the inexact proximal point method and the mini-batch sampling technique to accelerate these two graph-matching optimizers. Given high discriminative point features in the evaluation stage, we utilize the RANSAC approach to estimate the transformation between the scanned pairs. The proposed method has been evaluated on the 3DMatch/3DLoMatch benchmarks and the KITTI benchmark. The experimental results show that our method performs competitively compared to state-of-the-art baselines. Copyright © 2023, The Authors. All rights reserved.

关键词： Surface measurement

Diff-PCR: Diffusion-Based Correspondence Searching in Doubly Stochastic Matrix Space for Point Cloud Registration

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Qianliang Jiang, Haobo Ding, Yaqing Luo, Lei Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

Efficiently finding optimal correspondences between point clouds is crucial for solving both rigid and nonrigid point cloud registration problems. Existing methods often rely on geometric or semantic feature embedding to establish correspondences and estimate transformations or flow fields. Recently, state-of-the-art methods have employed RAFT-like iterative updates to refine the solution. However, these methods have certain limitations. Firstly, their iterative refinement design lacks transparency, and their iterative updates follow a fixed path during the refinement process, which can lead to suboptimal results. Secondly, these methods overlook the importance of refining or optimizing correspondences (or matching matrices) as a precursor to solving transformations or flow fields. They typically compute candidate correspondences based on distances in the point feature space. However, they only project the candidate matching matrix into some matrix space once with Sinkhorn or dual softmax operations to obtain final correspondences. This one-shot projected matching matrix may be far from the globally optimal one, and these approaches do not consider the distribution of the target matching matrix. In this paper, we propose a novel approach that exploits the Denoising Diffusion Model to predict a searching gradient for the optimal matching matrix within the Doubly Stochastic Matrix Space. Our method incorporates the diffusion model to learn a denoising gradient direction. During the reverse denoising process, our method iteratively searches for better solutions along this denoising gradient, which points towards the maximum likelihood direction of the target matching matrix. To improve efficiency, we employ a lightweight design for our denoising module and utilize the sampling strategy in the Denoising Diffusion Implicit Model (DDIM [27]). Experimental evaluations on the 3DMatch/3DLoMatch and 4DMatch/4DLoMatch datasets demonstrate the effectiveness of our newly designe

关键词： Flow fields

STGE-Former: Spatial-Temporal Graph-Enhanced Transformer for EEG-Based Major Depressive Disorder Detection

学校读者我要写书评

暂无评论

STGE-Former: Spatial-Temporal Graph-Enhanced Transformer for...

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Yu Chen Chunfeng Yang School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Southeast University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Applying deep learning techniques to Electroencephalogram (EEG) data has shown great potential in the field of depression detection. However, existing EEG-based depression detection models face challenges: they struggle to capture the complex spatiotemporal dependencies and the complementary nature of spatiotemporal information in EEG data; functional connectivity between brain regions is not sufficiently considered. To address these issues, we propose a new Spatial-Temporal Graph-Enhanced Transformer, named STGE-Former. Raw EEG signals are first mapped to Spatial-Temporal Shared Embeddings, then processed by the Spatial Attention Stream and the Temporal Graph-Enhanced Attention Stream to extract spatiotemporal complementary information, and finally classified through a classification head. Experimental results on the MODMA dataset show that our model outperforms existing methods in the task of EEG-Based MDD Detection. STGE-Former provides a promising approach for automatic depression detection. The code is available at https://***/RockyChen0205/STGE-Former.

关键词： Deep learning Electric potential Signal processing Depression Transformers Brain modeling Electroencephalography Spatiotemporal phenomena Speech processing Faces

LVOS: A Benchmark for Large-scale Long-term Video Object Segmentation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hong, Lingyi Liu, Zhongying Chen, Wenchao Tan, Chenzhi Feng, Yuang Zhou, Xinyu Guo, Pinxue Li, Jinglun Chen, Zhaoyu Gao, Shuyong Zhang, Wei Zhang, Wenqiang Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Shanghai Engineering Research Center of AI&Robotics Academy for Engineering&Technology Fudan University Shanghai China Engineering Research Center of AI&Robotics Ministry of Education Academy for Engineering&Technology Fudan University Shanghai China The Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China

Video object segmentation (VOS) aims to distinguish and track target objects in a video. Despite the excellent performance achieved by off-the-shell VOS models, existing VOS benchmarks mainly focus on short-term videos lasting about 5 seconds, where objects remain visible most of the time. However, these benchmarks poorly represent practical applications, and the absence of long-term datasets restricts further investigation of VOS in realistic scenarios. Thus, we propose a novel benchmark named LVOS, comprising 720 videos with 296,401 frames and 407,945 high-quality annotations. Videos in LVOS last 1.14 minutes on average, approximately 5 times longer than videos in existing datasets. Each video includes various attributes, especially challenges deriving from the wild, such as long-term reappearing and cross-temporal similar objects. Compared to previous benchmarks, our LVOS better reflects VOS models' performance in real scenarios. Based on LVOS, we evaluate 20 existing VOS models under 4 different settings and conduct a comprehensive analysis. On LVOS, these models suffer a large performance drop, highlighting the challenge of achieving precise tracking and segmentation in real-world scenarios. Attribute-based analysis indicates that key factor to accuracy decline is the increased video length, emphasizing LVOS's crucial role. We hope our LVOS can advance development of VOS in real scenes. Data and code are available at https://***/lvos. ***/. © 2024, CC BY.

关键词： Benchmarking