基于粒子群优化的Wiener模型辨识与实例研究

针对一类工业过程中可描述成Wiener模型的非线性系统,其辨识问题可等价成以估计参数为优化变量的非线性极小值优化问题．利用粒子群优化(PSO)算法在整个参数空间内并行搜索获得极小值优化问题的最优解(Wiener模型的最优估计),通过对粒子的迭代轨迹进行分析,改进了PSO算法中惯性权重和学习因子的选择．通过一个Wiener模型的数值仿真验证了本文提出的辨识方法的有效性和实用性,并将该方法应用在连续退火机组加热炉产品质量模型的辨识研究,取得了满意的辨识效果．     

基于粒子群优化算法的滤波器优化

给出一种基于粒子群优化算法（PSO）的模拟滤波器优化设计方法。传统的模拟滤波器的精度与效率均较差,引入PSO算法可对滤波器参数进行寻优。将滤波器的设计问题转化为滤波器参数的优化问题,然后利用粒子群优化算法对整个参数空间进行高效搜索以获得最优解;通过变异、重新随机化及采用自适应的惯性权重,提高了算法的搜索效率及收敛性。实例计算表明了算法在该类问题中的有效性和可行性。     

粒子群分形进化算法

在传统粒子群优化(PSO)算法的基础上,提出粒子群分形进化算法(FEPSO).FEPSO利用分形布朗运动模型中的无规则运动特性模拟优化目标函数未知特性,隐含的趋势变化模拟优化目标函数极值变化的总趋势,从而克服个体过于随机进化和早熟的现象.与传统的PSO算法相比,文中算法中每个粒子包含分形进化阶段.在分形进化阶段,粒子在解的子空间以不同的分形参数进行分形布朗运动方式搜索解空间,并对其分量进行更新.仿真实验结果表明,该算法对大部分标准复合测试函数都具有较强的全局搜索能力,其性能超过国际上最近提出的基于PSO的改进算法.     

基于改进粒子群算法的Hammerstein模型辨识

提出辨识非线性Hammerstein模型的新方法。将非线性系统的辨识问题转化为参数空间上的函数优化问题,采用粒子群算法获得该优化问题的解。为了进一步增强粒子群优化算法的辨识性能,提出采用速度变异粒子群对整个参数空间进行搜索得到系统参数的最优估计。仿真结果验证了该方法的有效性。     

粒子群算法求解连续优化问题的性能分析

粒子群优化(PSO)算法是一类有效的随机全局优化技术,适用于求解连续优化问题.它利用一个粒子群搜索解空间,通过粒子间的相互作用发现复杂搜索空间中的最优区域.本文介绍了基本的PSO算法,使用3类代表性的标准测试函数对粒子群算法进行了实验分析,并进一步讨论了PSO算法的寻优性能,提出了PSO求解连续优化问题的性能分析策略.     

基于QPSO算法的RBF神经网络参数优化仿真研究

针对粒子群优化(PSO)算法搜索空间有限，容易陷入局部最优点的缺陷，提出一种以量子粒子群优化(QPSO)算法为基础的RBF神经网络训练算法，将RBF神经网络的参数组成一个多维向量，作为算法中的粒子进行进化，由此在可行解空间范围内搜索最优解。实例仿真表明，该学习算法相比于传统的学习算法计算简单，收敛速度快，并由于其算法模型的自身特性比基于PSO的学习算法具有更好的全局收敛性能。     

多量子粒子群协同优化算法研究

针对标准粒子群优化（PSO）算法及其改进算法存在的局部收敛与收敛速度问题,提出了一种多量子粒子群协同优化（QPSCO）方法。该算法采用双层的多粒子群协同优化结构：用多个量子粒子群在底层独立地搜索解空间,同时引入参数变异策略,以扩大搜索范围;上层用1个量子粒子群追逐当前全局最优解,并对飞离搜索区域粒子的位置用新位置取代,以加快算法收敛。在此基础上,将该算法应用于实际控制系统低阶时滞对象的PID控制器设计中。仿真结果表明,QPSCO是一种有效的参数优化算法,与标准PSO、QPSO等算法相比具有更好的全局收敛性能。     

一种改进的粒子群优化算法

作为群体智能的代表性方法之一,粒子群优化算法(PSO)通过粒子间的竞争和协作以实现在复杂搜索空间中寻找全局最优点。提出了一种改进的粒子群优化算法(MPSO),该算法以广泛学习粒子群优化算法(CLPSO)的思想为基础,主要引入了选择墙的概念。同时在参数的设置中结合高斯分布的概念,以提高算法的收敛性。实验结果表明,改进后的粒子群算法防止陷入局部最优的能力有了明显的增强。同时,算法使高维优化问题中全局最优解相对搜索空间位置的鲁棒性得到了明显提高。     

多目标粒子群优化算法在柔性车间调度中的应用

将粒子群优化(Particle Swarm Optimization,PSO)算法和混沌搜索方法结合在一起,提出一种求解多目标柔性作业车间调度问题(Flexible job shop scheduling problem,FJSP)的新算法,利用混沌对PSO的参数进行自适应优化来有效平衡算法的全局搜索和局部开挖能力,并采用混沌局部优化策略来改善算法的搜索性能.此外,为了搜索到问题的所有非劣解,采用基于模糊逻辑的适应度函数来评价粒子.对于四个典型FJSP实例的实验验证了算法的可行性和有效性.     

一类新颖的粒子群优化算法

粒子群优化(PSO)是一类有效的随机全局优化技术。它利用一个粒子群搜索解空间,每个粒子表示一个被优化问题的解,通过粒子间的相互作用发现复杂搜索空间中的最优区域。提出一类新颖的PSO算法,该算法在基本PSO算法的粒子位置更新公式中增加了一个积分控制项。积分控制项根据每个粒子的适应值决定粒子位置的变化,改善了PSO算法摆脱局部极小点的能力。另外,该算法增加了限制搜索空间范围的机制,这对某些函数优化问题是必需的。用5个基准函数做的对比实验结果显示,该算法优于基本PSO算法以及自适应修改惯性因子的PSO算法。     

Solution of the Simultaneous Pose and Correspondence Problem Using Gaussian Error Model

The use of hypothesis verification is recurrent in the model-based recognition literature. Verification consists in measuring how many model features transformed by a pose coincide with some image features. When data involved in the computation of the pose are noisy, the pose is inaccurate and difficult to verify, especially when the objects are partially occluded. To address this problem, the noise in image features is modeled by a Gaussian distribution. A probabilistic framework allows the evaluation of the probability of a matching, knowing that the pose belongs to a rectangular volume of the pose space. It involves quadratic programming, if the transformation is affine. This matching probability is used in an algorithm computing the best pose. It consists in a recursive multiresolution exploration of the pose space, discarding outliers in the match data while the search is progressing. Numerous experimental results are described. They consist of 2D and 3D recognition experiments using the proposed algorithm.     

Least-squares estimation of anisotropic similarity transformations from corresponding 2D point sets

Pose estimation is a problem that occurs in many applications. In machine vision, the pose is often a 2D affine pose. In several applications, a restricted class of 2D affine poses with five degrees of freedom consisting of an anisotropic scaling, a rotation, and a translation must be determined from corresponding 2D points. A closed-form least-squares solution for this problem is described. The algorithm can be extended easily to robustly deal with outliers.     

Car model recognition by utilizing symmetric property to overcome severe pose variation

This paper presents a mirror morphing scheme to deal with the challenging pose variation problem in car model recognition. Conventionally, researchers adopt pose estimation techniques to overcome the pose problem, whereas it is difficult to obtain very accurate pose estimation. Moreover, slight deviation in pose estimation degrades the recognition performance dramatically. The mirror morphing technique utilizes the symmetric property of cars to normalize car images of any orientation into a typical view. Therefore, the pose error and center bias can be eliminated and satisfactory recognition performance can be obtained. To support mirror morphing, active shape model (ASM) is used to acquire car shape information. An effective pose and center estimation approach is also proposed to provide a good initialization for ASM. In experiments, our proposed car model recognition system can achieve very high recognition rate (>95%) with very low probability of false alarm even when it is dealing with the severe pose problem in the cases of cars with similar shape and color.     

基于仿射变换和线性回归的3D人脸姿态估计方法

提出了一种由仿射变换关系到线性回归的3D人脸空间姿态估计方法。即跟踪到人脸特征点后，根据仿射变换关系得到人脸姿态的粗估计值，以这个粗估计值作为人脸姿态的初始值，再通过线性回归迭代求得人脸姿态的精确值。实验结果表明，该方法在较大的姿态变化范围内，具有良好的估计精确度和鲁棒性。     

Coupled Action Recognition and Pose Estimation from Multiple Views

Action recognition and pose estimation are two closely related topics in understanding human body movements; information from one task can be leveraged to assist the other, yet the two are often treated separately. We present here a framework for coupled action recognition and pose estimation by formulating pose estimation as an optimization over a set of action-specific manifolds. The framework allows for integration of a 2D appearance-based action recognition system as a prior for 3D pose estimation and for refinement of the action labels using relational pose features based on the extracted 3D poses. Our experiments show that our pose estimation system is able to estimate body poses with high degrees of freedom using very few particles and can achieve state-of-the-art results on the HumanEva-II benchmark. We also thoroughly investigate the impact of pose estimation and action recognition accuracy on each other on the challenging TUM kitchen dataset. We demonstrate not only the feasibility of using extracted 3D poses for action recognition, but also improved performance in comparison to action recognition using low-level appearance features.     

Hopfield neural networks for affine invariant matching

The affine transformation, which consists of rotation, translation, scaling, and shearing transformations, can be considered as an approximation to the perspective transformation. Therefore, it is very important to find an effective means for establishing point correspondences under affine transformation in many applications. In this paper, we consider the point correspondence problem as a subgraph matching problem and develop an energy formulation for affine invariant matching by a Hopfield type neural network. The fourth-order network is investigated first, then order reduction is done by incorporating the neighborhood information in the data. Thus we can use the second-order Hopfield network to perform subgraph isomorphism invariant to affine transformation, which can be applied to an affine invariant shape recognition problem. Experimental results show the effectiveness and efficiency of the proposed method.     

Pose Estimation for 3D Workpiece Grasping in Industrial Environment Based on Evolutionary Algorithm

In industrial fields, precise pose of a 3D workpiece can guide operations like grasping and assembly tasks, thus precise estimation of pose of a 3D workpiece has received intensive attention over the last decades. When utilizing vision system as the source of pose estimation, it is difficult to get the pose of a 3D workpiece from the 2D image data provided by the vision system. Conventional methods face the complexity of model construction and time consumption on geometric matching. To overcome these difficulties, this paper proposes a search-based method to determine appropriate model and pose of a 3D workpiece that match the 2D image data. Concretely, we formulate the above problem as an optimization problem aiming at finding appropriate model parameters and pose parameters which minimizes the error between the notional 2D image (given by the model/pose parameters being optimized) and the real 2D image (provided by the vision system). Due to the coupling of model and pose parameters and discontinuity of the objective function, the above optimization problem cannot be tackled by conventional optimization techniques. Hence, we employ an evolutionary algorithm to cope with the optimization problem, where the evolutionary algorithm utilizes our problem-specific knowledge and adopts a hierarchical coarse-to-fine style to meet the requirement of online estimation. Experimental results demonstrate that our method is effective and efficient.     

结合稀疏表示和深度学习的视频中3D人体姿态估计

目的 2D姿态估计的误差是导致3D人体姿态估计产生误差的主要原因,如何在2D误差或噪声干扰下从2D姿态映射到最优、最合理的3D姿态,是提高3D人体姿态估计的关键。本文提出了一种稀疏表示与深度模型联合的3D姿态估计方法,以将3D姿态空间几何先验与时间信息相结合,达到提高3D姿态估计精度的目的。方法 利用融合稀疏表示的3D可变形状模型得到单帧图像可靠的3D初始值。构建多通道长短时记忆MLSTM（multi-channel long short term memory）降噪编/解码器,将获得的单帧3D初始值以时间序列形式输入到其中,利用MLSTM降噪编/解码器学习相邻帧之间人物姿态的时间依赖关系,并施加时间平滑约束,得到最终优化的3D姿态。结果 在Human3.6M数据集上进行了对比实验。对于两种输入数据：数据集给出的2D坐标和通过卷积神经网络获得的2D估计坐标,相比于单帧估计,通过MLSTM降噪编/解码器优化后的视频序列平均重构误差分别下降了12.6%,13%;相比于现有的基于视频的稀疏模型方法,本文方法对视频的平均重构误差下降了6.4%,9.1%。对于2D估计坐标数据,相比于现有的深度模型方法,本文方法对视频的平均重构误差下降了12.8%。结论 本文提出的基于时间信息的MLSTM降噪编/解码器与稀疏模型相结合,有效利用了3D姿态先验知识,视频帧间人物姿态连续变化的时间和空间依赖性,一定程度上提高了单目视频3D姿态估计的精度。     

Probabilistic Modeling and Recognition of 3-D Objects

This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical tool for stochastic modeling. The algorithmic part introduces methods for automatic model generation, localization, and recognition of objects. 2-D images are used for learning the statistical appearance of 3-D objects; both the depth information and the matching between image and model features are missing for model generation. The implied incomplete data estimation problem is solved by the Expectation Maximization algorithm. This leads to a novel class of algorithms for automatic model generation from projections. The estimation of pose parameters corresponds to a non-linear maximum likelihood estimation problem which is solved by a global optimization procedure. Classification is done by the Bayesian decision rule. This work includes the experimental evaluation of the various facets of the presented approach. An empirical evaluation of learning algorithms and the comparison of different pose estimation algorithms show the feasibility of the proposed probabilistic framework.