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

Multi-Scale Semantic Communication for Object Detection: Single and Cross-Domain Scenarios

IEEE Transactions on Wireless Communications 2025年

作者： Guo, Jie Yin, Hang Song, Bin Chi, Yuhao Zhang, Zhaoyang Yuen, Chau Niyato, Dusit Xidian University State Key Laboratory of Integrated Services Networks Xi’an710071 China Zhejiang University College of Information Science and Electronic Engineering Hangzhou310007 China School of Electrical and Electronics Engineering Nanyang Technological University 639798 Singapore Nanyang Technological University College of Computing and Data Science 639798 Singapore

With the rapid popularity of vision-driven communication applications, object detection has become one of the fundamental techniques for performing practical vision tasks. In traditional communication systems, images are compressed for transmission, reconstructed at the receiver, and then processed by existing object detection algorithms. However, transmitting large amounts of images consumes significant storage and communication resources. To address this challenge, a semantic communication-based image reconstruction scheme has been proposed for object detection, which transmits only the semantic information relevant to image reconstruction. However, this method is prone to losing key information, such as object position and texture details, leading to degraded object detection performance. Additionally, it is sensitive to environmental factors such as weather and lighting, resulting in poor adaptability across multiple scenarios. To address these issues, we propose a multiscale semantic communication framework for object detection that transmits only multi-scale semantic features relevant to the task and employs decoupling at the receiver to separate positional and classification information of target objects without requiring image reconstruction. To improve adaptability across multiple scenarios, we introduce a cross-domain object detection technique that ensures reliable object detection in new scenarios by optimizing the framework’s multi-scale semantic encoder through domain adversarial learning. Numerical results demonstrate that the proposed framework achieves mean average precision improvements of 15.4% ~ 38.5% over the traditional communication framework within low to medium signal-to-noise ratio regions in additive white Gaussian noise and Rayleigh fading channels. © 2002-2012 IEEE.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

Optimal Flying Location for Unmanned Aerial Vehicle Equipped with MF-RIS assisted Covert Wireless on Communication

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Jie Li, Yunxiang Tian, Wen Dai, Yuewei Liu, Yinqiu Niyato, Dusit Nanjing University of Posts and Telecommunications School of Communications and Information Engineering Nanjing China Nanjing University of Information Science and Technology School of Electronic and Information Engineering Key Laboratory of Intelligent Support Technology In Complex Environment Ministry of Education Nanjing210044 China Nanyang Technological University College of Computing and Data Science Singapore

In the current information age, covert communication holds significant value owing to its advantages, such as heightened security, enhanced flexibility, and improved concealment, surpassing those of traditional communication methods. However, existing covert communication approaches approximate communication channel models by Line-of-Sight (LoS) links, which is insufficient due to neglecting the impact of multipath effects and applying inaccurate performance assessments. To better adapt to real-world communication channel conditions, we propose a novel covert communication model assisted by Unmanned Aerial Vehicles (UAV) equipped with Multi-Functional Reconfigurable Intelligent Surface (MF-RIS), named UMCCM. Specifically, based on a mixed link of LoS and Non-Line-of-Sight (NLoS), UMCCM leverages MF-RIS as a flexible relay to enhance the signal-to-noise ratio (SNR) and effective throughput. We first derive the mixed channel model expression. Then, we transform covert constraints from incomplete gamma functions to those linked with relative entropy and accordingly optimize the UAV transmission power and block length. Finally, the optimal flying position of the UAV is obtained by analyzing the functional properties of SNR and effective throughput under these refined constraints. Extensive numerical results demonstrate the superiority of our proposed UMCCM for enhancing SNR and effective throughput over the existing works. © 2025 IEEE.

关键词： Aircraft communication

来源：评论

学校读者我要写书评

暂无评论

Towards Depth-continuous Scene Representation with Displacement Field for Robust Light Field Depth Estimation

引用

IEEE Transactions on Multimedia 2025年

作者： Chen, Rongshan Sheng, Hao Yang, Da Cong, Ruixuan Cui, Zhenglong Wang, Sizhe Wang, Tun Zhao, Mingyuan Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Key Laboratory of Data Science and Intelligent Computing International Innovation Institute 166 Shuanghongqiao Street Pingyao Town Yuhang District Hangzhou31 1115 China Macao Polytechnic University Faculty of Applied Sciences Macao999078 China

The light field (LF) captures both the spatial and angular information of scenes, enabling accurate depth estimation. However, previous deep learning methods typically model surface depth only while ignoring the continuous nature of depth in 3D scenes. In this paper, we use the displacement field (DF) to describe this continuous property, and propose a novel depth-continuous scene representation for robust LF depth estimation. Experiments demonstrate that our representation enables the network to generate highly detailed depth maps with fewer parameters and faster speeds. Specifically, inspired by the signed distance field in 3D object descriptions, we aim to exploit the intrinsic depth-continuous property of 3D scenes via DF and define a novel depth-continuous scene representation. Then, we introduce a simple, yet general, learning framework for depth-continuous scene embedding, and the proposed network, DepthDF, achieves state-of-the-art performance on both synthetic and real-world LF datasets, ranking 1st on the HCI 4D light field benchmark. Furthermore, previous LF depth estimation methods can also be seamlessly integrated into this framework. Finally, we extend this framework beyond LF depth estimation to various tasks, including multiview stereo depth inference, LF superresolution, and LF salient object detection. Our experiments demonstrate an improved performance when continuous scene representation is applied, suggesting that our framework can potentially provide insights for more fields. © 1999-2012 IEEE.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

Channel and space-based joint rate allocation algorithm

Channel and space-based joint rate allocation algorithm

引用

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

作者： Dayong Wang Chao Yuan Yu Sun Xin Lu Hui Guo Frederic Dufaux Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications China Department of Computer Science University of Central Arkansas Faculty of Computing Engineering and Media (CEM) De Montfort University UK Université Paris-Saclay CNRS CentraleSupélec Laboratoire Des Signaux et Systèmes France School of Information and Communication Engineering University of Electronic Science and Technology of China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Rate control is a critical component for image and video compression Particularly under limited network bandwidth conditions, bitrate control is essential to ensure efficient image transmission by effectively allocation channel resources. In this research, since both Channel and Spatial have relationship with rate allocation, we first propose a joint Channel-wise and Spatial-wise Quantization scheme to determine optimal quantization parameters. Subsequently, we develop a quantization step estimation network to obtain parameters to efficiently allocate rate according to target rate. Experiments demonstrate that our algorithm significantly improve compressed image quality with minimal bitrate distortion and achieve accurate rate control with nearly 3% average bitrate error.

关键词： Image quality Quantization (signal) Image coding Bit rate Signal processing algorithms Estimation Rate-distortion Video compression Resource management Speech processing

来源：评论

学校读者我要写书评

暂无评论

Should Audio Front-ends be Adaptive? Comparing Learnable and Adaptive Front-ends

arXiv

引用

arXiv 2025年

作者： Zhang, Qiquan Wickramasinghe, Buddhi Ambikairajah, Eliathamby Sethu, Vidhyasaharan Li, Haizhou School of Electrical Engineering and Telecommunications The University of New South Wales Sydney2052 Australia School of Electrical and Computer Engineering Purdue University West LafayetteIN United States Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen51872 China

Hand-crafted features, such as Mel-filterbanks, have traditionally been the choice for many audio processing applications. Recently, there has been a growing interest in learnable front-ends that extract representations directly from the raw audio waveform. However, both hand-crafted filterbanks and current learnable front-ends lead to fixed computation graphs at inference time, failing to dynamically adapt to varying acoustic environments, a key feature of human auditory systems. To this end, we explore the question of whether audio front-ends should be adaptive by comparing the Ada-FE front-end (a recently developed adaptive front-end that employs a neural adaptive feedback controller to dynamically adjust the Q-factors of its spectral decomposition filters) to established learnable front-ends. Specifically, we systematically investigate learnable front-ends and Ada-FE across two commonly used back-end backbones and a wide range of audio benchmarks including speech, sound event, and music. The comprehensive results show that our Ada-FE outperforms advanced learnable front-ends, and more importantly, it exhibits impressive stability or robustness on test samples over various training epochs. Copyright © 2025, The Authors. All rights reserved.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

GAEM: Graph-driven Attention-based Entropy Model for LiDAR Point Cloud Compression

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Cui, Mingyue Zhong, Yuyang Feng, Mingjian Long, Junhua Ling, Yehua Xu, Jiahao Huang, Kai Sun Yat-sen University School of Computer Science and Engineering Guangzhou400100 China Sun Yat-sen University key Laboratory of Machine Intelligence and Advanced Computing Guangzhou400100 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Guangxi Transportation Science and Technology Group Co. Ltd Nanning530029 China

High-quality LiDAR point cloud (LPC) coding is essential for efficiently transmitting and storing the vast amounts of data required for accurate 3D environmental representation. The Octree-based entropy coding framework has emerged as the predominant method, however, previous study usually overly relies on large-scale attention-based context prediction to encode Octree nodes, overlooking the inherent correlational properties of this structure. In this paper, we propose a novel Graph-driven Attention-based Entropy Model (GAEM), which adopts partitioned graph attention mechanisms to uncover contextual dependencies among neighboring nodes. Different from the Cartesian coordinate-based coding mode with higher redundancy, GAEM uses the multi-level spherical Octree to organize point clouds, improving the quality of LPC reconstruction. GAEM combines graph convolution for node feature embedding and grouped-graph attention for exploiting dependency among contexts, which preserves performance in low-computation using localized nodes. Besides, to further increase the receptive field, we design a high-resolution cross-attention module introducing sibling nodes. Experimental results show that our method achieves state-of-the-art performance on the LiDAR benchmark SemanticKITTI and MPEG-specified dataset Ford, compared to all baselines. Compared to the benchmark GPCC, our method achieves gains of up to 53.9% and 53.6% on SemanticKITTI and Ford while compared to the sibling-introduced methods, we achieve up to 42.3% and 44.7% savings in encoding/decoding time. In particular, our GAEM allows for extension to downstream tasks (i.e., vehicle detection and semantic segmentation), further demonstrating the practicality of the method. (Figure presented) © 1991-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Efficient Resource Allocation in computing Power Networks Considering Similar Task Merging: A Lyapunov Optimization-Based DRL Approach

引用

IEEE Internet of Things Journal 2025年

作者： Jia, Zhonghai Xue, Junxiao Shi, Lei Li, Jie He, Mengyang Zhejiang Lab Research Center for Space Computing System Hangzhou310000 China Zhengzhou University School of Cyber Science and Engineering Zhengzhou450002 China SongShan Laboratory Zhengzhou450040 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China Shanghai Key Laboratory of Trusted Data Circulation and Governance Web3 Shanghai China

The cloud-edge-terminal architecture relies on hierarchy for resource allocation but lacks global optimization. The computing power network (CPN) introduces a new distributed computing paradigm, integrating cross-domain, heterogeneous resources for global scheduling. However, most CPN research focuses on task optimization during resource allocation, while neglecting the similarity of random tasks before the allocation stage. Additionally, fragmented CPN resources and complex task demands pose challenges to global load balancing. This paper proposes a deep reinforcement learning framework with task merging and congestion avoidance for on-demand resource allocation. Specifically, a low-complexity similar task merging algorithm reduces redundant resource consumption during task preprocessing. In task offloading, the principal neighborhood aggregated graph neural network captures CPN's intricate features. Lyapunov optimization, integrated into a multi-threaded training framework, minimizes resource backlog congestion. A carefully designed reward function balances multiple objectives, enhancing computing resource utilization efficiency and ensuring system stability. Theoretical analysis shows that with control parameter V, the trade-off between resource utilization efficiency and system stability follows the relationship O(1/V), O(V). Extensive experiments demonstrate a 33.5% improvement in resource utilization efficiency and a 62.7% increase in task offloading success rates with respect to those in state-of-the-art algorithms. The proposed algorithm exhibits robustness and effectiveness, particularly in high-load and real network topologies. © 2014 IEEE.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

CMCache: An Adaptive Cross-Level data Placement Method for Multi-Level Cache

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Zeng, Zhaoyang Tan, Yujuan Ma, Zhulin Li, Jiali Zhao, Sanle Liu, Duo Chen, Xianzhang Ren, Ao Chongqing University College of Computer Science Chongqing400044 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing400044 China Chongqing Universityof Posts and Telecommunications College of Software Engineering China Chongqing University College of Big Data and Software Engineering Chongqing China

Multi-level cache systems enhance I/O performance by optimizing data placement across various cache levels from a global perspective. However, existing methods often struggle to place data at the optimal cache level promptly due to their reliance on historical access patterns and inflexible placement strategies. These methods face two main challenges: (1) For already cached data with sufficient access history, existing approaches only optimize movement between adjacent cache levels, potentially delaying data arrival at its globally optimal cache level and leading to unnecessary bandwidth consumption and increased latency. (2) For newly entered data without access history, current methods cannot accurately predict their future hotness and simply place them at a fixed cache level (i.e. first or last level), overlooking future accesses of new data and potentially resulting in high cache miss rates or cache pollution. To address these issues, we propose CMCache, an adaptive cross-level data placement method for multi-level cache. CMCache applies distinct placement strategies for cached and new data to reach the optimal level timely, considering their different characteristics. It also logically divides cache space into two sections to manage cached and new data separately, dynamically adjusting section sizes based on access patterns. This approach significantly improves data placement efficiency, achieving up to an 89% reduction in miss rates and a 79% decrease in average response times compared to existing methods. © 2025 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

StabStitch++: Unsupervised Online Video Stitching with Spatiotemporal Bidirectional Warps

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Nie, Lang Lin, Chunyu Liao, Kang Zhang, Yun Liu, Shuaicheng Zhao, Yao Beijing Jiaotong University Institute of Information Science Beijing100044 China Visual Intelligence +X International Cooperation Joint Laboratory of MOE Beijing100044 China Nanyang Technological University School of Computing and Data Science Singapore Communication University of Zhejiang School of Media Engineering Hangzhou310018 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China

We retarget video stitching to an emerging issue, named warping shake, which unveils the temporal content shakes induced by sequentially unsmooth warps when extending image stitching to video stitching. Even if the input videos are stable, the stitched video can inevitably cause undesired warping shakes and affect the visual experience. To address this issue, we propose StabStitch++, a novel video stitching framework to realize spatial stitching and temporal stabilization with unsupervised learning simultaneously. First, different from existing learning-based image stitching solutions that typically warp one image to align with another, we suppose a virtual midplane between original image planes and project them onto it. Concretely, we design a differentiable bidirectional decomposition module to disentangle the homography transformation and incorporate it into our spatial warp, evenly spreading alignment burdens and projective distortions across two views. Then, inspired by camera paths in video stabilization, we derive the mathematical expression of stitching trajectories in video stitching by elaborately integrating spatial and temporal warps. Finally, a warp smoothing model is presented to produce stable stitched videos with a hybrid loss to simultaneously encourage content alignment, trajectory smoothness, and online collaboration. Compared with StabStitch that sacrifices alignment for stabilization, StabStitch++ makes no compromise and optimizes both of them simultaneously, especially in the online mode. To establish an evaluation benchmark and train the learning framework, we build a video stitching dataset with a rich diversity in camera motions and scenes. Experiments exhibit that StabStitch++ surpasses current solutions in stitching performance, robustness, and efficiency, offering compelling advancements in this field by building a real-time online video stitching system. © 1979-2012 IEEE.

关键词： Stabilization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：