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

Micro-assembly of micro parts using uncalibrated microscopes visual servoing method

information Technology Journal 2008年第3期7卷 497-503页

作者： Xiangjin, Zeng Xinhan, Huang Min, Wang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering HUST Wuhan 430074 China

In micromanipulation, the microscope vision servoing can achieve a high performance. In order to avoid the complicated calibration of intrinsic parameter of camera, We apply an improved broyden's method to estimate the image jacobian matrix on line, which employs Chebyshev polynomial to construct a cost function to approximate the optimization value, obtaining a fast convergence for online estimation. Using the estimated jacobian matrix, a PD visual controller is used to make features converge to desired values with satisfactory dynamic performance. The experiments of micro-assembly of micro parts m microscopes confirm that the proposed method is effective and feasible. © 2008 Asian Network for Scientific information.

关键词： Chebyshev polynomials

来源：评论

学校读者我要写书评

暂无评论

Research of invariant moments and improved support vector machine in micro-targets identification

引用

Journal of Applied Sciences 2008年第21期8卷 3969-3974页

作者： Zeng, Xiangjin Huang, Xinhan Wang, Min Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

In order to identify multi micro objects, an improved support vector machine algorithm is present, which employs invariant moments based edge extraction to obtain feature attribute and then presents a heuristic attribute reduction algorithm based on rough set's discernibility matrix to obtain attribute reduction, with using support vector machine to identify and classify the targets. According to the feature attribute, the effectiveness of identifying multi micro objects using support vector machine is compared with the proposed improved support vector machine classification method. The experiment results under micro vision environment show that the proposed improved support vector machine classification method can meet the system application requirement, with the resolution is 95%. © 2008 Asian Network for Scientific information.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Artificial immune network clustering algorithm based on support vector domain description

引用

Journal of Computational information Systems 2008年第4期4卷 1483-1488页

作者： Huang, Wenlong Jiao, Licheng Jia, Jian Key Laboratory of Intelligent Perception and Image Understanding Institute of Intelligent Information Processing Xidian University Xi'an 710071 China Troops No.95948 of PLA Lanzhou 732750 China

This paper aims at the combination of the artificial immune network and the support vector domain description for clustering. A new artificial immune antibody network is proposed. In the network, the antibody neighborhood is represented as a support vector hypersphere, and an adaptive learning coefficient is presented. The input data set is firstly divided into subsets by antibodies, then each subset is mapped into a hypersphere respectively in a high dimensional feature space by support vector domain description. Finally the clustering results of the local support vector hyperspheres are combined to yield a global clustering solution by the minimal spanning tree, which need not a predefined number of clustering. The experimental results with several data sets illustrate the effectiveness of the proposed algorithm.

关键词： Antibodies

来源：评论

学校读者我要写书评

暂无评论

Neutrosophic combination rules based on dempster-shafer theory and Dezert-Smarandache theory

引用

information Technology Journal 2008年第7期7卷 1023-1029页

作者： Gao, Jian Huang, Xinhan Wang, Min Li, Xinde Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Department of CSE HUST Wuhan 430074 China School of Automation Southeast University Nanjing 210096 China

Several neutrosophic combination rules based on the Dempster-Shafer theory (DST) and Dezert-Smarandache theory (DSmT) are presented in this study. The new information fusing approaches proposed the neutrosophic belief assignment to represent the evidences and connect the DST and DSmT with neutrosophic theory. Neutrosophic theory used the components truth, indeterminacy and falsity to represent any idea, which provides a better approach to express the real world. The DST-based and DSmT-based combination rules can fuse information more effectively. The new combination rules utilized the advantages of DST, DSmT and neutrosophic theory. They are more adapted to describing the human mind and helping to make correct decisions. To fuse the information expressed in natural language, the qualitative neutrosophic combination rules of information have been proposed in this study too. Some application examples have been given to support the proposed combination rules. Compared with the original DST-based and DSmT-based combination rules, the neutrosophic combination rules can provide more useful information and have wider application field. © 2008 Asian Network for Scientific information.

关键词： information fusion

来源：评论

学校读者我要写书评

暂无评论

On string languages generated by spiking neural P systems with exhaustive use of rules

引用

Natural Computing 2008年第4期7卷 535-549页

作者： Zhang, Xingyi Zeng, Xiangxiang Pan, Linqiang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China

We continue the study of (extended) spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators. Specifically, a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation constitutes a string. Two cases are considered: one of them interprets a step when no spike is emitted as a specified symbol, the other interprets such a step as the empty string. In both cases, it is proved that finite and recursively enumerable languages are characterized by extended spiking neural P systems working in the exhaustive mode. The relationships with regular languages are also investigated. © Springer Science+Business Media B.V. 2008.

关键词： Membrane computing Register machine SN P systems

来源：评论

学校读者我要写书评

暂无评论

Improved taboo search algorithm for designing DNA sequences

引用

Progress in Natural Science:Materials International 2008年第5期18卷 623-627页

作者： Kai Zhang a, Jin Xu a,b, Xiutang Geng a, Jianhua Xiao a, Linqiang Pana, a The key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China b School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints.

关键词： DNA computing Taboo search algorithm DNA sequence design

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optimization using an immunodominance and clonal selection inspired algorithm

引用

Science in China(Series F) 2008年第8期51卷 1064-1082页

作者： GONG MaoGuo JIAO LiCheng MA WenPing DU HaiFeng Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an 710071 China School of Public and Administration Xi'an Jiaotong University Xi'an 710049 China

Based on the mechanisms of immunodominance and clonal selection theory, we propose a new multiobjective optimization algorithm, immune dominance clonal multiobjective algorithm （IDCMA）. IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one of the nondominated individuals found so far. According to the values of Ab-Ab affinity, all dominated individuals （antibodies） are divided into two kinds, subdominant antibodies and cryptic antibodies. Moreover, local search only applies to the subdominant antibodies, while the cryptic antibodies are redundant and have no function during local search, but they can become subdominant （active） antibodies during the subsequent evolution. Furthermore, a new immune operation, clonal proliferation is provided to enhance local search. Using the clonal proliferation operation, IDCMA reproduces individuals and selects their improved maturated progenies after local search, so single individuals can exploit their surrounding space effectively and the newcomers yield a broader exploration of the search space. The performance comparison of IDCMA with MISA, NSGA-Ⅱ, SPEA, PAES, NSGA, VEGA, NPGA, and HLGA in solving six well-known multiobjective function optimization problems and nine multiobjective 0/1 knapsack problems shows that IDCMA has a good performance in converging to approximate Pareto-optimal fronts with a good distribution.

关键词： multiobjective optimization immunodominance clonal selection artificial immune systems evolutionaryalgorithms

来源：评论

学校读者我要写书评

暂无评论

Predictive protocol of flocks with small-world connection pattern

引用

Physical Review E 2009年第1期79卷 016113-016113页

作者： Hai-Tao Zhang Michael Z. Q. Chen Tao Zhou The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 People's Republic of China Department of Engineering University of Cambridge Cambridge CB2 1PZ United Kingdom Department of Engineering University of Leicester Leicester LE1 7RH United Kingdom Department of Electronic Engineering City University of Hong Kong Kowloon Hong Kong SAR People's Republic of China Department of Modern Physics University of Science and Technology of China Hefei 230026 People’s Republic of China Department of Physics University of Fribourg Chemin du Muse 3 Fribourg CH-1700 Switzerland

By introducing a predictive mechanism with small-world connections, we propose a new motion protocol for self-driven flocks. The small-world connections are implemented by randomly adding long-range interactions from the leader to a few distant agents, namely, pseudoleaders. The leader can directly affect the pseudoleaders, thereby influencing all the other agents through them efficiently. Moreover, these pseudoleaders are able to predict the leader’s motion several steps ahead and use this information in decision making towards coherent flocking with more stable formation. It is shown that drastic improvement can be achieved in terms of both the consensus performance and the communication cost. From the engineering point of view, the current protocol allows for a significant improvement in the cohesion and rigidity of the formation at a fairly low cost of adding a few long-range links embedded with predictive capabilities. Significantly, this work uncovers an important feature of flocks that predictive capability and long-range links can compensate for the insufficiency of each other. These conclusions are valid for both the attractive and repulsive swarm model and the Vicsek model.

关键词： pattern formation protocols random processes 3-DIMENSIONAL LATTICE MODEL DYNAMICAL COMPLEX NETWORKS REPULSIVE INTERACTIONS STABILITY ANALYSIS ATTRACTIVE FORCES SENSOR NETWORKS ANIMAL GROUPS AGENTS TRANSITIONS CONSENSUS

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fusion Algorithm for Remote Sensing images Based on Nonsubsampled Contourlet Transform

引用

自动化学报 2008年第3期34卷 274-281页

作者： YANG Xiao-Hui JIAO Li-Cheng Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information ProcessingXidian UniversityXi＇an 710071P.R.China

就图象的人的视觉系统和特征而言，新奇图象熔化策略为在 nonsubsampled contourlet 的高分辨率图象和 multispectral 图象转变的 panchro matic (NSCT ) 被介绍域。NSCT 能由它好 multiresolution，移动不变性，和高 directionality ... 详细信息

就图象的人的视觉系统和特征而言，新奇图象熔化策略为在 nonsubsampled contourlet 的高分辨率图象和 multispectral 图象转变的 panchro matic (NSCT ) 被介绍域。NSCT 能由它好 multiresolution，移动不变性，和高 directionality 的特征的优点在图象给 asymptotic 边和轮廓的最佳的表示。紧张部件增加策略基于 LHS 变换被介绍进 NSCT 领域保存空间分辨率和颜色内容。熔化方法建议了的实验表演能改进空间分辨率并且保留光谱信息同时，并且与传统的原则部件分析( PCA )相比在视觉效果和量的肛门 ysis 两个都有改进方法， intensity-hue-saturation (代表耶稣之符号)变换技术，小浪变换加权的熔化方法，相应小浪基于变换的熔化方法，和 contourlet 基于变换的熔化方法。

关键词：混合算法遥感图象强度组分添加非子采样Contourlet变换 LHS变换

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：