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

2011 IEEE International conference on intelligent Computation and Bio-Medical Instrumentation, ICBMI 2011

作者： Hu, Song Hou, WenGuang Department of Biomedical Engineering HuaZhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan China

ISBN: (纸本)9780769546230

In Ultrasound imaging, speckle noise is the most serious problem which affects the performance of images. Non-local mean filter is a nice method to remove the speckle noise, but the algorithm' computational complexity makes it's a highly time-consuming method. In many applications like image-guided surgical intervention, real-time de-noising is required. This paper implements a NLM method accelerated by GPU for real-time denoising of 3D ultrasound images. The experimental results show the proposed accelerated de-noising method is efficient in terms of denoising quality and real-time. © 2011 IEEE.

关键词： image denoising

来源：评论

学校读者我要写书评

暂无评论

Multi-stage hybrid multiobjective evolutionary algorithm for multi-type vehicle routing problem with simultaneous pickup and delivery and time windows

引用

Computers & Industrial Engineering 2025年

作者： Wenqiang Zhang Shun Li Miaolei Deng Yashuang Mu Peng Li Key Laboratory of Grain Information Processing and Control (Henan University of Technology) Ministry of Education China Henan Key Laboratory of Grain Storage Information Intelligent Perception and Decision Making Henan University of Technology China School of Artificial Intelligence and Big Data Henan University of Technology China College of Information Science and Engineering Henan University of Technology China Institute for Complexity Science Henan University of Technology China

The vehicle routing problem (VRP) is a fundamental and extensively studied problem in logistics and transportation. Despite its significance, real-world applications often require more complex variants to address specific operational constraints and objectives. To address these limitations, this paper introduces the multi-type vehicle routing problem with simultaneous pickup and delivery and time windows (MTVRPSPDTW). Although hybrid multiobjective algorithms have been successful in combination optimization problems in recent years, it is still challenging to improve the performance of the algorithms by combining them with different timing. We propose a multi-stage hybrid evolutionary multi-objective optimization with a multi-region sampling strategy (MS-HEMO-MRSS) to optimize both vehicle number and wait time of MTVRPSPDTW. The algorithm integrates a three-stage hybrid approach, combining a global search using the multi-region sampling strategy (MRSS) with a local search based on routing sequence differential evolution (RSDE). The initial stage employs MRSS to quickly position the population near the Pareto front from various directions. The second stage utilizes RSDE to accelerate convergence towards central and edge areas of the Pareto front. In the final stage, individuals on Pareto front are selected and RSDE is used again to guide them towards the edge regions to enhance distribution performance. Specialized encoding, decoding techniques, and genetic operators tailored for two vectors are introduced to optimize MTVRPSPDTW. Comparative experiments with traditional multiobjective evolutionary algorithms demonstrate significant convergence and notable distribution performances, highlighting the benefits of employing different optimization strategies at different evolutionary stages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stability Analysis and controller Design of Positive Linear Systems Subject to Actuator Saturation

Stability Analysis and Controller Design of Positive Linear ...

引用

第三十二届中国控制会议

作者： ZHANG Jishi Wu Yan WANG Yanwu GAO Zhonghu School of Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan Institute of Marine Electric Propulsion CSIC

ISBN: (纸本)9781479900305

This paper addresses the stability and stabilization problems for a class of positive linear systems in the presence of saturating *** objective is to give conditions of the stability,and design state feedback control laws such that the closed-loop systems is asymptotically stable and positive at the origin with a large domain of *** sufficient conditions for stabilization and positivity are derived via the Lyapunov functions method and convex analysis in both the continuous-time and the discrete-time cases,*** state feedback controller design and the estimation of domain of attraction are presented by solving a convex optimization problem with LMIs constraints.A numerical example is given to show the effectiveness of the proposed methods.

关键词： Actuator Saturation Stability Analysis Positive System Domain of Attraction

来源：评论

学校读者我要写书评

暂无评论

Cross-user Gesture Recognition Based on Deep Domain Adaptation Networks 43

Cross-user Gesture Recognition Based on Deep Domain Adaptati...

引用

43rd Chinese control Conference, CCC 2024

作者： Fu, Zhongzheng He, Xinrun Wang, Haoyuan Chen, Xingjian Li, Yixuan Huang, Jian Huazhong University of Science and Technology Ministry of Education Key Laboratory of Image Processing and Intelligent Control Hubei Key Laboratory of Brain-inspired Intelligent Systems School of Artificial Intelligence and Automation Wuhan430074 China

ISBN: (纸本)9789887581581

This study introduces an innovative approach for gesture recognition in smart wearable devices using a deep domain adaptation model, focusing on the challenges posed by heterogeneous user environments and the need for precise, adaptable, and personalized gesture recognition systems. Traditional methods based on machine learning and deep learning techniques, while effective, struggle with the variance in data distribution among different users, leading to accuracy challenges. To address this, the study proposes the Domain Kernel-Alignment Adaptation Network (DKAN) model, utilizing a new Kernel-Aligned Multi-kernel Maximum Mean Discrepancy (KAMMD) method within deep networks. By calculating kernel alignments between source and target domains and adjusting weights of Gaussian kernels accordingly, DKAN emphasizes features conducive to transfer learning, enabling more accurate cross-user gesture recognition. The model achieves a significant average accuracy of 97.3% across 21 gestures, highlighting its potential in practical applications. This advancement addresses challenges in traditional gesture recognition methods and sets a new direction for future research in smart wearable technology. © 2024 Technical Committee on control Theory, Chinese Association of Automation.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Demand-Side Frequency control in Power Network Based on Multi-Agent Deep Reinforcement Learning 5

Demand-Side Frequency Control in Power Network Based on Mult...

引用

5th International Conference on Industrial Artificial Intelligence, IAI 2023

作者： Liu, Xianggang Liu, Zhi-Wei Chi, Ming Zhang, Yifan Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education College of Artificial Intelligence and Automation Wuhan China

ISBN: (纸本)9798350325294

The integration of renewable energy sources into the power grid has led to new challenges in maintaining the stability of the system frequency. This paper proposes a novel approach to address the Optimal Demand Side Frequency control (ODFC) problem using Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method. The proposed method models the ODFC problem as a Markov game, with centralized training based on multi-agent cooperative self-learning and associative storage service. In the decentralized execution stage, each agent independently outputs control actions to the controlled plant using local observations. Numerical simulations show that the proposed method effectively addresses the ODFC problem with superior performance compared to traditional methods. © 2023 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Fast KNN search for big data with set compression tree and best bin first 2

Fast KNN search for big data with set compression tree and b...

引用

2nd International Conference on Cloud Computing and Internet of Things, CCIOT 2016

作者： Chen, Zhenjie Yan, Jingqi Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of Ministry of Education for System Control and Information Processing China Shanghai China

ISBN: (纸本)9781467398213

This paper proposes k nearest neighbors (kNN) search based on set compression tree (SCT) and best bin first (BBF) to deal with the problem for big data. The large compression rate by set compression tree is achieved by compressing the set of descriptors jointly instead of compressing on a per-descript or basis. So set compression tree has a good performance in kNN search at a low bit rate. At the same time, the best bin first (BBF) is a very efficient algorithm to find the approximately kNN from a large number of high dimensional feature descriptors. SCT-BBF is a novel exploration and it improves search performance in three aspects: First, SCT-BBF requires less memory footprint, which is important in big data age. Second, it increases accuracy compared traditional method like KD-Tree and original SCT. SCT-BBF can be used with other data processing methods like PCA and SIFT to perform better. Third, this paper adopts finer search to increase accuracy at a slight loss of speed. And it can extend to big data easily. © 2016 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

EMPIRICAL STUDIES ON THE PROPERTIES OF LINEAR REGIONS IN DEEP NEURAL NETWORKS 8

EMPIRICAL STUDIES ON THE PROPERTIES OF LINEAR REGIONS IN DEE...

引用

8th International Conference on Learning Representations, ICLR 2020

作者： Zhang, Xiao Wu, Dongrui 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

A deep neural network (DNN) with piecewise linear activations can partition the input space into numerous small linear regions, where different linear functions are fitted. It is believed that the number of these regions represents the expressivity of the DNN. This paper provides a novel and meticulous perspective to look into DNNs: Instead of just counting the number of the linear regions, we study their local properties, such as the inspheres, the directions of the corresponding hyperplanes, the decision boundaries, and the relevance of the surrounding regions. We empirically observed that different optimization techniques lead to completely different linear regions, even though they result in similar classification accuracies. We hope our study can inspire the design of novel optimization techniques, and help discover and analyze the behaviors of DNNs. © 2020 8th International Conference on Learning Representations, ICLR 2020. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Graph-based scale-aware network for human parsing 1

引用

2nd Chinese Conference on Pattern Recognition and Computer Vision, PRCV 2019

作者： Yang, Beibei Yu, Changqian Liu, Jiahui Gao, Changxin Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9783030317232

ISBN: (纸本)9783030317225

Recent work has made considerable progress in exploring contextual information for human parsing with the Fully Convolutional Network framework. However, there still exist two challenges: (1) inherent relative relationships between parts;(2) scale variation of human parts. To tackle both problems, we propose a Graph-Based Scale-Aware Network for human parsing. First, we embed a Graph-Based Part Reasoning Layer into the backbone network to reason the relative relationship between human parts. Then we construct a Scale-Aware Context Embedding Layer, which consists of two branches to capture scale-specific contextual information, with different receptive fields and scale-specific supervisions. In addition, we adopt an edge supervision to further improve the performance. Extensive experimental evaluations demonstrate that the proposed model performs favorably against the state-of-the-art human parsing methods. More specifically, our algorithm achieves 53.32% (mIoU) on the LIP dataset. © Springer Nature Switzerland AG 2019.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Bimodal Feature Propagation and Fusion for Real-time Semantic Segmentation on RGB-D images 7

Bimodal Feature Propagation and Fusion for Real-time Semanti...

引用

7th International Conference on intelligent Computing and Signal processing, ICSP 2022

作者： He, Ying Xiao, Li Sun, Zhigang Wang, Zhuo Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Wuhan China

ISBN: (纸本)9781665478571

Semantic Segmentation is the foundation of scene understanding and automatic driving tasks. One of the challenges of semantic segmentation is the reduction of feature resolution as the network goes deep. In this paper, the low-resolution features are integrated into high-resolution features progressively, enabling high-resolution prediction. Currently, incorporating the auxiliary depth information into a semantic segmentation framework has proven to be helpful to improve accuracy. However, additional process of depth data immensely increases computational complexity, resulting in limitation for practical application. Here, a real-time bimodal semantic segmentation network that effectively extracts and fuses complementary information is investigated. Our network extends a light-weight architecture which can seamlessly take advantage of various prevalent backbone networks. Our model extracts RGB and depth features from two branches in parallel and integrates multi-level features of two modalities through bimodal feature fusion blocks. To reduce computation complexity, we employ depth-wise separable convolution while keep performance intact. Meanwhile, an attention mechanism is exploited to recalibrate the fusion modality features adaptively. Refinement components are retained to refine multi-resolution feature maps. We conduct ablative study to demonstrate the availability of our bimodal fusion blocks. Comprehensive experiments validate that the proposed network outperforms the state-of-the-arts and achieves 18 FPS on the challenging RGB-D dataset, NYUDv2. © 2022 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for color image enhancement with total variation regularization

引用

Science China(information Sciences) 2010年第9期53卷 1913-1916页

作者： LI Ming1,2 1School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,China 2key laboratory of Education Ministry for image processing and intelligent control,Wuhan 430074,China 1. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China2. Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan 430074 China

In this paper,a novel algorithm for color image enhancement is *** proposed method,which is based on Retinex theory and total variational framework,improves the original variational method by using a TV penalty term to force spatial smoothness on the reflectance *** split Bregman algorithm is employed to solve the proposed *** practical experiments,it is verified that our method obtains better enhancement performance and much better calculation efficiency.

关键词： color image enhancement Retinex theory total variational model split Bregman algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：