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

Replace2Self: Self-Supervised Denoising based on Voxel Replacing and Image Mixing for Diffusion MRI

学校读者我要写书评

暂无评论

IEEE Transactions on Medical Imaging 2025年 PP卷 PP页

作者： Wu, Linhai Wang, Lihui Deng, Zeyu Zhu, Yuemin Wei, Hongjiang Guizhou University Key Laboratory of Advanced Medical Imaging and Intelligent Computing of Guizhou Province Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education State Key Laboratory of Public Big Data College of Computer Science and Technology 550025 China Univ Lyon INSA Lyon CNRS Inserm CREATIS UMR 5220 LyonF-69621 France Shanghai Jiao Tong University School of Biomedical Engineering Shanghai200030 China

Low signal to noise ratio (SNR) remains one of the limitations of diffusion weighted (DW) imaging. How to suppress the influence of noise on the subsequent analysis about the tissue microstructure is still challenging. This work proposed a novel self-supervised learning model, Replace2Self, to effectively reduce spatial correlated noise in DW images. Specifically, a voxel replacement strategy based on similar block matching in Q-space was proposed to destroy the correlations of noise in DW image along one diffusion gradient direction. To alleviate the signal gap caused by the voxel replacement, an image mixing strategy based on complementary mask was designed to generate two different noisy DW images. After that, these two noisy DW images were taken as input, and the non-correlated noisy DWimage after voxel replacement was taken as learning target, a denoising network was trained for denoising. To promote the denoising performance, a complementary mask mixing consistency loss and an inverse replacement regularization loss were also proposed. Through the comparisons against several existing DW image denoising methods on extensive simulation data with different noise distributions, noise levels and b-values, as well as the acquisition datasets and the ablation experiments, we verified the effectiveness of the proposed method. Regardless of the noise distribution and noise level, the proposed method achieved the highest PSNR, which was at least 1.9% higher than the suboptimal method when the noise level reaches 10%. Furthermore, our method has superior generalization ability due to the use of the proposed strategies. © 2025 IEEE. All rights reserved.

关键词： Signal to noise ratio

LLM Knows Geometry Better than Algebra: Numerical Understanding of LLM-Based Agents in A Trading Arena

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Ma, Tianmi Du, Jiawei Huang, Wenxin Wang, Wenjie Xie, Liang Zhong, Xian Zhou, Joey Tianyi Hubei Key Laboratory of Transportation Internet of Things Wuhan University of Technology China Hubei Key Laboratory of Big Data Intelligent Analysis and Application Hubei University China Centre for Frontier AI Research Agency for Science Technology and Research Singapore Institute of High Performance Computing Agency for Science Technology and Research Singapore School of Computing National University of Singapore Singapore School of Science Wuhan University of Technology China

Recent advancements in large language models (LLMs) have significantly improved performance in natural language processing tasks. However, their ability to generalize to dynamic, unseen tasks, particularly in numerical reasoning, remains a challenge. Existing benchmarks mainly evaluate LLMs on problems with predefined optimal solutions, which may not align with real-world scenarios where clear answers are absent. To bridge this gap, we design the Agent Trading Arena, a virtual numerical game simulating complex economic systems through zero-sum games, where agents invest in stock portfolios. Our experiments reveal that LLMs, including GPT-4o, struggle with algebraic reasoning when dealing with plain-text stock data, often focusing on local details rather than global trends. In contrast, LLMs perform significantly better with geometric reasoning when presented with visual data, such as scatter plots or K-line charts, suggesting that visual representations enhance numerical reasoning. This capability is further improved by incorporating the reflection module, which aids in the analysis and interpretation of complex data. We validate our findings on NASDAQ STOCK dataset, where LLMs demonstrate stronger reasoning with visual data compared to text. Our code and data are publicly available at https://***/wekjsdvnm/***. © 2025, CC BY.

关键词： Natural language processing systems

MULTIPLE HEADS ARE BETTER THAN ONE: MIXTURE OF MODALITY KNOWLEDGE EXPERTS FOR ENTITY REPRESENTATION LEARNING

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yichi Chen, Zhuo Guo, Lingbing Xu, Yajing Hu, Binbin Liu, Ziqi Zhang, Wen Chen, Huajun College of Computer Science and Technology Zhejiang University China ZJU-Ant Group Joint Lab of Knowledge Graph China Ant Group China School of Software Technology Zhejiang University China Zhejiang Key Laboratory of Big Data Intelligent Computing China

Learning high-quality multi-modal entity representations is an important goal of multi-modal knowledge graph (MMKG) representation learning, which can enhance reasoning tasks within the MMKGs, such as MMKG completion (MMKGC). The main challenge is to collaboratively model the structural information concealed in massive triples and the multi-modal features of the entities. Existing methods focus on crafting elegant entity-wise multi-modal fusion strategies, yet they overlook the utilization of multi-perspective features concealed within the modalities under diverse relational contexts. To address this issue, we introduce a novel framework with Mixture of Modality Knowledge experts (MOMOK for short) to learn adaptive multi-modal entity representations for better MMKGC. We design relation-guided modality knowledge experts to acquire relation-aware modality embeddings and integrate the predictions from multi-modalities to achieve joint decisions. Additionally, we disentangle the experts by minimizing their mutual information. Experiments on four public MMKG benchmarks demonstrate the outstanding performance of MOMOK under complex scenarios. Our code and data are available at https://***/zjukg/MoMoK. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

Cooperative guidance strategy for multiple hypersonic gliding vehicles system

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2020年第3期33卷 990-1005页

作者： Jianglong YU Xiwang DONG Qingdong LI Zhang REN Jinhu LV School of Automation Science and Electrical Engineering Science and Technology on Aircraft Control LaboratoryBeihang UniversityBeijing 100083China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing 100083China Shananxi Key Laboratory of Integrated and Intelligent Navigation Xi’an 710068China

Cooperative guidance strategy for multiple hypersonic gliding vehicles system with flight constraints and cooperative constraints is *** paper mainly cares about the coordination of the entry glide flight phase and driving-down *** from the existing results,both the attack time and the attack angle constraints are considered ***, for the entry glide flight phase, a two-stage method is proposed to achieve the rapid cooperative trajectories planning, where the control signal corridors are designed based on the quasi-equilibrium gliding *** the first stage, the bank angle curve is optimized to achieve the attack angle *** the second stage, the angle of attack curve is optimized to achieve the attack time *** optimized parameters can be obtained by the secant ***, for the driving-down phase, the cooperative terminal guidance law is designed where the terminal attack time and attack angle are *** guidance law is then transformed into the bank angle and angle of attack *** cooperative guidance strategy is summarized as an ***, a numerical simulation example with three hypersonic gliding vehicles is provided for revealing the effectiveness of the acquired strategy and algorithm.

关键词： Attack angle constraints Attack time constraints Cooperative guidance Cooperative path planning Entry guidance Hypersonic vehicles

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-th...

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

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang Xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, Xing Min, Geyong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dayong Wang Yishen Deng Weisheng Li Xin Lu Frederic Dufaux Bo Hang Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Faculty of Computing Engineering and Media (CEM) De Montfort University Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et systèmes The Computer School Hubei University of Arts and Science School of Information and Communication Engineering University of Electronic Science and Technology of China

Versatile Video Coding (VVC) now supports Screen Content Coding (SCC) by integrating two efficient coding modes: Intra Block Copy (IBC) and Palette (PLT). However, the numerous modes and the Quad-Tree Plus Multi-Type Tree (QTMT) structure inherent to VVC contribute to a very high coding complexity. To effectively reduce the computational complexity of VVC SCC, we propose a fast Intra mode prediction algorithm for VVC SCC. More specifically, we first use the difference of minimum Sum of Absolute Transformed Differences (SATD) value of four Directional Modes (DMs) of Intra and the SATD value of the IBC-merge mode to determine whether to early skip Intra checking. Subsequently, we use a decision tree to determine whether to early terminate the checking after block differential pulse coded modulation (BDPCM). Finally, we employ a decision tree to determine whether to early skip multiple transform selection (MTS) and low frequency non-separable transform (LFNST) checking. The results demonstrate that our algorithm achieves an average encoding time reduction of 34.34% with a negligible Bjøntegaard delta bitrate increase of 0.46%.

关键词：

Tokenization, Fusion, and Augmentation: Towards Fine-grained Multi-modal Entity Representation

学校读者我要写书评

暂无评论

arXiv 2024年

Multi-modal knowledge graph completion (MMKGC) aims to discover unobserved knowledge from given knowledge graphs, collaboratively leveraging structural information from the triples and multi-modal information of the entities to overcome the inherent incompleteness. Existing MMKGC methods usually extract multi-modal features with pre-trained models, resulting in coarse handling of multi-modal entity information, overlooking the nuanced, fine-grained semantic details and their complex interactions. To tackle this shortfall, we introduce a novel framework MYGO to tokenize, fuse, and augment the fine-grained multi-modal representations of entities and enhance the MMKGC performance. Motivated by the tokenization technology, MYGO tokenizes multi-modal entity information as fine-grained discrete tokens and learns entity representations with a cross-modal entity encoder. To further augment the multi-modal representations, MYGO incorporates fine-grained contrastive learning to highlight the specificity of the entity representations. Experiments on standard MMKGC benchmarks reveal that our method surpasses 19 of the latest models, underlining its superior performance. Code and data can be found in https://***/zjukg/MyGO. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing 39

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

ISBN: (纸本)157735897X

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. Our codes will be made publicly available. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：