Abstract
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.
| Original language | English |
|---|---|
| Pages | 2202-2205 |
| Number of pages | 4 |
| State | Published - 2004 |
| Event | 2004 7th International Conference on Signal Processing Proceedings (ICSP'04) - Beijing, China Duration: 31 Aug 2004 → 4 Sep 2004 |
Conference
| Conference | 2004 7th International Conference on Signal Processing Proceedings (ICSP'04) |
|---|---|
| Country/Territory | China |
| City | Beijing |
| Period | 31/08/04 → 4/09/04 |
Keywords
- Corresponding points
- Evolutionary programming
- Multi-view
- Regulation of the minimum summation of euclid distance
Fingerprint
Dive into the research topics of 'The research of the match of corresponding points in multi-view and the realization by evolutionary programming'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver