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

arXiv 2025年

作者： Ding, Yao Kang, Weijie Yang, Aitao Zhang, Zhili Zhao, Junyang Feng, Jie Hong, Danfeng Zheng, Qinghe The Key Laboratory of Intelligent Control PLA Rocket Force University of Engineering Xi’an710025 China The Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Xidian University Xi’an710071 China The Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China The School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

Hyperspectral image (HSI) clustering has been a fundamental but challenging task with zero training labels. Currently, some deep graph clustering methods have been successfully explored for HSI due to their outstanding performance in effective spatial structural information encoding. Nevertheless, insufficient structural information utilization, poor feature presentation ability, and weak graph update capability limit their performance. Thus, in this paper, a homophily structure graph learning with an adaptive filter clustering method (AHSGC) for HSI is proposed. Specifically, homogeneous region generation is first developed for HSI processing and constructing the original graph. Afterward, an adaptive filter graph encoder is designed to adaptively capture the high and low frequency features on the graph for subsequence processing. Then, a graph embedding clustering self-training decoder is developed with KL Divergence, with which the pseudo-label is generated for network training. Meanwhile, homophily-enhanced structure learning is introduced to update the graph according to the clustering task, in which the orient correlation estimation is adopted to estimate the node connection, and graph edge sparsification is designed to adjust the edges in the graph dynamically. Finally, a joint network optimization is introduced to achieve network self-training and update the graph. The K-means is adopted to express the latent features. Extensive experiments and repeated comparative analysis have verified that our AHSGC contains high clustering accuracy, low computational complexity, and strong robustness. The code source will be available at https://***/DY-HYX. Copyright © 2025, The Authors. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

MF2N: Multiview feature fusion network for pancreatic cancer segmentation

引用

Pattern Recognition 2025年 167卷

作者： Xue, Jie Li, Qi Gong, Guanzhong Liu, Xiyu Li, Chao Cheng, Lianghui Chang, Shulei Liang, Shujun Li, Dengwang Business School Shandong Key Laboratory of Medical Physics and Image Processing Shandong Normal University Jinan Shandong250014 China Shandong Cancer Hospital and Institute Shandong First Medical University and Shandong Academy of Medical Sciences Jinan 250017 China Computer School Qufu Normal University Rizhao276826 China School of Information Science and Engineering Shandong Normal University Jinan250014 China School of Biomedical Engineering Southern Medical University Guangzhou510515 China School of Physics and Electronics Shandong Key Laboratory of Medical Physics and Image Processing Shandong Normal University Jinan 250014 China

Automated segmentation for variable pancreas and tumors is challenging due to 1) large variations occurring within/crossing the narrow and irregular pancreas, 2) a small proportion of voxels on pancreatic tumors in the abdomen and 3) ambiguous lesion boundaries caused by low contrast between target surroundings. Most existing methods mainly focus on extracting local semantic features corresponding to ground truth, while ignoring the mislead by voxels similar to boundaries and irrelevant information from input images, and the lack of shallow global information. In this paper, we present a novel deep network, MF2N network, equipped with three feature fusion modules for automated segmentation of pancreas and tumors. We first propose adaptive morphological feature fusion (AMF2) module to dynamically learn morphological features of targets from skeleton to boundaries for mitigating undersegmentation. Then, bidirectional semantic feature fusion (BSF2) module is proposed to optimize mutual information between prediction and manual delineation as well as discard redundant information between features to capture more consistent feature expressions and alleviate noise interference. Furthermore, we develop a local–global dependency feature fusion (LGDF2) module to fuse local features from CNNs and global information provided by shallow features through lightweight transformers to enhance MF2N's capability to grasp more boundary and content features. The experimental results show that MF2N network outperforms twelve state-of-the-art methods on the MSD pancreas dataset and can be applied to other potential clinical scenarios. © 2025 Elsevier Ltd

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Joint Masked Reconstruction and Contrastive Learning for Mining Interactions Between Proteins

arXiv

引用

arXiv 2025年

作者： Li, Jiang Wang, Xiaoping School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Brain-Inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

Protein-protein interaction (PPI) prediction is an instrumental means in elucidating the mechanisms underlying cellular operations, holding significant practical implications for the realms of pharmaceutical development and clinical treatment. Presently, the majority of research methods primarily concentrate on the analysis of amino acid sequences, while investigations predicated on protein structures remain in the nascent stages of exploration. Despite the emergence of several structure-based algorithms in recent years, these are still confronted with inherent challenges: (1) the extraction of intrinsic structural information of proteins typically necessitates the expenditure of substantial computational resources;(2) these models are overly reliant on seen protein data, struggling to effectively unearth interaction cues between unknown proteins. To further propel advancements in this domain, this paper introduces a novel PPI prediction method jointing masked reconstruction and contrastive learning, termed JmcPPI. This methodology dissects the PPI prediction task into two distinct phases: during the residue structure encoding phase, JmcPPI devises two feature reconstruction tasks and employs graph attention mechanism to capture structural information between residues;during the protein interaction inference phase, JmcPPI perturbs the original PPI graph and employs a multi-graph contrastive learning strategy to thoroughly mine extrinsic interaction information of novel proteins. Extensive experiments conducted on three widely utilized PPI datasets demonstrate that JmcPPI surpasses existing optimal baseline models across various data partition schemes. The associated code can be accessed via https://***/lijfrankopen/JmcPPI. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Spiking neural P systems with anti-spikes and without annihilating priority as number acceptors

引用

Journal of Systems Engineering and Electronics 2014年第3期25卷 464-469页

作者： Gangjun Tan Tao Song Zhihua Chen Key Laboratory of Image Information Processing and Intelligent Control School of AutomationHuazhong University of Science and Technology

Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.

关键词： membrane computing spiking neural P system Turing completeness register machine anti-spike.

来源：评论

学校读者我要写书评

暂无评论

image Demosaicing by Non-local Similarity and Local Correlation

Image Demosaicing by Non-local Similarity and Local Correlat...

引用

2012 IEEE 11th International Conference on Signal processing(ICSP 2012)

作者： Wang Guo-gang Zhu Xiu-chang Gan Zong-liang Province Key Lab on Image Processing and Image Communication Nanjing University of Posts and Telecommunications

ISBN: (纸本)9781467321969

Conventional single-chip digital cameras use color filter arrays(CFA) to sample different spectral components. image demosaicing is a problem of interpolating these data to complete red, green, and blue values for each image pixel, to produce an RGB image. Many color demosaicing(CDM) methods assume that the high local spatial redundancy exists among the color samples. Such an assumption, however, may be fail for images with high color saturation and sharp color transitions. This paper presents an adaptive demosaicing algorithm by exploiting both the non-local similarity and the local correlation(NLS-LC) in the color filter array image. First, the most flattest nonlocal image patches are searched in the searching window centered on the estimated pixel. Second, the patch, which is the most similar to the current patch, is selected among the most smoothest nonlocal patches. Third, according to the similar degree and the local correlation degree, the obtained nonlocal image patch and the current patch are adaptively chosen to estimate the missing color samples. Experimental results indicate that the proposed method exhibits superior performance over many state-of-the-art color interpolation methods.

关键词： image demosaicing, image interpolation, local correlation, non-local similarity

来源：评论

学校读者我要写书评

暂无评论

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency Model for Omnidirectional images 27th

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Liu, Qian Zhu, Dandan Zhu, Kun Zhai, Guangtao Yang, Xiaokang School of Computer Science and Technology Donghua University No.2999 Renmin North Road Songjiang District Shanghai201620 China Institute of AI Education Shanghai East China Normal University No.3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No.4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781216

Recent years have witnessed rapid progress of convolutional neural networks (CNNs) and their successful application in the task of saliency prediction for omnidirectional images (ODIs). Albeit achieving tremendous performance improvements, these CNNs-based saliency models are plagued by two major shortcomings: spatial content-agnostic and computationally intensive. Inspired by the effectiveness of equivariant network in the majority of computer vision tasks, we propose a novel efficient equivariant dynamic aggregation saliency (E2DAS) model to efficiently tackle the issue of human fixation prediction in ODIs. To be specific, our proposed model consists of an efficient equivariant module, a dynamic convolutional aggregation module, and an optimization computation module. Different from existing saliency models for ODIs, we are the first attempt to introduce an efficient equivariant dynamic convolutional aggregation operation into the saliency prediction task, which can fundamentally alleviate the projection distortion problem and can effectively learn spatial content-adaptive features. Moreover, we clearly observe a considerable decrease in the number of parameters resulting from the replacement of standard convolution with dynamic convolution aggregation. Extensive experiments on several benchmark datasets show the proposed model’s superiority over other state-of-the-art methods in terms of performance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Equivariant dynamic aggregation light-weight model omnidirectional images saliency prediction spatial content-adaptive

来源：评论

学校读者我要写书评

暂无评论

MindEye-OmniAssist: A Gaze-Driven LLM-Enhanced Assistive Robot System for Implicit Intention Recognition and Task Execution

arXiv

引用

arXiv 2025年

作者： Zhang, Zejia Yang, Bo Chen, Xinxing Shi, Weizhuang Wang, Haoyuan Luo, Wei Huang, Jian Hubei Key Laboratory of Brain-Inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China State key laboratory of intelligent vehicle safety technology chongqing changan automobile co ltd Chongqing400023 China Science and technology innovation center China ship development and design centre Wuhan430060 China

A promising effective human-robot interaction in assistive robotic systems is gaze-based control. However, current gaze-based assistive systems mainly help users with basic grasping actions, offering limited support. Moreover, the restricted intent recognition capability constrains the assistive system’s ability to provide diverse assistance functions. In this paper, we propose an open implicit intention recognition framework powered by Large Language Model (LLM) and Vision Foundation Model (VFM), which can process gaze input and recognize user intents that are not confined to predefined or specific scenarios. Furthermore, we implement a gaze-driven LLM-enhanced assistive robot system (MindEye-OmniAssist) that recognizes user’s intentions through gaze and assists in completing task. To achieve this, the system utilizes open vocabulary object detector, intention recognition network and LLM to infer their full intentions. By integrating eye movement feedback and LLM, it generates action sequences to assist the user in completing tasks. Real-world experiments have been conducted for assistive tasks, and the system achieved an overall success rate of 41/55 across various undefined tasks. Preliminary results show that the proposed method holds the potential to provide a more user-friendly human-computer interaction interface and significantly enhance the versatility and effectiveness of assistive systems by supporting more complex and diverse task. Copyright © 2025, The Authors. All rights reserved.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

A reinforcement learning-based dynamic multi-objective optimization approach for integrated timetabling and vehicle scheduling

引用

Knowledge-Based Systems 2025年 321卷

作者： Shen, Yindong Xie, Wenliang Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan 430074 China The MOE Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

Dynamic integrated timetabling and vehicle scheduling (D-ITVS) is essential for mitigating the negative impacts of service disruptions. It involves multiple rescheduling stages, with inherent optimization similarities across these stages. However, existing optimization approaches for the D-ITVS problem have not systematically exploited these similarities, overlooking the potential for decision knowledge from previous stages to inform the current stage. To address this gap, this paper proposes a reinforcement learning-based dynamic multi-objective optimization approach (RL-DMOA), which focuses on transferring decision knowledge between rescheduling stages. This approach models the optimization process of each rescheduling stage in the D-ITVS problem as a Markov decision process, incorporating a state space with vehicle information, action space for vehicle assignment, and a multi-objective reward function. A multi-objective deep reinforcement learning (M-DRL) agent is employed within the RL-DMOA to select actions based on the state at each decision point. The agent is constructed on a multi-objective deep Q-learning network (M-DQN), with a Q-value adjustment layer incorporated to prevent the selection of invalid actions. To select optimal actions while balancing the conflicts among multiple objectives, the M-DRL agent applies a non-dominated sorting selection strategy. Experimental results demonstrate that the proposed RL-DMOA is capable of generating timetables and vehicle schedules with reduced costs, enhanced robustness, and improved convergence and diversity across all rescheduling stages. By balancing operational costs and passenger service quality, these improvements benefit transit operators, and during daily operations, passengers enjoy reduced travel costs and enhanced service reliability. © 2025 Elsevier B.V.

关键词： Dynamic multi-objective optimization Reinforcement learning Timetabling Vehicle scheduling

来源：评论

学校读者我要写书评

暂无评论

Leapfrog Polymorphic Neural Ordinary Differential Equation

引用

IEEE Signal processing Letters 2025年 32卷 2139-2143页

作者： Zhang, Xiao Wei, Wei Zhang, Zhen Zhang, Lei Northwestern Polytechnical University School of Software Xi'an710072 China Northwestern Polytechnical University Shaanxi Provincial Key Laboratory of Speech and Image Information Processing School of Computer Science Xi'an710072 China Northwestern Polytechnical University National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Xi'an710072 China The University of Adelaide school of computer science AdelaideSA5005 Australia

Neural Ordinary Differential Equations (NODEs) revolutionize the way we view residual networks as solvers for initial value problems (IVPs), with layer depth serving as the time step. In this study, we propose a more efficient extension of NODEs called Leap-Frog Polymorphic Neural ODEs (LF-NODEs). LF-NODEs introduce the leap-frog updating scheme, breaking free from the specific structure of time-evolving mixtures of multiple dynamical systems. In each time step (corresponding to each residual network layer), LF-NODEs integrate the features of multiple dynamical systems (residual network layers) by employing time-variant weights from different dynamical systems. Our LF-NODEs not only overcome the limitations in the representation power of individual residual networks but also provide a more flexible and effective structure for residual networks based on multiple dynamical systems. The efficiency of the leap-frog updating scheme is theoretically derived and demonstrated. Furthermore, we expand the model by incorporating a multi-scale approach (LF-MSNODEs) to achieve even more accurate model representations. Empirical results showcase the improvements provided by our proposed methods in 2D concentric spheres task, irregularly sampled time series prediction, and classification tasks. Additionally, the results provide empirical evidence that the learned feature space enhances system efficiency with fewer parameters and function evaluations compared to the baseline methods. © 1994-2012 IEEE.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

M3-CR: Multiscale Multibranch Mamba for SAR-Assisted Optical image Thick Cloud Removal

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Pan, Linpeng Song, Xuedong Xie, Fengying Zhang, Xiaozhe Ji, Haolin Shi, Zhenwei Beihang University School of Astronautics Beijing100191 China Tianmushan Laboratory Hangzhou311115 China Shanghai Aerospace Control Technology Institute Shanghai201109 China Beihang University Image Processing Center School of Astronautics State Key Laboratory of Virtual Reality Technology and Systems Beijing100191 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China

SAR-assisted thick cloud removal from optical remote sensing images has long been a challenging task. Current mainstream methods face challenges in achieving an effective global receptive field, fully using multiscale features, and deeply integrating features from both modalities. To overcome these limitations, we propose the multiscale multibranch Mamba model for SAR-assisted thick cloud removal ( M3-CR). Specifically, we integrate the Mamba model into the task of SAR-assisted cloud removal, effectively modeling global dependencies within the images. Concurrently, a multiscale multibranch structure is introduced to extract and integrate multiscale information, and in combination with a convolutional branch to fully exploit the global and local geographic proximities inherent in remote sensing images. Furthermore, we present a novel feature fusion module leveraging the modal-traversing-2-D selective scan (MTSS2D) to enable deep interaction and integration of features from optical and SAR images. The experimental results on two benchmark databases show that the M3-CR achieves superior performance compared with state-of-the-art cloud removal approaches, while requiring fewer parameters and reduced floating-point operations (FLOPs). © 1980-2012 IEEE.

关键词： Optical remote sensing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：