Abstract
Reliable homography estimation is essential for plenty of computer vision tasks. However, the ground truth of homography is difficult to obtain. Moreover, it is relatively hard for ordinary convolutional neural networks to model correspondence, which leads to the difficulty for optimization. In this paper, we propose a novel framework based on unsupervised dense correspondence. We extract feature pyramid for each image and estimate the dense correspondence map in a coarse-to-fine manner. Relying on correlation layers and photometric loss, we can get rid of the deficiency of ordinary networks and estimate reliable dense correspondence for each image pair, which facilitates the later prediction of homography matrix. To achieve the homography training on both synthetic dataset and realistic dataset, we apply different losses for different tasks respectively being supervised loss and triplet loss, to regulate the training procedure. Qualitative and quantitative evaluations illustrate the effectiveness of the dense correspondence map, and shows the competitive performance of our method compared with traditional feature-based algorithms and deep learning methods.
This research is partly supported by NSFC, China (No: 61876107, U1803261).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 91–110 (2004)
DeTone, D., Malisiewicz, T., Rabinovich, A.: Deep image homography estimation (2016)
Nguyen, T., Chen, S.W., Shivakumar, S.S., Taylor, C.J., Kumar, V.: Unsupervised deep homography: a fast and robust homography estimation model. IEEE Robot. Autom. Lett. 3(3), 2346–2353 (2018)
Zhang, J., et al.: Content-Aware unsupervised deep homography estimation. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12346, pp. 653–669. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58452-8_38
Liu, L., et al.: Learning by analogy: Reliable supervision from transformations for unsupervised optical flow estimation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June 2020
Meister, S., Hur, J., Roth, S.: Unsupervised learning of optical flow with a bidirectional census loss. CoRR Unflow (2017)
Lin, T.-Y.: Microsoft COCO: common objects in context. CoRR (2014)
Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to sift or surf. In: 2011 International Conference on Computer Vision, pp. 2564–2571 (2011)
Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24(6), 381–395 (1981)
Bay, H., Ess, A., Tuytelaars, T., Van Gool, L.: Speeded-up robust features (surf). In: Computer Vision and Image Understanding, pp. 346–359 (2008)
Butler, D.J., Wulff, J., Stanley, G.B., Black, M.J.: A naturalistic open source movie for optical flow evaluation. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7577, pp. 611–625. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33783-3_44
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Yang, X., Kong, L., Liang, Z., Yang, J. (2021). Homography Estimation Network Based on Dense Correspondence. In: Mantoro, T., Lee, M., Ayu, M.A., Wong, K.W., Hidayanto, A.N. (eds) Neural Information Processing. ICONIP 2021. Communications in Computer and Information Science, vol 1517. Springer, Cham. https://doi.org/10.1007/978-3-030-92310-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-030-92310-5_73
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92309-9
Online ISBN: 978-3-030-92310-5
eBook Packages: Computer ScienceComputer Science (R0)