Matching Of Feature Points using Dynamic Programming


The KIPS Transactions:PartB , Vol. 10, No. 1, pp. 73-80, Feb. 2003
10.3745/KIPSTB.2003.10.1.73,   PDF Download:

Abstract

In this paper we propose an algorithm which matches the corresponding feature points between the reference image and the search image. We use Harris큦 corner detector to find the feature points in both image. For each feature point in the reference image, we can extract the candidate matching points as feature points in the search image which the normalized correlation coefficient goes greater than a threshold. Finally we determine a corresponding feature points among candidate points by using dynamic programming. In experiments we show results that match feature points in synthetic image and real image.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
D. K. Kim, "Matching Of Feature Points using Dynamic Programming," The KIPS Transactions:PartB , vol. 10, no. 1, pp. 73-80, 2003. DOI: 10.3745/KIPSTB.2003.10.1.73.

[ACM Style]
Dong Keun Kim. 2003. Matching Of Feature Points using Dynamic Programming. The KIPS Transactions:PartB , 10, 1, (2003), 73-80. DOI: 10.3745/KIPSTB.2003.10.1.73.