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

Impulsive control with time windows for hyperchaotic exponential synchronization

学校读者我要写书评

暂无评论

Impulsive control with time windows for hyperchaotic exponen...

International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)

作者： Hongjuan Wu Xiang Hu Yuming Feng Zhengwen Tu Key Laboratory of Intelligent Information Processing and Control of Chongqing Municipal Institutions of Higher Education Chongqing Three Gorges University Wanzhou Chongqing P. R. China School of Three Gorges Artificial Intelligence Chongqing Three Gorges University Wanzhou Chongqing P. R. China

ISBN: (数字)9781728158570

ISBN: (纸本)9781728158587

In actual situation, the input error of impulsive signal is inevitable and there are always some time delays when different systems communicate with each other. Then, considering the input error and time delays in the real world, this paper provides the criteria for the exponential lag synchronization of one kind of hyperchaotic system based on impulsive control with time windows, matrix inequalities, etc. Finally, the simulation results are displayed to illustrate the theoretical results.

关键词： Input error delays exponential lag synchronization hyperchaotic system impulsive control time windows Input Error Time windows control period Impulsiveness time delay delay

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

Tcgfusion: A Network for Pet-Mri Fusion Based on Gan and Transformer

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Fan, Chao Chen, Zhixiang Lin, Hao Wang, Xiao School of Artificial Intelligence and Big Data Henan University of Technology Henan Province Zhengzhou City China School of Information Science and Engineering Henan University of Technology Henan Province Zhengzhou City China Key Laboratory of Grain Information Processing and Control Ministry of Education Henan Province Zhengzhou City China

We provide an end-to-end unsupervised training model called TCGFusion: a network for PET-MRI fusion based on GAN and transformer. We set the generator to a dual-path layout to assure the gathering of both global and detailed image information. To guarantee the coarse scale picture extraction and prevent the high computational cost, the global path T-Path utilizes Grid-former (a residual grid transformer structure). The detailed path C-Path is DenseNet, and its multi-cascade structure captures image details well. Additionally, we set up a dual adversarial mechanism between the fused image and the source image, creating a dual discriminator to determine the distribution of structural similarity between the fused result and the source image, and using patch-SSIM to reinforce the semantic constraints between them and promote the image details. According to our extensive studies on public datasets, medical image fusion demonstrate the superiority of our TCGFusion compared to the state-of-the-art image fusion algorithms. © 2022, The Authors. All rights reserved.

关键词： Semantics

Multiscale Low-Frequency Memory Network for Improved Feature Extraction in Convolutional Neural Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Fuzhi Wu, Jiasong Kong, Youyong Yang, Chunfeng Yang, Guanyu Shu, Huazhong Carrault, Guy Senhadji, Lotfi Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Bangladesh Laboratoire Traitement du Signal et de l'Image Univ Rennes France Centre de Recherche en Information Biomédicale Sino-français CRIBs France Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Southeast University Bangladesh

Deep learning and Convolutional Neural Networks (CNNs) have driven major transformations in diverse research areas. However, their limitations in handling low-frequency information present obstacles in certain tasks like interpreting global structures or managing smooth transition images. Despite the promising performance of transformer structures in numerous tasks, their intricate optimization complexities highlight the persistent need for refined CNN enhancements using limited resources. Responding to these complexities, we introduce a novel framework, the Multiscale Low-Frequency Memory (MLFM) Network, with the goal to harness the full potential of CNNs while keeping their complexity unchanged. The MLFM efficiently preserves low-frequency information, enhancing performance in targeted computer vision tasks. Central to our MLFM is the Low-Frequency Memory Unit (LFMU), which stores various low-frequency data and forms a parallel channel to the core network. A key advantage of MLFM is its seamless compatibility with various prevalent networks, requiring no alterations to their original core structure. Testing on imageNet demonstrated substantial accuracy improvements in multiple 2D CNNs, including ResNet, MobileNet, EfficientNet, and ConvNeXt. Furthermore, we showcase MLFM's versatility beyond traditional image classification by successfully integrating it into image-to-image translation tasks, specifically in semantic segmentation networks like FCN and U-Net. In conclusion, our work signifies a pivotal stride in the journey of optimizing the efficacy and efficiency of CNNs with limited resources. This research builds upon the existing CNN foundations and paves the way for future advancements in computer vision. Our codes are available at https://***/AlphaWuSeu/MLFM. © 2024, CC BY-NC-ND.

关键词： Computer vision

A multi-stage semi-supervised learning for ankle fracture classification on CT images

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Hongzhi Li, Guicheng Nie, Jiacheng Tang, Hui Yang, Chunfeng Feng, Qianjin Xu, Hailin Chen, Yang The School of Computer Science and Engineering Southeast University Nanjing210096 China The Peking University People's Hospital Beijing100000 China The Guangdong Provincial Key Laboratory of Medical Image Processing School of Biomedical Engineering Southern Medical University Guangzhou510515 China The Key Laboratory of New Generation Artificial Intelligence Technology and its Interdisciplinary Applications Southeast University Ministry of Education China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Southeast University Nanjing210096 China Jiangsu Key Laboratory of Molecular and Functional Imaging Department of Radiology Zhongda Hospital Southeast University Nanjing210009 China

Because of the complicated mechanism of ankle injury, it is very difficult to diagnose ankle fracture in clinic. In order to simplify the process of fracture diagnosis, an automatic diagnosis model of ankle fracture was proposed. Firstly, a tibia-fibula segmentation network is proposed for the joint tibiofibular region of the ankle joint, and the corresponding segmentation dataset is established on the basis of fracture data. Secondly, the image registration method is used to register the bone segmentation mask with the normal bone mask. Finally, a semi-supervised classifier is constructed to make full use of a large number of unlabeled data to classify ankle fractures. Experiments show that the proposed method can segment fractures with fracture lines accurately and has better performance than the general method. At the same time, this method is superior to classification network in several indexes. Copyright © 2024, The Authors. All rights reserved.

关键词： image classification

Dfe-Net: Dual-Branch Feature Extraction Network for Enhanced Segmentation in Skin Lesion

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Fan, Chao Yang, Litao Lin, Hao Qiu, Yingying School of Artificial Intelligence and Big Data Henan University of Technology Henan Province Zhengzhou City China Key Laboratory of Grain Information Processing and Control Ministry of Education Henan Province Zhengzhou City China School of Information Science and Engineering Henan University of Technology Henan Province Zhengzhou City China

Skin lesion segmentation is a critical method for extracting pathological information from dermoscopy images, which is of great significance for lesion location, recognition, monitoring and treatment. Due to the varied sizes of lesions, different forms and colors, and blurring boundaries, the present detection methods are unable to accurately anticipate local features, which has an impact on the segmentation accuracy. Therefore, the Dual-branch Feature Extraction Network (DFE-Net) is suggested in this paper. We designed two types of encoders based on the Transformer and Efficient Channel Attention (ECA) module, one for extracting the global feature and another for the local feature, before fusing and decoding. Simultaneously, the skip connections from the Enhanced ECA Feature Extraction Modules to decoders are designed to reduce feature loss during decoding, this will restore the boundaries and local features to the greatest extent possible. We test the model on three publicly available skin lesion datasets: PH2, ISIC-2016, and ISIC-2018. The results show that our model is superior to other previous methods, and the segmentation characteristics are more accurate representations of the actual lesion. © 2022, The Authors. All rights reserved.

关键词： Feature extraction

Dehazing Quality Evaluation Algorithm Integrating Dark Channel Theory and image Depth Estimation

学校读者我要写书评

暂无评论

Journal of Network Intelligence

Journal of Network intelligence 2024年第2期9卷 1119-1133页

作者： Huang, Jia-Yan Xu, Xin-Xin Luo, Shao-Ye Zhao, Wan-Qi Fan, Hao-Yi Grau, Antoni Guerra, Edmundo Wang, Chuan-Sheng Zhang, Fu-Quan New Engineering Industry College Putian University Putian351100 China The University of Sheffield SheffieldS10 2TN United Kingdom School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou450001 China Department of Automatic Control Technical Polytechnic University of Catalonia Barcelona08034 Spain Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350108 China

image dehazing is an important research topic and hotspot in the fields of image processing and computer vision. Therefore, evaluating the performance of image dehazing algorithms has become an import research issue. However, current image quality assessment (IQA) algorithms only judge the final dehazed image and do not give an analysis of the capabilities of the image dehazing algorithm. In order to fill this gap, we propose an image dehazing quality assessment method that integrated the dark channel prior with image depth estimation. The proposed method first uses the dark channel prior to estimate the absolute amount of haze removed from each pixel as an indication of the performance of dehazing. Then, a dual-scale variance ratio method is introduced to estimate the scene depth of the image. Finally, the relative dehazing is calculated from the obtained absolute dehazing and the image depth to represent the capability of the dehazing algorithm. The method proposed in this paper first introduces the concepts of relative and absolute dehazing quantities, along with pioneering a pixel-level evaluation of dehazing outcomes. Extensive experiments show that the algorithm proposed in this paper is more in line with human subjective judgment than other IQA algorithms. © 2024, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Pixels

Sparse generalized canonical correlation analysis: Distributed alternating iteration based approach

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Cai, Jia Lv, Kexin Huo, Junyi Huang, Xiaolin Yang, Jie School of Statistics and Mathematics Guangdong University of Finance & Economics Big Data and Educational Statistics Application Laboratory 21 Chisha Road Guangzhou Guangdong510320 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China School of Electronics and Computer Science University of Southampton University Road SouthamptonSO17 1BJ United Kingdom

Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA works only for two datasets, i.e., there are only two views or two distinct objects. To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Moreover, the introduced sparsity could be considered as Laplace prior on the canonical variates. Specifically, we convert the GCCA into a linear system of equations and impose 1 minimization penalty for sparsity pursuit. This results in a nonconvex problem on Stiefel manifold, which is difficult to solve. Motivated by Boyd’s consensus problem, an algorithm based on distributed alternating iteration approach is developed and theoretical consistency analysis is investigated elaborately under mild conditions. Experiments on several synthetic and real world datasets demonstrate the effectiveness of the proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Statistical mechanics

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding