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

Spatial-Semantic Collaborative Cropping for User Generated Content

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Su, Yukun Cao, Yiwen Deng, Jingliang Rao, Fengyun Wu, Qingyao School of Software and Engineering South China University of Technology China WeChat Tencent Inc China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China

A large amount of User Generated Content (UGC) is uploaded to the Internet daily and displayed to people world-widely through the client side (e.g., mobile and PC). This requires the cropping algorithms to produce the aesthetic thumbnail within a specific aspect ratio on different devices. However, existing image cropping works mainly focus on landmark or landscape images, which fail to model the relations among the multi-objects with the complex background in UGC. Besides, previous methods merely consider the aesthetics of the cropped images while ignoring the content integrity, which is crucial for UGC cropping. In this paper, we propose a Spatial-Semantic Collaborative cropping network (S2CNet) for arbitrary user generated content accompanied by a new cropping benchmark. Specifically, we first mine the visual genes of the potential objects. Then, the suggested adaptive attention graph recasts this task as a procedure of information association over visual nodes. The underlying spatial and semantic relations are ultimately centralized to the crop candidate through differentiable message passing, which helps our network efficiently to preserve both the aesthetics and the content integrity. Extensive experiments on the proposed UGCrop5K and other public datasets demonstrate the superiority of our approach over state-of-the-art counterparts. Our project is available at https://***/suyukun666/S2CNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Message passing

A Decision-Making Model for Autonomous Vehicles Considering Pedestrian's Time Pressure Based on Game Theory and Reinforcement Learning

学校读者我要写书评

暂无评论

IEEE Access 2025年 13卷 87730-87739页

作者： Lin, Qing-Feng Xue, Heng-Yu Lyu, Yang Li, Qing-Kun Ou, Ju-Shang Beihang University School of Transportation Science and Engineering Beijing100191 China Intelligent Policing Key Laboratory of Sichuan Province Luzhou646000 China Chongqing400015 China Institute of Software Chinese Academy of Sciences Beijing100190 China

Due to the obvious randomness, pedestrian crossing behavior is hard to predict, which challenges the decision-making of autonomous vehicles (AVs). Recent solutions have been able to adapt to structured road scenes with crossing signals or markings. However, there is still a gap in extending the pedestrian-vehicle interaction (PVI) performance in structured road scenes to unstructured road scenes. Therefore, this paper proposed a vehicle decision-making model considering pedestrian intention based on game theory and reinforcement learning (RL). We designed and conducted a simulation experiment based on a virtual reality platform. Then, leveraging game theory, we established a pedestrian crossing decision-making model considering pedestrian heterogeneity evoked by time pressure (TP). A reward function was developed to enhance driving performance by combining safety, efficiency, and comfort. The RL agent of AVs learns to control the vehicle speed in a pattern that maximizes cumulative rewards through trials and errors by interacting with pedestrians in the simulation environment. The results show that AVs can effectively and safely interact with heterogeneous pedestrians on unstructured roads based on the proposed model. This study contributes to developing AVs that interact better with pedestrians and improve traffic safety, efficiency, and user acceptance of autonomous vehicles. © 2013 IEEE.

关键词： Reinforcement learning

PATCH: Empowering Large Language Model with Programmer-Intent Guidance and Collaborative-Behavior Simulation for Automatic Bug Fixing

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Yuwei Jin, Zhi Xing, Ying Li, Ge Liu, Fang Zhu, Jiaxin Dou, Wensheng Wei, Jun Affiliated with Nanjing Institute of Software Technology University of Chinese Academy of Sciences Nanjing China Key Laboratory of System Software Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Key Laboratory of High Confidence Software Technologies Peking University Ministry of Education School of Computer Science Peking University Beijing China School of Computer Science Wuhan University Wuhan China School of Intelligent Engineering and Automation Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Complex & Critical Software Environment School of Computer Science and Engineering Beihang University Beijing China

Bug fixing holds significant importance in software development and maintenance. Recent research has made substantial strides in exploring the potential of large language models (LLMs) for automatically resolving software bugs. However, a noticeable gap in existing approaches lies in the oversight of collaborative facets intrinsic to bug resolution, treating the process as a single-stage endeavor. Moreover, most approaches solely take the buggy code snippet as input for LLMs during the patch generation stage. To mitigate the aforementioned limitations, we introduce a novel stage-wise framework named PATCH. Specifically, we first augment the buggy code snippet with corresponding dependence context and intent information to better guide LLMs in generating the correct candidate patches. Additionally, by taking inspiration from bug management practices, we decompose the bug-fixing task into four distinct stages: bug reporting, bug diagnosis, patch generation, and patch verification. These stages are performed interactively by LLMs, aiming to simulate the collaborative behavior of programmers during the resolution of software bugs. By harnessing these collective contributions, PATCH effectively enhances the bug-fixing capability of LLMs. We implement PATCH by employing the powerful dialogue-based LLM ChatGPT. Our evaluation on the widely used bug-fixing benchmark BFP demonstrates that PATCH has achieved better performance than state-of-the-art LLMs. Copyright © 2025, The Authors. All rights reserved.

关键词： Computer software maintenance

A Logical Pattern Memory Pre-trained Model for Entailment Tree Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yuan, Li Cai, Yi Ren, Haopeng Wang, Jiexin School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China

Generating coherent and credible explanations remains a significant challenge in the field of AI. In recent years, researchers have delved into the utilization of entailment trees to depict explanations, which exhibits a reasoning process of how a hypothesis is deduced from the supporting facts. However, existing models often overlook the importance of generating intermediate conclusions with logical consistency from the given facts, leading to inaccurate conclusions and undermining the overall credibility of entailment trees. To address this limitation, we propose the logical pattern memory pre-trained model (LMPM). LMPM incorporates an external memory structure to learn and store the latent representations of logical patterns, which aids in generating logically consistent conclusions. Furthermore, to mitigate the influence of logically irrelevant domain knowledge in the Wikipedia-based data, we introduce an entity abstraction approach to construct the dataset for pre-training LMPM. The experimental results highlight the effectiveness of our approach in improving the quality of entailment tree generation. By leveraging logical entailment patterns, our model produces more coherent and reasonable conclusions that closely align with the underlying premises. Code and Data are released at https://***/YuanLi95/T5-LMPM. © 2024, CC BY-NC-ND.

关键词： Domain Knowledge

Anomaly Detection for Multivariate Time Series Based on Contrastive Learning and Autoformer

学校读者我要写书评

暂无评论

Anomaly Detection for Multivariate Time Series Based on Cont...

International Conference on Computer Supported Cooperative Work in Design

作者： Xuwen Shang Jue Zhang Xingguo Jiang Hong Luo Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Nowadays, due to the increasingly complex and huge data flow, anomaly detection has become an important technology to ensure the high security and reliability of the systems. It helps identify unusual observations in the data, thereby protecting safety and reducing risk. However, in the field of multivariate temporal anomaly detection, there are still some difficulties in spatio-temporal correlation mining of variables, generalization ability in dealing with complex temporal sequences, and feature learning under different granularity. Therefore, we propose an unsupervised anomaly detection method for multivariate time series based on contrastive learning and Autoformer autoencoder. In order to fully explore the spatio-temporal correlation of time series data, this paper uses Graph Attention Network and Auto-Correlation to jointly learn spatio-temporal correlation, and obtain positive and negative pairs through time-domain and frequency-domain data augmentation. Finally, the Autoformer autoencoder is used for anomaly detection in a predictive manner. In the loss function section, a joint loss function is formed by introducing contrastive learning losses at the time step and time window granularity, combined with prediction loss, to improve the learning effect. This paper investigates the performance of the proposed method through experiments on the SMAP and MSL public datasets, and achieves better results than baseline methods.

关键词： Correlation Computational modeling Time series analysis Contrastive learning Computer architecture Stability analysis Safety

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

Adaptively feature matching via joint transformational-spatial clustering

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spati...

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

multiPI-TransBTS: A Multi-Path Learning Framework for Brain Tumor Image Segmentation Based on Multi-Physical Information

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Hongjun Huang, Jiaohang Chen, Kuo Ying, Xuehui Qian, Ying School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Engineering Research Center of Software Quality Assurance Testing and Assessment Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

Brain Tumor Segmentation (BraTS) plays a critical role in clinical diagnosis, treatment planning, and monitoring the progression of brain tumors. However, due to the variability in tumor appearance, size, and intensity across different MRI modalities, automated segmentation remains a challenging task. In this study, we propose a novel Transformer-based framework, multiPI-TransBTS, which integrates multi-physical information to enhance segmentation accuracy. The model leverages spatial information, semantic information, and multi-modal imaging data, addressing the inherent heterogeneity in brain tumor characteristics. The multiPI-TransBTS framework consists of an encoder, an Adaptive Feature Fusion (AFF) module, and a multi-source, multi-scale feature decoder. The encoder incorporates a multi-branch architecture to separately extract modality-specific features from different MRI sequences. The AFF module fuses information from multiple sources using channel-wise and element-wise attention, ensuring effective feature recalibration. The decoder combines both common and task-specific features through a Task-Specific Feature Introduction (TSFI) strategy, producing accurate segmentation outputs for Whole Tumor (WT), Tumor Core (TC), and Enhancing Tumor (ET) regions. Comprehensive evaluations on the BraTS2019 and BraTS2020 datasets demonstrate the superiority of multiPI-TransBTS over the state-of-the-art methods. The model consistently achieves better Dice coefficients, Hausdorff distances, and Sensitivity scores, highlighting its effectiveness in addressing the BraTS challenges. Our results also indicate the need for further exploration of the balance between precision and recall in the ET segmentation task. The proposed framework represents a significant advancement in BraTS, with potential implications for improving clinical outcomes for brain tumor patients. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding

CI-Based Block-Level Precoding for ISAC System

学校读者我要写书评

暂无评论

CI-Based Block-Level Precoding for ISAC System

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Yiran Wang Xiaoyan Hu Ang Li Kai-Kit Wong Kun Yang School of Information and Communications Engineering Xi'an Jiaotong University Xi'an China Department of Electronic and Electrical Engineering University College London London UK School of Intelligent Software and Engineering Nanjing University (Suzhou Campus) Suzhou China State Key Laboratory of Novel Software Technology Nanjing University Nanjing China

ISBN: (数字)9798350390643

ISBN: (纸本)9798350390650

In this paper, we propose a constructive interference (CI)-based precoding scheme and extend the proposed precoding scheme from the symbol level to the block level for multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) systems. The illumination power of radar is maximized under communication CI constraint. Since the optimization objective function is not convex, we use succesive convex ap-proximation (SCA) method to solve the proposed optimization problem. Furthermore, we formulate the dual problem of the convex subproblem in SCA method. It is a simple quadratic programming (QP) problem and can be efficiently solved. The simulation results show that the proposed CI-based precoding design has significant advantages in enhancing the ISAC performance with acceptable computational complexity.

关键词： Wireless communication Precoding Simulation Lighting Symbols Radar Interference Integrated sensing and communication Radar signal processing Optimization