Matching Triangle Chain Codes

Abstract

We propose a local descriptor referred to as triangle chain code as well as a matching algorithm for point set matching and image registration. First, feature points are detected using Harris corner detector. Second, triangle chain code is constructed for every point, which carries the discriminative information regarding its k nearest neighbors (KNN). Third, the KNN neighborhoods of two points are matched using the proposed triangle chain code matching algorithm. Fourth, every matched pair of the KNN structures determines a candidate geometric transformation mapping one point set to the other. Finally, the geometric transformation that is supported by the largest number of matched point pairs is selected and the corresponding matched point pairs are selected in the meantime. The affine transformation to conduct image registration can then be obtained by least-square fitting of the finally selected matched point pairs. The image registration experiments with regard to remote-sensing images show that the performance of the proposed method is satisfactory.