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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Wentao Zhang Defeng Zhao Wei-Shi Zheng Ruixuan Wang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing MOE Guangzhou China Peng Cheng Laboratory Shenzhen China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Current intelligent diagnostic systems often catastrophically forget old knowledge when learning new diseases only from the training dataset of the new diseases. Inspired by human learning of visual classes with the effective help of language, we propose a continual learning framework based on a pre-trained visual-language model (VLM) without storing any image of previously learned diseases. In this framework, textual prior knowledge of each new disease can be obtained by utilizing the frozen VLM’s text encoder, and then used to guide the visual learning of the new disease. This framework innovatively utilizes the textual prior knowledge of all previously learned diseases as out-of-distribution (OOD) information to help differentiate currently being-learned diseases from others. Extensive empirical evaluations on both medical and natural image datasets confirm the superiority of the proposed method over existing state-of-the-art methods in continual learning of new visual classes. The source code is available at https://***/OpenMedIA/TexCIL.

关键词： Continuing education Training Visualization Source coding Biological system modeling Benchmark testing Bioinformatics Medical diagnostic imaging Diseases

来源：评论

学校读者我要写书评

暂无评论

A Versatile Framework for Multi-scene Person Re-identification

arXiv

引用

arXiv 2024年

作者： Zheng, Wei-Shi Yan, Junkai Peng, Yi-Xing The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510275 China The Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education 510006 China

Person Re-identification (ReID) has been extensively developed for a decade in order to learn the association of images of the same person across non-overlapping camera views. To overcome significant variations between images across camera views, mountains of variants of ReID models were developed for solving a number of challenges, such as resolution change, clothing change, occlusion, modality change, and so on. Despite the impressive performance of many ReID variants, these variants typically function distinctly and cannot be applied to other challenges. To our best knowledge, there is no versatile ReID model that can handle various ReID challenges at the same time. This work contributes to the first attempt at learning a versatile ReID model to solve such a problem. Our main idea is to form a two-stage prompt-based twin modeling framework called VersReID. Our VersReID firstly leverages the scene label to train a ReID Bank that contains abundant knowledge for handling various scenes, where several groups of scene-specific prompts are used to encode different scene-specific knowledge. In the second stage, we distill a V-Branch model with versatile prompts from the ReID Bank for adaptively solving the ReID of different scenes, eliminating the demand for scene labels during the inference stage. To facilitate training VersReID, we further introduce the multi-scene properties into self-supervised learning of ReID via a multi-scene prioris data augmentation (MPDA) strategy. Through extensive experiments, we demonstrate the success of learning an effective and versatile ReID model for handling ReID tasks under multi-scene conditions without manual assignment of scene labels in the inference stage, including general, low-resolution, clothing change, occlusion, and cross-modality scenes. Codes and models are available at https://***/iSEE-laboratory/VersReID. Copyright © 2024, The Authors. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Cube Attacks Against Trivium, Kreyvium and ACORN with Practical Complexity 20th

Cube Attacks Against Trivium, Kreyvium and ACORN with Prac...

引用

20th International Conference on Information Security and Cryptology, Inscrypt 2024

作者： Chen, Yanqi Li, Ting Sun, Yao Key Laboratory of Cyberspace Security Defense Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Laboratory for Advanced Computing and Intelligence Engineering Wuxi China

ISBN: (纸本)9789819647330

The cube attack is a powerful cryptanalysis technique used against stream ciphers. It enables the retrieval of secret key information by computing the values of superpolys, with unknown secret key bits as variables. A practical key-recovery attack seeks to recover all key bits within a reasonable time complexity. The complexity of such attacks typically involves two main components: (1) the complexity of calculating the superpoly values under the real key, which depends on the size of the mother cube, and (2) the complexity of solving the superpoly system, guess-and-determine techniques are often used to solve the system especially when superpolys are nonlinear. In this paper, we improve the best-known practical key-recovery attack on Trivium by enhancing the techniques used in these two areas. First, we introduce a heuristic method to search for good mother cubes, enabling many balanced superpolys to recover. Second, we propose an efficient MILP-based model to search for a minimal number of guessed variables to solve the balanced superpoly systems, thus reducing the complexity of solving the system. With these advancements, we achieve key-recovery attacks on the 830- and 832-round Trivium within practical time complexity, surpassing the previous best result of 825 rounds. Additionally, we applied our new model to attack ACORN with 128-bit keys, achieving practical key-recovery attacks on the 507- and 611-round versions, compared to the previous highest of 477 rounds. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Preparation and Simulation of Quantum States of Matrices 6

Preparation and Simulation of Quantum States of Matrices

引用

6th International Conference on Electronic Information Technology and Computer engineering, EITCE 2022

作者： Liu, Zhengyu Liu, Xiaonan Xie, Haoshan Zhao, Chenyan School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou450000 China National Supercomputing Center in Zhengzhou Zhengzhou450000 China State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou450000 China

ISBN: (纸本)9781450397148

A basic problem of quantum computing is how to effectively express classical data in quantum systems. This problem is called state preparation problem, and the process of preparing quantum states is called coding. In this paper, the classical data of matrix is transformed into quantum states in the form of amplitude coding and simulated. This paper first introduces the detailed process of matrix transformation into the linear combination of quantum ground state, then designs a quantum circuit model to realize amplitude coding according to the idea of binary tree model and quantum random walk algorithm, and finally simulates the three matrices on IBM quantum cloud platform, and analyzes and introduces many situations. The experimental results verify the feasibility of converting the matrix into quantum states by amplitude coding, analyze the causes of errors in the experimental process, and put forward the corresponding solutions. This paper introduces in detail the whole process of matrix conversion to quantum states and the construction of quantum circuits for simulation. Compared with the existing experiments, the quantum circuits constructed in this paper are shorter in length, less in number of quantum gates, and more versatile. © 2022 Association for computing Machinery.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Language-Image Pre-Training 24

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Lang...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Li, Yudong Hou, Xianxu Dezhi, Zheng Shen, Linlin Zhao, Zhe School of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Tencent AI Lab Beijing China

ISBN: (纸本)9798400706868

While significant progress has been made in multi-modal learning driven by large-scale image-text datasets, there is still a noticeable gap in the availability of such datasets within the facial domain. To facilitate and advance the field of facial representation learning, we present FLIP-80M, a large-scale visual-linguistic dataset comprising over 80 million face images paired with text descriptions. FLIP-80M is constructed by leveraging the large openly available image-text-pair dataset LAION-5B and a mixed-method approach to filter face-related pairs from both visual and linguistic perspectives. Our curation process involves face detection, face caption classification, text de-noising, and synthesis-based image augmentation. As a result, FLIP-80M stands as the largest face-text dataset to date. To evaluate the potential of our dataset, we fine-tune the CLIP model using the proposed FLIP-80M, to create FLIP (Facial Language-Image Pretraining) and assess its representation capabilities across various downstream tasks. Our experiments demonstrate that our FLIP model achieves state-of-the-art results in a range of face analysis tasks, including face parsing, face alignment, and face attribute classification. The dataset and models are available at https://***/ydli-ai/FLIP. © 2024 ACM.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Approximate k-Nearest Neighbor Query over Spatial Data Federation 28th

Approximate k-Nearest Neighbor Query over Spatial Data Fede...

引用

28th International Conference on Database Systems for advanced Applications, DASFAA 2023

作者： Zhang, Kaining Tong, Yongxin Shi, Yexuan Zeng, Yuxiang Xu, Yi Chen, Lei Zhou, Zimu Xu, Ke Lv, Weifeng Zheng, Zhiming State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing School of Computer Science and Engineering and Institute of Artificial Intelligence Beihang University Beijing China Department of Computer Science and Engineering HKUST Hong Kong Guangzhou China City University of Hong Kong Hong Kong

ISBN: (纸本)9783031306365

Approximate nearest neighbor query is a fundamental spatial query widely applied in many real-world applications. In the big data era, there is an increasing demand to scale these queries over a spatial data federation, which consists of multiple data owners, each holding a private, disjoint partition of the entire spatial dataset. However, it is non-trivial to enable approximate k-nearest neighbor query over a spatial data federation. This is because stringent security constraints are often imposed to protect the sensitive, privately owned data partitions, whereas naively extending prior secure query processing solutions leads to high inefficiency (e.g., 100 s per query). In this paper, we propose two novel algorithms for efficient and secure approximate k-nearest neighbor query over a spatial data federation. We theoretically analyze their communication cost and time complexity, and further prove their security guarantees and approximation bounds. Extensive experiments show that our algorithms outperform the state-of-the-art solutions with respect to the query efficiency and often yield a higher accuracy. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

PRET: Planning with Directed Fidelity Trajectory for Vision and Language Navigation

arXiv

引用

arXiv 2024年

作者： Lu, Renjie Meng, Jingke Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Peng Cheng Laboratory Shenzhen China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

Vision and language navigation is a task that requires an agent to navigate according to a natural language instruction. Recent methods predict sub-goals on constructed topology map at each step to enable long-term action planning. However, they suffer from high computational cost when attempting to support such high-level predictions with GCN-like models. In this work, we propose an alternative method that facilitates navigation planning by considering the alignment between instructions and directed fidelity trajectories, which refers to a path from the initial node to the candidate locations on a directed graph without detours. This planning strategy leads to an efficient model while achieving strong performance. Specifically, we introduce a directed graph to illustrate the explored area of the environment, emphasizing directionality. Then, we firstly define the trajectory representation as a sequence of directed edge features, which are extracted from the panorama based on the corresponding orientation. Ultimately, we assess and compare the alignment between instruction and different trajectories during navigation to determine the next navigation target. Our method outperforms previous SOTA method BEVBert on RxR dataset and is comparable on R2R dataset while largely reducing the computational cost. Code is available: https://***/iSEE-laboratory/VLN-PRET. Copyright © 2024, The Authors. All rights reserved.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

An Instance-Level Motion-Aware Graph Model for Multi-target Multi-camera Tracking

An Instance-Level Motion-Aware Graph Model for Multi-target ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaotong Fan Huicheng Zheng School of Computer Science and Engineering Sun Yat-sen University China Guangdong Key Laboratory of Information Security Technology China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Multi-target multi-camera tracking (MTMCT), focusing on inferring trajectory across multiple surveillance videos, is holding significant practical utility. While numerous studies aim to learn visual features robust to illumination variation, occlusions, and other issues, the spatio-temporal information within a multi-camera system is not explored sufficiently. Existing methods generally exploit coarse-grained spatio-temporal information by modeling the distribution of time intervals between cameras. However, they tend to neglect the specific motion state of individual objects, which may hinder accurate cross-camera association. In this paper, we introduce a novel motionaware graph (MAG) model designed to extract instance-level spatio-temporal information that aligns with visual features and seamlessly aggregate these two kinds of information within a unified graph framework for MTMCT. Specifically, we propose a motion encoder-decoder module that predicts spatio-temporal consistency scores between objects based on their instance-level motion states. These scores are then integrated with visual similarity scores to generate discriminative feature representations for data association via a graph attention mechanism. Experimental evaluations and ablation studies on the large-scale MTA dataset demonstrate the superiority of our proposed model.

关键词： Visualization Attention mechanisms Tracking Surveillance Neural networks Lighting Predictive models

来源：评论

学校读者我要写书评

暂无评论

Single-View Scene Point Cloud Human Grasp Generation

Single-View Scene Point Cloud Human Grasp Generation

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yan-Kang Wang Chengyi Xing Yi-Lin Wei Xiao-Ming Wu Wei-Shi Zheng School of Computer Science and Engineering Sun Yat-sen University China Stanford University Stanford CA Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

In this work, we explore a novel task of generating human grasps based on single-view scene point clouds, which more accurately mirrors the typical real-world situation of observing objects from a single viewpoint. Due to the incompleteness of object point clouds and the presence of numerous scene points, the generated hand is prone to penetrating into the invisible parts of the object and the model is easily affected by scene points. Thus, we introduce S2HGrasp, a framework composed of two key modules: the Global Perception module that globally perceives partial object point clouds, and the DiffuGrasp module designed to generate high-quality human grasps based on complex inputs that include scene points. Additionally, we introduce S2HGD dataset, which comprises approximately 99,000 single-object single-view scene point clouds of 1,668 unique objects, each annotated with one human grasp. Our extensive experiments demonstrate that S2HGrasp can not only generate natural human grasps regardless of scene points, but also effectively prevent penetration between the hand and invisible parts of the object. Moreover, our model showcases strong generalization capability when applied to unseen objects. Our code and dataset are available at https://***/iSEE-laboratory/S2HGrasp.

关键词： Point cloud compression Computer vision Codes Computational modeling Pattern recognition Mirrors Task analysis

来源：评论

学校读者我要写书评

暂无评论

EgoExo-Fitness: Towards Egocentric and Exocentric Full-Body Action Understanding

arXiv

引用

arXiv 2024年

作者： Li, Yuan-Ming Huang, Wei-Jin Wang, An-Lan Zeng, Ling-An Meng, Jing-Ke Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Peng Cheng Laboratory Shenzhen China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China School of Artificial Intelligence Sun Yat-sen University China

We present EgoExo-Fitness, a new full-body action understanding dataset, featuring fitness sequence videos recorded from synchronized egocentric and fixed exocentric (third-person) cameras. Compared with existing full-body action understanding datasets, EgoExo-Fitness not only contains videos from first-person perspectives, but also provides rich annotations. Specifically, two-level temporal boundaries are provided to localize single action videos along with sub-steps of each action. More importantly, EgoExo-Fitness introduces innovative annotations for interpretable action judgement–including technical keypoint verification, natural language comments on action execution, and action quality scores. Combining all of these, EgoExo-Fitness provides new resources to study egocentric and exocentric full-body action understanding across dimensions of "what", "when", and "how well". To facilitate research on egocentric and exocentric full-body action understanding, we construct benchmarks on a suite of tasks (i.e., action classification, action localization, cross-view sequence verification, cross-view skill determination, and a newly proposed task of guidance-based execution verification), together with detailed analysis. Data and code are available at https://***/iSEE-laboratory/EgoExo-Fitness/tree/main. Copyright © 2024, The Authors. All rights reserved.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：