ZHAO Xiao-qiang, YUE Zong-da. A Fast Matching Algorithm Based on Local Binary Patterns and Graph Transformation[J]. Acta Electronica Sinica, 2017, 45(9): 2156-2161.
DOI:
ZHAO Xiao-qiang, YUE Zong-da. A Fast Matching Algorithm Based on Local Binary Patterns and Graph Transformation[J]. Acta Electronica Sinica, 2017, 45(9): 2156-2161. DOI: 10.3969/j.issn.0372-2112.2017.09.015.
A Fast Matching Algorithm Based on Local Binary Patterns and Graph Transformation
Aiming at problems of large computation and poor real-time of scale invariant feature transform (SIFT) algorithm for image matching application in image matching
object recognition and other fields
a matching algorithm based on local binary patterns (LBP) and graph transformation matching (GTM) is proposed.Firstly
SIFT is used to extract initial feature points.1313 pixel blocks around the feature points are used as the feature regions.Secondly
in order to reduce complexity of descriptors
the local rotation invariant binary patterns (LRIBP) descriptor is used to produce feature vectors of 29 dimensions for a feature region.Euclidean distance is adopted as measure criterion of the descriptors to fulfil initial match.Finally
GTM is adopted to eliminate mismatching points.Simulation results show that the proposed algorithm not only improves accuracy and robustness and real-time