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

arXiv 2024年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security 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 Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Security Department of Alibaba Group Hangzhou311121 China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

Collab.rative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and collab.rative filtering. Following the convention of RS, existing practices exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collab.rative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to introduce a set of multiple representations for each user in the system where users' preference toward an item is aggregated by taking the minimum item-user distance among their embedding set. Specifically, we instantiate two effective assignment strategies to explore a proper quantity of vectors for each user. Meanwhile, a Diversity Control Regularization Scheme (DCRS) is developed to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could induce a smaller generalization error than traditional CML. Furthermore, we notice that CML-based approaches usually require negative sampling to reduce the heavy computational burden caused by the pairwise objective therein. In this paper, we reveal the fundamental limitation of the widely adopted hard-aware sampling from the One-Way Partial AUC (OPAUC) perspective and then develop an effective sampling alternative for the CML-based paradigm. Finally, comprehensive experiments over a range of benchmark datasets speak to the efficacy of DPCML. Code are availab.e at https://***/statusrank/LibCML. © 2024, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Forensicability Assessment of Questioned Images in Recapturing Detection

arXiv

引用

arXiv 2022年

作者： Chen, Changsheng Zhao, Lin Cai, Rizhao Yu, Zitong Huang, Jiwu Kot, Alex C. The Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China The Department of Electrical and Electrics Engineering Nanyang Technological University Singapore639798 Singapore

Recapture detection of face and document images is an important forensic task. With deep learning, the performances of face anti-spoofing (FAS) and recaptured document detection have been improved significantly. However, the performances are not yet satisfactory on samples with weak forensic cues. The amount of forensic cues can be quantified to allow a reliable forensic result. In this work, we propose a forensicability assessment network to quantify the forensicability of the questioned samples. The low-forensicability samples are rejected before the actual recapturing detection process to improve the efficiency of recapturing detection systems. We first extract forensicability features related to both image quality assessment and forensic tasks. By exploiting domain knowledge of the forensic application in image quality and forensic features, we define three task-specific forensicability classes and the initialized locations in the feature space. Based on the extracted features and the defined centers, we train the proposed forensic assessment network (FANet) with cross-entropy loss and update the centers with a momentum-based update method. We integrate the trained FANet with practical recapturing detection schemes in face anti-spoofing (FAS) and recaptured document detection tasks. Experimental results show that, for a generic CNN-based FAS scheme, FANet reduces the EERs from 33.75% to 19.23% under ROSE to IDIAP protocol by rejecting samples with the lowest 30% forensicability scores. The performance of FAS schemes is poor in the rejected samples, with EER as high as 56.48%. Similar performances in rejecting low-forensicability samples have been observed for the state-of-the-art approaches in FAS and recaptured document detection tasks. To the best of our knowledge, this is the first work that assesses the forensicability of recaptured document images and improves the system efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

APPLICATIONS OF KNOWLEDGE GRAPHS FOR THE FOOD SCIENCE AND INDUSTRY

arXiv

引用

arXiv 2021年

作者： Min, Weiqing Liu, Chunlin Xu, Leyi Jiang, Shuqiang Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Soochow University Jiangsu Suzhou215021 China

The deployment of various networks (e.g., Internet of Things (IoT) and mobile networks), databases (e.g., nutrition tables and food compositional databases) and social media (e.g., Instagram and Twitter) generates huge amounts of food data, which present researchers with an unprecedented opportunity to study various problems and applications in the food science and industry via data-driven computational methods. However, these multi-source heterogeneous food data appear as information silos, leading to the difficulty in fully exploiting these food data. The knowledge graph provides a unified and standardized conceptual terminology in a structured form, and thus can effectively organize these food data to benefit various applications. In this review, we provide a brief introduction of knowledge graphs, and the evolution of food knowledge organization mainly from food ontology to food knowledge graphs. We then summarize seven representative applications of food knowledge graphs, such as new recipe development, diet-disease correlation discovery and personalized dietary recommendation. We also discuss future directions in this field, such as multimodal food knowledge graph construction and food knowledge graphs for human health. Copyright © 2021, The Authors. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Joint Deep Matching Model of OCT Retinal Layer Segmentation

引用

Computers, Materials & Continua 2020年第6期63卷 1485-1498页

作者： Mei Yang Yuanjie Zheng Weikuan Jia Yunlong He Tongtong Che Jinyu Cong School of Information Science and Engineering at Shandong Normal University Jinan250358China Key Lab of Intelligent Computing and Information Security in Universities of Shandong Shandong Provincial Key Laboratory for Novel Distributed Computer Software TechnologyInstitute of Biomedical SciencesShandong Normal UniversityJinan250358China INSA Lyon University of LyonCNRSInsermVilleurbanne69621 CedexFrance

Optical Coherence Tomography(OCT)is very important in medicine and provide useful diagnostic *** retinal layer thicknesses plays a vital role in pathophysiologic factors of many ocular *** the existing retinal layer segmentation approaches,learning or deep learning-based methods belong to the ***,most of these techniques rely on manual-marked layers and the performances are limited due to the image *** order to overcome this limitation,we build a framework based on gray value curve matching,which uses depth learning to match the curve for semi-automatic segmentation of retinal layers from *** depth convolution network learns the column correspondence in the OCT image *** whole OCT image participates in the depth convolution neural network operation,compares the gray value of each column,and matches the gray value sequence of the transformation column and the next *** this algorithm,when a boundary point is manually specified,we can accurately segment the boundary between retinal *** experimental results obtained from a 54-subjects database of both normal healthy eyes and affected eyes demonstrate the superior performances of our approach.

关键词： OCT retinal segmentation deep learning 1D convolution

来源：评论

学校读者我要写书评

暂无评论

Disentangled Generation Network for Enlarged License Plate Recognition and A Unified Dataset

arXiv

引用

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 lab.r 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, lab.l 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 availab.e at https://***/ICTMCG/Characterizing-Weibo-Multi-Domain-False-News. © 2022, CC BY-NC-ND.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalab.e 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 scalab.e 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 scalab.lity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：