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

arXiv 2024年

作者： Li, Na Zhang, Zhichao Han, Jie Chen, Yunjie Cao, Chunzheng School of Mathematics and Statistics Center for Applied Mathematics of Jiangsu Province Jiangsu International Joint Laboratory on System Modeling and Data Analysis Nanjing University of Information Science and Technology Nanjing210044 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Key Laboratory of Computational Science and Application of Hainan Province Haikou571158 China School of Remote Sensing and Geomatics Engineering Nanjing University of Information Science and Technology Nanjing210044 China

Many multi-dimensional (M-D) graph signals appear in the real world, such as digital images, sensor network measurements and temperature records from weather observation stations. It is a key challenge to design a transform method for processing these graph M-D signals in the linear canonical transform domain. This paper proposes the two-dimensional graph linear canonical transform based on the central discrete dilated Hermite function (2-D CDDHFs-GLCT) and the two-dimensional graph linear canonical transform based on chirp multiplication-chirp convolution-chirp multiplication decomposition (2-D CM-CC-CM-GLCT). Then, extending 2-D CDDHFs-GLCT and 2-D CM-CC-CM-GLCT to M-D CDDHFs-GLCT and M-D CM-CC-CM-GLCT. In terms of the computational complexity, additivity and reversibility, M-D CDDHFs-GLCT and M-D CM-CC-CM-GLCT are compared. Theoretical analysis shows that the computational complexity of M-D CM-CC-CM-GLCT algorithm is obviously reduced. Simulation results indicate that M-D CM-CC-CM-GLCT achieves comparable additivity to M-D CDDHFs-GLCT, while M-D CM-CC-CM-GLCT exhibits better reversibility. Finally, M-D GLCT is applied to data compression to show its application advantages. The experimental results reflect the superiority of M-D GLCT in the algorithm design and implementation of data compression. Copyright © 2024, The Authors. All rights reserved.

关键词： Chirp modulation

来源：评论

学校读者我要写书评

暂无评论

Graph Chirp Signal and Graph Fractional Vertex-Frequency Energy Distribution

arXiv

引用

arXiv 2025年

作者： Cui, Manjun Zhang, Zhichao School of Mathematics and Statistics The Center for Applied Mathematics of Jiangsu Province The Jiangsu International Joint Laboratory on System Modeling and Data Analysis Nanjing University of Information Science and Technology Nanjing210044 China School of Mathematics and Statistics Nanjing University of Information Science and Technology Nanjing210044 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Computational Science and Application of Hainan Province Hainan Normal University Haikou571158 China

Graph signal processing (GSP) has emerged as a powerful framework for analyzing data on irregular domains. In recent years, many classical techniques in signal processing (SP) have been successfully extended to GSP. Among them, chirp signals play a crucial role in various SP applications. However, graph chirp signals have not been formally defined despite their importance. Here, we define graph chirp signals and establish a comprehensive theoretical framework for their analysis. We propose the graph fractional vertex-frequency energy distribution (GFED), which provides a powerful tool for processing and analyzing graph chirp signals. We introduce the general fractional graph distribution (GFGD), a generalized vertex-frequency distribution, and the reduced interference GFED, which can suppress cross-term interference and enhance signal clarity. Furthermore, we propose a novel method for detecting graph signals through GFED domain filtering, facilitating robust detection and analysis of graph chirp signals in noisy environments. Moreover, this method can be applied to real-world data for denoising more effective than some state-of-the-arts, further demonstrating its practical significance. Copyright © 2025, The Authors. All rights reserved.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Location Rating Based on Graph Neural Network 2020

Location Rating Based on Graph Neural Network

引用

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Fengbin Zheng Li Ding Lanxue Dang Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

With the rapid development of social networks, people are increasingly interested in sharing their location. Location recommendation has become an important personalization service for location-based social networks (LBSN). Location rating is one of the important tools. However, location-based social networks contain multidimensional network structures and node information. Existing approaches mostly focus on network structures that utilize one of these dimensions, which makes it difficult to efficiently aggregate information from multiple dimensions simultaneously. To overcome these difficulties, one of the recent approaches is the social recommendation based on graph neural networks (GNNs). Based on this, this paper proposes a graph neural network framework for location rating. Graph neural networks are highly inductive and can efficiently aggregate network structure and node information. In particular, the method not only aggregates homogeneous social networks composed of user and heterogeneous bipartite graphs composed of user-location, but also constructs location networks using location sequences to propose an aggregation model for location networks. Experiments are conducted on two datasets, and the results show that the method improves on the root mean square error (RMSE) and mean absolute error (MAE) metrics.

关键词： Graph neural network Location rating Location based social networks

来源：评论

学校读者我要写书评

暂无评论

Recognition of Pest Based on Faster RCNN 6th

Recognition of Pest Based on Faster RCNN

引用

6th Conference on Signal and Information processing, Networking and Computers, ICSINC 2019

作者： Zhang, Miaohui Chen, Yunzhong Zhang, Bo Pang, Kangning Lv, Bingxue Key Laboratory of Data Analysis and Processing of Henan Province Henan University Kaifeng China Postdoctoral Research Station of Geography Henan University Kaifeng China College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China

ISBN: (纸本)9789811541629

Effective prediction of crop pest species and quantities can provide a priori knowledge for pest control. However, there are many kinds of pests and the color and texture of different pests are similar, traditional image processing and recognition methods based on time or frequency domain features and classifiers are hard to meet the needs of high-precision recognition. In order to improve the recognition result of agricultural pests, based on the target detection algorithm Faster RCNN, we put forward a method for the classification and identification of pests on the basis of online hard sample mining and residual network. The main work is as follows: (1) According to the different size of pests, the detection ability of the network for small targets is enhanced by changing the size and number of anchors;(2) In the feature extraction stage, we use ResNet-50 with stronger feature extraction ability rather than the original VGG16 network;(3) In order to solve the imbalance of samples, online hard Sample Mining Strategy is introduced in the training stage. The experimental outcome demonstrate that our method is effective, the improved algorithm achieves about 5% improvement in accuracy, and the network has a stronger ability to detect small targets. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

High-resolution rock abundance derivation of lunar cold spot craters based on RA-SAR model

引用

Planetary and Space Science 2025年 263卷

作者： Sun, Jiacheng Lu, Xin Shu, Gaofeng Guo, Zhengwei Li, Ning School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Henan Province Engineering Research Center of Spatial Information Processing Henan University Kaifeng475004 China

The distribution of rock abundance (RA) on the lunar surface plays a pivotal role in understanding its geological evolution. This study focuses on the derivation of high-resolution RA data for lunar cold spot craters using Mini-RF (Miniature Radio Frequency) synthetic aperture radar (SAR) data. Firstly, terrain correction was applied to the SAR data. Secondly, the correlation between the Stokes parameters (S1, S2, S3, and S4) and RA was examined using optically-derived RA data, which aligns with the resolution of the Mini-RF SAR images. By plotting scatter diagrams showing the relationships between the Stokes parameters and the optically-derived RA, strong statistical associations were established. Finally, based on these findings, we formulated a regression-based RA-SAR model. This model was applied to other lunar cold spot craters in order to derive their high-resolution RA distributions. The experimental results show that the model yields highly precise outcomes when validated against both Diviner RA and optical data. The study provides a new approach for inferring rock distribution across the lunar surface using SAR data, and offers valuable insights for advancing lunar geological research. © 2025

关键词： Cold spot crater Diviner Mini-RF Moon Rock abundance SAR

来源：评论

学校读者我要写书评

暂无评论

Diffusion Model-based Contrastive Learning for Human Activity Recognition

arXiv

引用

arXiv 2024年

作者： Xiao, Chunjing Han, Yanhui Yang, Wei Hou, Yane Shi, Fangzhan Chetty, Kevin The School of Computer and Information Engineering Henan University Kaifeng475004 China University College London LondonWC1E 6BT United Kingdom The School of Computer and Information Engineering Henan University China The Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China The Department of Security and Crime Science University College London LondonWC1E 6BT United Kingdom

WiFi Channel State Information (CSI)-based activity recognition has sparked numerous studies due to its widespread availability and privacy protection. However, when applied in practical applications, general CSI-based recognition models may face challenges related to the limited generalization capability, since individuals with different behavior habits will cause various fluctuations in CSI data and it is difficult to gather enough training data to cover all kinds of motion habits. To tackle this problem, we design a diffusion model-based Contrastive Learning framework for human Activity Recognition (CLAR) using WiFi CSI. On the basis of the contrastive learning framework, we primarily introduce two components for CLAR to enhance CSI-based activity recognition. To generate diverse augmented data and complement limited training data, we propose a diffusion model-based time series-specific augmentation model. In contrast to typical diffusion models that directly apply conditions to the generative process, potentially resulting in distorted CSI data, our tailored model dissects these condition into the high-frequency and low-frequency components, and then applies these conditions to the generative process with varying weights. This can alleviate data distortion and yield high-quality augmented data. To efficiently capture the difference of the sample importance, we present an adaptive weight algorithm. Different from typical contrastive learning methods which equally consider all the training samples, this algorithm adaptively adjusts the weights of positive sample pairs for learning better data representations. The experiments suggest that CLAR achieves significant gains compared to state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Big data and Cloud Computing (BdCloud)

作者： Lei Zhang Xuefei Chen Yuxiang Ma School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China

Mobile devices face the problem of handover signal sources in mobile communication networks. It is particularly difficult to address this problem in 5G networks, because the coverage area of 5G base stations is smaller than that of traditional mobile communication networks, e.g., 4G networks. Therefore, when a device is moving, it needs to frequently handover base stations to maintain the connection with the network in the 5G network. Given that 5G networks have high requirements for low latency and high reliability, new methods need to be proposed to optimize the selection of gNBs for devices. The prediction of the UEs’ trajectory can reduce redundant handovers between devices and base stations. However, the prediction of the UEs’ movement trajectory requires sufficient user movement data to achieve the desired prediction accuracy. For users with less trajectory data, inaccurate predictions may cause negative effects and even increase the number of handovers. In this paper, we propose a gNB handover model based on user similarity. The evaluation results show that our method can reduce the number of handovers by 50% compared with existing related solutions, which means that the proposed method will effectively reduce the transmission delay and enhance the robustness of the gNB.

关键词： Base stations 5G mobile communication Handover Predictive models Prediction algorithms data models Robustness

来源：评论

学校读者我要写书评

暂无评论

Graph Structure-Aware Bi-directional Graph Convolution Model for Semantic Role Labeling

Graph Structure-Aware Bi-directional Graph Convolution Model...

引用

IEEE International Conference on Big data

作者： Wenke Ding Congcong Zhang Gaofei Xie Xiaojie Hu Xiajiong Shen Yatian Shen School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China

ISBN: (纸本)9781665445993

Dependency tree contains rich syntactic structure information, which is very effective for semantic role labeling. Semantic role labeling is a task with strong syntactic dependence. How to effectively use subgraphs to predict surrounding graph structures for context of dependency tree and encode the dependency relationships between predicates and arguments in the sentence which to be annotated is still a challenging problem. In this paper, we propose a bidirectional graph convolution model based on distribution of graph structure and the attention mechanism, which is used to make better use of all syntactic information in the sentence dependency tree and the dependencies between predicates and arguments, so as to improve the accuracy of semantic role labeling. Without heavy feature engineering and extra knowledge of a particular language, our model obtained 88.9% F1 value on the WSJ test set of public dataset CoNLL2005, and 0.7% improvement compared with the existing best model.

关键词： Knowledge engineering Convolution Conferences Semantics Bidirectional control Syntactics Big data

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of data Classification Based on PCA and K-Means++

An Algorithm of Data Classification Based on PCA and K-Means...

引用

Telecommunications, Optics and Computer Science (TOCS), IEEE Conference on

作者： Ruirui Huang Qianshuai Cheng Zhengquan Chen Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer and Information Engineering Henan University Kaifeng China

ISBN: (纸本)9781665424998

Principal component analysis (PCA) and K-means++ algorithm are used to classify and analyze eight main variables of the average annual consumption expenditure of urban households in 31 provinces and cities in China in a given year, so as to better build the reasonable consumption level of each area. In this paper, a data classification method based on PCA and improved K-means++ is proposed. In this method, PCA was used to extract eight variable characteristics of consumer expenditure, and K-means++ algorithm was used to classify the data. The experimental results show that this method reduces the dependence of the characteristic dimension of variable data and the k-means++ algorithm on the initial classification center of gravity, and improves the accuracy and stability of data classification results.

关键词： Dimensionality reduction Conferences Urban areas Optics Stability analysis Classification algorithms Telecommunications

来源：评论

学校读者我要写书评

暂无评论

key-Point Based Distribution Probability Optimization for Object Detection in Remote Sensing Images

Key-Point Based Distribution Probability Optimization for Ob...

引用

International Conference on Computer and Communications (ICCC)

作者： Xiaoke Zhu Yufei Wang Xiaopan Chen Danyang Li Jitong Zhang Yulong Cai School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China

ISBN: (纸本)9781665409513

Recently, object detection in remote sensing images has been an important topic in computer vision. As a mainstream approach to detectors, single-stage detectors usually compute the important points of the bounding box to get the location of the target, and optimize them by Focal Loss. One of the development trends for one-stage detectors is to combine with Localization Quality Estimation (LQE), which can provide accurate ranking scores, and thus bring benefits to the Non-Maximum Suppression as well as the following detection results. In this paper, we propose a one-stage detector, named key-point based Distribution Probability Optimization (KDPO), for remote sensing object detection. Specially, we first classify and locate the object through five key points. Then, we merge the quality estimation into the class prediction vector to form a joint representation of localization quality and classification. Next, we utilize a vector to represent arbitrary distribution of box locations. The improved representations avoid the inconsistency risk and accurately describe the flexible distribution of the data. Meanwhile, we use the improved Focal Loss for the succeed optimization. The proposed method is tested on two popular aerial image datasets, including HRSC2016 and DOTA. In all experiments, our approach achieves promising performance comparing to the state-of-the-art detectors.

关键词： Location awareness Heating systems Computer vision Estimation Detectors Object detection Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：