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

The Iterative Sequential Polynomial Fitting Algorithm for a Mobile 4CASK-OCC System

IEEE Internet of Things Journal 2025年

作者： Ji, Shaoxi Yang, Aiying Xu, Hang Feng, Lihui Zhang, Zhenrong Zhang, Minglun Beijing Institute of Technology Key Laboratory of Photonics Information Technology School of Optics and Photonics Beijing100081 China Guangxi University Key Laboratory of Multimedia Communications and Network Technology School of Computer Electronics and Information Nanning530004 China State Key Laboratory of Information Photonics and Optical Communications Beijing100876 China

We propose and experimentally validate the adaptive detection method for a 4CASK optical camera communication (OCC) system that supports user mobility. In mobile scenarios, lateral movement shifts the brightest received position in the image, while vertical movement causes the change in received light intensity. These effects lead to grayscale variations for the same symbol across different frames, making empirical or trained thresholds ineffective. To address this, we propose an iterative sequential polynomial fitting (ISPF) method for detecting multi-level symbols in a 4-compound amplitude shift keying (4CASK) OCC system. By iteratively fitting each symbol level, ISPF adapts to the inherent nonlinearity of LED modulation and derives time-varying thresholds per frame, ensuring a fixed transmission rate under varying distances and movement speeds. Additionally, we design an outlier point identification algorithm to filter erroneous symbols caused by the illumination unevenness and LED instability at the edges of the fitted curve. Experiments were conducted on a 4CASK-OCC system with movement speeds of the camera as 40, 60, and 80 cm/s, covering vertical distances from 100 cm to 400 cm and lateral distances up to 50 cm. Results show that movement speed has minimal impact on the system performance, and the proposed method achieves 6.8 kbps throughput under low illumination (70 lx). Our approach requires no training and is robust to channel variations. © 2014 IEEE.

关键词： Amplitude shift keying

来源：评论

学校读者我要写书评

暂无评论

Collaborative Video Processing of Multiple Cameras in Smart Transportation: Content Analysis and Resource Allocation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Du, Lei Huo, Ru Sun, Chuang Wang, Shuo Huang, Tao Beijing University of Technology Faculty of Information Technology Beijing100124 China Purple Mountain Laboratories Future Network Research Center Nanjing211111 China China Academy of Information and Communications Technology Research Institute of Information and Industrialization Integration Beijing100095 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China

In the context of smart transportation, the collaborative processing of video data sourced from multiple cameras plays a pivotal role in promoting efficient traffic management and augmenting safety measures. Nevertheless, the exponential surge in surveillance cameras deployment has concurrently engendered a rapid increase in the magnitude of video analysis tasks and data volume. To address these challenges, we propose a comprehensive framework for collaborative video processing. Primarily, a collaborative content analysis approach is proposed, and which employs a Transformer-based ReID (Re-identification) algorithm to construct key stickers. These key stickers are optimized with cross-cameras correlations and serve as the foundational structure for subsequent online video compression. Subsequently, we propose a collaborative resource allocation approach, and which involves the formulation of a queue model designed for the orchestration of online camera analysis tasks. In addition, we have devised an enhanced deep reinforcement learning algorithm to fine-tune the task scheduling configuration of multiple cameras, with guidance from the queue model. Extensive experiments and simulations were conducted to evaluate the proposed framework. The results demonstrate its effectiveness in achieving accurate and real-time analysis of video data in smart transportation scenarios. © 2002-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Multi-Watermarking Algorithm for Medical Images Using Inception V3 and DCT

引用

computers, Materials & Continua 2023年第1期74卷 1279-1302页

作者： Yu Fan Jingbing Li Uzair Aslam Bhatti Chunyan Shao Cheng Gong Jieren Cheng Yenwei Chen School of Information and Communication Engineering Hainan UniversityHaikou570100China State Key Laboratory of Marine Resource Utilization in the South China Sea Hainan UniversityHaikou570100China School of Computer Science and Technology Hainan UniversityHaikou570100China Graduate School of Information Science and Engineering Ritsumeikan UniversityKyoto5258577Japan Hainan Blockchain Technology Engineering Research Center Hainan UniversityHaikou570100China TJ-YZ School of Network Science Haikou University of EconomicsHaikou571127China

Medical images are a critical component of the diagnostic process for *** the quality of medical photographs is essential to the accuracy of a physician’s diagnosis,they must be encrypted due to the characteristics of digital storage and information leakage associated with medical *** watermark embedding algorithm embeds the watermark information into the medical image,which reduces the quality of the medical image and affects the physicians’judgment of patient *** addition,watermarks in this method have weak robustness under high-intensity geometric attacks when the medical image is attacked and the watermarks are *** paper proposes a novel watermarking algorithm using the convolutional neural networks(CNN)Inception V3 and the discrete cosine transform(DCT)to address above mentioned ***,the medical image is input into the Inception V3 network,which has been structured by adjusting parameters,such as the size of the convolution kernels and the typical architecture of the convolution ***,the coefficients extracted from the fully connected layer of the network are transformed by DCT to obtain the feature vector of the medical *** last,the watermarks are encrypted using the logistic map system and hash function,and the keys are stored by a third *** encrypted watermarks and the original image features are performed logical operations to realize the embedding of *** the experimental section,multiple watermarking schemes using three different types of watermarks were implemented to verify the effectiveness of the three proposed *** NC values for all the images are more than 90%accurate which shows the robustness of the *** experimental results demonstrate the robustness under both conventional and high-intensity geometric attacks of the proposed algorithm.

关键词： Inception V3 multi-watermarking DCT watermark encryption robustness

来源：评论

学校读者我要写书评

暂无评论

Coverage Enhancement Strategy Based on Novel Perception and Co-Evolution for Multimedia Sensor networks

引用

Chinese Journal of Electronics 2023年第1期22卷 135-140页

作者： Fu Xiao Jing Wang Lijuan Sun Ruchuan Wang Jian Guo College of Computer Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing China

Coverage enhancement is one of the hot research topics in wireless multimedia sensor networks. A novel Coverage-enhancing algorithm based on three-dimensional Directional perception and co-evolution (DPCCA) is proposed in multimedia sensor networks on the basis of the model whose pitch angle and deviation angle can be adjusted. Based on the proposed elliptical cone sensing model, we can derive the coverage area of the node and calculate the optimal pitch angle according the information of monitoring area and the nodes, and then the deviation angle is optimized based on co-evolution algorithm, which eliminate the overlapped and blind sensing area effectively. A set of simulations demonstrate the effectiveness of our algorithm in coverage ratio.

关键词： Wireless communication Industries Solid modeling Wireless sensor networks Three-dimensional displays Medical services Sensors

来源：评论

学校读者我要写书评

暂无评论

Long and Recent Preference Learning with Recent-k Items Distribution for Recommender System

引用

IEEE Transactions on Multimedia 2025年

作者： Gao, Yongbiao Niu, Sijie Lv, Guohua Ling, Miaogen Geng, Xin Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China Southeast University Ministry of Education Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application China University of Jinan Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing School of Information Science and Engineering China Nanjing University of Information Science and Technology School of Computer Science China Southeast University School of Computer Science and Engineering China

Reinforcement learning (RL) aims to formulate the recommendation task as a Markov decision process (MDP) and trains an agent to automatically learn the optimal recommendation policy from interaction trajectories through trial-and-error and reward mechanisms. However, most existing RL-based approaches overlook the correlation between items and the dynamics of user interests implied in temporally close interactions. Therefore, in this paper, we propose a reinforcement learning method that incorporates a "recent-k items"distribution to capture users' local preferences. Specifically, we model the output layer as two distinct branches. The "recent-k items"branch, formulated with a Kullback-Leibler divergence loss, learns the recent interests of users, whereas the other branch utilizes a one-step temporal difference error to capture long-term preferences. The proposed structure is integrated into deep Q-learning and actor-critics, resulting in two enhanced methods named R k Q and R k AC, respectively. Furthermore, a novel soft inter-reward is carefully designed to enhance the proposed method, and we theoretically prove the convergence of the proposed algorithm. We perform extensive experiments on two large real-world datasets and conduct further analysis of the influences of different action sequences, time intervals, and enhancement capabilities for state-of-the-art models. The experimental results demonstrate the efficacy of our proposed methods. © 1999-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

network Traffic Prediction with Attention-based Spatial-Temporal Graph network

Network Traffic Prediction with Attention-based Spatial-Temp...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Yufei Peng Yingya Guo Run Hao Junda Lin Department of Computer and Data Science Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University

network traffic prediction plays a significant role in network management. Previous network traffic prediction methods mainly focus on the temporal relationship between network traffic, and used time series models to predict network traffic, ignoring the spatial information contained in traffic data. Therefore, the prediction accuracy is limited, especially in long-term prediction. To improve the prediction accuracy of the dynamic network traffic in the long term, we propose an Attention-based Spatial-Temporal Graph network (ASTGN) model for network traffic prediction to better capture both the temporal and spatial relations between the network traffic. Specifically, in ASTGN, we exploit an encoder-decoder architecture, where the encoder encodes the input network traffic and the decoder outputs the predicted network traffic sequences, integrating the temporal and spatial information of the network traffic data through the Spatio-Temporal Embedding module. The experimental results demonstrate the superiority of our proposed method ASTGN in long-term prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mirror contrastive loss based sliding window transformer for subject-independent motor imagery based EEG signal recognition

arXiv

引用

arXiv 2024年

作者： Luo, Jing Mao, Qi Shi, Weiwei Shi, Zhenghao Wang, Xiaofan Lu, Xiaofeng Hei, Xinhong Shaanxi Key Laboratory for Network Computing and Security Technology and Human–Machine Integration Intelligent Robot Shaanxi University Engineering Research Center School of Computer Science and Engineering Xi’an University of Technology Shaanxi Xi’an China

While deep learning models have been extensively utilized in motor imagery based EEG signal recognition, they often operate as black boxes. Motivated by neurological findings indicating that the mental imagery of left or right-hand movement induces event-related desynchronization (ERD) in the contralateral sensorimotor area of the brain, we propose a Mirror Contrastive Loss based Sliding Window Transformer (MCL-SWT) to enhance subject-independent motor imagery-based EEG signal recognition. Specifically, our proposed mirror contrastive loss enhances sensitivity to the spatial location of ERD by contrasting the original EEG signals with their mirror counterparts—mirror EEG signals generated by interchanging the channels of the left and right hemispheres of the EEG signals. Moreover, we introduce a temporal sliding window transformer that computes self-attention scores from high temporal resolution features, thereby improving model performance with manageable computational complexity. We evaluate the performance of MCL-SWT on subject-independent motor imagery EEG signal recognition tasks, and our experimental results demonstrate that MCL-SWT achieved accuracies of 66.48% and 75.62%, surpassing the state-of-the-art (SOTA) model by 2.82% and 2.17%, respectively. Furthermore, ablation experiments confirm the effectiveness of the proposed mirror contrastive loss. A code demo of MCL-SWT is available at https://***/roniusLuo/MCL_SWT. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Graph Contrastive Learning with Learnable Graph Augmentation

Graph Contrastive Learning with Learnable Graph Augmentation

引用

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

作者： Xinyan Pu Ke Zhang Huazhong Shu Jean Louis Coatrieux Youyong Kong Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China LTSI Universit de Rennes 1 Rennes France Centre de Recherche en Information BioMdicale Sino-Franais Rennes France

Graph contrastive learning has gained popularity due to its success in self-supervised graph representation learning. Augmented views in contrastive learning greatly determine the quality of the learned representations. Handcrafted data augmentations in previous work require tedious trial-and- errors per dataset, which is time-consuming and resource-intensive. Here, we propose a Graph Contrastive learning framework with Learnable graph Augmentation called GraphCLA. Specifically, learnable graph augmentation trains augmented views by minimizing the mutual information (MI) between the input graphs and their augmented graphs. This paper designs a kernel contrastive loss function based on an end-to-end differentiable graph kernel to learn augmented views. In addition, this paper utilizes a min-max optimization strategy to learn challenging augmented graphs and to learn discriminative representations adversarially. Finally, we compared GraphCLA with state-of-the-art self-supervised learning baselines and experimentally validate the effectiveness of GraphCLA.

关键词： Representation learning Self-supervised learning Signal processing Benchmark testing Acoustics Kernel Speech processing

来源：评论

学校读者我要写书评

暂无评论

Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation

引用

IEEE Internet of Things Journal 2025年

作者： Yan, Huan Zhang, Xiang Huang, Jinyang Feng, Yuanhao Li, Meng Wang, Anzhi Ou, Weihua Wang, Hongbing Liu, Zhi Guizhou Normal University School of Big Data and Computer Science Guiyang550025 China University of Science and Technology of China CAS Key Laboratory of Electromagnetic Space Information Hefei230026 China Hefei University of Technology School of Computer and Information Hefei230601 China The University of Electro-Communications Department of Computer and Network Engineering Tokyo1828585 Japan

WiFi Channel State information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors such as data privacy protection hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this paper, we propose Wi-SFDAGR, a WiFi-based Source-free Domain Adaptation Gesture Recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

information spreading in mobile social networks: Identifying the influential nodes using FPSO algorithm 10

Information spreading in mobile social networks: Identifying...

引用

10th International Conference on information Technology: IoT and Smart City, ICIT 2022

作者： Zhang, Xinxin Xu, Li Xu, Zhenyu Sun, Hung-Min Lee, Chia-Wei College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China The Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Computer Science and Information Engineering National Taitung University Taiwan

ISBN: (纸本)9781450397438

The most influential nodes are capable of generating maximum influence and widest information spread to their connected nodes in mobile social networks. Hence identifying high influential users plays an important role in monitoring network public opinion. However, influence maximization is an open and challenging issue, and existing works only focus on online social networks but fail to characterize the user social relations and social behavior. In this paper, firstly, we present a novel method based on location and preference relationships to calculate the social influence of users, and the initial nodes are identified by community partition. Secondly, according to the stochastic information spreading process in MSNs, we propose the Fluctuate Particle Swarm Optimization (FPSO)-algorithm to solve the problem of changing communication relationship between users at the optimization stage. Finally, we use extensive experiments on the real datasets to prove the effectiveness of the proposed FPSO-algorithm. The experimental evaluation shows that in the real networks, our proposal achieves better performance than other related methods. © 2022 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：