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

A Parallel-based Lifting Algorithm and VLSI Architecture for DWT

Journal of Electronics(China) 2006年第2期23卷 244-248页

作者： Xiong Chengyi Tian Jinwen Liu Jian Gao Zhirong The State Key Lab of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition ＆ Artificial Intelligence Huazhong Univ. of Science ＆ Tech. Wuhan 430074 China College of Electronic Info. Eng. South- Center Univ. for Nationalities Wuhan 430074 China Dept of Computer Science Wuhan Univ. of Science ＆ Eng. Wuhan 430074 China

A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration （VLSI） architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation （CLABI）, the critical path latency of the proposed architecture is reduced by more than half from （4Tm ＋ 8Ta）to Tm ＋ 4Ta, and is competitive to that of Convolution-Based Implementation （CBI）, but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.

关键词： Discrete Wavelet Transform （DFT） Lifting scheme Parallel Very Large Scale Integration（VLSI）

来源：评论

学校读者我要写书评

暂无评论

Distributed Observer Design over Directed Switching Topologies

arXiv

引用

arXiv 2024年

作者： Xu, Haotian Liu, Shuai Wang, Bohui Wang, Jingcheng School of Control Science and Engineering Shandong University Jinan250061 China The School of Aerospace Science and Technology Xidian University Xi’an710071 China Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China

The distributed observer design problem holds significant importance in cases in which the output information of a system is decentralized across different subsystems. Each subsystem has a local observer and access to one part of the measurement outputs and information exchanged through communication networks. This paper focuses on the design of distributed observer with jointly connected directed switching networks. The problem presents challenges due to passive switching modes and the open-loop unboundedness that results from local observability. To overcome these challenges, we develop a network transformation mapping method whereby each local observer can classify itself into an independent subgraph based on independent judgment. Next, an observable decomposition and reorganization method is developed for the digraph case to ensure that each subgraph possesses independent dynamic properties. Asymptotic omniscience is then proven using a developed recursive proof method. This paper includes many previous results as special cases, because most are only suitable for undirected switching topologies or fast-switching cases. An adaptive coupling gain design is proposed to simplify the calculation and verification of conditions that guarantee asymptotic omniscience. Finally, simulation results with the power system show the validity of the developed theory. © 2024, CC BY.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

On Enlarging the Domain of Attraction for Linear Systems Subject to Asymmetric Actuator Saturation

On Enlarging the Domain of Attraction for Linear Systems Sub...

引用

IEEE Conference on Decision and control

作者： Wenxin Lai Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA U.S.A.

In this paper, we revisit the problem of enlarging the domain of attraction for linear systems with asymmetric actuator saturation. We partition the state space into several regions according to the sign of each input and rewrite the linear system subject to asymmetric actuator saturation as an equivalent switched system, each subsystem of which is associated with one partition of the state space and is a linear system subject to symmetric actuator saturation. Based on this equivalent representation of the system, we present a Lyapunov function, which is composed of a set of quadratic functions associated with matrices that are not required to be positive definite. We establish sufficient conditions for regional stability and, based on them, formulate optimization problems to enlarge the estimate of the domain of attraction. Simulation results illustrate the effectiveness of the proposed approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lag Synchronization of Switched Neural Networks via Neural Activation Function and Applications in image Encryption

引用

IEEE Transactions on Neural Networks and Learning Systems 2015年第7期26卷 1493-502页

作者： Wen, Shiping Zeng, Zhigang Huang, Tingwen Meng, Qinggang Yao, Wei School of Automation Huazhong University of Science and Technology China and the Key Laboratory of Image Processing and Intelligent Control Wuhan 430074 China Texas A and M University at Qatar Doha 23874 Qatar Department of Computer Science Loughborough University Loughborough LE11 3TU United Kingdom School of Computer Science South-Central University for Nationalities Wuhan 430074 China

This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The controller is dependent on the output of the system in the case of packed circuits, since it is hard to measure the inner state of the circuits. Thus, it is critical to design the controller based on the neuron activation function. Comparing the results, in this paper, with the existing ones shows that we improve and generalize the results derived in the previous literature. Several examples are also given to illustrate the effectiveness and potential applications in image encryption.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Picture array generation using flat splicing operation

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3568-3577页

作者： Pan, Linqiang Nagar, Atulya K. Subramanian, K.G. Song, Bosheng School of Electric and Information Engineering Zhengzhou University of Light Industry Zhengzhou Henan450002 China Department of Mathematics and Computer Science Faculty of Science Liverpool Hope University LiverpoolL16 9JD United Kingdom Key Laboratory of Image Information Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan Hubei430074 China

The operation of splicing on words was introduced by Tom Head while proposing a theoretical model of DNA recombination. Subsequent investigations on splicing on linear and circular strings of symbols have resulted in a number of theoretical properties. A different kind of splicing on two words, referred to as flat splicing, has been considered recently. This operation is extended to flat splicing on picture arrays, thus defining a new model of generation of digitized pictures, which is called as array flat splicing system (AFS). Results on the generative power of AFS in comparison with certain well-known picture array defining models and certain non-closure results are obtained. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Nanoscience

来源：评论

学校读者我要写书评

暂无评论

Sensor-based Multi-agent Coverage control with Spatial Separation in Unstructured Environments

arXiv

引用

arXiv 2024年

作者： Wang, Xinyi Xu, Jiwen Gao, Chuanxiang Chen, Yizhou Zhang, Jihan Wang, Chenggang Ding, Yulong Chen, Ben M. Department of Mechanical and Automation Engineering The Chinese University of Hong Kong N.T. Shatin Hong Kong Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University Shanghai200240 China Department of Control Science and Engineering Tongji University Shanghai China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education China

Multi-robot systems have increasingly become instrumental in tackling coverage problems. However, the challenge of optimizing task efficiency without compromising task success still persists, particularly in expansive, unstructured scenarios with dense obstacles. This paper presents an innovative, decentralized Voronoi-based coverage control approach to reactively navigate these complexities while guaranteeing safety. This approach leverages the active sensing capabilities of multi-robot systems to supplement GIS (Geographic Information System), offering a more comprehensive and real-time understanding of environments like post-disaster. Based on point cloud data, which is inherently non-convex and unstructured, this method efficiently generates collision-free Voronoi regions using only local sensing information through spatial decomposition and spherical mirroring techniques. Then, deadlock-aware guided map integrated with a gradient-optimized, centroid Voronoi-based coverage control policy, is constructed to improve efficiency by avoiding exhaustive searches and local sensing pitfalls. The effectiveness of our algorithm has been validated through extensive numerical simulations in high-fidelity environments, demonstrating significant improvements in task success rate, coverage ratio, and task execution time compared with others. Copyright © 2024, The Authors. All rights reserved.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Edge-Aware Graph Attention Network for Ratio of Edge-User Estimation in Mobile Networks

Edge-Aware Graph Attention Network for Ratio of Edge-User Es...

引用

International Conference on Pattern Recognition

作者： Jiehui Deng Sheng Wan Xiang Wang Enmei Tu Xiaolin Huang Jie Yang Chen Gong PCA Lab the Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Hong Kong Polytechnic University Hong Kong SAR China

Estimating the Ratio of Edge-Users (REU) is an important issue in mobile networks, as it helps the subsequent adjustment of loads in different cells. However, existing approaches usually determine the REU manually, which are experience-dependent and labor-intensive, and thus the estimated REU might be imprecise. Considering the inherited graph structure of mobile networks, in this paper, we utilize a graph-based deep learning method for automatic REU estimation, where the practical cells are deemed as nodes and the load switchings among them constitute edges. Concretely, Graph Attention Network (GAT) is employed as the backbone of our method due to its impressive generalizability in dealing with networked data. Nevertheless, conventional GAT cannot make full use of the information in mobile networks, since it only incorporates node features to infer the pairwise importance and conduct graph convolutions, while the edge features that are actually critical in our problem are disregarded. To accommodate this issue, we propose an Edge-Aware Graph Attention Network (EAGAT), which is able to fuse the node features and edge features for REU estimation. Extensive experimental results on two real-world mobile network datasets demonstrate the superiority of our EAGAT approach to several state-of-the-art methods.

关键词： Deep learning Fuses Estimation Switches Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Topology-Aware 3D Gaussian Splatting: Leveraging Persistent Homology for Optimized Structural Integrity

arXiv

引用

arXiv 2024年

作者： Shen, Tianqi Liu, Shaohua Feng, Jiaqi Ma, Ziye An, Ning Department of Computer Science City University of Hong Kong Hong Kong Image Processing Center Beihang University China Shen Yuan Honors College Beihang University China Research Institute of Mine Artificial Intelligence China Coal Research Institute China State Key Laboratory of Intelligent Coal Mining and Strata Control China

Gaussian Splatting (GS) has emerged as a crucial technique for representing discrete volumetric radiance fields. It leverages unique parametrization to mitigate computational demands in scene optimization. This work introduces Topology-Aware 3D Gaussian Splatting (Topology-GS), which addresses two key limitations in current approaches: compromised pixel-level structural integrity due to incomplete initial geometric coverage, and inadequate feature-level integrity from insufficient topological constraints during optimization. To overcome these limitations, Topology-GS incorporates a novel interpolation strategy, Local Persistent Voronoi Interpolation (LPVI), and a topology-focused regularization term based on persistent barcodes, named PersLoss. LPVI utilizes persistent homology to guide adaptive interpolation, enhancing point coverage in low-curvature areas while preserving topological structure. PersLoss aligns the visual perceptual similarity of rendered images with ground truth by constraining distances between their topological features. Comprehensive experiments on three novel-view synthesis benchmarks demonstrate that Topology-GS outperforms existing methods in terms of PSNR, SSIM, and LPIPS metrics, while maintaining efficient memory usage. This study pioneers the integration of topology with 3D-GS, laying the groundwork for future research in this area. Copyright © 2024, The Authors. All rights reserved.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

An Improved Result on Stabilization of Switched Linear Systems with Time-varying Delay ⁎

引用

IFAC-PapersOnLine 2021年第18期54卷 96-101页

作者： Tan Hou Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai 200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China and Shanghai Engineering Research Center of Intelligent Control and Management Shanghai 200240 China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia P.O. Box 400743 Charlottesville VA 22904-4743 U.S.A.

This paper revisits the stabilization problem of switched linear systems with time-varying delay via state dependent switching strategies. In contrast to the existing works, the commonly adopted stable convex combination assumption is relaxed in this paper. For switched systems satisfying the relaxed assumption, we design a state dependent switching strategy, under which the considered system is asymptotically stable at the origin in the presence of time-varying delay. An optimization problem is formulated to estimate the upper bound of tolerable time delay. Numerical examples are presented to show that our method is applicable to a larger class of switched systems and leads to greater delay bound.

关键词： Asymptotic stability delay bound state dependent switching switched system time-varying delay

来源：评论

学校读者我要写书评

暂无评论

ESNet: evolution and succession network for high-resolution salient object detection 24

ESNet: evolution and succession network for high-resolution ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Hongyu Liu Runmin Cong Hua Li Qianqian Xu Qingming Huang Wei Zhang Institute of Information Science Beijing Jiaotong University & Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China School of Control Science and Engineering Shandong University & Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Computer Science and Technology Hainan University Hainan China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

Preserving details and avoiding high computational costs are the two main challenges for the High-Resolution Salient Object Detection (HRSOD) task. In this paper, we propose a two-stage HRSOD model from the perspective of evolution and succession, including an evolution stage with Low-resolution Location Model (LrLM) and a succession stage with High-resolution Refinement Model (HrRM). The evolution stage achieves detail-preserving salient objects localization on the low-resolution image through the evolution mechanisms on supervision and feature; the succession stage utilizes the shallow high-resolution features to complement and enhance the features inherited from the first stage in a lightweight manner and generate the final high-resolution saliency prediction. Besides, a new metric named Boundary-Detail-aware Mean Absolute Error (MAEBD) is designed to evaluate the ability to detect details in high-resolution scenes. Extensive experiments on five datasets demonstrate that our network achieves superior performance at real-time speed (49 FPS) compared to state-of-the-art methods. Our code is publicly available at: https://***/rmcong/ESNet_ICML24.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：