This is the authors' abstract. We don't add key points for this paper.
In this work, we present an implementation and thorough study of the Harris corner detector. This feature detector relies on the analysis of the eigenvalues of the autocorrelation matrix. The algorithm comprises seven steps, including several measures for the classification of corners, a generic non-maximum suppression method for selecting interest points, and the possibility to obtain the corners position with subpixel accuracy. We study each step in detail and propose several alternatives for improving the precision and speed. The experiments analyze the repeatability rate of the detector using different types of transformations.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Sánchez et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: