A Fast Scene Matching Algorithm Based on Pixel-Jump Method
According to the image matching demands of both the precision and instantaneity, a real-time two-level scene matching algorithm is proposed based on the least trimmed square Hausdorff distance (LTS-HD). In the first level, a coarse match point is obtained using pixel-jump searching through the refer...
Saved in:
Published in | 2009 International Symposium on Computer Network and Multimedia Technology pp. 1 - 4 |
---|---|
Main Authors | , , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2009
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | According to the image matching demands of both the precision and instantaneity, a real-time two-level scene matching algorithm is proposed based on the least trimmed square Hausdorff distance (LTS-HD). In the first level, a coarse match point is obtained using pixel-jump searching through the reference image. In the second level, a point-by-point local searching is performed to get the accurate match point within the ¿ -neighborhood around the coarse point. Simulation results show that the proposed image matching algorithm takes little time and the point is correct. |
---|---|
ISBN: | 9781424452729 1424452724 |
DOI: | 10.1109/CNMT.2009.5374699 |