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

Optimizing Binary Sequence Excitation Signals for Rapid Impedance Spectrum Measurement in Proton Exchange Membrane Fuel Cells

学校读者我要写书评

暂无评论

Optimizing Binary Sequence Excitation Signals for Rapid Impe...

第43届中国控制会议

作者： Jingzhi Lei Chuang Sheng Jingjing Wang Liansong Yu Xi Li School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education MinistryHuazhong University of Science and Technology State Grid Electric Power Research Institute Wuhan Nanrui Limited Liability Company Shenzhen Huazhong University of Science and Technology Research Institute

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

With the increasing demand for efficient and reliable renewable energy sources,Proton Exchange Membrane Fuel Cells(PEMFCs) have emerged as a promising *** experiments demonstrate that Electrochemical Impedance Spectroscopy(EIS) effectively differentiates various states of *** broadband signals as testing excitations significantly reduces EIS measurement time,facilitating real-time monitoring of PEMFCs' health under dynamic *** signal design requires maintaining adequate amplitude across frequency components for noise resistance while minimizing signal peak value to reduce operational *** paper introduces an EIS simulation environment,leveraging PEMFCs' impedance and electrochemical noise *** focuses on optimizing the excitation signal's amplitude-frequency distribution using discrete interval binary *** results indicate that our method achieves minimal perturbation amplitude while preserving measurement accuracy in amplitude-frequency signal design.

关键词： Proton exchange membrane fuel cell Electrochemical impedance spectroscopy Electrochemical noise Excitation signal optimization

PG-SLAM: Photo-realistic and Geometry-aware RGB-D SLAM in Dynamic Environments

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Haoang Meng, Xiangqi Zuo, Xingxing Liu, Zhe Wang, Hesheng Cremers, Daniel Guangzhou China School of Computation Information and Technology Technical University of Munich Munich Germany MoE Key Lab of Artificial Intelligence Shanghai Jiao Tong University Shanghai China Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai Jiao Tong University Shanghai China

Simultaneous localization and mapping (SLAM) has achieved impressive performance in static environments. However, SLAM in dynamic environments remains an open question. Many methods directly filter out dynamic objects, resulting in incomplete scene reconstruction and limited accuracy of camera localization. The other works express dynamic objects by point clouds, sparse joints, or coarse meshes, which fails to provide a photo-realistic representation. To overcome the above limitations, we propose a photo-realistic and geometry-aware RGB-D SLAM method by extending Gaussian splatting. Our method is composed of three main modules to 1) map the dynamic foreground including non-rigid humans and rigid items, 2) reconstruct the static background, and 3) localize the camera. To map the foreground, we focus on modeling the deformations and/or motions. We consider the shape priors of humans and exploit geometric and appearance constraints of humans and items. For background mapping, we design an optimization strategy between neighboring local maps by integrating appearance constraint into geometric alignment. As to camera localization, we leverage both static background and dynamic foreground to increase the observations for noise compensation. We explore the geometric and appearance constraints by associating 3D Gaussians with 2D optical flows and pixel patches. Experiments on various real-world datasets demonstrate that our method outperforms state-of-the-art approaches in terms of camera localization and scene representation. Source codes will be publicly available upon paper acceptance. Copyright © 2024, The Authors. All rights reserved.

关键词： Geometry

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Pertur...

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jiang, Hanjing Wang, Meineng Zhang, Luping Huang, Yu-An Li, Yangyuan Huang, Yabing Huazhong University of Science and Technology Key Laboratory of Image Information Processing and Intelligent Control Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Hubei Wuhan430074 China China University of Mining and Technology School of Computer Science and Technology Xuzhou221116 China Yichun University School of Mathematics and Computer Science Yichun336000 China East China University of Technology School of Information Engineering Nanchang330013 China Northwestern Polytechnical University School of Computer Science Xi'an710129 China Renmin Hospital Wuhan University Department of Pathology Wuhan430060 China

ISBN: (纸本)9798350386226

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets. © 2024 IEEE.

关键词： Non-negative matrix factorization

A Point Cloud Segmentation Method Based on Ground Point Cloud Removal and Multi-Scale Twin Range image

学校读者我要写书评

暂无评论

A Point Cloud Segmentation Method Based on Ground Point Clou...

Chinese control Conference (CCC)

作者： Yicheng Zhou Gang Peng Hangqi Duan Zhangang Wu Xukang Zhu School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan China Shantui Construction Machinery Co. Ltd. Jining China

Aiming at the shortcomings of traditional point cloud segmentation algorithms, this paper proposes a 3D lidar point cloud segmentation method combining ground filtering and multi-scale twin range image construction. This method fully considers the geometric space distribution characteristics of the point cloud and the randomness of the positions between objects. Based on the assumption of multi plane model, the point cloud is divided into sectors. The ground points are removed through region ground plane fitting and growth, and then the multi-scale twin range image is constructed according to non-ground points. On the basis of the twin range image, the Breadth First Search algorithm is improved, the depth-breadth joint search strategy is proposed, all the points to be clustered are traversed, and the adaptive clustering threshold is used for point cloud clustering, which realizes a point cloud segmentation method with higher accuracy and robustness. Through the experimental analysis of KITTI dataset and collected campus outdoor scene dataset, compared with the traditional point cloud segmentation algorithm, the method proposed in this paper can effectively improve the point cloud segmentation accuracy and robustness of mobile robots in complex environments.

关键词：

Semi-Supervised Class-Agnostic Motion Prediction with Pseudo Label Regeneration and BEVMix

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Kewei Wu, Yizheng Pan, Zhiyu Li, Xingyi Xian, Ke Wang, Zhe Cao, Zhiguo Lin, Guosheng S-Lab Nanyang Technological University Singapore Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China SenseTime Research Hong Kong

Class-agnostic motion prediction methods aim to comprehend motion within open-world scenarios, holding significance for autonomous driving systems. However, training a high-performance model in a fully-supervised manner always requires substantial amounts of manually annotated data, which can be both expensive and time-consuming to obtain. To address this challenge, our study explores the potential of semi-supervised learning (SSL) for class-agnostic motion prediction. Our SSL framework adopts a consistency-based self-training paradigm, enabling the model to learn from unlabeled data by generating pseudo labels through test-time inference. To improve the quality of pseudo labels, we propose a novel motion selection and re-generation module. This module effectively selects reliable pseudo labels and regenerates unreliable ones. Furthermore, we propose two data augmentation strategies: temporal sampling and BEVMix. These strategies facilitate consistency regularization in SSL. Experiments conducted on nuScenes demonstrate that our SSL method can surpass the self-supervised approach by a large margin by utilizing only a tiny fraction of labeled data. Furthermore, our method exhibits comparable performance to weakly and some fully supervised methods. These results highlight the ability of our method to strike a favorable balance between annotation costs and performance. Code will be available at https://***/kwwcv/SSMP. Copyright © 2023, The Authors. All rights reserved.

关键词： Forecasting

Lifetime Extension control for Multi-Stack SOFC System with Inconsistent Stacks

学校读者我要写书评

暂无评论

Lifetime Extension Control for Multi-Stack SOFC System with ...

Chinese control Conference (CCC)

作者： Zexin Li Guoqiang Liu Wei Zhao Xi Li Key Laboratory of Image Processing and Intelligent Control of Education Ministry School of Artificial Intelligence and Automation Huazhong University of Science & Technology Wuhan Hubei China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen Guangdong China

The multi-stack fuel cell system (MFCS) is an important basis for the application of solid oxide fuel cell (SOFC) technology to large-scale power generation systems. MFCS can provide higher power, longer lifetime and better reliability. Different from the single-stack fuel cell system (SFCS), there may be some inconsistencies among the stacks in the MFCS. If the inconsistencies are ignored, they will significantly affect the lifetime of the MFCS. This study focuses on the lifetime extension of multi-stack SOFC power generation systems with inconsistent stacks. Since the multi-stack system of SOFC generally cannot control the flow rate of each stack respectively, it brings a difficulty to the control of the MFCS with inconsistencies among the stacks. In order to overcome this difficulty, this paper built a multi-stack SOFC system model, which can characterize the degradation and inconsistencies among SOFC stacks. And then designed a power distribution strategy based on fuzzy control to extend the lifetime of the MFCS. The strategy was verified by simulations. The simulation results show that the strategy can effectively control the inconsistencies among the stacks and significantly extend the lifetime of the MFCS.

关键词：

Find Beauty in the Rare: Contrastive Composition Feature Clustering for Nontrivial Cropping Box Regression

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Zhiyu Chen, Yinpeng Zhang, Jiale Lu, Hao Cao, Zhiguo Zhong, Weicai Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Huawei CBG Consumer Cloud Service Search Product & Big Data Platform Department China

Automatic image cropping algorithms aim to recompose images like human-being photographers by generating the cropping boxes with improved composition quality. Cropping box regression approaches learn the beauty of composition from annotated cropping boxes. However, the bias of annotations leads to quasi-trivial recomposing results, which has an obvious tendency to the average location of training samples. The crux of this predicament is that the task is naively treated as a box regression problem, where rare samples might be dominated by normal samples, and the composition patterns of rare samples are not well exploited. Observing that similar composition patterns tend to be shared by the cropping boundaries annotated nearly, we argue to find the beauty of composition from the rare samples by clustering the samples with similar cropping boundary annotations, i.e., similar composition patterns. We propose a novel Contrastive Composition Clustering (C2C) to regularize the composition features by contrasting dynamically established similar and dissimilar pairs. In this way, common composition patterns of multiple images can be better summarized, which especially benefits the rare samples and endows our model with better generalizability to render nontrivial results. Extensive experimental results show the superiority of our model compared with prior arts. We also illustrate the philosophy of our design with an interesting analytical visualization. Copyright © 2023, The Authors. All rights reserved.

关键词： image enhancement

Transmission-Constrained Consensus of Multiagent Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Xiaotian Su, Housheng School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China

This paper studies the consensus problem for multiagent systems with transmission constraints. A novel model of multiagent systems is proposed where the information transmissions between agents are disturbed by irregular distortions or interferences (named transmission constraint functions), and this model is universal which can be applied in many cases, such as interval consensus and discarded consensus. In the transmission-constrained consensus problem, we obtain the necessary and sufficient condition that agents can converge to state consensus. Furthermore, a more general case is studied in which the system reaches an equilibrium. Based on some techniques of algebraic topology and stability theory, the existence, uniqueness and stability of the system equilibrium point can be proven, which means the system can reach an asymptotically stable equilibrium. Moreover, the state values of the equilibrium are only decided by the network structure and transmission constraint functions, but not the agents’ initial states. Finally, numerical simulations are presented to illustrate the proposed theorems and corollaries. © 2022, CC BY-NC-SA.

关键词： Directed graphs