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

arXiv 2022年

作者： Li, Chenglong Yang, Xiaobin Wang, Guohao Zheng, Aihua Tan, Chang Jia, Ruoran Tang, Jin Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China iFLYTEK Co. Ltd. Hefei230088 China

License plate recognition plays a critical role in many practical applications, but license plates of large vehicles are difficult to be recognized due to the factors of low resolution, contamination, low illumination, and occlusion, to name a few. To overcome the above factors, the transportation management department generally introduces the enlarged license plate behind the rear of a vehicle. However, enlarged license plates have high diversity as they are non-standard in position, size, and style. Furthermore, the background regions contain a variety of noisy information which greatly disturbs the recognition of license plate characters. Existing works have not studied this challenging problem. In this work, we first address the enlarged license plate recognition problem and contribute a dataset containing 9342 images, which cover most of the challenges of real scenes. However, the created data are still insufficient to train deep methods of enlarged license plate recognition, and building large-scale training data is very time-consuming and high labor cost. To handle this problem, we propose a novel task-level disentanglement generation framework based on the Disentangled Generation Network (DGNet), which disentangles the generation into the text generation and background generation in an end-to-end manner to effectively ensure diversity and integrity, for robust enlarged license plate recognition. Extensive experiments on the created dataset are conducted, and we demonstrate the effectiveness of the proposed approach in three representative text recognition frameworks. © 2022, CC BY.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

HieNet: Bidirectional Hierarchy Framework for Automated ICD Coding

arXiv

引用

arXiv 2022年

作者： Wang, Shi Tang, Daniel Zhang, Luchen Li, Huilin Han, Ding Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China TruX Luxembourg National Computer Network Emergency Response Technical Team Coordination Center of China China Department of Civil Engineering Technical University of Denmark Lyngby2800 Denmark Huazhong University of Science and Technology China

International Classification of Diseases (ICD) is a set of classification codes for medical records. Automated ICD coding, which assigns unique International Classification of Diseases codes with each medical record, is widely used recently for its efficiency and error-prone avoidance. However, there are challenges that remain such as heterogeneity, label unbalance, and complex relationships between ICD codes. In this work, we proposed a novel Bidirectional Hierarchy Framework(HieNet) to address the challenges. Specifically, a personalized PageRank routine is developed to capture the co-relation of codes, a bidirectional hierarchy passage encoder to capture the codes’ hierarchical representations, and a progressive predicting method is then proposed to narrow down the semantic searching space of prediction. We validate our method on two widely used datasets. Experimental results on two authoritative public datasets demonstrate that our proposed method boosts the state-of-the-art performance by a large margin. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Point, Segment and Count: A Generalized Framework for Object Counting

arXiv

引用

arXiv 2023年

作者： Huang, Zhizhong Dai, Mingliang Zhang, Yi Zhang, Junping Shan, Hongming Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China School of Cyber Science and Engineering Sichuan University Chengdu610065 China Institute of Science and Technology for Brain-inspired Intelligence MOE Frontiers Center for Brain Science Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Shanghai200433 China

Class-agnostic object counting aims to count all objects in an image with respect to example boxes or class names, a.k.a few-shot and zero-shot counting. In this paper, we propose a generalized framework for both few-shot and zero-shot object counting based on detection. Our framework combines the superior advantages of two foundation models without compromising their zero-shot capability: (i) SAM to segment all possible objects as mask proposals, and (ii) CLIP to classify proposals to obtain accurate object counts. However, this strategy meets the obstacles of efficiency overhead and the small crowded objects that cannot be localized and distinguished. To address these issues, our framework, termed PseCo, follows three steps: point, segment, and count. Specifically, we first propose a class-agnostic object localization to provide accurate but least point prompts for SAM, which consequently not only reduces computation costs but also avoids missing small objects. Furthermore, we propose a generalized object classification that leverages CLIP image/text embeddings as the classifier, following a hierarchical knowledge distillation to obtain discriminative classifications among hierarchical mask proposals. Extensive experimental results on FSC-147, COCO, and LVIS demonstrate that PseCo achieves state-of-the-art performance in both few-shot/zero-shot object counting/detection. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Characterizing Multi-domain False News and Underlying User Effects on Chinese Weibo

arXiv

引用

arXiv 2022年

作者： Sheng, Qiang Cao, Juan Bernard, H. Russell Shu, Kai Li, Jintao Liu, Huan Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Institute for Social Science Research Arizona State University TempeAZ United States Department of Computer Science Illinois Institute of Technology ChicagoIL United States Computer Science and Engineering Arizona State University TempeAZ United States

False news that spreads on social media has proliferated over the past years and has led to multi-aspect threats in the real world. While there are studies of false news on specific domains (like politics or health care), little work is found comparing false news across domains. In this article, we investigate false news across nine domains on Weibo, the largest Twitter-like social media platform in China, from 2009 to 2019. The newly collected data comprise 44,728 posts in the nine domains, published by 40,215 users, and reposted over 3.4 million times. Based on the distributions and spreads of the multi-domain dataset, we observe that false news in domains that are close to daily life like health and medicine generated more posts but diffused less effectively than those in other domains like politics, and that political false news had the most effective capacity for diffusion. The widely diffused false news posts on Weibo were associated strongly with certain types of users - by gender, age, etc. Further, these posts provoked strong emotions in the reposts and diffused further with the active engagement of false-news starters. Our findings have the potential to help design false news detection systems in suspicious news discovery, veracity prediction, and display and explanation. The comparison of the findings on Weibo with those of existing work demonstrates nuanced patterns, suggesting the need for more research on data from diverse platforms, countries, or languages to tackle the global issue of false news. The code and new anonymized dataset are available at https://***/ICTMCG/Characterizing-Weibo-Multi-Domain-False-News. © 2022, CC BY-NC-ND.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP

arXiv

引用

arXiv 2022年

作者： Chen, Jie Chen, Shouzhen Bai, Mingyuan Gao, Junbin Zhang, Junping Pu, Jian Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Discipline of Business Analytics The University of Sydney Business School The University of Sydney Australia Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China

The message-passing mechanism helps Graph Neural Networks (GNNs) achieve remarkable results on various node classification tasks. Nevertheless, the recursive nodes fetching and aggregation in message-passing cause inference latency when deploying GNNs to large-scale graphs. One promising inference acceleration direction is to distill the GNNs into message-passing-free student multi-layer perceptrons (MLPs). However, the MLP student cannot fully learn the structure knowledge due to the lack of structure inputs, which causes inferior performance in the heterophily and inductive scenarios. To address this, we intend to inject structure information into MLP-like students in low-latency and interpretable ways. Specifically, we first design a Structure-Aware MLP (SA-MLP) student that encodes both features and structures without message-passing. Then, we introduce a novel structure-mixing knowledge distillation strategy to enhance the learning ability of MLPs for structure information. Furthermore, we design a latent structure embedding approximation technique with two-stage distillation for inductive scenarios. Extensive experiments on eight benchmark datasets under both transductive and inductive settings show that our SA-MLP can consistently outperform the teacher GNNs, while maintaining faster inference as MLPs. The source code of our work can be found in https://***/JC-202/SA-MLP. Copyright © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Mining latent structures for multimedia recommendation

arXiv

引用

arXiv 2021年

作者： Zhang, Jinghao Zhu, Yanqiao Liu, Qiang Wu, Shu Wang, Shuhui Wang, Liang Center for Research on Intelligent Perception and Computing Institute of Automation Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences Artificial Intelligence Research Chinese Academy of Sciences

Multimedia content is of predominance in the modern Web era. Investigating how users interact with multimodal items is a continuing concern within the rapid development of recommender systems. The majority of previous work focuses on modeling user-item interactions with multimodal features included as side information. However, this scheme is not well-designed for multimedia recommendation. Specifically, only collaborative item-item relationships are implicitly modeled through high-order item-user-item relations. Considering that items are associated with rich contents in multiple modalities, we argue that the latent semantic item-item structures underlying these multimodal contents could be beneficial for learning better item representations and further boosting recommendation. To this end, we propose a LATent sTructure mining method for multImodal reCommEndation, which we term LATTICE for brevity. To be specific, in the proposed LATTICE model, we devise a novel modality-aware structure learning layer, which learns item-item structures for each modality and aggregates multiple modalities to obtain latent item graphs. Based on the learned latent graphs, we perform graph convolutions to explicitly inject high-order item affinities into item representations. These enriched item representations can then be plugged into existing collaborative filtering methods to make more accurate recommendations. Extensive experiments on three real-world datasets demonstrate the superiority of our method over state-of-the-art multimedia recommendation methods and validate the efficacy of mining latent item-item relationships from multimodal features. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Sequential Manipulation Against Rank Aggregation: Theory and Algorithm

arXiv

引用

arXiv 2024年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Liu, Wei Cao, Xiaochun Sun, Yingfei Huang, Qingming The School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China The Tencent Data Platform Shenzhen518054 China The School of Cyber Science and Technology Shenzhen Campus of Sun Yat-Sen University Shenzhen518107 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China University of Chinese Academy of Sciences Beijing100049 China

Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc. Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to manipulate the ranking list. However, the ideal attack opportunity and the excessive adversarial capability cause the existing methods to be impractical. To fully explore the potential risks, we leverage an online attack on the vulnerable data collection process. Since it is independent of rank aggregation and lacks effective protection mechanisms, we disrupt the data collection process by fabricating pairwise comparisons without knowledge of the future data or the true distribution. From the game-theoretic perspective, the confrontation scenario between the online manipulator and the ranker who takes control of the original data source is formulated as a distributionally robust game that deals with the uncertainty of knowledge. Then we demonstrate that the equilibrium in the above game is potentially favorable to the adversary by analyzing the vulnerability of the sampling algorithms such as Bernoulli and reservoir methods. According to the above theoretical analysis, different sequential manipulation policies are proposed under a Bayesian decision framework and a large class of parametric pairwise comparison models. For attackers with complete knowledge, we establish the asymptotic optimality of the proposed policies. To increase the success rate of the sequential manipulation with incomplete knowledge, a distributionally robust estimator, which replaces the maximum likelihood estimation in a saddle point problem, provides a conservative data generation solution. Finally, the corroborating empirical evidence shows that the proposed method manipulates the results of rank aggregation methods in a sequential manner. © 2024, CC BY.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Cell-Free Massive MIMO-OFDM for High-Speed Train Communications

arXiv

引用

arXiv 2022年

作者： Zheng, Jiakang Zhang, Jiayi Björnson, Emil Li, Zhetao Ai, Bo The School of Electronic and Information Engineering Beijing Jiaotong University Beijing100044 China The Department of Computer Science KTH Royal Institute of Technology Kista Sweden The Hunan International Scientific and Technological Cooperation Base of Intelligent Network Key Laboratory of Intelligent Computing & Information Processing Ministry of Education Xiangtan University Hunan411105 China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China

Cell-free (CF) massive multiple-input multiple-output (MIMO) systems show great potentials in low-mobility scenarios, due to cell boundary disappearance and strong macro diversity. However, the great Doppler frequency offset (DFO) leads to serious inter-carrier interference in orthogonal frequency division multiplexing (OFDM) technology, which makes it difficult to provide high-quality transmissions for both high-speed train (HST) operation control systems and passengers. In this paper, we focus on the performance of CF massive MIMO-OFDM systems with both fully centralized and local minimum mean square error (MMSE) combining in HST communications. Considering the local maximum ratio (MR) combining, the large-scale fading decoding (LSFD) cooperation and the practical effect of DFO on system performance, exact closed-form expressions for uplink spectral efficiency (SE) expressions are derived. We observe that cooperative MMSE combining achieves better SE performance than uncooperative MR combining. In addition, HST communications with small cell and cellular massive MIMO-OFDM systems are compared in terms of SE. Numerical results reveal that the CF massive MIMO-OFDM system achieves a larger and more uniform SE than the other systems. Finally, the train antenna centric (TA-centric) CF massive MIMO-OFDM system is designed for practical implementation in HST communications, and three power control schemes are adopted to optimize the propagation of TAs for reducing the impact of the DFO. Copyright © 2022, The Authors. All rights reserved.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

SelfGait: A spatiotemporal representation learning method for self-supervised gait recognition

arXiv

引用

arXiv 2021年

作者： Liu, Yiqun Zeng, Yi Pu, Jian Shan, Hongming He, Peiyang Zhang, Junping Shanghai Key Lab of Intelligent Information Processing School of Computer Science China Institute of Science and Technology for Brain-inspired Intelligence Fudan University 200433 China

Gait recognition plays a vital role in human identification since gait is a unique biometric feature that can be perceived at a distance. Although existing gait recognition methods can learn gait features from gait sequences in different ways, the performance of gait recognition suffers from insufficient labeled data, especially in some practical scenarios associated with short gait sequences or various clothing styles. It is unpractical to label the numerous gait data. In this work, we propose a self-supervised gait recognition method, termed SelfGait, which takes advantage of the massive, diverse, unlabeled gait data as a pre-training process to improve the representation abilities of spatiotemporal backbones. Specifically, we employ the horizontal pyramid mapping (HPM) and micro-motion template builder (MTB) as our spatiotemporal backbones to capture the multi-scale spatiotemporal representations. Experiments on CASIA-B and OU-MVLP benchmark gait datasets demonstrate the effectiveness of the proposed SelfGait compared with four state-of-the-art gait recognition methods. © 2021, CC BY.

关键词： Gait analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：