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

A novel cross-modal hashing algorithm based on multimodal deep learning

Science China(Information Sciences) 2017年第9期60卷 50-63页

作者： Wen QU Daling WANG Shi FENG Yifei ZHANG Ge YU School of Information Science and Engineering Northeastern University Key Laboratory of Medical Image Computing

With the growing popularity of multimodal data on the Web, cross-modal retrieval on large-scale multimedia databases has become an important research topic. Cross-modal retrieval methods based on hashing assume that there is a latent space shared by multimodal features. To model the relationship among heterogeneous data, most existing methods embed the data into a joint abstraction space by linear projections. However,these approaches are sensitive to noise in the data and are unable to make use of unlabeled data and multimodal data with missing values in real-world applications. To address these challenges, we proposed a novel multimodal deep-learning-based hash(MDLH) algorithm. In particular, MDLH uses a deep neural network to encode heterogeneous features into a compact common representation and learns the hash functions based on the common representation. The parameters of the whole model are fine-tuned in a supervised training *** on two standard datasets show that the method achieves more effective results than other methods in cross-modal retrieval.

关键词： hashing cross-modal retrieval cross-modal hashing multimodal data analysis deep learning

来源：评论

学校读者我要写书评

暂无评论

Reliable and Fair Trustworthiness Evaluation Protocol for Platoon Service Recommendation System

引用

Chinese Journal of Electronics 2025年第2期34卷 563-575页

作者： Hongyuan Cheng Yining Liu Fei Zhou Zhiyuan Tan Xianchao Zhang School of Computer Science & Engineering Linyi University Linyi China School of Data Science and Artificial Intelligence Wenzhou University of Electronic Technology Wenzhou China Guangxi Key Laboratory of Digital Infrastructure Nanning China School of Computing Engineering & the Built Environment Edinburgh Napier University Edinburgh UK Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province College of Information Science and Engineering Jiaxing University Jiaxing China

Aiming at the problems of the communication inefficiency and high energy consumption in vehicular networks, the platoon service recommendation systems (PSRS) are presented. Many schemes for evaluating the reputation of platoon head vehicles have been proposed to obtain and recommend reliable platoon head vehicles. These trustworthiness evaluation protocols for PSRS fail to achieve both reliability and fairness. We first provide a reliable trustworthiness evaluation method to ensure that the reputation level of platoon head vehicle can be calculated by cloud service provider (CSP) with the help of key agreement mechanism and truth discovery technology. The semi-trusted entity CSP may maliciously tamper with the reputation level of the platoon head vehicle. We also provide a reputation level confirmation method to ensure the fairness of trustworthiness evaluation. Formal security proof and security analysis are provided to show that our trustworthiness evaluation protocol can achieve the goals of privacy protection, reliability, fairness and resistance to several security attacks. Experiments demonstrate that this protocol can save execution time and achieve reliable and fair trustworthiness evaluation for PSRS.

关键词： Resistance Privacy Protocols Uncertainty Reliability engineering Delays Reliability Security Protection Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Phase synchronization on small-world networks with community structure

引用

Chinese Physics B 2010年第2期19卷 92-100页

作者：王晓华焦李成吴建设 Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Xidian University Aeronautical Computing Technique Research Institute

In this paper, we propose a simple model that can generate small-world network with community structure. The network is introduced as a tunable community organization with parameter r, which is directly measured by the ratio of inter- to intra-community connectivity, and a smaller r corresponds to a stronger community structure. The structure properties, including the degree distribution, clustering, the communication efficiency and modularity are also analysed for the network. In addition, by using the Kuramoto model, we investigated the phase synchronization on this network, and found that increasing the fuzziness of community structure will markedly enhance the network synchronizability; however, in an abnormal region （r ≤ 0.001）, the network has even worse synchronizability than the case of isolated communities （r = 0）. Furthermore, this network exhibits a remarkable synchronization behaviour in topological scales： the oscillators of high densely interconnected communities synchronize more easily, and more rapidly than the whole network.

关键词： complex networks small-world community structure phase synchronization

来源：评论

学校读者我要写书评

暂无评论

COph100: A comprehensive fundus image registration dataset from infants constituting the "RIDIRP" database

arXiv

引用

arXiv 2025年

作者： Hu, Yan Gong, Mingdao Qiu, Zhongxi Liu, Jiabao Shen, Hongli Yuan, Mingzhen Zhang, Xiaoqing Li, Heng Lu, Hai Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Sciences Key Laboratory Beijing China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Retinal image registration is vital for diagnostic therapeutic applications within the field of ophthalmology. Existing public datasets, focusing on adult retinal pathologies with high-quality images, have limited number of image pairs and neglect clinical challenges. To address this gap, we introduce COph100, a novel and challenging dataset known as the Comprehensive Ophthalmology Retinal image Registration dataset for infants with a wide range of image quality issues constituting the public "RIDIRP" database1. COph100 consists of 100 eyes, each with 2 to 9 examination sessions, amounting to a total of 491 image pairs carefully selected from the publicly available dataset. We manually labeled the corresponding ground truth image points and provided automatic vessel segmentation masks for each image. We have assessed COph100 in terms of image quality and registration outcomes using state-of-the-art algorithms. This resource enables a robust comparison of retinal registration methodologies and aids in the analysis of disease progression in infants, thereby deepening our understanding of pediatric ophthalmic conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： image registration

来源：评论

学校读者我要写书评

暂无评论

Effective ensemble learning approach for SST field prediction using attention-based PredRNN

引用

Frontiers of Computer Science 2023年第1期17卷 143-155页

作者： Baiyou QIAO Zhongqiang WU Ling MA Yicheng Zhou Yunjiao SUN School of Computer Science and Engineering Northeastern UniversityShenyang 110169China Key Laboratory of Intelligent Computing in Medical Image Ministry of EducationNortheastern UniversityShenyang 110169China

Accurate prediction of sea surface temperature (SST) is extremely important for forecasting oceanic environmental events and for ocean studies. However, the existing SST prediction methods do not consider the seasonal periodicity and abnormal fluctuation characteristics of SST or the importance of historical SST data from different times;thus, these methods suffer from low prediction accuracy. To solve this problem, we comprehensively consider the effects of seasonal periodicity and abnormal fluctuation characteristics of SST data, as well as the influence of historical data in different periods, on prediction accuracy. We propose a novel ensemble learning approach that combines the Predictive Recurrent Neural Network(PredRNN) network and an attention mechanism for effective SST field prediction. In this approach, the XGBoost model is used to learn the long-period fluctuation law of SST and to extract seasonal periodic features from SST data. The exponential smoothing method is used to mitigate the impact of severely abnormal SST fluctuations and extract the a priori features of SST data. The outputs of the two aforementioned models and the original SST data are stacked and used as inputs for the next model, the PredRNN network. PredRNN is the most recently developed spatiotemporal deep learning network, which simulates both spatial and temporal representations and is capable of transferring memory across layers and time steps. Therefore, we used it to extract the spatiotemporal correlations of SST data and predict future SSTs. Finally, an attention mechanism is added to capture the importance of different historical SST data, weigh the output of each step of the PredRNN network, and improve the prediction accuracy. The experimental results on two ocean datasets confirm that the proposed approach achieves higher training efficiency and prediction accuracy than the existing SST field prediction approaches do.

关键词： SST prediction ensemble learning XGBoost PredRNN attention mechanism

来源：评论

学校读者我要写书评

暂无评论

A review of multimodal fusion–based deep learning for Alzheimer's disease

引用

Neuroscience 2025年 576卷 80-95页

作者： Zhang, Rong Sheng, Jinhua Zhang, Qiao Wang, Junmei Wang, Binbing School of Computer Science and Technology Hangzhou Dianzi University Zhejiang Hangzhou 310018 China Key Laboratory of Intelligent Image Analysis for Sensory and Cognitive Health Ministry of Industry and Information Technology of P. R. China Zhejiang Hangzhou 310018 China Beijing Hospital Beijing 100730 China National Center of Gerontology Beijing 100730 China Institute of Geriatric Medicine Chinese Academy of Medical Sciences Beijing 100730 China

Alzheimer's Disease (AD) as one of the most prevalent neurodegenerative disorders worldwide, characterized by significant memory and cognitive decline in its later stages, severely impacting daily lives. Consequently, early diagnosis and accurate assessment are crucial for delaying disease progression. In recent years, multimodal imaging has gained widespread adoption in AD diagnosis and research, particularly the combined use of Magnetic Resonance Imaging (MRI) and Positron Emission Tomography (PET). The complementarity of these modalities in structural and metabolic information offers a unique advantage for comprehensive disease understanding and precise diagnosis. With the rapid advancement of deep learning techniques, efficient fusion of MRI and PET multimodal data has emerged as a prominent research focus. This review systematically surveys the latest advancements in deep learning-based multimodal fusion of MRI and PET images for AD research, with a particular focus on studies published in the past five years (2021–2025). It first introduces the main sources of AD-related data, along with data preprocessing and feature extraction methods. Then, it summarizes performance metrics and multimodal fusion techniques. Next, it explores the application of various deep learning models and their variants in multimodal fusion tasks. Finally, it analyzes the key challenges currently faced in the field, including data scarcity and imbalance, inter-institutional data heterogeneity, etc., and discusses potential solutions and future research directions. This review aims to provide systematic guidance for researchers in the field of MRI and PET multimodal fusion, with the ultimate goal of advancing the development of early AD diagnosis and intervention strategies. © 2025 International Brain Research Organization (IBRO)

关键词： Alzheimer's Disease Deep learning Detection and classification MRI and PET Multimodal

来源：评论

学校读者我要写书评

暂无评论

Memory Layout Optimization for Task-Based Intermittent computing Systems 2

Memory Layout Optimization for Task-Based Intermittent Compu...

引用

2nd International Conference on intelligent Technology and Embedded Systems, ICITES 2022

作者： Ji, Dong Liu, Songran Wei, Yangjie Yi, Wang Northeastern University Key Laboratory of Intelligent Computing in Medical Image Shenyang China

ISBN: (数字)9781665451048

ISBN: (纸本)9781665451048

The embedded system with energy harvest equipment collects the energy required for system operation from its working environment and releases it from the battery. However, the equipment can only provide intermittent power because environmental energy fluctuates. As a result, to assure the program's progress, the program states must be stored timely and frequently. A promising paradigm for providing this capability is the task-based intermittent computing, in which each task is executed atomically and the states stored in shared memory across task boundaries must be preserved. The total number of saved states influences execution energy and time, and memory layout influences the saved memory interval of each task. In this paper, we model and analyze the influence of memory layout on the task-based computing system, and we establish an optimization problem for memory layout aimed at reducing the unnecessary operations on state backup. A heuristic algorithm based on genetic algorithms is proposed to obtain the approximate optimal solution in polynomial time. The benchmark test evaluation results show that, by optimizing the layout of memory variables, the proposed method significantly reduces the cost of state saving and improves execution efficiency. © 2022 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Network evolution driven by dynamics applied to graph coloring

引用

Chinese Physics B 2013年第6期22卷 262-267页

作者：吴建设李力光王晓华于昕焦李成 Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China 224# Xidian University Aeronautical Computing Technique Research Institute

An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.

关键词： network dynamics evolution of network evolutionary strategies graph coloring problem

来源：评论

学校读者我要写书评

暂无评论

Modeling Fine-Grained Relations in Dynamic Space-Time Graphs for Video-Based Facial Expression Recognition

引用

IEEE Transactions on Affective computing 2025年

作者： Huang, Changqin Jiang, Fan Han, Zhongmei Huang, Xiaodi Wang, Shijin Zhu, Yanlai Jiang, Yunliang Hu, Bin Zhejiang Normal University Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Jinhua321004 China Charles Sturt University School of Computing Mathematics and Engineering AlburyNSW2640 Australia State Key Laboratory of Cognitive Intelligence Anhui Hefei230088 China Hangzhou Hikvision Digital Technology Co. Ltd Education Business Department Hangzhou310051 China Zhejiang Normal University School of Computer Science and Technology Jinhua321004 China Beijing Institute of Technology School of Medical Technology Beijing10081 China

Facial expressions in videos inherently mirror the dynamic nature of real-world facial events. Consequently, facial expression recognition (FER) should employ a dynamic graph-based representation to effectively capture the relational structure of facial expressions rather than relying on conventional grid or sequence methods. However, existing graph-based approaches have their limitations. Frame-level graph methods provide a coarse representation of the facial graph across time and space, while landmark-based graph methods need to introduce additional facial landmarks, resulting in a static graph structure. To address these challenges, we propose spatial-temporal relation-aware dynamic graph convolutional networks (ST-RDGCN). This fine-grained relation modeling approach enables the dynamic modeling of evolving facial expressions in videos through dynamic space-time graphs, eliminating the need for facial landmarks. ST-RDGCN encompasses three graph construction paradigms: dynamic independent space graph, dynamic joint space-time graph, and dynamic cross space-time graph. Furthermore, we propose a relation-aware space-time graph convolution (RSTG-Conv) operator to learn informative spatiotemporal correlations in dynamic space-time graphs. In extensive experimental evaluations, our ST-RDGCN demonstrates state-of-the-art performance on the five popular video-based FER datasets, achieving overall accuracy scores of 99.69%, 91.67%, 56.51%, 69.37%, and 49.03% on the CK+, Oulu-CASIA, AFEW, DFEW, and FERV39 k datasets, respectively. In particular, our ST-RDGCN outperforms the current best method by 3.6% in UAR on the most challenging FERV39 k dataset. Furthermore, our analysis reveals that the dynamic cross space-time graph scheme is the most effective among the three dynamic graph construction schemes. © 2010-2012 IEEE.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Outlier Detection over Sliding Windows for Probabilistic Data Streams

引用

Journal of Computer Science & Technology 2010年第3期25卷 389-400页

作者：王斌杨晓春王国仁于戈 School of Information Science and Engineering Northeastern University(Shenyang) Key Laboratory of Medical Image Computing (Northeastern University) Ministry of Education

Outlier detection is a very useful technique in many applications, where data is generally uncertain and could be described using probability. While having been studied intensively in the field of deterministic data, outlier detection is still novel in the emerging uncertain data field. In this paper, we study the semantic of outlier detection on probabilistic data stream and present a new definition of distance-based outlier over sliding window. We then show the problem of detecting an outlier over a set of possible world instances is equivalent to the problem of finding the k-th element in its neighborhood. Based on this observation, a dynamic programming algorithm （DPA） is proposed to reduce the detection cost from 0（2IR（~＇d）l） to O（Ik.R（e, d）l）, where R（e, d） is the d-neighborhood of e. Furthermore, we propose a pruning-based approach （PBA） to effectively and efficiently filter non-outliers on single window, and dynamically detect recent m elements incrementally. Finally, detailed analysis and thorough experimental results demonstrate the efficiency and scalability of our approach.

关键词： outlier detection uncertain data probabilistic data stream sliding window

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：