摘要
Present a corresponding point match algorithm based on "The Regulation of the Minimum Summation of Euclid Distance". This algorithm gives the regulation that makes the corresponding points match to the highest accuracy according to the condition that the relative position is almost fixed for corresponding points in adjoining area if two images are acquired by means of multi-view. This match algorithm is realized by evolutionary programming. By experiment on PC, the result demonstrates that it can match the most corresponding points in low time cost.
源语言 | 英语 |
---|---|
页 | 2202-2205 |
页数 | 4 |
出版状态 | 已出版 - 2004 |
活动 | 2004 7th International Conference on Signal Processing Proceedings (ICSP'04) - Beijing, 中国 期限: 31 8月 2004 → 4 9月 2004 |
会议
会议 | 2004 7th International Conference on Signal Processing Proceedings (ICSP'04) |
---|---|
国家/地区 | 中国 |
市 | Beijing |
时期 | 31/08/04 → 4/09/04 |