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

HIET:Hybrid Information Enhancement Transformer Network for Single-Photon Image Reconstruction

Journal of Beijing Institute of Technology 2025年第1期34卷 1-17页

作者： Yiming Liu Xuri Yao Tao Zhang Yifei Sun Ying Fu School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China Center for Quantum Technology Research and Key Laboratory of Advanced Optoelec-tronic Quantum Architecture and Measurements(MOE) School of PhysicsBeijing Institute of TechnologyBeijing 100081China School of Communication Engineering Hangzhou Dianzi UniversityHangzhou 310018China Uniview Technology Hangzhou 310056China

Single-photon sensors are novel devices with extremely high single-photon sensitivity and temporal ***,these advantages also make them highly susceptible to ***,single-photon cameras face severe quantization as low as 1 bit/*** factors make it a daunting task to recover high-quality scene information from noisy single-photon *** current image reconstruction methods for single-photon data are mathematical approaches,which limits information utilization and algorithm *** this work,we propose a hybrid information enhancement model which can significantly enhance the efficiency of information utilization by leveraging attention mechanisms from both spatial and channel ***,we introduce a structural feature enhance module for the FFN of the transformer,which explicitly improves the model's ability to extract and enhance high-frequency structural information through two symmetric convolution ***,we propose a single-photon data simulation pipeline based on RAW images to address the challenge of the lack of single-photon *** results show that the proposed method outperforms state-of-the-art methods in various noise levels and exhibits a more efficient capability for recovering high-frequency structures and extracting information.

关键词： single-photon images hybrid information enhancement structual feature enhancement data simulation pipeline

来源：评论

学校读者我要写书评

暂无评论

RGB-Based Category-Level Object Pose Estimation via Depth Recovery and Adaptive Refinement

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 5377-5384页

作者： Yang, Hui Sun, Wei Liu, Jian Zheng, Jin Zeng, Zhiwen Mian, Ajmal Hunan University National Engineering Research Center for Robot Visual Perception and Control Technology College of Electrical and Information Engineering Changsha410082 China Hunan University State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body Changsha410082 China Central South University School of Architecture and Art Changsha410082 China University of Western Australia Department of Computer Science and Software Engineering CrawleyWA6009 Australia

Category-level pose estimation methods have received widespread attention as they can be generalized to intra-class unseen objects. Although RGB-D-based category-level methods have made significant progress, reliance on depth image limits practical application. RGB-based methods offer a more practical and cost-effective solution. However, current RGB-based methods struggle with object geometry perception, leading to inaccurate pose estimation. We propose depth recovery and adaptive refinement for category-level object pose estimation from a single RGB image. We leverage DINOv2 to reconstruct the coarse scene-level depth from the input RGB image and propose an adaptive refinement network based on an encoder-decoder architecture to dynamically improve the predicted coarse depth and reduce its gap from the ground truth. We introduce a 2D–3D consistency loss to ensure correspondence between the point cloud obtained from depth projection and the objects in the 2D image. This consistency supervision enables the model to maintain alignment between the depth image and the point cloud. Finally, we extract features from the refined point cloud and feed them into two confidence-aware rotation regression branches and a translation and size prediction residual branch for end-to-end training. Decoupling the rotation matrix provides a more direct representation, which facilitates parameter optimization and gradient propagation. Extensive experiments on the REAL275 and CAMERA25 datasets demonstrate the superior performance of our method. Real-world estimation and robotic grasping experiments demonstrate our model robustness to occlusion, clutter environments, and low-textured objects. Our code and robotic grasping video are available at DA-Pose. © 2016 IEEE.

关键词： Depth perception

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile Computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

arXiv

引用

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A New Paradigm of User-Centric Wireless Communication Driven by Large Language Models

arXiv

引用

arXiv 2025年

作者： Ding, Kuiyuan Guo, Caili Yang, Yang Hu, Wuxia Eldar, Yonina C. Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Beijing Laboratory of Advanced Information Net works School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot7610001 Israel

The next generation of wireless communications seeks to deeply integrate artificial intelligence (AI) with user-centric communication networks, with the goal of developing AI-native networks that more accurately address user requirements. The rapid development of large language models (LLMs) offers significant potential in realizing these goals. However, existing efforts that leverage LLMs for wireless communication often overlook the considerable gap between human natural language and the intricacies of real-world communication systems, thus failing to fully exploit the capabilities of LLMs. To address this gap, we propose a novel LLM-driven paradigm for wireless communication that innovatively incorporates the nature language to structured query language (NL2SQL) tool. Specifically, in this paradigm, user personal requirements is the primary focus. Upon receiving a user request, LLMs first analyze the user intent in terms of relevant communication metrics and system parameters. Subsequently, a structured query language (SQL) statement is generated to retrieve the specific parameter values from a high-performance real-time database. We further utilize LLMs to formulate and solve an optimization problem based on the user request and the retrieved parameters. The solution to this optimization problem then drives adjustments in the communication system to fulfill the user’s requirements. To validate the feasibility of the proposed paradigm, we present a prototype system. In this prototype, we consider user-request centric semantic communication (URC-SC) system in which a dynamic semantic representation network at the physical layer adapts its encoding depth to meet user requirements, such as improved data transmission quality or reduced data transmission latency. Additionally, two LLMs are employed to analyze user requests and generate SQL statements, respectively. Simulation results demonstrate the effectiveness of the prototype in personalizing and addressing user r

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

THE APPLICATION OF MULTIPROCESSORS TO SCIENTIFIC PROBLEMS - THE POTENTIAL AND THE PITFALLS

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 1985年第1期32卷 187-194页

作者： MAPLES, C Advanced Computer Architecture Laboratory Lawrence Berkeley Laboratory University of California Berkeley CA USA

The objective of research on the MIDAS project is to demonstrate the viability of a multiprocessor approach to computing and to develop a general purpose, extensible architecture which can be used to address the growing computational requirements of the scientific community. To be successful in this endeavor, however, requires more than simply designing, or even constructing, new hardware structures. To achieve high performance on future systems will require software approaches which can exploit parallel architectures as fully as possible. A critical issue, therefore, is to understand the functional requirements of a large class of applications. The requirernents must be critically examined and, in many cases, new approaches to old algorithms investigated. For highly parallel systems to be effectively utilized, they must be flexible and adaptable to specific application requirements. In particular, they will probably need a variety of control and communication mechanisms to facilitate load balancing of a problem and to minimize bottlenecks in performance. The effective utilization of highly parallel architectures, however, raises many new questions. Traditional operating system structures must, for example, be re-examined. Fault-tolerant environments, with error recovery capability, become increasingly important as the number of components and processors increases. Language extensions to support parallel operations are obviously required, and ultimately new languages are needed to explicitly exploit parallel constructs. A new generation of development and debugging tools will be necessary in order to examine programn performance and operation in an asynchronous parallel environment.

关键词： Parallel architectures computer architecture Hardware Software performance Software systems Application software Communication system control Load management Operating systems Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

MAXIMUM RATE SINGLE-PHASE CLOCKING OF A CLOSED PIPELINE INCLUDING WAVE PIPELINING, STOPPABILITY, AND STARTABILITY

引用

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1995年第12期14卷 1526-1545页

作者： CHANG, CH DAVIDSON, ES SAKALLAH, KA Department of Electrical Engineering and Computer Science Advanced Computer Architecture Laboratory University of Michigan Ann Arbor MI USA

Aggressive design using level-sensitive latches and wave pipelining has been proposed to meet the increasing need for higher performance digital systems. The optimal clocking problem for such designs has been formulated using an accurate timing model, However, this problem has been difficult to solve because of its nonconvex solution space, The best algorithms to date employ linear programs to solve an overconstrained case that has a convex solution space, yielding suboptimal solutions to the general problem, A new efficient (cubic complexity) algorithm, Gpipe, exploits the geometric characteristics of the fun nonconvex solution space to determine the maximum single-phase clocking rate for a closed pipeline with a specified degree of wave pipelining. Introducing or increasing wave pipelining by permanently enabling some latches is also investigated, Sufficient conditions have been found to identify which latches can be removed in this fashion so as to guarantee no decrease and permit a possible increase in the clock rate. Although increasing the degree of wave pipelining can result in faster clocking, wave pipelining is often avoided in design due to difficulties in stopping and restarting the pipeline under stall conditions without losing data or in reduced rate testing of the circuit. To solve this problem, which has not previously been addressed, we present conditions and implementation methods that insure the stoppability and restartability of a wave pipeline.

关键词： Pipeline processing Clocks Latches Timing Digital systems Circuit testing Synchronization Propagation delay Linear programming Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

SYNCHRONIZATION OF PIPELINES

引用

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1993年第8期12卷 1132-1146页

作者： SAKALLAH, KA MUDGE, TN BURKS, TM DAVIDSON, ES Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

In this paper we apply a recently formulated general timing model of synchronous operation to the special case of latch-controlled pipelined circuits. The model accounts for multiphase synchronous clocking, correctly captures the behavior of level-sensitive latches, handles both short- and long-path delays, accommodates wave pipelining, and leads to a comprehensive set of timing constraints. Pipeline circuits are important because of their frequent use in computer systems. We define their concurrency as a function of the clock schedule and degree of wave pipelining. We then identify a special class of clock schedules, coincident multiphase clocks, which provide a lower bound on the value of the optimum cycle time. We show that the region of feasible solutions for single-phase clocking can be nonconvex or even disjoint, and derive a closed-form expression for the minimum cycle time of a restricted but practical form of single-phase clocking. We compare these forms of clocking on three pipeline examples and highlight some of the issues in pipeline synchronization.

关键词： Clocks Pipeline processing Synchronization Circuits Latches Timing Concurrent computing Propagation delay Processor scheduling Space vector pulse width modulation

来源：评论

学校读者我要写书评

暂无评论

LAYOUT OPTIMIZATION OF STATIC CMOS FUNCTIONAL-CELLS

引用

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1990年第7期9卷 708-719页

作者： MAZIASZ, RL HAYES, JP Advanced Computer Architecture Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A general theory for designing minimum-area layouts of static series-parallel CMOS functional cells (also called complex gates) in a standard cell layout style is presented. T. Uehara and W.M. vanCleemput. (1981) originally formulated this as the graph optimization problem of finding the minimum number of dual trails that cover a multigraph model of M of a cell. The present theory provides a formalism for the analysis of series-parallel graphs and identifies the mathematical structures that underlie the layout problem. It also leads to two efficient algorithms for designing minimum area functional cell layouts. The first algorithm, TrailTrace, accepts an ordering of M that is fixed, typically for performance reasons, and produces the minimum area layout for that ordering. Its time complexity is linear in the number of transistors in the cell. The second algorithm, R-TrailTrace, reorders M and produces the best layout area that can be achieved for any reordering that preserves the cell's functionality.< >

关键词： Semiconductor device modeling Design methodology computer architecture Laboratories Logic circuits Propagation delay Contacts CMOS technology Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：