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

Automatic Retinal Nerve Fiber Trajectory Simulation and Quasi-polar Transformation for Detecting Retinal Nerve Fiber Layer Defect in Fundus Images

学校读者我要写书评

暂无评论

Automatic Retinal Nerve Fiber Trajectory Simulation and Quas...

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yanni Wang Gang Yang Dayong Ding Jianchun Zhao School of Information Renmin University of China Beijing China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Vistel AI Lab Beijing Office Visionary Intelligence Ltd. Beijing China

The retinal nerve fiber layer defects (RNFLD) provide early objective evidence for many retinal abnormalities, especially early glaucoma. The recent success of deep learning has led to exciting prospects in automating the detection of RNFLD, but it is highly dependent on the availability of large-scale datasets carefully annotated by experienced ophthalmologists, which is both time-consuming and cost-prohibitive. Most previous works on RNFLD detection lack a unified annotation scheme. In addition, they fail to exploit the intrinsic morphological characteristics of retinal nerve fiber bundles (RNFB). This work presents an automatic RNFB tracing method that is applicable not only in automating the RNFLD annotation process, but also in performing a quasi-polar transformation on fundus images for subsequent RNFLD detection tasks. Also, our proposed method paves the way for alleviating the problem of inter-annotator variation incurred merely by different annotation habits among annotators and reducing the noise before the input stage. Experiments reveal that our proposed quasi-polar transformation provides a significant boost to the existing RNFLD detection method and surpasses the state-of-the-art F1 by 4.2%, and that our method also offers a more accurate and reasonable description of RNFLD detection results, which demonstrates the orientation of RNFLD rather than vague position indication.

关键词：

PSSL: Self-supervised learning for personalized search with contrastive sampling

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhou, Yujia Dou, Zhicheng Zhu, Yutao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China School of Information Renmin University of China Université de Montréal MontréalQC Canada Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Personalized search plays a crucial role in improving user search experience owing to its ability to build user profiles based on historical behaviors. Previous studies have made great progress in extracting personal signals from the query log and learning user representations. However, neural personalized search is extremely dependent on sufficient data to train the user model. data sparsity is an inevitable challenge for existing methods to learn high-quality user representations. Moreover, the overemphasis on final ranking quality leads to rough data representations and impairs the generalizability of the model. To tackle these issues, we propose a Personalized Search framework with Self-supervised Learning (PSSL) to enhance data representations. Specifically, we adopt a contrastive sampling method to extract paired self-supervised information from sequences of user behaviors in query logs. Four auxiliary tasks are designed to pre-train the sentence encoder and the sequence encoder used in the ranking model. They are optimized by contrastive loss which aims to close the distance between similar user sequences, queries, and documents. Experimental results on two datasets demonstrate that our proposed model PSSL achieves state-of-the-art performance compared with existing *** Codes 68P20 Copyright © 2021, The Authors. All rights reserved.

关键词： Signal encoding

One chatbot per person: Creating personalized chatbots based on implicit user profiles

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Zhengyi Dou, Zhicheng Zhu, Yutao Zhong, Hanxun Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China School of Information Renmin University of China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE Université de Montréal MontréalQC Canada

Personalized chatbots focus on endowing chatbots with a consistent personality to behave like real users, give more informative responses, and further act as personal assistants. Existing personalized approaches tried to incorporate several text descriptions as explicit user profiles. However, the acquisition of such explicit profiles is expensive and time-consuming, thus being impractical for large-scale real-world applications. Moreover, the restricted predefined profile neglects the language behavior of a real user and cannot be automatically updated together with the change of user interests. In this paper, we propose to learn implicit user profiles automatically from large-scale user dialogue history for building personalized chatbots. Specifically, leveraging the benefits of Transformer on language understanding, we train a personalized language model to construct a general user profile from the user's historical responses. To highlight the relevant historical responses to the input post, we further establish a key-value memory network of historical post-response pairs, and build a dynamic post-aware user profile. The dynamic profile mainly describes what and howthe user has responded to similar posts in history. To explicitly utilize users' frequently used words, we design a personalized decoder to fuse two decoding strategies, including generating a word from the generic vocabulary and copying one word from the user's personalized vocabulary. Experiments on two real-world datasets show the significant improvement of our model compared with existing methods. Our code is available at https://***/zhengyima/DHAP. Copyright © 2021, The Authors. All rights reserved.

关键词： User profile

SP3: Enhancing Structured Pruning via PCA Projection

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hu, Yuxuan Zhang, Jing Zhao, Zhe Zhao, Chen Chen, Xiaodong Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China Tencent AI Lab Tencent Beijing China School of Computer Science and Technology Xi'an Jiaotong University Xi'An China

Structured pruning is a widely used technique for reducing the size of pre-trained language models (PLMs), but current methods often overlook the potential of compressing the hidden dimension (d) in PLMs, a dimension critical to model size and efficiency. This paper introduces a novel structured pruning approach, Structured Pruning with PCA Projection (SP3), targeting the effective reduction of d by projecting features into a space defined by principal components before masking. Extensive experiments on benchmarks (GLUE and SQuAD) show that SP3 can reduce d by 70%, compress 94% of the BERTbase model, and maintain over 96% accuracy and outperform other methods that compress d by 6% in accuracy at the same compression ratio. SP3 has also proven effective with other models, including OPT and Llama. Our data and code are available at ours repo. © 2023, CC BY.

关键词：

Deepfake Network Architecture Attribution

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Tianyun Huang, Ziyao Cao, Juan Li, Lei Li, Xirong Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China University of Chinese Academy of Sciences Beijing China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

With the rapid progress of generation technology, it has become necessary to attribute the origin of fake images. Existing works on fake image attribution perform multi-class classification on several Generative Adversarial Network (GAN) models and obtain high accuracies. While encouraging, these works are restricted to model-level attribution, only capable of handling images generated by seen models with a specific seed, loss and dataset, which is limited in real-world scenarios when fake images may be generated by privately trained models. This motivates us to ask whether it is possible to attribute fake images to the source models’ architectures even if they are finetuned or retrained under different configurations. In this work, we present the first study on Deepfake Network Architecture Attribution to attribute fake images on architecture-level. Based on an observation that GAN architecture is likely to leave globally consistent fingerprints while traces left by model weights vary in different regions, we provide a simple yet effective solution named DNA-Det for this problem. Extensive experiments on multiple cross-test setups and a large-scale dataset demonstrate the effectiveness of DNA-Det. Our source code and dataset can be found here: https://***/ICTMCG/DNA-Det Copyright © 2022, The Authors. All rights reserved.

关键词： Network architecture

A property of reductions in Fuzzy Variable Precision Rough Set model

学校读者我要写书评

暂无评论

A property of reductions in Fuzzy Variable Precision Rough S...

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Eric C. C. Tsang Su-Yun Zhao Cai-Li Zhou Faculty of Information Technology Macau University of Science and Technology Taipa Macao China Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China School of Mathematics and Computer Sciences Hebei University China

In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the monotonously increasing threshold. By using the nested structure of reductions, we could design algorithms to quickly find different reductions when a reduction is required. Here `different' means the reductions obtained using different thresholds.

关键词： Rough sets Approximation methods Fuzzy sets Educational institutions Computational modeling Machine learning Cybernetics

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Dong, Jianfeng Li, Xirong Xu, Duanqing College of Computer Science and Technology Zhejiang University Hangzhou310027 China Key Lab of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China

—In order to retrieve unlabeled images by textual queries, cross-media similarity computation is a key ingredient. Although novel methods are continuously introduced, little has been done to evaluate these methods together with large-scale query log analysis. Consequently, how far have these methods brought us in answering real-user queries is unclear. Given baseline methods that use relatively simple text/image matching, how much progress have advanced models made is also unclear. This paper takes a pragmatic approach to answering the two questions. Queries are automatically categorized according to the proposed query visualness measure, and later connected to the evaluation of multiple cross-media similarity models on three test sets. Such a connection reveals that the success of the state-of-the-art is mainly attributed to their good performance on visual-oriented queries, which account for only a small part of real-user queries. To quantify the current progress, we propose a simple text2image method, representing a novel query by a set of images selected from large-scale query log. Consequently, computing cross-media similarity between the query and a given image boils down to comparing the visual similarity between the given image and the selected images. Image retrieval experiments on the challenging Clickture dataset show that the proposed text2image is a strong baseline, comparing favorably to recent deep learning alternatives. Copyright © 2017, The Authors. All rights reserved.

关键词： Image retrieval

Dual Encoding for Zero-Example Video Retrieval

学校读者我要写书评

暂无评论

Dual Encoding for Zero-Example Video Retrieval

IEEE/CVF Conference on Computer Vision and Pattern Recognition

作者： Jianfeng Dong Xirong Li Chaoxi Xu Shouling Ji Yuan He Gang Yang Xun Wang College of Computer and Information Engineering Zhejiang Gongshang University Key Lab of Data Engineering and Knowledge Engineering Renmin University of China AI & Media Computing Lab School of Information Renmin University of China College of Computer Science Zhejiang University Alibaba Group

ISBN: (纸本)9781728132945

This paper attacks the challenging problem of zero-example video retrieval. In such a retrieval paradigm, an end user searches for unlabeled videos by ad-hoc queries described in natural language text with no visual example provided. Given videos as sequences of frames and queries as sequences of words, an effective sequence-to-sequence cross-modal matching is required. The majority of existing methods are concept based, extracting relevant concepts from queries and videos and accordingly establishing associations between the two modalities. In contrast, this paper takes a concept-free approach, proposing a dual deep encoding network that encodes videos and queries into powerful dense representations of their own. Dual encoding is conceptually simple, practically effective and end-to-end. As experiments on three benchmarks, i.e. MSR-VTT, TRECVID 2016 and 2017 Ad-hoc Video Search show, the proposed solution establishes a new state-of-the-art for zero-example video retrieval.

关键词： Videotapes video retrieval End users end-to-end Dual coding

SAMPLING LOVÁSZ LOCAL LEMMA FOR GENERAL CONSTRAINT SATISFACTION SOLUTIONS IN NEAR-LINEAR TIME

学校读者我要写书评

暂无评论

arXiv 2022年

作者： He, Kun Wang, Chunyang Yin, Yitong The Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China No. 59 Zhongguancun Street Haidian District Beijing China State Key Laboratory for Novel Software Technology Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing China

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has n variables with domain size at most q, each constraint contains at most k variables, shares variables with at most Δ constraints, and is violated with probability at most p by a uniform random assignment. The algorithm returns an almost uniform satisfying assignment in expected poly(q,k, Δ) ·(n) time, as long as a local lemma condition is satisfied: k · p · q2 · Δ5 ≤ C0 for a suitably small absolute constant C0. Previously, under similar local lemma conditions, sampling algorithms with running time polynomial in both nand Δ were only known for the almost atomic case, where each constraint is violated by a small number of forbidden local configurations. The key term Δ5 in our local lemma condition also improves the previously best known Δ7 for general CSPs [JPV21b] and Δ5.714 for atomic CSPs, including the special case of k-CNF [JPV21a, HSW21]. Our sampling approach departs from previous fast algorithms for sampling LLL, which were based on Markov chains. A crucial step of our algorithm is a recursive marginal sampler that is of independent interests. Within a local lemma regime, this marginal sampler can draw a random value for a variable according to its marginal distribution, at a cost independent of the size of the CSP. Copyright © 2022, The Authors. All rights reserved.

关键词： Constraint satisfaction problems