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

A Comprehensive Survey of 3D Dense Captioning: Localizing and Describing Objects in 3D Scenes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yu, Ting Lin, Xiaojun Wang, Shuhui Sheng, Weiguo Huang, Qingming Yu, Jun School of Information Science and Technology Hangzhou Normal University Hangzhou311121 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China

Three-Dimensional (3D) dense captioning is an emerging vision-language bridging task that aims to generate multiple detailed and accurate descriptions for 3D scenes. It presents significant potential and challenges due to its closer representation of the real world compared to 2D visual captioning, as well as complexities in data collection and processing of 3D point cloud sources. Despite the popularity and success of existing methods, there is a lack of comprehensive surveys summarizing the advancements in this field, which hinders its progress. In this paper, we provide a comprehensive review of 3D dense captioning, covering task definition, architecture classification, dataset analysis, evaluation metrics, and in-depth prosperity discussions. Based on a synthesis of previous literature, we refine a standard pipeline that serves as a common paradigm for existing methods. We also introduce a clear taxonomy of existing models, summarize technologies involved in different modules, and conduct detailed experiment analysis. Instead of a chronological order introduction, we categorize the methods into different classes to facilitate exploration and analysis of the differences and connections among existing techniques. We also provide a reading guideline to assist readers with different backgrounds and purposes in reading efficiently. Furthermore, we propose a series of promising future directions for 3D dense captioning by identifying challenges and aligning them with the development of related tasks, offering valuable insights and inspiring future research in this field. Our aim is to provide a comprehensive understanding of 3D dense captioning, foster further investigations, and contribute to the development of novel applications in multimedia and related domains. Copyright © 2024, The Authors. All rights reserved.

关键词： Data handling

Prompting Video-Language Foundation Models with Domain-specific Fine-grained Heuristics for Video Question Answering

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yu, Ting Fu, Kunhao Wang, Shuhui Huang, Qingming Yu, Jun School of Information Science and Technology Hangzhou Normal University Hangzhou311121 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China

Video Question Answering (VideoQA) represents a crucial intersection between video understanding and language processing, requiring both discriminative unimodal comprehension and sophisticated cross-modal interaction for accurate inference. Despite advancements in multi-modal pre-trained models and video-language foundation models, these systems often struggle with domain-specific VideoQA due to their generalized pre-training objectives. Addressing this gap necessitates bridging the divide between broad cross-modal knowledge and the specific inference demands of VideoQA tasks. To this end, we introduce HeurVidQA, a framework that leverages domain-specific entity-action heuristics to refine pre-trained video-language foundation models. Our approach treats these models as implicit knowledge engines, employing domain-specific entity-action prompters to direct the model’s focus toward precise cues that enhance reasoning. By delivering fine-grained heuristics, we improve the model’s ability to identify and interpret key entities and actions, thereby enhancing its reasoning capabilities. Extensive evaluations across multiple VideoQA datasets demonstrate that our method significantly outperforms existing models, underscoring the importance of integrating domain-specific knowledge into video-language models for more accurate and context-aware VideoQA. Copyright © 2024, The Authors. All rights reserved.

关键词： Inference engines

OHSS: Optimizing Homomorphic Secret Sharing to Support Fast Matrix Multiplication

学校读者我要写书评

暂无评论

OHSS: Optimizing Homomorphic Secret Sharing to Support Fast ...

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Shuguang Zhang Jianli Bai Kun Tu Ziyue Yin Chan Liu New Technology Research Laboratory Chengfang Financial Technology Co. Beijing China School of Computing and Information Systems Singapore Management University Singapore College of Art & Science New York University New York USA The Software College Shenyang Normal University Shenyang China

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

Homomorphic Secret Sharing (HSS) has evolved as a state-of-the-art methodology for achieving secure two-party computation, synthesizing the advantages of secret sharing and homomorphic encryption. This amalgamation ensures minimal computational and communicational overhead, making it particularly adept at arithmetic operations. However, HSS faces challenges in scalability and efficiency when confronted with extensive matrix operations, including both matrix-vector and matrix-matrix multiplications, which are fundamental in numerous privacy-preserving computations, notably within the realm of privacy-preserving machine learning. In this research, we introduce Optimized Homomorphic Secret Sharing (OHSS), a refined version of HSS, crafted to address these limitations. Our contributions include enhancements to the key generation phase alongside the development of efficient algorithms for matrix-vector multiplication and matrix-matrix multiplication. Comprehensive security evaluations and performance benchmarks demonstrate that OHSS not only fulfills stringent security criteria but also boasts superior efficiency.

关键词： Privacy Machine learning algorithms Costs Scalability Machine learning Computational efficiency Complexity theory Cryptography Homomorphic encryption Faces

How Hard is Takeover in DPoS Blockchains? Understanding the Security of Coin-based Voting Governance

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Chao Palanisamy, Balaji Xu, Runhua Duan, Li Liu, Jiqiang Wang, Wei Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing China Department of Informatics and Networked Systems School of Computing and Information University of Pittsburgh Pittsburgh United States School of Computer Science and Engineering Beihang University Beijing China

Delegated-Proof-of-Stake (DPoS) blockchains, such as EOSIO, Steem and TRON, are governed by a committee of block producers elected via a coin-based voting system. We recently witnessed the first de facto blockchain takeover that happened between Steem and TRON. Within one hour of this incident, TRON founder took over the entire Steem committee, forcing the original Steem community to leave the blockchain that they maintained for years. This is a historical event in the evolution of blockchains and Web 3.0. Despite its significant disruptive impact, little is known about how vulnerable DPoS blockchains are in general to takeovers and the ways in which we can improve their resistance to takeovers. In this paper, we demonstrate that the resistance of a DPoS blockchain to takeovers is governed by both the theoretical design and the actual use of its underlying coin-based voting governance system. When voters actively cooperate to resist potential takeovers, our theoretical analysis reveals that the current active resistance of DPoS blockchains is far below the theoretical upper bound. However in practice, voter preferences could be significantly different. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON. Our study identifies the diversity in voter preferences and characterizes the impact of this diversity on takeover resistance. Through both theoretical and empirical analyses, our study provides novel insights into the security of coin-based voting governance and suggests potential ways to improve the takeover resistance of any blockchain that implements this governance model. © 2023, CC BY-NC-ND.

关键词： Blockchain

Calibrated One-class Classification for Unsupervised Time Series Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xu, Hongzuo Wang, Yijie Jian, Songlei Liao, Qing Wang, Yongjun Pang, Guansong Beijing100091 China The National Key Laboratory of Parallel and Distributed Computing College of Computer National University of Defense Technology Hunan410073 China The College of Computer National University of Defense Technology Hunan410073 China Guangdong518055 China The School of Computing and Information Systems Singapore Management University Singapore178902 Singapore

Time series anomaly detection is instrumental in maintaining system availability in various domains. Current work in this research line mainly focuses on learning data normality deeply and comprehensively by devising advanced neural network structures and new reconstruction/prediction learning objectives. However, their one-class learning process can be misled by latent anomalies in training data (i.e., anomaly contamination) under the unsupervised paradigm. Their learning process also lacks knowledge about the anomalies. Consequently, they often learn a biased, inaccurate normality boundary. To tackle these problems, this paper proposes calibrated one-class classification for anomaly detection, realizing contamination-tolerant, anomaly-informed learning of data normality via uncertainty modeling-based calibration and native anomaly-based calibration. Specifically, our approach adaptively penalizes uncertain predictions to restrain irregular samples in anomaly contamination during optimization, while simultaneously encouraging confident predictions on regular samples to ensure effective normality learning. This largely alleviates the negative impact of anomaly contamination. Our approach also creates native anomaly examples via perturbation to simulate time series abnormal behaviors. Through discriminating these dummy anomalies, our one-class learning is further calibrated to form a more precise normality boundary. Extensive experiments on ten real-world datasets show that our model achieves substantial improvement over sixteen state-of-the-art contenders. © 2022, CC BY.

关键词： Contamination

Forecasting COVID-19 Infections in Gulf Cooperation Council (GCC) Countries using Machine Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ismail, Leila Materwala, Huned Hennebelle, Alain Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi15551 United Arab Emirates Independent Data Scientist and Engineer Al Ain Abu Dhabi United Arab Emirates

COVID-19 has infected more than 68 million people worldwide since it was first detected about a year ago. Machine learning time series models have been implemented to forecast COVID-19 infections. In this paper, we develop time series models for the Gulf Cooperation Council (GCC) countries using the public COVID-19 dataset from Johns Hopkins. The dataset set includes the one-year cumulative COVID-19 cases between 22/01/2020 to 22/01/2021. We developed different models for the countries under study based on the spatial distribution of the infection data. Our experimental results show that the developed models can forecast COVID-19 infections with high *** Codes 68-04, 68T05, 68T07, 68T20 © 2023, CC BY-NC-ND.

关键词： Coronavirus

FAIR: Flow Type-Aware Pre-Training of Compiler Intermediate Representations

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Niu, Changan Li, Chuanyi Ng, Vincent Lo, David Luo, Bin State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Human Language Technology Research Institute University of Texas at Dallas RichardsonTX United States School of Computing and Information Systems Singapore Management University Singapore

While the majority of existing pre-trained models from code learn source code features such as code tokens and abstract syntax trees, there are some other works that focus on learning from compiler intermediate representations (IRs). Existing IR-based models typically utilize IR features such as instructions, control and data flow graphs (CDFGs), call graphs, etc. However, these methods confuse variable nodes and instruction nodes in a CDFG and fail to distinguish different types of flows, and the neural networks they use fail to capture long-distance dependencies and have over-smoothing and over-squashing problems. To address these weaknesses, we propose FAIR, a Flow type-Aware pre-trained model for IR that involves employing (1) a novel input representation of IR programs;(2) Graph Transformer to address over-smoothing, over-squashing and long-dependencies problems;and (3) five pre-training tasks that we specifically propose to enable FAIR to learn the semantics of IR tokens, flow type information, and the overall representation of IR. Experimental results show that FAIR can achieve state-of-the-art results on four code-related downstream tasks. © 2023, CC BY.

关键词： Semantics

IRS-Enhanced Anti-Jamming Precoding Against DISCO Physical Layer Jamming Attacks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huang, Huan Zhang, Hongliang Cai, Yi Zhang, Yunjing Lee Swindlehurst, A. Han, Zhu Electronic Information School Soochow University Suzhou China State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Peking University Beijing China Department of Electrical and Computer Engineering University of Houston Houston United States Center for Pervasive Communications and Computing University of California Irvine United States

Illegitimate intelligent reflective surfaces (IRSs) can pose significant physical layer security risks on multi-user multiple-input single-output (MU-MISO) systems. Recently, a DISCO approach has been proposed an illegitimate IRS with random and time-varying reflection coefficients, referred to as a "disco" IRS (DIRS). Such DIRS can attack MU-MISO systems without relying on either jamming power or channel state information (CSI), and classical anti-jamming techniques are ineffective for the DIRS-based fully-passive jammers (DIRS-based FPJs). In this paper, we propose an IRS-enhanced anti-jamming precoder against DIRS-based FPJs that requires only statistical rather than instantaneous CSI of the DIRS-jammed channels. Specifically, a legitimate IRS is introduced to reduce the strength of the DIRS-based jamming relative to the transmit signals at a legitimate user (LU). In addition, the active beamforming at the legitimate access point (AP) is designed to maximize the signal-to-jamming-plus-noise ratios (SJNRs). Numerical results are presented to evaluate the effectiveness of the proposed IRS-enhanced anti-jamming precoder against DIRS-based FPJs. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel state information

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

学校读者我要写书评

暂无评论

IEEE Transactions on Fuzzy systems 2025年第6期33卷 1899-1912页

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation