中心路径

方法应用中心路径的性质及NCP函数，构造了求解半定规划的光滑化方法。

Methods Exploiting some characterizations of the central path and the NCP function , a smoothing-type method for the solution of semidefinite programs are derived .

多目标半定规划的加权中心路径法

The Weighted Central Path Method for Multiobjective Semidefinite Programming

基于Hessian矩阵的中心路径提取算法

Centerline Extraction Based on Hessian Matrix

提出了一种基于Hessian矩阵的中心路径提取算法。

In this paper , a new centerline extraction algorithm based on Hessian Matrix is proposed .

采用改进Hopfield方法结合孔群加工的最优化目标函数进行钻削加工中心路径的优化。

Adopting an improved Hopfield algorithm and holes machining route optimization functions , the center route was optimized in drilling and cutting process .

为了保持漫游过程中的连续性，用Cardinal三次样条曲线对中心路径进行了平滑处理。

In order to maintain the continuity when flying through , this thesis uses a cardinal cubic spline curve to smooth the center path .

文章的最后通过数值实验将该算法与Ye的解决线性规划的中心路径算法进行了比较。比较的结果显示新的算法从各个方面都要优于Ye的算法。

In the last section , we compared this new algorithm with the algorithm of Ye 's central-path algorithm , the result shows that this new algorithm is better than Ye 's central-path algorithm .

基于双距离场的三维中心路径提取算法

A 3-D Center Path Finding Algorithm Base on Two Distance Fields

基于边界距离场的管腔中心路径自动提取算法

An Automatic Centerline Extraction Algorithm Based on Distance from Boundary Field

在此基础上，结合文中提出的中心路径函数，给出了求解箱约束单调变分不等式的内点算法。

On the basic of it , we present the interior-point algorithm .

一种新颖的三维脑血管中心路径提取算法

A Novel 3D Centerline Extraction of Brain Blood Vessel

虚拟内窥镜中心路径抽取技术

A study on extracting centerline in virtual endoscopy

一种新的抽取中心路径算法

A new algorithm for extracting center path

通过判断中心路径点中任意两点之间的关系决定是否将其相连，最终得到三维血管的中心路径。

Finally the path is generated by measuring the relationship between arbitrary two of the centerline points .

另外，在研究中提出了利用元胞自动机模型进行虚拟内窥镜中心路径提取算法，利用元胞的演进进行中心路径搜索。

Besides , it proposes the VE center path search algorithm by using cellular automata model . 5 .

结果给出了虚拟内窥镜中心路径的定义，总结了中心路径的基本特性。

Results A definition of center path in virtual endoscopy is presented and its properties are also summarized .

拓扑细化算法可以有效的提取中心路径，但是耗时很长，严重的影响了该算法的实用性。

Topological thinning is an efficient method to do this job , but the procedure is quite time consuming .

虚拟大肠镜的中心路径提取是本文的核心问题之一，为了保证虚拟大肠镜系统辅助检查的实时性，大肠中心路径的提取算法必须满足实时性要求。

To guarantee real-time property of the virtual colonoscopy detection system , the centerline extraction should be extracted quickly .

基于中心路径大邻域上的一类非单调线性互补问题的高阶可行内点算法

High-order feasible interior point algorithms for a class of Nonmonotonic Linear Complementary Problems Based on large neighborhoods of central path

该方法所采用的系统不是等价于中心路径条件，而是等价于最优性条件本身。

The system which is employed in this method is equivalent to the optimality conditions and not to the central path conditions .

结论在虚拟人脑内窥镜系统中实现了中心路径的提取，用于器官内窥检查，效果良好。

Conclusion A center path is extracted and integrated into an human brain virtual endoscopy system that has a good effect in clinic .

在路径规划方面，深入研究了拓扑细化算法，在事先建立查找表思想的基础上，提出了一种结合最小堆和区域增长的快速中心路径抽取算法。

In path planning , this thesis studies the Topological Thinning algorithm and proposes a fast algorithm using a look-up table based on min-heap and region growing .

此外，文中提出的曲面重建方法和不同的中心路径提取算法具有一定的通用性，为管腔可视化技术的理论研究与应用推广提供了新的思路。

Besides , curved planar reformation and several different centerline extraction algorithms proposed in this paper have generality and enrich the theories and applications of vascular structures visualization .

虚拟旋转的基本思想是利用计算机将将空腔结构以其中心路径为轴进行非刚性旋转，从而将内角部位的图像转到外角。

The main idea of virtual rotation is to rotate the hollow structures with the centerline as the axis to rotate the internal angle part to the external angle .

这样，空腔结构内表面上的每一点就都能够沿着电场线外翻到空腔外部。这些电场线既可以由模拟带电荷的中心路径点，也可以由邻域表面上的采样点所生成。

Thus , each point on the inner surface of a hollow structure can be everted outside along the elec-trical force lines generated either from charged centerline points or from sampling points onthe neighboring surface .

第四章把凸二次规划转化为线性互补问题，讨论了线性互补问题解存在的条件，并给出了求解互补问题的中心路径算法，同时分析了其收敛性。

In chapter four , the convex quadratic programming is firstly transformed into linear complementarity problem , then the existence conditions of solution to linear complementarity problem are discussed and central path algorithm for linear complementarity problem is given .

在PPI网络聚类过程中，蛋白质结点根据它们距离聚类中心的路径上的信息素的浓度以及对应的状态转移概率判断是否归并到该聚类中心所在的聚类模块中。

During the procedure of clustering PPI network , whether the protein node is merged into the cluster including the cluster center depends on the density of pheromone and corresponding state transition probability on the path from the protein node to the cluster center .

上海建设国际银行业中心的路径和动力

The Path and Driving Force in Developing Shanghai as an International Banking Center

也可以结合热带气旋中心的路径预报，作沿海局地各时次的风力预报。

And the relationship with track forecasting of cyclone centre can predict local wind .

构建国际金融中心的路径

Path to Construction of International Financial Center