Corner Detection with Covariance Propagation
Abstract
This paper presents a statistical approach for detecting corners from chain encoded digital arcs. An arc point is declared as a corner if the estimated parameters of the two fitted lines of the two arc segments immediately to the right and left of the are point are statistically significantly different. The corner detection algorithm consists of two steps: corner detection and optimization. While corner detection involves statistically identifying the most likely corner points along an arc sequence, corner optimization deals with improving the locational errors of the detected corners. The major contributions of this research include developing a method for analytically estimating the covariance matrix of the fitted line parameters and developing a hypothesis test statistic to statistically test the difference between the parameters of two fitted lines. Performance evaluation study showed that the algorithm is robust and accurate for complex images. It has an average misdetection rate of 2.5% and false alarm rate of 2.2% for the complex RADIUS images. This paper discusses the theory and performance characterization of the proposed corner detector.
Cite
Text
Ji and Haralick. "Corner Detection with Covariance Propagation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997. doi:10.1109/CVPR.1997.609350Markdown
[Ji and Haralick. "Corner Detection with Covariance Propagation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1997.](https://mlanthology.org/cvpr/1997/ji1997cvpr-corner/) doi:10.1109/CVPR.1997.609350BibTeX
@inproceedings{ji1997cvpr-corner,
title = {{Corner Detection with Covariance Propagation}},
author = {Ji, Qiang and Haralick, Robert M.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1997},
pages = {362-367},
doi = {10.1109/CVPR.1997.609350},
url = {https://mlanthology.org/cvpr/1997/ji1997cvpr-corner/}
}