A Fast Matching Algorithm with Feature Points Based on NCC

DOI

10.2991/iaw-sc.2013.217How to use a DOI?

Keywords

Image matching; feature point; normalized cross-correlation(NCC); histogram of gradient orientation (HOG); matching matrix

Abstract

Featured with high anti-noise ability and precision, normalized cross-correlation (NCC) algorithm is broadly used in the feature point matching. However, it’s not applied to the real-time processing because of the complexity of searching procedure and the great calculation quantity. To solve these problems, an improved NCC matching procedure is provided in this paper. First, the direction parameters of the feature points are abstracted with the histogram of gradient orientation (HOG), the pairs of the feature point in different gradient direction are filtered, and the matching matrix is used to get the right matching pair in order to avoid the repeated searching procedure. It can be included from the experiment result that the algorithm is not only characterized with good matching efficiency, but also can improve the calculation speed, which is good for the real-time processing and image matching with small amount of rotation.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Bo Yi
AU  - Ping Yu
AU  - Guo-zhu He
AU  - Jing Chen
PY  - 2013/10
DA  - 2013/10
TI  - A Fast Matching Algorithm with Feature Points Based on NCC
BT  - Proceedings of the 2013 International Academic Workshop on Social Science
PB  - Atlantis Press
SP  - 955
EP  - 958
SN  - 1951-6851
UR  - https://doi.org/10.2991/iaw-sc.2013.217
DO  - 10.2991/iaw-sc.2013.217
ID  - Yi2013/10
ER  -