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

PFS3F: Probabilistic Fusion of Superpixel-wise and Semantic-aware Structural Features for Hyperspectral Image Classification

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhang, Ying Duan, Puhong Liang, Lianhui Kang, Xudong Li, Jun Plaza, Antonio Hunan University of Technology College of Railway Transportation Zhuzhou412007 China Hunan University School of Robotics Changsha410082 China Guangxi University School of Electrical Engineering Nanning530004 China China University of Geosciences Hubei Key Laboratory of Intelligent Geo-Information Processing the School of Computer Science Wuhan430078 China Hyperspectral Computing Laboratory Department of Technology of Computers and Communications Escuela Politecnica University of Extremadura CaceresE-10071 Spain

processing high-dimensional data cubes and developing high-performance classifiers are core objectives in the field of hyperspectral image classification (HSIC). Superpixel-based methods are widely used in HSIC due to their efficacy in reducing redundant information and enhancing local features. However, imprecise segmentation, especially in complex structures and textures of hyperspectral images (HSIs), may lead to inconsistencies in the regions extracted by superpixels and the boundaries between different ground objects. Such inconsistencies significantly degrade the classification performance of HSIs. Alternatively, when parameter settings are inaccurate, edge-aware feature extraction methods often introduce sharpening artifacts at the image boundaries, resulting in a decrease in classification accuracy. To effectively address these challenges, we propose a novel probabilistic fusion method for HSIC. This method consists of the following stages. First, spatial information is extracted by a multiscale superpixel segmentation method and then probabilistically optimized by the extended random walk (ERW) method. Next, semantic-aware structural features (S2Fs) are extracted along with edge information of different objects. Lastly, a probabilistic framework is proposed to fuse the class probabilities of superpixel-based spatial information and semantic-aware structural features. Experimental results on three real datasets show state-of-the-art classification performance, even with limited training sets. ©1991-2012 IEEE.

关键词： Superpixels

来源：评论

学校读者我要写书评

暂无评论

Joint utility optimization algorithm for secure hybrid spectrum sharing

引用

High Technology Letters 2022年第4期28卷 373-383页

作者： WANG Yi HUANG Rong XU Yaohua JIANG Fang BAI Na TANG Tao HU Yanjun Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230601P.R.China

As the rapid development of wireless communication networks has resulted in better user experiences,the spectrum resources occupied and energy consumption have increased considerably and resulted in great *** address the energy consumption and cost problems of spectrum sharing in cognitive radio networks,a hybrid spectrum sharing model combining the free spectrum of authorized users and the leased spectrum of mobile network operators is *** on the hybrid model,a function of throughput and costs,including energy consumption and transaction costs,is constructed,and a joint utility optimization problem is *** transactions between secondary users and primary users are performed on the consortium blockchain on which users can directly trade spectrum and the transaction information is *** order to improve the joint utility,the Lagrange multiplier method is used to achieve the optimal solution for the sensing time,the number of secondary users involved in sensing,and the transmission *** simulation results show that the joint utility optimization algorithm proposed in this paper can achieve higher joint utility under the constraints of the minimum throughput requirement and maximum transmission power.

关键词： spectrum sharing power control joint utility blockchain

来源：评论

学校读者我要写书评

暂无评论

Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm

引用

Tsinghua Science and Technology 2014年第3期19卷 285-292页

作者： Yanping Zhang Heng Zhang Huazhen Wei Jie Tang Shu Zhao the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University1Hefei 230601 China the Department of Computer Science and Technology Tsinghua University

Multiple-Instance Learning （MIL） is used to predict the unlabeled bags＇ label by learning the labeled positive training bags and negative training *** bag is made up of several unlabeled instances.A bag is labeled positive if at least one of its instances is positive,otherwise *** multiple-instance learning methods with instance selection ignore the representative degree of the selected *** example,if an instance has many similar instances with the same label around it,the instance should be more representative than *** on this idea,in this paper,a multiple-instance learning with instance selection via constructive covering algorithm （MilCa） is *** MilCa,we firstly use maximal Hausdorff to select some initial positive instances from positive bags,then use a Constructive Covering Algorithm （CCA） to restructure the structure of the original instances of negative *** an inverse testing process is employed to exclude the false positive instances from positive bags and to select the high representative degree instances ordered by the number of covered instances from training ***,a similarity measure function is used to convert the training bag into a single sample and CCA is again used to classification for the converted *** results on synthetic data and standard benchmark datasets demonstrate that MilCa can decrease the number of the selected instances and it is competitive with the state-of-the-art MIL algorithms.

关键词： multiple-instance learning instance selection constructive covering algorithm maximal Hausdorff

来源：评论

学校读者我要写书评

暂无评论

Informative gene selection using the Algebraic Connectivity Strength of Point and Scoring Criteria

引用

Chinese Science Bulletin 2013年第6期58卷 657-661页

作者： WANG Nian SU LiangLiang TANG Jun YE AiXia Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University School of Electronics and Information Engineering Anhui University

This paper presents a novel method that integrates the Algebraic Connectivity Strength of Point(ACSP) and Scoring Criteria to identify genes associated with tumor ***,for each gene,the ACSP is used to identify reliable expression levels of the gene in all the *** informative genes are then selected using Scoring Criteria based on these reliable expression ***,the Support Vector Machine(SVM) classifier is used to classify the two datasets of gene expression *** results show that the informative genes selected by the proposed method have higher credibility than those selected by Scoring Criteria alone.

关键词：基因选择评分标准信息化强度连通代数基因表达谱支持向量机

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

DMFVAE:miRNA-disease associations prediction based on deep matrix factorization method with variational autoencoder

引用

Frontiers of Computer Science 2024年第6期18卷 259-270页

作者： Pijing WEI Qianqian WANG Zhen GAO Ruifen CAO Chunhou ZHENG Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and TechnologyAnhui UniversityHefei 230601China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial IntelligenceAnhui UniversityHefei 230601China

MicroRNAs(miRNAs)are closely related to numerous complex human diseases,therefore,exploring miRNA-disease associations(MDAs)can help people gain a better understanding of complex disease *** increasing number of computational methods have been developed to predict ***,the sparsity of the MDAs may hinder the performance of many *** addition,many methods fail to capture the nonlinear relationships of miRNA-disease network and inadequately leverage the features of network and neighbor *** this study,we propose a deep matrix factorization model with variational autoencoder(DMFVAE)to predict potential *** first decomposes the original association matrix and the enhanced association matrix,in which the enhanced association matrix is enhanced by self-adjusting the nearest neighbor method,to obtain sparse vectors and dense vectors,***,the variational encoder is employed to obtain the nonlinear latent vectors of miRNA and disease for the sparse vectors,and meanwhile,node2vec is used to obtain the network structure embedding vectors of miRNA and disease for the dense ***,sample features are acquired by combining the latent vectors and network structure embedding vectors,and the final prediction is implemented by convolutional neural network with channel *** evaluate the performance of DMFVAE,we conduct five-fold cross validation on the HMDD v2.0 and HMDD v3.2 datasets and the results show that DMFVAE performs ***,case studies on lung neoplasms,colon neoplasms,and esophageal neoplasms confirm the ability of DMFVAE in identifying potential miRNAs for human diseases.

关键词： miRNA-disease association deep matrix factorization self-adjusted nearest neighbor variational encoder network structure

来源：评论

学校读者我要写书评

暂无评论

Research on Robust Measurement Method of Heart Rate Using Remote Photoplethysmography Based on Adversarial Learning Network with High and Low Frequency Features

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhai, Dezhao Chen, Wei Ding, Yinghao Yu, Ming Li, Qinwei Wu, Hang Tianjin University of Technology Tianjin Key Laboratory for Advanced Mechatronic System Design and Intelligent Control School of Mechanical Engineering Tianjin300384 China National Demonstration Center for Experimental Mechanical and Electrical Engineering Education Tianjin University of Technology China People's Liberation Army Systems Engineering Institute Academy of Military Sciences Tianjin300161 China Civil Aviation University of China Tianjin Key Laboratory for Advanced Signal Processing Tianjin300300 China Nankai University School of Artificial Intelligence Tianjin300381 China

Remote Photoplethysmography (rPPG) is a non-contact method for measuring heart rate (HR) through facial video, breaking the constraints of contact measurements and offering broad application prospects. However, in real monitoring scenarios, the distance of subjects and facial illumination often vary. This leads to degradation of rPPG signals due to changes in facial resolution and light intensity. This paper presents the High and Low Frequency Feature Adversarial Learning Network (HLFF-AL), which utilizes feature space interpolation and composite feature capture to perform multi-band global and local signal extraction. By adopting an adversarial learning strategy, it enhances the capability to capture semantic information of rPPG under varying resolutions and lighting, bridging the differences in rPPG signal generation due to resolution changes. While maintaining accuracy in HR measuring, the robustness of the network is improved to achieve robust measurement of HR via rPPG. Even under high-resolution conditions, the Mean Absolute Error (MAE) for the three public datasets - unchanging lighting (COHFACE, UBFC-rPPG) and varying lighting (BUAA-MIHR) - reached 1.10 bpm, 1.64 bpm, and 4.41 bpm, respectively, with a mere 0.29 bpm difference in MAE between high and low resolutions on the BUAA-MIHR dataset. This demonstrates that HLFF-AL can predict more robust rPPG signals in various resolutions and lighting scenarios, achieving competitive results compared to state-of-the-art methods. © 1991-2012 IEEE.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

Contrary description logic: Gentzen deduction system

引用

Science China(Information Sciences) 2017年第11期60卷 171-179页

作者： Wei LI Yuefei SUI Jie LUO Bo CHEN State Key Laboratory of Software Development Environment Beihang University Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

Traditional description logics are based on complementary rather than contrary concepts. This work proposes a contrary description logic based on the contrary concept constructors ～, ?(instead of ?).A Gentzen-type deduction system is applied to make the system sound and complete with the three-valued semantics of contrary description logic.

关键词： description logics contradictory contrary soundness completeness

来源：评论

学校读者我要写书评

暂无评论

Simulation of Dual-Layer Metallic Nanowire Grids Broadband Polarizers Using the Finite-Difference Frequency-Domain Method 5

Simulation of Dual-Layer Metallic Nanowire Grids Broadband P...

引用

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Wu, Gang Wu, Bo Huang, Zhixiang Key Laboratory of Intelligent Computing Signal Processing Anhui University Hefei China

ISBN: (纸本)9781538671115

We develop the broadband polarizers functioning in an extremely wide wavelength range from 0.3 to 5 μ m based on structural design and numerical simulation. The finite-difference frequency-domain (FDFD) method is a powerful and simple method for analyzing the electromagnetic structures. We propose a broadband polarizer using dual-layer metallic nanowire grids on a substrate, reflectance and transmittance are simulated by the FDFD method including normal incidence and oblique incidence. © 2019 IEEE.

关键词： Reflection

来源：评论

学校读者我要写书评

暂无评论

Joint relay selection and power allocation protocol for two-way relaying system

引用

International Journal of Wireless and Mobile computing 2019年第4期17卷 349-360页

作者： Zhi, Hui Zhu, Jun Hu, Yanjun Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui230601 China

The Joint Relay Selection and Power Allocation (JRSPA) for Amplify-and-Forward (AF) relaying (JRSPA-AF) combines Power Allocation (PA) and Relay Selection (RS) very well in Two- Way Relaying (TWR) system. In order to explore the system performance of JRSPA-AF protocol, the outage probability and Diversity-Multiplexing Trade-off (DMT) of JRSPA-AF protocol are analysed. One upper bound, two lower bounds and approximate expressions of outage probability along with the DMT are derived. Based on this, the idea of JRSPA is introduced into Decode-and- Forward (DF) relaying TWR system, and the JRSPA-DF protocol is proposed. Moreover, the exact expressions of outage probability and DMT for JRSPA-DF are derived. Simulations are developed to validate the analytical results, the results show that the approximation outage probability of JRSPA-AF can be used well to evaluate system outage probability over the entire transmission SNR region, and the analysis results of outage probability of JRSPA-DF are consistent with its simulation results. In addition, the simulation results indicate that JRSPA-DF can achieve lower outage probability than JRSPA-AF and other protocols. Copyright © 2019 Inderscience Enterprises Ltd.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：