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

SSRN 2024年

作者： Jin, Hailong Li, Huiying Jilin University College of Computer Science and Technology Jilin Province Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun130012 China

Semantic correspondence remains a challenging task for establishing correspondences between a pair of images with the same category or similar scenes due to the large intra-class appearance. In this paper, we introduce a novel problem called 'Small Object Semantic Correspondence (SOSC).' This problem is challenging due to the close proximity of keypoints associated with small objects, which results in the fusion of these respective features. It is difficult to identify the corresponding key points of the fused features, and it is also difficult to be recognized. To address this challenge, we propose the keypoint Bounding box-centered Cropping (KBC) method, which aims to increase the spatial separation between keypoints of small objects, thereby facilitating independent learning of these keypoints. The KBC method is seamlessly integrated into our proposed inference pipeline and can be easily incorporated into other methodologies, resulting in significant performance enhancements. Additionally, we introduce a novel framework, named KBCNet, which serves as our baseline model. KBCNet comprises a Cross-Scale Feature Alignment (CSFA) module and an efficient 4D convolutional decoder. The CSFA module is designed to align multi-scale features, enriching keypoint representations by integrating fine-grained features and deep semantic features. Meanwhile, the 4D convolutional decoder, based on efficient 4D convolution, ensures efficiency and rapid convergence. To empirically validate the effectiveness of our proposed methodology, extensive experiments are conducted on three widely used benchmarks: PF-PASCAL, PF-WILLOW, and SPair-71k. Our KBC method demonstrates a substantial performance improvement of 7.5\% on the SPair-71K dataset, providing compelling evidence of its efficacy. © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization 29

Improving Local Search for Pseudo Boolean Optimization by Fr...

引用

29th International Conference on Principles and Practice of Constraint Programming, CP 2023

作者： Zhou, Wenbo Zhao, Yujiao Wang, Yiyuan Cai, Shaowei Wang, Shimao Wang, Xinyu Yin, Minghao School of Information Science and Technology Northeast Normal University Changchun China Key Laboratory of Applied Statistics of MOE Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University Changchun China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959773003

Pseudo-Boolean optimization (PBO) is usually used to model combinatorial optimization problems, especially for some real-world applications. Despite its significant importance in both theory and applications, there are few works on using local search to solve PBO. This paper develops a novel local search framework for PBO, which has three main ideas. First, we design a two-level selection strategy to evaluate all candidate variables. Second, we propose a novel deep optimization strategy to disturb some search spaces. Third, a sampling flipping method is applied to help the algorithm jump out of local optimum. Experimental results show that the proposed algorithms outperform three state-of-the-art PBO algorithms on most instances. © Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, and Minghao Yin.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Independently keypoint Learning for Small Object Semantic Correspondence

arXiv

引用

arXiv 2024年

Semantic correspondence remains a challenging task for establishing correspondences between a pair of images with the same category or similar scenes due to the large intra-class appearance. In this paper, we introduce a novel problem called’Small Object Semantic Correspondence (SOSC).’ This problem is challenging due to the close proximity of keypoints associated with small objects, which results in the fusion of these respective features. It is difficult to identify the corresponding key points of the fused features, and it is also difficult to be recognized. To address this challenge, we propose the keypoint Bounding box-centered Cropping (KBC) method, which aims to increase the spatial separation between keypoints of small objects, thereby facilitating independent learning of these keypoints. The KBC method is seamlessly integrated into our proposed inference pipeline and can be easily incorporated into other methodologies, resulting in significant performance enhancements. Additionally, we introduce a novel framework, named KBCNet, which serves as our baseline model. KBCNet comprises a Cross-Scale Feature Alignment (CSFA) module and an efficient 4D convolutional decoder. The CSFA module is designed to align multi-scale features, enriching keypoint representations by integrating fine-grained features and deep semantic features. Meanwhile, the 4D convolutional decoder, based on efficient 4D convolution, ensures efficiency and rapid convergence. To empirically validate the effectiveness of our proposed methodology, extensive experiments are conducted on three widely used benchmarks: PF-PASCAL, PF-WILLOW, and SPair-71k. Our KBC method demonstrates a substantial performance improvement of 7.5% on the SPair-71K dataset, providing compelling evidence of its efficacy. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Instance-adaptive Zero-shot Chain-of-Thought Prompting 38

Instance-adaptive Zero-shot Chain-of-Thought Prompting

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Yuan, Xiaosong Shen, Chen Yan, Shaotian Zhang, Xiaofeng Xie, Liang Wang, Wenxiao Guan, Renchu Wang, Ying Ye, Jieping College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering MoE Jilin University China Alibaba Cloud Computing China Shanghai Jiao Tong University China College of Computer Science and Technology Zhejiang University of Technology China College of Software Zhejiang University China

Zero-shot Chain-of-Thought (CoT) prompting emerges as a simple and effective strategy for enhancing the performance of large language models (LLMs) in real-world reasoning tasks. Nonetheless, the efficacy of a singular, task-level prompt uniformly applied across the whole of instances is inherently limited since one prompt cannot be a good partner for all, a more appropriate approach should consider the interaction between the prompt and each instance meticulously. This work introduces an instance-adaptive prompting algorithm as an alternative zero-shot CoT reasoning scheme by adaptively differentiating good and bad prompts. Concretely, we first employ analysis on LLMs through the lens of information flow to detect the mechanism under zero-shot CoT reasoning, in which we discover that information flows from question to prompt and question to rationale jointly influence the reasoning results most. We notice that a better zero-shot CoT reasoning needs the prompt to obtain semantic information from the question, and then the rationale aggregates sufficient information from the question directly and via the prompt indirectly. On the contrary, lacking any of those would probably lead to a bad one. Stem from that, we further propose an instance-adaptive prompting strategy (IAP) for zero-shot CoT reasoning. Experiments conducted with LLaMA-2, LLaMA-3, and Qwen on math, logic, and commonsense reasoning tasks (e.g., GSM8k, MMLU, Causal Judgement) obtain consistent improvement, demonstrating that the instance-adaptive zero-shot CoT prompting performs better than other task-level methods with some curated prompts or sophisticated procedures, showing the significance of our findings in the zero-shot CoT reasoning mechanism. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Approach for Few-Shot Segmentation Via Smooth Downsampling Mask and Label Smoothing Loss

SSRN

引用

SSRN 2023年

作者： Jin, Hailong Li, Huiying College of Computer Science and Technology Jilin Province Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun130012 China

Few-shot semantic segmentation aims to segment new categories with only a small number of annotated images. Previous methods mainly focused on exploiting the pixel-level correlation between the support image and the query image, combined with attention-based methods, resulting in significant advancements. In this paper, we introduce a new perspective to enhance few-shot segmentation. We identify that utilizing the bilinear interpolation method to downsample the mask leads to the loss of fine-grained information from the target features. To address this issue, we propose a Smooth Downsampling Mask (SDM) method. The SDM method is designed to retain more effective target semantic features by employing a cascaded downsampling approach with a smooth kernel for mask processing. Additionally, we propose a label smoothing loss to further enhance the performance, which provides direct guidance for low-resolution feature map optimization. Notably, our proposed method involves no additional learnable parameters and introduces only a small amount of extra computation. To validate the effectiveness of our approach, we conduct extensive experiments on three public benchmarks, PASCAL-$5^i$, COCO-$20^i$, and FSS-$1000$, and achieve considerable improvements. © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Aspect-Based Sentiment Analysis with Explicit Sentiment Augmentations

arXiv

引用

arXiv 2023年

作者： Ouyang, Jihong Yang, Zhiyao Liang, Silong Wang, Bing Wang, Yimeng Li, Ximing College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University China

Aspect-based sentiment analysis (ABSA), a fine-grained sentiment classification task, has received much attention recently. Many works investigate sentiment information through opinion words, such as "good" and "bad". However, implicit sentiment data widely exists in the ABSA dataset, whose sentiment polarity is hard to determine due to the lack of distinct opinion words. To deal with implicit sentiment, this paper proposes an ABSA method that integrates explicit sentiment augmentations (ABSA-ESA) to add more sentiment clues. We propose an ABSA-specific explicit sentiment generation method to create such augmentations. Specifically, we post-train T5 by rule-based data and employ three strategies to constrain the sentiment polarity and aspect term of the generated augmentations. We employ Syntax Distance Weighting and Unlikelihood Contrastive Regularization in the training procedure to guide the model to generate the explicit opinion words with the same polarity as the input sentence. Meanwhile, we utilize the Constrained Beam Search to ensure the augmentations are aspect-related. We test ABSA-ESA on two ABSA benchmarks. The results show that ABSA-ESA outperforms the SOTA baselines on implicit and explicit sentiment accuracy. Copyright © 2023, The Authors. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Nutrition feature basis of food classification in traditional chinese medicine 7

Nutrition feature basis of food classification in traditiona...

引用

7th International Conference on Big Data Computing and Communications, BigCom 2021

作者： Zhao, Fucheng Han, Xiaosong Zhang, Yikun Niu, Peiyu Cheng, Jun Yi, Wan Jilin University Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Changchun130012 China

ISBN: (纸本)9781665442527

In TCM (Traditional Chinese Medicine) theory, the cold-and-hot property of food is considered as an important information to guide people's daily diet and keep them healthy. But the classification of this property mostly relies on experience from medical books, which lacks corresponding molecular chemistry basis and makes differentiation very difficult for ordinary people. To solve above question, in this paper, we collected 500 kinds of food and their nutrients, used ANOVA algorithm for feature selection to find out the nutrient feature that have a greater correlation with the cold and hot properties of food, and then used LightGBM algorithm to classify the processed data set. Finally, we constructed a reliable and accurate classification model and found the related nutritional elements are Tyrosine, Arginine, Thiamine, Vitamin B6 and Selenium. © 2021 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model for WMH Segmentation from 3D MR Brain Image

2.5D ASF-UNet: Adjacent Slice Spatial Feature Fusion Model f...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Lan Huang Yinglu Sun Ziqi Zhao Chunjie Guo Yan Wang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China Department of Radiology the First Hospital of Jilin University Changchun China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Segmenting brain white matter hyperintensities (WMH) from 3D Magnetic Resonance (MR) images is crucial for the diagnosis, treatment, and prognosis of Multiple Sclerosis (MS). Unlike common 2D images, this task is more challenging and time-consuming. Classical deep learning methods for 3D image segmentation face two main challenges: 1) Pure 3D networks have more parameters and are prone to overfitting. 2) When using 2D networks to segment slices of 3D images, the lack of 3D structural information results in suboptimal segmentation after reconstruction. To address these difficulties, we propose the 2.5D ASF-UNet, which employs the 2.5D workflow and uses adjacent slices as the input for 2D segmentation network ASF-UNet. In ASF-UNet, separate down-sampling paths are used for the adjacent slices, and the Local Spatial Attention Module (LSAM) is designed to more effectively integrate 3D spatial information into the 2D network. Additionally, the Conv_Spectral_Block (CSB) is designed to extract and integrate local and global features. It allows the model to capture global spatial structures while preserving detailed information. Experimental results on MICCAI MSSEG 2016 and Local MS datasets show that 2.5D ASF-UNet achieve better segmentation performance than other deep learning methods.

关键词： Deep learning Image segmentation Solid modeling Three-dimensional displays Multiple sclerosis Feature extraction Brain modeling White matter Prognostics and health management Overfitting

来源：评论

学校读者我要写书评

暂无评论

A Survey on Performance Optimization of High-Level Synthesis Tools

引用

Journal of Computer Science & Technology 2020年第3期35卷 697-720页

作者： Lan Huang Da-Lin Li Kang-Ping Wang Teng Gao Adriano Tavares College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041China Algorithm Center University of MinhoGuimaraes 4800058Portugal

Field-programmable gate arrays(FPGAs)have recently evolved as a valuable component of the heterogeneous *** register transfer level(RTL)design flows demand the designers to be experienced in hardware,resulting in a possible failure of ***-level synthesis(HLS)permits designers to work at a higher level of abstraction through synthesizing high-level language programs to RTL *** provides a promising approach to solve these ***,the performance of HLS tools still has *** example,designers remain exposed to various aspects of hardware design,development cycles are still time consuming,and the quality of results(QoR)of HLS tools is far behind that of RTL *** this paper,we survey the literature published since 2014 focusing on the performance optimization of HLS *** with previous work,we extend the scope of the performance of HLS tools,and present a set of three-level evaluation criteria,covering from ease of use of the HLS tools to promotion on specific metrics of *** also propose performance evaluation equations for describing the relation between the performance optimization and the *** find that it needs more efforts on the ease of use for efficient HLS *** suggest that it is better to draw an analogy between the HLS development process and the embedded system design process,and to provide more elastic HLS methodology which integrates FPGAs virtual machines.

关键词： evaluation criterion field-programmable gate array(FPGA) high-level synthesis(HLS) performance optimization quality of results(QoR)

来源：评论

学校读者我要写书评

暂无评论

Crossed-Time Delay Neural Network for Speaker Recognition 1

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Chen, Liang Liang, Yanchun Shi, Xiaoshu Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China

ISBN: (数字)9783030678326

ISBN: (纸本)9783030678319

Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) to enhance the performance of current TDNN for speaker recognition. Inspired by the multi-filters setting of convolution layers from convolution neural networks, we set multiple time delay units with different context size at the bottom layer and construct a multilayer parallel network. The proposed CTDNN gives significant improvements over original TDNN on both speaker verification and identification tasks. It outperforms in VoxCeleb1 dataset in verification experiment with a 2.6% absolute Equal Error Rate improvement. In few shots condition, CTDNN reaches 90.4% identification accuracy, which doubles the identification accuracy of original TDNN. We also compare the proposed CTDNN with another new variant of TDNN, Factorized-TDNN, which shows that our model has a 36% absolute identification accuracy improvement under few shots condition. Moreover, the proposed CTDNN can handle training with a larger batch more efficiently and hence, utilize calculation resources economically. © 2021, Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：