Article directory
1. Introduction
Harris key point detection was proposed by Chair Harris and Mike Stephens in 1988. It is a very classic early key point detection algorithm. In a two-dimensional image, Harris key point detection judges whether it is a key point by calculating the Harris matrix of the image point and the eigenvalues corresponding to the matrix. A point is a key point if both eigenvalues of the Harris matrix feature are large. Generally, the following formula can be used to replace the eigenvalue calculation of the Harris matrix.
A = [ I x