| 基于度的枝切线优化策略 |
| |
| 引用本文： | 张会战,独知行,陶秋香,贾光帅.基于度的枝切线优化策略[J].测绘科学,2013,38(2):96-97. |
| |
| 作者姓名： | 张会战 独知行 陶秋香 贾光帅 |
| |
| 作者单位： | 1. 内蒙古科技大学,内蒙古包头,014010
2. 山东科技大学,山东青岛,266510 |
| |
| 基金项目： | 内蒙古自治区自然科学基金，内蒙古自治区高等学校科学技术研究项目，内蒙古科技大学创新基金项目 |
| |
| 摘 要： | 本文通过对Goldstein枝切算法的研究和分析,针对它的枝切线连接策略中存在的缺陷,采用基于度的最短路径算法改进了枝切线的连接策略,消除了Goldstein枝切线中的圈和贯通枝切线,减少了孤立区域;与Prim算法相比,在兼顾运算效率的条件下有效地改善了解缠结果。
|
| 关 键 词： | 基于度的最短路径算法 枝切线优化策略 孤立区域 Prim算法 |
An optimization strategy of Goldstein Branch-cuts based on degrees |
| |
| ZHANG Hui-zhan,DU Zhi-xing,TAO Qiu-xaing,JIA Guang-shuai.An optimization strategy of Goldstein Branch-cuts based on degrees[J].Science of Surveying and Mapping,2013,38(2):96-97. |
| |
| Authors: | ZHANG Hui-zhan DU Zhi-xing TAO Qiu-xaing JIA Guang-shuai |
| |
| Institution: | ②(①Inner Mogolia University of Science and Technology,Inner Mogolia Baotou 014010,China;②Shandong University of Science and Technology,Shandong Qingdao 266510,China) |
| |
| Abstract: | The shortest path based on degrees was put forward to improve Goldstein Branch-cut after Goldstein Algorithm was studied and analyzed.It eliminated loops and the branch-cuts which traverse interference pattern.As a result,it could reduce the number and the size of isolation regions,and improve the result of the phase unwrapping,in comparison with Prim's algorithm. |
| |
| Keywords: | shortest path based on degrees an optimization strategy of Branch-cuts isolation region Prim algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
