基于相似度的双搜索多目标识别算法

在分析远距离多目标特性的基础上,提出了一种基于相似度的粗精双搜索多目标识别算法。在粗搜索阶段,首先利用圆形形态学模板在滤波后的二值化图像中快速搜索候选目标,再利用"距离相似度"原则进行候选目标的聚类分析,以同一目标内各候选目标点的形心位置作为局部熵处理区域中心。在精搜索阶段,以最大熵值点为种子点进行目标区域生长。为了减少运算量,提高实时性,还采用基于熵相似度、简单连接法与子区合并法相结合的改进型区域生长法,重构单个目标。仿真结果表明该算法可快速、准确地实现对5个目标的识别。

Similarity measure on intuitionistic fuzzy sets

Study of fuzzy entropy and similarity measure on intuitionistic fuzzy sets (IFSs) was proposed and analyzed. Unlike fuzzy set, IFSs contain uncertainty named hesitance, which is contained in fuzzy membership function itself. Hence, designing fuzzy entropy is not easy because of many entropy definitions. By considering different fuzzy entropy definitions, fuzzy entropy on IFSs is designed and discussed. Similarity measure was also presented and its usefulness was verified to evaluate degree of similarity.

Quantitative comparison of similarity measure and entropy for fuzzy sets

Comparison and data analysis with the similarity measures and entropy for fuzzy sets were carried out. The distance proportional value between the fuzzy set and the corresponding crisp set was considered by the fuzzy entropy. The relation between the similarity measure and the entropy for fuzzy set was also analyzed. The fuzzy entropy was reformulated as the dissimilarity measure. Furthermore, crisp set having the minimum uncertainty with respect to the corresponding fuzzy set was also proposed. Finally, derivation of a similarity measure from entropy with the help of total information property was derived. A simple example shows the relation between similarity measure and fuzzy entropy, in which the summation of similarity measure and fuzzy entropy represents a constant value.

改进伪并行遗传算法求解作业车间调度问题

针对遗传算法在求解极复杂优化问题中出现的过早收敛、执行效率差的缺点,提出了一种改进的伪并行遗传算法.该算法将并行进化与串行搜索相结合,提高了算法的收敛速度.同时该算法通过种群因子控制伪并行算法中的各子种群的规模,不仅保证了搜索过程中勘探和开采的平衡,克服过早收敛,而且减少了计算的复杂性,特别是在处理复杂优化问题上具有较高的性能.实验结果证明了该算法的有效性.