TY - JOUR
T1 - Pixel-jump fast image matching algorithm based on LTS-HD
AU - Fu, Yan Jun
AU - Cheng, Yong Mei
AU - Pan, Quan
AU - Sun, Kai Feng
PY - 2010/7
Y1 - 2010/7
N2 - By analyzing the characteristics of the HD measure, a real-time two-level scene matching algorithm is proposed. Compared with traditional image multi-scale feature decomposition matching methods, the proposed method is performed directly on the original resolution image and shortens the matching time by reducing both the number of match points and the computation complexity of similarity measure. The pixel-jump method decreases the participated match points greatly, and the computation of LTS-HD at each point is performed between sets consisted of only feature points, which efficiently simplify the computation of similarity measure. To ensure the match precision, a coarse-to-fine two-level matching strategy is adopted. 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 matching method takes less time than both the point-by-point searching and the genetic algorithm, and that the match point is correct even though the actual image is occluded severely.
AB - By analyzing the characteristics of the HD measure, a real-time two-level scene matching algorithm is proposed. Compared with traditional image multi-scale feature decomposition matching methods, the proposed method is performed directly on the original resolution image and shortens the matching time by reducing both the number of match points and the computation complexity of similarity measure. The pixel-jump method decreases the participated match points greatly, and the computation of LTS-HD at each point is performed between sets consisted of only feature points, which efficiently simplify the computation of similarity measure. To ensure the match precision, a coarse-to-fine two-level matching strategy is adopted. 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 matching method takes less time than both the point-by-point searching and the genetic algorithm, and that the match point is correct even though the actual image is occluded severely.
KW - Genetic algorithm
KW - Hausdorff distance
KW - Hierarchical matching
KW - Point-by-point matching
UR - http://www.scopus.com/inward/record.url?scp=77955808782&partnerID=8YFLogxK
U2 - 10.3788/gzxb20103907.1284
DO - 10.3788/gzxb20103907.1284
M3 - 文章
AN - SCOPUS:77955808782
SN - 1004-4213
VL - 39
SP - 1284
EP - 1288
JO - Guangzi Xuebao/Acta Photonica Sinica
JF - Guangzi Xuebao/Acta Photonica Sinica
IS - 7
ER -