Author:
Zhang Chao,Lu Xuequan,Hotta Katsuya,Yang Xi
Abstract
AbstractIn this paper we address the problem of geometric multi-model fitting using a few weakly annotated data points, which has been little studied so far. In weak annotating (WA), most manual annotations are supposed to be correct yet inevitably mixed with incorrect ones. SuchWA data can naturally arise through interaction in various tasks. For example, in the case of homography estimation, one can easily annotate points on the same plane or object with a single label by observing the image. Motivated by this, we propose a novel method to make full use of WA data to boost multi-model fitting performance. Specifically, a graph for model proposal sampling is first constructed using the WA data, given the prior that WA data annotated with the same weak label has a high probability of belonging to the same model. By incorporating this prior knowledge into the calculation of edge probabilities, vertices (i.e., data points) lying on or near the latent model are likely to be associated and further form a subset or cluster for effective proposal generation. Having generated proposals, a-expansion is used for labeling, and our method in return updates the proposals. This procedure works in an iterative way. Extensive experiments validate our method and show that it produces noticeably better results than state-of-the-art techniques in most cases.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Vision and Pattern Recognition
Reference30 articles.
1. Fischler, M. A.; Bolles, R. C. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM Vol. 24, No. 6, 381–395, 1981.
2. Boykov, Y.; Veksler, O.; Zabih, R. Fast approximate energy minimization via graph cuts. In: Proceedings of the 7th IEEE International Conference on Computer Vision, 377–384, 1999.
3. Delong, A.; Osokin, A.; Isack, H. N.; Boykov, Y. Fast approximate energy minimization with label costs. International Journal of Computer Vision Vol. 96, No. 1, 1–27, 2012.
4. Isack, H.; Boykov, Y. Energy-based geometric multimodel fitting. International Journal of Computer Vision Vol. 97, No. 2, 123–147, 2012.
5. Amayo, P.; Pinies, P.; Paz, L. M.; Newman, P. Geometric multi-model fitting with a convex relaxation algorithm. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 8138–8146, 2018.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献