基于拟牛顿和遗传算法的三维人脸建模

用网格重采样算法和点变形技术把不同人脸纹理全景图进行标准化,实现三维人脸的像素级对齐;根据在不同姿态下用拟牛顿法优化目标函数优化速度的不同和提取的人脸特征点精确计算出输入图像中人脸的姿态;确定三维人脸模型在此姿态下的可见点,最后利用改进的实数遗传算法进行匹配计算,建立完整的三维人脸模型。实验表明,此算法能实现三维人脸像素级的精确对齐,快速的精确计算输入图像中人脸的姿态,减少优化参数,简化目标函数,提高模型匹配效率和重构精度,缩短匹配时间。     

An infeasible-interior-point potential-reduction algorithm for linear programming

n . The method is based on Rockafellar’s proximal point algorithm and a cutting-plane technique. At each step, we use an approximate proximal point p^a(x_k) of x_k to define a v_k∈∂_εkf(p^a(x_k)) with ε_k≤α∥v_k∥, where α is a constant. The method monitors the reduction in the value of ∥v_k∥ to identify when a line search on f should be used. The quasi-Newton step is used to reduce the value of ∥v_k∥. Without the differentiability of f, the method converges globally and the rate of convergence is Q-linear. Superlinear convergence is also discussed to extend the characterization result of Dennis and Moré. Numerical results show the good performance of the method. Received October 3, 1995 / Revised version received August 20, 1998 Published online January 20, 1999     

CONVERGENCE PROPERTIES OF MULTI-DIRECTIONAL PARALLEL ALGORITHMS FOR UNCONSTRAINED MINIMIZATION

Convergence properties of a class of multi-directional parallel quasi-Newton algorithmsfor the solution of unconstrained minimization problems are studied in this paper.At eachiteration these algorithms generate several different quasi-Newton directions,and thenapply line searches to determine step lengths along each direction,simultaneously.Thenext iterate is obtained among these trail points by choosing the lowest point in the sense offunction reductions.Different quasi-Newton updating formulas from the Broyden familyare used to generate a main sequence of Hessian matrix approximations.Based on theBFGS and the modified BFGS updating formulas,the global and superlinear convergenceresults are proved.It is observed that all the quasi-Newton directions asymptoticallyapproach the Newton direction in both direction and length when the iterate sequenceconverges to a local minimum of the objective function,and hence the result of superlinearconvergence follows.     

一种基于多普勒效应的拟牛顿室内定位算法

针对现有室内定位方法,根据目标节点在运动过程中与参考信标节点间产生的多普勒效应,得到一种距离差测量方法,避免了对目标节点与信标节点间时钟同步的要求.为实现此距离差定位,提出了一种基于拟牛顿法的室内定位算法.随机选取初始猜测值,得到一个测量点的距离差信息,由此迭代得到单个测量点坐标,再将所有测得的相对位置坐标进行整体迭代并调整初始位置,直到得到稳定的初始位置,实现定位.Matlab仿真结果表明,在信噪比SNR=10时,定位误差不超过0.5m.同时,为提高定位速度和成功率,尝试用粒子群算法求初始猜测值,进一步提高算法的性能.