arrow
Return

Robust scene matching method based on sparse representation and iterative correction

delete2017-04-01
delete9
PRE
AI
S
Sai Yang
B
Bo Xiao
L
Liping Yan *
Y
Yuanqing Xia
M
Mengyin Fu
刘扬 (Yang Liu)
DOI:10.1016/j.imavis.2016.11.009delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This article presents an efficient scene matching method robust to noise and occlusion. The method combines a coarse matching method with a fine matching method by iterative correction. Both coarse matching method and fine matching method, inspired by sparse representation for face recognition, are resistant to noise and occlusion inherently. In each step of iterative matching, the result of coarse matching is introduced into fine matching as prior knowledge, which gives a rough range about the possible positions. Then, the fine matching finds the most reasonable result based on the rough range given by coarse matching. Finally, the result of fine matching is brought back to coarse matching as post knowledge to correct it. Experiments demonstrate that the robustness to noise and occlusion is improved compared with the matching methods without iterative correction. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Scene matching
Sparse representation
Iterative correction
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Image and Vision Computing cover
Image and Vision Computing
IF:
4.2
Papers:
4.0K
Citations:
6.7K

Organization

B
beijing university of posts & telecommunications
Scholars:
1.4W
Papers: 1.2W
Citations: 9
B
beijing institute of technology
Scholars:
5.4W
Papers: 3.9W
Citations: 63