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

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Haoxiang Ma Modi Shi Boyang Gao Di Huang State Key Laboratory of Complex and Critical Software Environment School of Computer Science and Engineering Beihang University Beijing China Geometry Robotics

ISBN: (纸本)9798331314385

This paper tackles the challenge of active perception for robotic grasp detection in cluttered environments. Incomplete 3D geometry information can negatively affect the performance of learning-based grasp detection methods, and scanning the scene from multiple views introduces significant time costs. To achieve reliable grasping performance with efficient camera movement, we propose an active grasp detection framework based on the Neural Graspness Field (NGF), which models the scene incrementally and facilitates next-best-view planning. Constructed in real-time as the camera moves, the NGF effectively models the grasp distribution in 3D space by rendering graspness predictions from each view. For next-best-view planning, we aim to reduce the uncertainty of the NGF through a graspness inconsistency-guided policy, selecting views based on discrepancies between NGF outputs and a pre-trained graspness network. Additionally, we present a neural graspness sampling method that decodes graspness values from the NGF to improve grasp pose detection results. Extensive experiments on the GraspNet-1Billion benchmark demonstrate significant performance improvements compared to previous works. Real-world experiments show that our method achieves a superior trade-off between grasping performance and time costs. Code is available at https://***/mahaoxiang822/ActiveNGF.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Collaborative Teams Recruitment Based on Dual Constraints of Willingness and Trust for Crowd Sensing 25

Collaborative Teams Recruitment Based on Dual Constraints of...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Song, Nianyun Lu, Dianjie Shi, Yepeng Zhang, Guijuan Liu, Hong School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology State Key Laboratory of High-end Server and Storage Technology Shandong Jinan China

ISBN: (纸本)9781665405270

As crowd sensing tasks become more complex, it is increasingly needed for participants to form teams to collaborate interactively in order to complete tasks more efficiently. It is valuable to fully understand user behavior, the organizational principles of crowd collaboration teams and incorporate them into the user recruitment process. In fact, there is a two-way process of subjective and objective selection for building a team in crowd sensing. From the participant's perspective, the willingness of users to participate in the task is a subjective factor;from the platform's perspective, the trust relationship between users is an objective factor. However, existing work has not well recognized the value of including collaborative teams in the crowd sensing recruitment process and has not considered the willingness and trust relationships between participants simultaneously, which results in poor quality of service (QoS) among recruited users. To address this problem, we propose a willingness and trust-based collaborative team recruitment method (WT-CTRM). First, we construct a willingness network (WN) and a trust network (TN) to describe the interaction of willingness and trust among the collaborated users respectively. Based on these networks, we then predict the unknown willingness and trust relationships between users for collaboration by using graph convolutional networks (GCNs). Finally, we build collaborative teams for the user recruitment process of crowd sensing based on the consensus constraints of the predicted willingness network and trust network. Simulation results show that the recruitment scheme significantly improves the QoS in task scenarios with collaborative requirements. © 2022 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Vision-language models are strong noisy label detectors 24

Vision-language models are strong noisy label detectors

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Tong Wei Hao-Tian Li Chun-Shu Li Jiang-Xin Shi Yu-Feng Li Min-Ling Zhang School of Computer Science and Engineering Southeast University Nanjing China and Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education China and National Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Engineering Southeast University Nanjing China and Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education China National Key Laboratory for Novel Software Technology Nanjing University China and School of Artificial Intelligence Nanjing University China

ISBN: (纸本)9798331314385

Recent research on fine-tuning vision-language models has demonstrated impressive performance in various downstream tasks. However, the challenge of obtaining accurately labeled data in real-world applications poses a significant obstacle during the fine-tuning process. To address this challenge, this paper presents a Denoising Fine-Tuning framework, called DEFT, for adapting vision-language models. DEFT utilizes the robust alignment of textual and visual features pre-trained on millions of auxiliary image-text pairs to sieve out noisy labels. The proposed framework establishes a noisy label detector by learning positive and negative textual prompts for each class. The positive prompt seeks to reveal distinctive features of the class, while the negative prompt serves as a learnable threshold for separating clean and noisy samples. We employ parameter-efficient fine-tuning for the adaptation of a pre-trained visual encoder to promote its alignment with the learned textual prompts. As a general framework, DEFT can seamlessly fine-tune many pre-trained models to downstream tasks by utilizing carefully selected clean samples. Experimental results on seven synthetic and real-world noisy datasets validate the effectiveness of DEFT in both noisy label detection and image classification tasks. Our source code is available at https://***/HotanLee/DeFT.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-View Representation Learning for Multi-Instance Learning with Applications to Medical Image Classification

Multi-View Representation Learning for Multi-Instance Learni...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Zhao, Lu Yuan, Liming Li, Zhenliang Wen, Xianbin School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China School of Computer and Information Engineering Tianjin Chengjian University Tianjin300384 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin300384 China

ISBN: (纸本)9781665468190

Multi-Instance Learning (MIL) is a weakly supervised learning paradigm, in which every training example is a labeled bag of unlabeled instances. In typical MIL applications, instances are often used for describing the features of regions/parts in a whole object, e.g., regional patches/lesions in an eye-fundus image. However, for a (semantically) complex part the standard MIL formulation puts a heavy burden on the representation ability of the corresponding instance. To alleviate this pressure, we still adopt a bag-of-instances as an example in this paper, but extract from each instance a set of representations using 1 times1 convolutions. The advantages of this tactic are two-fold: i) This set of representations can be regarded as multi-view representations for an instance;ii) Compared to building multi-view representations directly from scratch, extracting them automatically using 1 times1 convolutions is more economical, and may be more effective since 1 times1 convolutions can be embedded into the whole network. Furthermore, we apply two consecutive multi-instance pooling operations on the reconstituted bag that has actually become a bag of sets of multi-view representations. We have conducted extensive experiments on several canonical MIL data sets from different application domains. The experimental results show that the proposed framework outperforms the standard MIL formulation in terms of classification performance and has good interpretability. © 2022 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

SMART: towards pre-trained missing-aware model for patient health status prediction 24

SMART: towards pre-trained missing-aware model for patient h...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Zhihao Yu Xu Chu Yujie Jin Yasha Wang Junfeng Zhao School of Computer Science Peking University and National Research and Engineering Center of Software Engineering Peking University School of Computer Science Peking University and Center on Frontiers of Computing Studies Peking University Beijing China and Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China and Peking University Information Technology Institute (Tianjin Binhai) National Research and Engineering Center of Software Engineering Peking University and Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China and Peking University Information Technology Institute (Tianjin Binhai) School of Computer Science Peking University and National Research and Engineering Center of Software Engineering Peking University and Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China and Nanhu Laboratory Jiaxing China

ISBN: (纸本)9798331314385

Electronic health record (EHR) data has emerged as a valuable resource for analyzing patient health status. However, the prevalence of missing data in EHR poses significant challenges to existing methods, leading to spurious correlations and suboptimal predictions. While various imputation techniques have been developed to address this issue, they often obsess difficult-to-interpolate details and may introduce additional noise when making clinical predictions. To tackle this problem, we propose SMART, a Self-Supervised Missing-Aware RepresenTation Learning approach for patient health status prediction, which encodes missing information via missing-aware temporal and variable attentions and learns to impute missing values through a novel self-supervised pre-training approach which reconstructs missing data representations in the latent space rather than in input space as usual. By adopting elaborated attentions and focusing on learning higher-order representations, SMART promotes better generalization and robustness to missing data. We validate the effectiveness of SMART through extensive experiments on six EHR tasks, demonstrating its superiority over state-of-the-art methods. Our code is available at https://***/yzhHoward/SMART.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Precipitation Nowcasting Based on ST-LSTM

引用

computers, Materials & Continua 2022年第9期72卷 4867-4877页

作者： Wei Fang Liang Shen Victor S.Sheng Qiongying Xue School of Computer&Software Engineering Research Center of Digital ForensicsMinistry of EducationNanjing University of Information Science&TechnologyNanjing210044China State Key Laboratory of Severe Weather Chinese Academy of Meteorological SciencesBeijing100081China Department of Computer Texas Tech UniversityLubbockTX79409USA

Precipitation nowcasting is of great significance for severe convective weather *** echo extrapolation is a commonly used precipitation nowcasting ***,the traditional radar echo extrapolation methods are encountered with the dilemma of low prediction accuracy and extrapolation *** reason is that those methods cannot retain important long-term information and fail to capture short-term motion information from the long-range data *** order to solve the above problems,we select the spatiotemporal long short-term memory(ST-LSTM)as the recurrent unit of the model and integrate the 3D convolution operation in it to strengthen the model’s ability to capture short-term motion information which plays a vital role in the prediction of radar echo motion *** the purpose of enhancing the model’s ability to retain long-term important information,we also introduce the channel attention mechanism to achieve this *** the experiment,the training and testing datasets are constructed using radar data of Shanghai,we compare our model with three benchmark models under the reflectance thresholds of 15 and *** results demonstrate that the proposed model outperforms the three benchmark models in radar echo extrapolation task,which obtains a higher accuracy rate and improves the clarity of the extrapolated image.

关键词： Precipitation nowcasting radar echo extrapolation ST-LSTM attention mechanism

来源：评论

学校读者我要写书评

暂无评论

Deep Multi-Instance Learning with Adaptive Recurrent Pooling for Medical Image Classification

Deep Multi-Instance Learning with Adaptive Recurrent Pooling...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Ding, Yi Zhao, Lu Yuan, Liming Wen, Xianbin School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China School of Computer and Information Engineering Tianjin Chengjian University Tianjin300384 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin300384 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin300384 China

ISBN: (纸本)9781665468190

Recently, deep multi-instance neural networks have been successfully applied for medical image classification, where only image-level labels rather than fine-grained patch-level labels are available for use. One key issue for these multi-instance neural networks is how to aggregate all patch (instance) features into an entire image (bag) representation, referred to as multi-instance pooling, e.g., max, mean, and attention based pooling. Nevertheless, these multi-instance pooling operations do not take the structural information within an image into account. This is obviously inappropriate for medical image classification since there often exist certain dependencies among regional patches/lesions. We propose an adaptive recurrent pooling based deep multi-instance neural network in this paper. In this network, we first extract multi-view global structural features from every bag using the self-attention mechanism, and then aggregate these multi-view features into a whole bag representation based on the adaptive recurrent pooling operation in order to further capture the contextual information within the bag. Moreover, we introduce the cross-normalization operation used in the Unit Force Operated Vision Transformer into the self-attention module to reduce its computational complexity. We have experimentally evaluated the performance of the proposed network on three medical image datasets, namely UCSB breast, Messidor, and Colon cancer. The results demonstrate the advantage of our network over current state-of-the-art deep multi-instance networks in terms of classification accuracy and interpretability. © 2022 IEEE.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

A Novel Association Rule Mining Method for Streaming Temporal Data

引用

Annals of Data Science 2022年第4期9卷 863-883页

作者： Zheng, Hui Li, Peng He, Jing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Nanjing China School of Software and Electrical Engineering Swinburne University of Technology Melbourne Australia

Streaming temporal data contains time stamps and values, challenging to quantify relationships of time stamps and corresponding values. Moreover, the characteristics and relationships of streaming temporal data are not invariable. Thus, it is impossible to analyse all data by a trained model at the beginning of data streams. Practically, the trained model to analyse streaming temporal data should change according to the increasing volume of data. Association rule mining, on the other hand, can find potential relationships from given data. This paper proposes an association rule mining method for streaming temporal data to discover potential relationships from streaming temporal data. Our experiments verify our proposed method. A public data set is applied to compare the performance of the proposed method and its counterpart. A small data set is also applied for two case studies to further illustrate our proposed method mine association rules with streaming temporal data with time stamps and corresponding values. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Association rule mining Streaming data Potential relationships Timestamp Value Data mining Association rule learning

来源：评论

学校读者我要写书评

暂无评论

CLIMS++: Cross Language Image Matching with Automatic Context Discovery for Weakly Supervised Semantic Segmentation

引用

International Journal of computer Vision 2025年 1-20页

作者： Xie, Jinheng Deng, Songhe Hou, Xianxu Luo, Zhaochuan Shen, Linlin Huang, Yawen Zheng, Yefeng Shou, Mike Zheng Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computer Science Wenzhou-Kean University Wenzhou325060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore639798 Singapore School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou215400 China Jarvis Research Center Tencent YouTu Lab Shenzhen518703 China

While promising results have been achieved in weakly-supervised semantic segmentation (WSSS), limited supervision from image-level tags inevitably induces discriminative reliance and spurious relations between target classes and background regions. Thus, Class Activation Map (CAM) usually tends to activate discriminative object regions and falsely includes lots of class-related backgrounds. Without pixel-level supervisions, it could be very difficult to enlarge the foreground activation and suppress those false activation of background regions. In this paper, we propose a novel framework of Cross Language Image Matching with Automatic Context Discovery (CLIMS++), based on the recently introduced Contrastive Language-Image Pre-training (CLIP) model, for WSSS. The core idea of our framework is to introduce natural language supervision to activate more complete object regions and suppress class-related background regions in CAM. In particular, we design object, background region, and text label matching losses to guide the model to excite more reasonable object regions of each category. In addition, we propose to automatically find spurious relations between foreground categories and backgrounds, through which a background suppression loss is designed to suppress the activation of class-related backgrounds. The above designs enable the proposed CLIMS++ to generate a more complete and compact activation map for the target objects. Extensive experiments on PASCAL VOC 2012 and MS COCO 2014 datasets show that our CLIMS++ significantly outperforms the previous state-of-the-art methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：