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

International Conference on Computer Vision (ICCV)

作者： Zhiyu Pan Zhiguo Cao Kewei Wang Hao Lu Weicai Zhong Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Huawei CBG

ISBN: (纸本)9781665428132

We show that relation modeling between visual elements matters in cropping view recommendation. Cropping view recommendation addresses the problem of image recomposition conditioned on the composition quality and the ranking of views (cropped sub-regions). This task is challenging because the visual difference is subtle when a visual element is reserved or removed. Existing methods represent visual elements by extracting region-based convolutional features inside and outside the cropping view boundaries, without probing a fundamental question: why some visual elements are of interest or of discard? In this work, we observe that the relation between different visual elements significantly affects their relative positions to the desired cropping view, and such relation can be characterized by the attraction inside/outside the cropping view boundaries and the repulsion across the boundaries. By instantiating a transformer-based solution that represents visual elements as visual words and that models the dependencies between visual words, we report not only state-of-the-art performance on public benchmarks, but also interesting visualizations that depict the attraction and repulsion between visual elements, which may shed light on what makes for effective cropping view recommendation.

关键词： Visualization Computer vision Computational modeling Benchmark testing Feature extraction Transformers Decoding

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Generalized Source-Free Domain Adaptation (SSG-SFDA)

Semi-Supervised Generalized Source-Free Domain Adaptation (S...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jiayu An Changming Zhao Dongrui Wu Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

Continual learning aims to learn on a sequence of new tasks while maintaining the performance on previous tasks. Source-free domain adaptation (SFDA), which adapts a pretrained source model to a target domain, is useful in protecting the source domain data privacy. Generalized SFDA (G-SFDA) combines continual learning and SFDA to achieve outstanding performance on both the source and the target domains. This paper proposes semi-supervised G-SFDA (SSG-SFDA) for domain incremental learning, where a pre-trained source model (instead of the source data), few labeled target data, and plenty of unlabeled target data, are available. The goal is to achieve good performance on all domains. To cope with domain-ID agnostic, SSG-SFDA trains a conditional variational auto-encoder (CVAE) for each domain to learn its feature distribution, and a domain discriminator using virtual shallow features generated by CVAE to estimate the domain ID. To cope with catastrophic forgetting, SSG-SFDA uses soft domain attention to improve the sparse domain attention in G-SFDA. To cope with insufficient labeled target data, SSG-SFDA uses MixMatch to augment the unlabeled target data and better exploit the few labeled target data. Experiments on three datasets demonstrated the effectiveness of SSG-SFDA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating Informativeness, Representativeness and Diversity in Pool-Based Sequential Active Learning for Regression

Integrating Informativeness, Representativeness and Diversit...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Ziang Liu Dongrui Wu Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

In many real-world machine learning applications, unlabeled samples are easy to obtain, but it is expensive and/or time-consuming to label them. Active learning is a common approach for reducing this data labeling effort. It optimally selects the best few samples to label, so that a better machine learning model can be trained from the same number of labeled samples. This paper considers active learning for regression (ALR) problems. Three essential criteria - informativeness, representativeness, and diversity - have been proposed for ALR. However, very few approaches in the literature have considered all three of them simultaneously. We propose three new ALR approaches, with different strategies for integrating the three criteria. Extensive experiments on 12 datasets in various domains demonstrated their effectiveness.

关键词： Computational modeling Clustering algorithms Machine learning Training Labeling Predictive models image processing

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with rule production/removal 18th

Tissue P systems with rule production/removal

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Pan, Linqiang Song, Bosheng Zhang, Gexiang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Robotics Research Center and Key Laboratory of Fluid and Power Machinery Xihua University Chengdu610039 China

ISBN: (纸本)9783319733586

Tissue P systems are computational models inspired by the way of biochemical substance movement/exchange between two cells or between a cell and the environment, where all communication (symport/antiport) rules used in a system are initially set up and keep unchanged during any computation. In this work, a variant of tissue P systems, called tissue P systems with rule production/removal (abbreviated as TRPR P systems) is considered, where rules in a system are dynamically changed during a computation, that is, at any computation step new rules can be produced and some existing rules can be removed. The computation power of TRPR P systems is investigated. It is proved that Turing universality is achieved for TRPR P systems with one cell, and using symport rules of length at most 1, antiport rules of length at most 2 or symport rules of length at most 2 and working in a maximally parallel manner. We further show that TRPR P systems with two cells, using symport rules of length at most 1, and working in a flat maximally parallel manner, are Turing universal. © 2018, Springer International Publishing AG.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

$H_{\infty}$ Filtering for Neutral Systems With Mixed Delays and Multiplicative Noises

引用

IEEE Transactions on Circuits and Systems II: Express Briefs 2012年第11期59卷 820-824页

作者： Shiping Wen Zhigang Zeng Tingwen Huang Department of Control Science and Engineering Huazhong University of Science and Technology and Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan China Texas A & M University at Qatar Doha Qatar

This brief investigates the H ∞ filtering problem for a class of neutral systems with mixed delays and multiplicative noises. The mixed delays comprise both discrete time-varying and distributed delays. Moreover, the multiplicative disturbances are in the form of a scalar Gaussian white noise with unit variance. In the presence of mixed delays and multiplicative noises, sufficient conditions for the existence of an H ∞ filter are derived, such that the filtering error dynamics is asymptotically mean-square stable and also achieves a guaranteed H ∞ performance level. Then, a linear matrix inequality approach for designing such an H ∞ filter is presented. Finally, a numerical example is provided to illustrate the effectiveness of the developed theoretical results.

关键词： Delay Noise Robustness control systems Stochastic systems Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

A protocol for structured illumination microscopy with minimal reconstruction artifacts

引用

生物物理学报 2019年第2期5卷 80-90页

作者： Junchao Fan Xiaoshuai Huang Liuju Li Shan Tan Liangyi Chen Key Laboratory of Image Processing and Intelligent Control of Ministry of Education of China School of Automation Huazhong University of Science and Technology Wuhan 430074 China State Key Laboratory of Membrane Biology Beijing Key Laboratory of Cardiometabolic Molecular MedicineInstitute of Molecular Medicine Peking University Beijing 100084 China

The imaging rate of structured illumination microscopy (SIM) reached 188 Hz *** the exposure time decreases,the camera detects fewer virtual photons,while the noise level remains the *** a result,the signal-to-noise ratio (SNR) decreases ***,the SNR decreases further because of photobleaching and *** decreased quality of SIM raw data may lead to surprising artifacts with various causes,which may confuse a new user of SIM *** summarize three significant possible sources of severe artifacts in reconstructed super-resolution (SR) *** motion of a biological sample or an uneven illumination pattern is the most difficult to be *** estimated parameter could also be incorrect,leading to artifact of regular ***,reconstruction with the Wiener method generates stochastic artifacts due to the amplification of noise during the deconvolution *** deal with these problems,we have established a protocol to reconstruct ultrafast SIM raw data obtained in low SNR ***,we checked the quality of the raw data with the imageJ plugin SIMcheck before ***,a modified parameter estimation method was used to improve the precision of the ***,an iterative algorithm was used for SIM reconstruction under low signal-to-noise ratio *** procedure effectively suppressed the artifacts in the super-resolution images reconstructed from raw data of low signal-to-noise ratio.

关键词： Ultrafast SIM Low signal-to-noise ratio Reconstruction

来源：评论

学校读者我要写书评

暂无评论

A heuristically accelerated multi-agent reinforcement learning algorithm applied to flow line maintenance scheduling

引用

Journal of Computational Information Systems 2015年第6期11卷 2245-2255页

作者： Wang, Xiao Wang, Hongwei Qi, Chao Wang, Xu School of Safety Engineering Shenyang Aerospace University Shenyang China Institute of Systems Engineering/State Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China

This paper investigates the maintenance scheduling problem in a flow line system consisting of two series machines with a finite buffer in between. The machines deteriorate with age and have multiple deteriorating quality states represented by multiple decreasing yield levels. The maintenance problem of both machines is modeled as semi-Markov decision processes. A heuristically accelerated multi-agent reinforcement learning algorithm with a feature of incorporating heuristic function for action selection is developed to produce a reasonable maintenance scheduling. A comparison with a Ε-greedy search based exploration algorithm, a simulated annealing search based exploration algorithm, a tabu search based exploration algorithm and a neighborhood search based exploration algorithm in reinforcement learning is presented. The results indicate that the proposed heuristically accelerated multi-agent reinforcement learning algorithm is competitive and has a certain advantage for larger problems. Copyright © 2015 Binary Information Press.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Modified lifting algorithm and VLSI architecture for the 9/7 wavelet filters

Modified lifting algorithm and VLSI architecture for the 9/7...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Chen-Gyi Xiong Zhi-Rong Gao Jin-Wen Tian Jian Liu The State Key Laboratory of Education Commission for Image Processing and Intelligent Control Institute of Pattern Recognition & Artificial Intelligence Huazhong University of Science and Technology Wuhan China Department of Computer Science Wuhan University of Science and Engineering Hebei China

ISBN: (纸本)0780384032

A new parallel-based lifting algorithm (PBLA) for the 9/7 filters, exploring the parallelism of arithmetic operations in each lifting step, was proposed in this paper. It shortened significantly the critical path of computation, and resulted in a fast VLSI implementation architecture. In comparison with the conventional lifting algorithm based implementation (CLABI), the latency is reduced by more than half from (4T/sub m/ + 8T/sub a/) to (T/sub m/ + 4T/sub a/), which is competitive to that of convolution based implementation CBI, and can be further reduced to Tm by inserting 3 stages of pipeline. The experimental results demonstrate that the proposed architecture has good performances in both speed and area.

关键词： Very large scale integration Discrete wavelet transforms Filters image coding Delay Parallel processing Arithmetic Convolution Hardware Transform coding

来源：评论

学校读者我要写书评

暂无评论

Analysis of a third-order circuit based on a memristor

Analysis of a third-order circuit based on a memristor

引用

International Conference on Information Science and Technology (ICIST)

作者： Jian Xiao Yi Shen Zhigang Zeng Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan China

In this paper, a third-order canonical circuit with a memristor is investigated. Unlike the conventional circuit systems, it has an equilibrium set, whose stability is affected by the initial state of the memristor. T... 详细信息

ISBN: (纸本)9781424494408

关键词： Computer languages Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Nested Saturated control of Uncertain Complex Cascade Systems Using Mixed Saturation Levels

引用

IEEE/CAA Journal of Automatica Sinica 2024年第5期11卷 1163-1174页

作者： Meng Li Zhigang Zeng Wuhan National Laboratory for Optoelectronics Wuhan 430074 School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074China School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074 Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan 430074China

This study addresses the problem of global asymptotic stability for uncertain complex cascade systems composed of multiple integrator systems and non-strict feedforward nonlinear systems. To tackle the complexity inherent in such structures, a novel nested saturated control design is proposed that incorporates both constant saturation levels and state-dependent saturation levels. Specifically, a modified differentiable saturation function is proposed to facilitate the saturation reduction analysis of the uncertain complex cascade systems under the presence of mixed saturation levels. In addition, the design of modified differentiable saturation function will help to construct a hierarchical global convergence strategy to improve the robustness of control design scheme. Through calculation of relevant inequalities, time derivative of boundary surface and simple Lyapunov function,saturation reduction analysis and convergence analysis are carried out, and then a set of explicit parameter conditions are provided to ensure global asymptotic stability in the closed-loop systems. Finally, a simplified system of the mechanical model is presented to validate the effectiveness of the proposed method.

关键词： method saturation differentiable

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：