| 一种快速景象匹配方法的研究 |
| |
| 引用本文： | 李鹏. 一种快速景象匹配方法的研究[J]. 盐城工学院学报(自然科学版), 2004, 17(3): 23-25 |
| |
| 作者姓名： | 李鹏 |
| |
| 作者单位： | 南京航空航天大学,自动化学院,江苏,南京,210016 |
| |
| 摘 要： | 将变阈值SSDA算法、遗传算法及分层搜索三者结合起来用于景象匹配中，从而既保留了SSDA算法的强抗干扰能力及其对匹配景象几何畸变有较好的鲁棒性，又进一步改善了SSDA算法的匹配速度，使景象匹配具有较高的实时性。
|
| 关 键 词： | SSDA算法 变阈值 遗传算法 分层搜索 景象匹配 |
| 文章编号： | 1671-5322(2004)03-0023-03 |
| 修稿时间： | 2004-03-15 |
A research of fast image matching method |
| |
| LI Peng. A research of fast image matching method[J]. Journal of Yancheng Institute of Technology(Natural Science Edition), 2004, 17(3): 23-25 |
| |
| Authors: | LI Peng |
| |
| Affiliation: | Automation Academy, Nanjing University of Aeronautics and Astronautics, Jiangsu Nanjing 210016,China |
| |
| Abstract: | In this article, by drawing alterable threshold SSDA algorithm , genetic algorithms and delamination into a matching course, a fast image matching algorithm is presented. From the experimental results, we can draw the conclusion that the fast matching algorithm is not only of retaining the capability of restraining the noise of SSDA algorithm and the capability of restraining geometry aberration, but also of improving farther the matching speed of SSDA algorithm. |
| |
| Keywords: | SSDA algorithm alterable threshold genetic algorithms delamination search image matching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《盐城工学院学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《盐城工学院学报(自然科学版)》下载全文 |
