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

The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

作者： Xian-xiang Wu Bao-long Guo Juan WANG Institute of Intelligent Control and Image Engineering Xidian University Xi'an 710071 P.R.China Telecommunication Engineering Institute Air Force Engineering University Xi'an 710077 P.R.China

ISBN: (纸本)9781424451012

A novel image registration algorithm based on octalog-polar Fourier transform (OLPFT) for estimating large translations, rotations, and scalings in images is presented. The OLPFT, which is calculated at points distributed at non-linear increased concentric octagons, approximated log-polar Fourier representations of images accurately. And it can be calculated fast by utilizing the Fourier separability property and fractional FFT. Using the log-polar Fourier representations and cross-power spectrum method, we can estimate the rotations and scalings in images, and obtain translations later.

关键词： image registration octa-log-polar Fourier transform phase correlation

来源：评论

学校读者我要写书评

暂无评论

Rotation,scaling and translation invariant image watermarking using feature points

引用

The Journal of China Universities of Posts and Telecommunications 2008年第2期15卷 82-87页

作者： LI Lei-da GUO Bao-long GUO Lei Institute of Intelligent Control and Image Engineering Xidian UniversityXi'an 710071 China National Laboratory of Pattern Recognition Chinese Academy of SciencesBeijing 100080 China

In this article, a novel robust image watermarking scheme is presented to resist rotation, scaling, and translation （RST）. Initially, the original image is scale normalized, and the feature points are then extracted. Furthermore, the locally most stable feature points are used to generate several nonoverlapped circular regions. These regions are then rotation normalized to generate the invariant regions. Watermark embedding and extraction are implemented in the invariant regions in discrete cosine transform domain. In the decoder, the watermark can be extracted without the original image. Simulation results show that the proposed scheme is robust to traditional signal processing attacks, RST attacks, as well as some combined attacks.

关键词： image watermarking geometric attack featurepoint image normalization

来源：评论

学校读者我要写书评

暂无评论

High performance word level sequential and parallel coding methods and architectures for bit plane coding

引用

Science in China(Series F) 2008年第4期51卷 337-351页

作者： XIONG ChengYi TIAN JinWen LIU Jian College of Electronic Information Engineering South-Central University for Nationalities Wuhan 430074 China Institute of Pattern Recognition & Artificial Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science & Technology Wuhan 430074 China

This paper introduced a novel high performance algorithm and VLSI architectures for achieving bit plane coding （BPC） in word level sequential and parallel mode. The proposed BPC algorithm adopts the techniques of coding pass prediction and parallel ＆ pipeline to reduce the number of accessing memory and to increase the ability of concurrently processing of the system, where all the coefficient bits of a code block could be coded by only one scan. A new parallel bit plane architecture （PA） was proposed to achieve word-level sequential coding. Moreover, an efficient high-speed architecture （HA） was presented to achieve multi-word parallel coding. Compared to the state of the art, the proposed PA could reduce the hardware cost more efficiently, though the throughput retains one coefficient coded per clock. While the proposed HA could perform coding for 4 coefficients belonging to a stripe column at one intra-clock cycle, so that coding for an NxN code-block could be completed in approximate N2/4 intra-clock cycles. Theoretical analysis and experimental results demonstrate that the proposed designs have high throughput rate with good performance in terms of speedup to cost, which can be good alternatives for low power applications.

关键词： bit plane coding high performance word-level sequential multi-word parallel

来源：评论

学校读者我要写书评

暂无评论

A Statistical Speckle Suppression Algorithm for Underwater Laser image Based on Nonsubsampled Contourlet Transform

A Statistical Speckle Suppression Algorithm for Underwater L...

引用

International Conference on intelligent Systems Design and Applications (ISDA)

作者： Liu Yang Baolong Guo Wei Ni Institute of Intelligent Control and Image Engineering Xidian University Xi'an China

Underwater laser image is seriously contaminated by speckle noise which is due to the coherent nature of the scattering phenomenon. In this paper, the authors propose an adaptive speckle suppression algorithm via the novel nonsubsampled contourlet transform. The statistical model for speckle noise is first analyzed to obtain a simple and tractable solution in a closed analytical form. Gaussian distribution for speckle noise and a general Gaussian distribution are adopted to model the statistics of contourlet coefficients in logarithmically transformed laser images. Then based on the maximizing the a posteriori estimation with the assumption that speckle noise is spatially correlated within a small window, we utilize a locally adaptive Bayesian processor whose parameters are obtained from the neighboring coefficients in highpass subbands. Experimental results show that comparing with classical wavelet method, the proposed algorithm shows a superior performance in suppressing the speckle noise and retaining geometrical structures of the image.

关键词： Speckle Laser noise Laser modes Signal processing algorithms Gaussian distribution image edge detection Scattering Statistical distributions Bayesian methods image analysis

来源：评论

学校读者我要写书评

暂无评论

Particle Swarm Optimization inspired by r- and K-Selection in ecology

Particle Swarm Optimization inspired by r- and K-Selection i...

引用

Congress on Evolutionary Computation

作者： Yunyi Yan Baolong Guo Institute of Intelligent Control and Image Engineering (ICIE) School of Electromechanical Engineering Xidian University Xi'an China

An optimization technique named r/KPSO (particle swarm optimization with r- and K-selection) was developed in this paper. In Ecology, two evolutionary ldquostrategiesrdquo are termed, r-selection for those species that breed many ldquocheaprdquo offspring and live in unstable environments and K-selection for those species that produce few ldquoexpensiverdquo offspring and live in stable environments. r-selection can be characterized as: quantitative, little parent care, large growth rate and rapid development and K-selection as: qualitative, much parent care, small growth rate and slow development. r/KPSO selects r- and K-selection to produce the progenies in the iterative procedure according to the concerned particlepsilas fitness value. K-selection is performed for those particles (K-subswarm called in this paper) in high fitness, and K-subswarm only can produce few progenies but the progenies are nurtured delicately with much parent care. On the other hand, r-selection is performed for those particles (r-subswarm called) in relatively low fitness. And with little parent care, r-subswarm can produce a large number of progenies, the progenies have to compete with the r-subswarm for survival according to fitness and only the best ones can survive. In r/KPSO, the particles performed r-selection mainly explore the search space as possible as they can to find more potential solutions in large speed, and those particles performed K-selection keep the current optimum solutions and exploit the space as they can to find more ideal solutions. Combined the advantages of r-selection and K-selection, r/KPSO can converge in higher speed and higher precision.

关键词： Evolution (biology) Particle swarm optimization Optimization Productivity Animals Space exploration Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Co-scheduling model and algorithm of the three gorges-gezhou dam based on GA

Co-scheduling model and algorithm of the three gorges-gezhou...

引用

7th World Congress on intelligent control and Automation (WCICA 2008), vol.10

作者： Xiaoping Wang Huan Qi Henghui Xiao Xiaopan Zhang Key Laboratory of Image Processing and Intelligent Control Institute of Systems Engineering Huazhong University of Science and Technology Wuhan China

This paper provided a mathematic model for Three Gorges-Gezhou dam co-scheduling problems, based on full analysis of Three Gorges-Gezhou dam's actual needs, to maximize the total throughput of Three Gorges-Gezhou dam, to maximize the utilization ratio of shiplock area and minimize the total navigation shiplock waiting time under eight constraint conditions. Then a scheduling algorithm based on GA was pointed out. The three gorges south lock, Gezhou dam lock, the three gorges north lock were optimization searched separately in the GA algorithm. The scheduling results of the three gorges south lock were taken as the origin of the whole plan period, and also were taken as the basis of the Gezhou dam scheduling together with the ship applied information. The scheduling results of Gezhou dam were regarded as the basis of the three gorges north lock scheduling together with the ship applied information, so repeated, until the optimal scheduling results were given, or the most iterative step was reached. The applied result shows that making a period plan of two dam five lock only needs 2 minutes, and the plan is quite effective according to practical application.

关键词： Genetic algorithm The three gorges-gezhou dam Co-scheduling Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Method of boundary extraction based on schrödinger equation 21

Method of boundary extraction based on schrödinger equation

引用

2008 21st ISPRS International Congress for Photogrammetry and Remote Sensing

作者： Lou, Liantang Zhan, Xin Fu, Zhongliang Ding, Mingyue School of Remote Sensing and Information Engineering Wuhan University Wuhan430072 China School of Science Wuhan Institute of Technology Wuhan430073 China Institute for Pattern Recognition and Artificial Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan430074 China

To overcome the main drawbacks of global minimal for active contour models (L. D. Cohen and Ron Kimmel) that the contour is only extracted partially for low SNR images, Method of boundary extraction based on Schrödinger Equation is proposed. Our Method is based on computing the numerical solutions of initial value problem for second order nonlinear Schrödinger equation by using discrete Fourier Transformation. Schrödinger transformation of image is first given. We compute the probability P(b,a) that a particle moves from a point a to another point b according to I-Type Schrödinger transformation of image and obtain boundary of object by using quantum contour model.

关键词： Initial value problems

来源：评论

学校读者我要写书评

暂无评论

An improved shuffled frog leaping algorithm with cognitive behavior

An improved shuffled frog leaping algorithm with cognitive b...

引用

World Congress on intelligent control and Automation (WCICA)

作者： Xuncai Zhang Xuemei Hu Guangzhao Cui Yanfeng Wang Ying Niu College of Electrical and Electronic Engineering Zhengzhou University of Light Industry Zhengzhou China Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Electrical Engineering Henan Polytechnic Institute Henan Nanyang China

Shuffled frog leaping (SFL) is a population based, cooperative search metaphor inspired by natural memetics. Its ability of adapting to dynamic environment makes SFL become one of the most important memetic algorithms. In order to improve the algorithmpsilas stability and the ability to search the global optimum, a novel dasiacognition componentpsila is introduced to enhance the effectiveness of the SFL, namely frog not only adjust its position according to the best individual within the memeplex or the global best of population but also according to thinking of the frog itself. To validate the improved SFL (ISFL) method, numerous simulations were conducted to compare SFL and ISFL using six benchmark problems for continuous and discrete optimization. According to the simulation results, adding the cognitive behavior to SFL significantly enhances the performance of SFL in solving the optimization problems, and the improvements are more evident with the scale of the problem increasing.

关键词： Optimization Evolution (biology) Cognition Algorithm design and analysis Heuristic algorithms Evolutionary computation Space exploration

来源：评论

学校读者我要写书评

暂无评论

Temporal pattern recognition using spiking neural networks for cortical neuronal spike train decoding

引用

IFAC Proceedings Volumes 2008年第2期41卷 5203-5208页

作者： Huijuan Fang Yongji Wang Jiping He Shan Liu Key Laboratory for Image Processing and Intelligent Control of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China (Tel: 86-27-87557284 The Harrington Department of Bioengineering and the Center for Neural Interface Design of The Biodesign Institute Arizona State University Tempe AZ 85287 USA

Most experimental and decoding algorithm studies of brain neural signals assume that neurons transmit information as a rate coding, but recent studies on the fast cortical computations indicate that temporal coding is probably a more biologically plausible scheme used by neurons. We introduce spiking neural networks (SNN) which consist of spiking neurons propagate information by the timing of spikes to analyze the cortical neural spike trains directly without temporal information lost. The SNN based temporal pattern classification is compared with the conventional artificial neural networks (ANN) based firing rate analysis. The results show that the SNN algorithm can achieve higher accuracy, which demonstrates that temporal coding is a viable code for fast neural information processing and the SNN approach is suitable for recognizing the temporal pattern in the cortical neural signals.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Supply chain system complexity analysis

引用

Xitong Gongcheng Lilun yu Shijian/System engineering Theory and Practice 2008年第SUPPL.期28卷 132-141页

作者： Wang, Hong-Wei Guo, Min Institute of Systems Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

Supply chain is a complex system. The complexity of supply chain can be categorized into two kinds: the complexity of supply chain components as well as the complexity of the supply chain organizations, and both information uncertainty with system dynamics are the main reasons that lead to supply chain complexity. Concerning supply chain complexity, we review the related researching approaches in the literature from uncertainty, the measure of supply chain complexity as well as the dynamic analysis of the supply chain (including dynamic games), and give suggestions in the future research.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：