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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Ping Yan Ming-Yue Ding Cheng-Ping Zhou Institute of Pattern Recognition and Artificial Intelligence. Education Ministry Key Laboratory for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China Department of Weaponry Engineering Naval University of Engineering Wuhan China

ISBN: (纸本)0780384032

Unmanned air vehicles (UAVs) are identified as an integral part of future military forces. The coordinated route-planning problems of UAV team with various architectures are addressed in the framework of game theory. A two-stage route planner has been proposed, which combines various game models and the concept of evolutionary computation and is compatible with the cooperative/competitive nature envisioned for UAV team. Our route planner can handle different kinds of mission constraints in hierarchical style. Potential routes of each vehicle form their own sub-population, and evolve only in their own sub-population, while the cooperation and competition among UAVs are reflected by the definition of fitness function. Experimental results show the feasibility of generating the coordinated routes for UAV team using game theory methods.

关键词： Unmanned aerial vehicles Game theory Evolutionary computation Automotive engineering Time of arrival estimation pattern recognition Artificial intelligence Control engineering education Laboratories image processing

来源：评论

学校读者我要写书评

暂无评论

Research on attention-based multiscale information fusion with the real-time instance segmentation method

Research on attention-based multiscale information fusion wi...

引用

Algorithms, High Performance Computing and Artificial Intelligence (AHPCAI), International Conference on

作者： Yifan He Hua Huang Qishen Li Guiwen Zhang School of Information Engineering Nanchang Hangkong University Nanchang Jiangxi China Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition Nanchang Jiangxi China School of Software Nanchang Hangkong University Nanchang Jiangxi China

Instance segmentation is a comprehensive computer vision task that involves a wide range of other tasks. Recently, the study of real-time instance segmentation methods has received more attention for the development of autonomous driving. Although existing real-time instance segmentation methods are fast, their accuracy does not meet practical needs. Most methods go for segmentation based on object detection, and their effectiveness is overly dependent on the effectiveness of detection. This paper proposes a new attention-based multiscale information fusion method based on Cheng, T. et al. [1]. Firstly, the PPM module of the baseline network is replaced with the module Multiscale Context Attention (MSCA) designed in this paper based on the baseline network, which uses atrous convolution with different ratios to obtain information of four scales, and then uses non-local attention to enhance the information of features. It can effectively suppress the interference of redundant information on the instance segmentation results. Secondly, a new feature fusion approach is designed, which no longer uses bilinear interpolation, but sub-pixel up sampling combined with attention. We did experiments related to this module on the coco dataset and demonstrated its effectiveness, with a 0.5% improvement over the baseline network.

关键词： Interpolation Computer vision Convolution High performance computing Interference Object detection Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Experimental Comparison of Geometric, Arithmetic and Harmonic Means for EEG Event Related Potential Detection

Experimental Comparison of Geometric, Arithmetic and Harmoni...

引用

International Conference on Computational Intelligence and Security

作者： Jarno M.A. Tanskanen X.Z. Gao Jing Wang Ping Guo Jari A.K. Hyttinen Vassil S. Dimitrov Department of Biomedical Engineering Tampere University of Technology and BioMediTech Finland College of Information Engineering Shanghai Maritime University China Laboratory of Image Processing and Pattern Recognition Beijing Normal University Beijing China ATIPS Laboratory University of Calgary AB Canada

In this paper, we experimentally evaluate three different averaging methods for processing of electroencephalogram (EEG) event related potentials (ERPs) measured from scalp in response to repeated stimulus. In ERP applications, arithmetic mean (AM) is normally employed in processing the ERPs prior to ERP detection, whereas also other averaging methods might have beneficial properties. Fast ERP detection is essential, for example, in brain computer interfaces and during spine surgery. Thus, it is of interest to search for methods to aid in detecting ERPs with as few stimulus repetitions as possible. Here, noise reduction properties of AM, geometric mean (GM), and harmonic mean (HM) are demonstrated with simulations, and ERP processing by the three methods is illustrated by processing real visual evoked potentials (VEPs).

关键词： Electroencephalography Gaussian noise Educational institutions Electrodes Visualization Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Generalization properties of hyper-RKHS and its applications

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2021年第1期22卷 6220-6257页

作者： Fanghui Liu Lei Shi Xiaolin Huang Jie Yang Johan A.K. Suykens Department of Electrical Engineering ESAT-STADIUS KU Leuven Leuven Belgium Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai China Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China

This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view. Algorithmically, we consider two regularized regression models with bivariate forms in this space, including kernel ridge regression (KRR) and support vector regression (SVR) endowed with hyper-RKHS, and further combine divide-and-conquer with Nyström approximation for scalability in large sample cases. This framework is general: the underlying kernel is learned from a broad class, and can be positive definite or not, which adapts to various requirements in kernel learning. Theoretically, we study the convergence behavior of regularized regression algorithms in hyper-RKHS and derive the learning rates, which goes beyond the classical analysis on RKHS due to the non-trivial independence of pairwise samples and the characterisation of hyper-RKHS. Experimentally, results on several benchmarks suggest that the employed framework is able to learn a general kernel function form an arbitrary similarity matrix, and thus achieves a satisfactory performance on classification tasks.

关键词： hyper-RKHS approximation theory kernel learning out-of-sample extensions

来源：评论

学校读者我要写书评

暂无评论

An improved mapping method of buffer for line-based architecture of 2-D DWT

An improved mapping method of buffer for line-based architec...

引用

International Conference on Communications, Circuits and Systems (ICCCAS)

作者： Cheng-Yi Xiong Cheng-Jun Wang Jin-wen Tian Jian Liu Institute of Pattern Recognition & Artificial Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China College of Electronic Information Engineering South-Center University for Nationalities Wuhan China

ISBN: (纸本)0780390156

The number of arithmetic units used in the one-dimensional (1D) discrete wavelet transform (DWT) is the main consideration for reducing the area of VLSI implementation of 1D DWT, while the size of intermediate memory used for data buffering is another dominate factor of effecting hardware complexity of VLSI implementation for two-dimensional (2D) DWT. In this paper, we exploit the essential relationship between the size of temporal buffer (TB) required in the line-based architecture for 2D DWT (LBA2DDWT) and the number of registers used in the 1D DWT module, and present an improved method of mapping the registers used in the 1D DWT to the TB required in LBA2DDWT. Comparison results with the other design reported in previous literature demonstrate that, the proposed mapping method can reduce efficiently the size of memory required in LBA2DDWT.

关键词： Discrete wavelet transforms Registers Two dimensional displays Very large scale integration Hardware Convolution Pipeline processing Arithmetic Signal analysis image processing

来源：评论

学校读者我要写书评

暂无评论

Impulse noise removal using linear prediction model

Impulse noise removal using linear prediction model

引用

International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service (TELSIKS)

作者： I. Prudyus S. Voloshynovskiy Y. Rytsar T. Holotyak National University Lvivska Politechnika Lviv Ukraine Coordinated Science Laboratory College of Engineering University of Illinois Urbana IL USA Department of Image Processing and Pattern Recognition Institute of Physics and Mechanics National Academy of Sciences Lviv Ukraine

Noise removal is an important problem in many applications. In this paper a new two-step scheme of the decision-based impulse noise removal method by means of contaminated pixel detection is proposed and comparison with direct order statistic filtering is given. The proposed methods satisfy both objective and subjective image quality.

关键词： Predictive models Statistics Noise reduction Pixel Electronic mail image quality Nonlinear filters Filtering algorithms Data analysis Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

Text scanner with text detection technology on image sequences

Text scanner with text detection technology on image sequenc...

引用

International Conference on pattern recognition

作者： Keechul Jung Kwang In Kim T. Kurata M. Kourogi JungHyun Han Pattern Recognition and Image Processing Laboratory Michigan State University USA Artificial Intelligence Laboratory KAIST South Korea National Institute for Advanced Industrial Science and Technology Japan School of Electrical and Computer Engineering Sung Kyun Kwan University South Korea

ISBN: (纸本)076951695X

We propose a text scanner which detects wide text strings in a sequence of scene images. For scene text detection, we use a multiple-CAMShift algorithm on a text probability image produced by a multi-layer perceptron. To provide enhanced resolution of the extracted text images, we perform the text detection process after generating a mosaic image in a fast and robust image registration method.

关键词： image sequences Layout image registration Cameras Parameter estimation Videos Pixel image processing Robustness Optical character recognition software

来源：评论

学校读者我要写书评

暂无评论

New approach to fast calculation of moments of 3-D gray level images

引用

Parallel Computing 2000年第6期26卷 805-815页

作者： Liu, J.G. Chan, F.H.Y. Lam, F.K. Li, H.F. Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology China Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Department of Computer Science University of Concordia Canada State Education Ministry Laboratory for Image Processing and Intelligent Control China

Fast computation of three-dimensional (3-D) moments is an important and pragmatic problem. In this paper, we propose a new algorithm together with suitable systolic structure for the fast computation of 3-D moments, extending our method for fast computation of 2-D moments. A scalable systolic structure, consisting of adders and latches, fully exploits parallelism of the network architecture and is very suitable for hardware implementation. Our new method, which also dispenses with the need for multiplication, is suitable for both binary images and gray level images. We also extend our method to efficient computation of k-dimensional (k-D) moments (k > 3).

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Nonconvex penalties with analytical solutions for one-bit compressive sensing

arXiv

引用

arXiv 2017年

作者： Huang, Xiaolin Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing Shanghai200240 China Department of Computational Mathematics Science and Engineering Department of Mathematics Michigan State University East LansingMI48824 United States

One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a solution is globally optimal or not. For positive homogeneous penalties, a globally optimal solution can be obtained in two steps: a proximal operator and a normalization step. For other penalties, we solve the dual problem, and it needs to evaluate the proximal operators for many times. Then we provide fast algorithms for finding analytical solutions for three penalties: minimax concave penalty (MCP), 0norm, and sorted 1penalty. Specifically, our algorithm is more than 200 times faster than the existing algorithm for MCP. Its efficiency is comparable to the algorithm for the 1penalty in time, while its performance is much better than 1. Among these penalties, sorted 1is most robust to noise in different settings. Copyright © 2017, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：