{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:23:07Z","timestamp":1740108187082,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T00:00:00Z","timestamp":1553040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61271293"],"award-info":[{"award-number":["61271293"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Vision and Applications"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00138-019-01019-7","type":"journal-article","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T14:06:42Z","timestamp":1553090802000},"page":"657-669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Soft decision optimization method for robust fundamental matrix estimation"],"prefix":"10.1007","volume":"30","author":[{"given":"Chun-Bao","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Zheng","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Dong","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,20]]},"reference":[{"key":"1019_CR1","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2003)","edition":"2"},{"issue":"3","key":"1019_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1561\/0600000017","volume":"3","author":"T Tuytelaars","year":"2008","unstructured":"Tuytelaars, T., Mikolajczyk, K.: Local invariant feature detectors: a survey. Found. Trends Comput. Graph. Vis. 3(3), 177\u2013280 (2008)","journal-title":"Found. Trends Comput. Graph. Vis."},{"issue":"8","key":"1019_CR3","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TPAMI.2014.2301163","volume":"36","author":"K Simonyan","year":"2014","unstructured":"Simonyan, K., Vedaldi, A., Zisserman, A.: Learning local feature descriptors using convex optimisation. IEEE Trans. Pattern Anal. Mach. Intell. 36(8), 1573\u20131585 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1019_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"unstructured":"Bay, H., Tuytelaars, T., Van Gool, L.: Surf: Speeded up robust features. In: Proceedings of ECCV, 2006, pp. 404\u2013417. Springer, Berlin (2006)","key":"1019_CR5"},{"doi-asserted-by":"crossref","unstructured":"Calonder, M., Lepetit, V., Strecha, C., et al.: BRIEF: Binary robust independent elementary features. In: Proceedings of ECCV, pp. 778\u2013792 (2010)","key":"1019_CR6","DOI":"10.1007\/978-3-642-15561-1_56"},{"doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Chli, M., Siegwart, R.Y.: BRISK: Binary robust invariant scalable keypoints. In: Proceedings of ICCV, pp. 2548\u20132555 (2011)","key":"1019_CR7","DOI":"10.1109\/ICCV.2011.6126542"},{"doi-asserted-by":"crossref","unstructured":"Rublee, E., Rabaud, V., Konolige, K., et al.: Orb: An efficient alternative to sift or surf. In: Proceedings of ICCV, pp. 2564\u20132571 (2011)","key":"1019_CR8","DOI":"10.1109\/ICCV.2011.6126544"},{"doi-asserted-by":"crossref","unstructured":"Muja, M., Lowe, D.G.: Fast matching of binary features. In: Proceedings of Computer and Robot Vision (CRV), pp. 404\u2013410 (2012)","key":"1019_CR9","DOI":"10.1109\/CRV.2012.60"},{"issue":"2","key":"1019_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Beng, C.O., Kian, L.T., et al.: iDistance: An adaptive B\u2009+\u2009tree based indexing method for nearest neighbor search. ACM Trans. Data Base Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Data Base Syst."},{"key":"1019_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4908.001.0001","volume-title":"Nearest-Neighbor Methods in Learning and Vision: Theory and Practice","author":"G Shakhnarovich","year":"2006","unstructured":"Shakhnarovich, G., Indyk, P., Darrell, T.: Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, Cambridge (2006)"},{"issue":"10","key":"1019_CR12","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/34.799907","volume":"21","author":"JS Beis","year":"1999","unstructured":"Beis, J.S., Lowe, D.G.: Indexing without invariants in 3D object recognition. IEEE Trans. Pattern Anal. Mach. Intell. 21(10), 1000\u20131015 (1999)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"1019_CR13","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R Salakhutdinov","year":"2009","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic hashing. Int. J. Approx. Reason. 50(7), 969\u2013978 (2009)","journal-title":"Int. J. Approx. Reason."},{"doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised KD-trees for fast image descriptor matching. In: Proceedings of CVPR, pp. 1\u20138 (2008)","key":"1019_CR14","DOI":"10.1109\/CVPR.2008.4587638"},{"unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: International Conference on Computer Vision Theory and Application, pp. 331\u2013340 (2009)","key":"1019_CR15"},{"issue":"2","key":"1019_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1007941100561","volume":"27","author":"Z Zhang","year":"1998","unstructured":"Zhang, Z.: Determining the epipolar geometry and its uncertainty: a review. Int. J. Comput. Vis. 27(2), 161\u2013195 (1998)","journal-title":"Int. J. Comput. Vis."},{"issue":"1","key":"1019_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF00127818","volume":"17","author":"QT Luong","year":"1996","unstructured":"Luong, Q.T., Faugeras, O.D.: The fundamental matrix: theory, algorithms, and stability analysis. Int. J. Comput. Vis. 17(1), 43\u201375 (1996)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"1019_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0262-8856(02)00154-3","volume":"21","author":"X Armangu\u00e9","year":"2003","unstructured":"Armangu\u00e9, X., Salvi, J.: Overall view regarding fundamental matrix estimation. Image Vis. Comput. 21(2), 205\u2013220 (2003)","journal-title":"Image Vis. Comput."},{"issue":"6","key":"1019_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"M Fischler","year":"1981","unstructured":"Fischler, M., Bolles, R.: Random sample consensus: a paradigm for model fitting with application to image analysis and automated cartography. Commun. ACM 24(6), 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"1019_CR20","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/cviu.1999.0832","volume":"78","author":"PH Torr","year":"2000","unstructured":"Torr, P.H., Zisserman, A.: MLESAC: A new robust estimator with application to estimating image geometry. Comput. Vis. Image Underst. 78(1), 138\u2013156 (2000)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"1019_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1020224303087","volume":"50","author":"PHS Torr","year":"2002","unstructured":"Torr, P.H.S.: Bayesian model estimation and selection for epipolar geometry and generic manifold fitting. Int. J. Comput. Vis. 50(1), 35\u201361 (2002)","journal-title":"Int. J. Comput. Vis."},{"issue":"10","key":"1019_CR22","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TPAMI.2005.199","volume":"27","author":"BJ Tordoff","year":"2005","unstructured":"Tordoff, B.J., Murray, D.W.: Guided-MLESAC: faster image transform estimation by using matching priors. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1523\u20131535 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"Chum, O., Matas, J.: Matching with PROSAC-progressive sample consensus. In: Proceedings of CVPR, vol. 1, pp. 220\u2013226 (2005)","key":"1019_CR23"},{"doi-asserted-by":"crossref","unstructured":"Chum, O., Matas, J.: Randomized RANSAC with Td,d test. In: Proceedings of BMVC, vol. 2, pp. 448\u2013457 (2002)","key":"1019_CR24","DOI":"10.5244\/C.16.43"},{"doi-asserted-by":"crossref","unstructured":"Chum, O., Matas, J., Kittler, J.: Locally optimized RANSAC. In: Proceedings of 25th DAGM Symposium, pp. 236\u2013243. Springer, Berlin (2003)","key":"1019_CR25","DOI":"10.1007\/978-3-540-45243-0_31"},{"issue":"5","key":"1019_CR26","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00138-005-0006-y","volume":"16","author":"D Nist\u00e9r","year":"2005","unstructured":"Nist\u00e9r, D.: Preemptive RANSAC for live structure and motion estimation. Mach. Vis. Appl. 16(5), 321\u2013329 (2005)","journal-title":"Mach. Vis. Appl."},{"doi-asserted-by":"crossref","unstructured":"Vedaldi, A., Jin, H., Favaro, P., et al.: KALMANSAC: Robust filtering by consensus. In: Proceedings of ICCV, vol. 1, pp. 633\u2013640 (2005)","key":"1019_CR27","DOI":"10.1109\/ICCV.2005.130"},{"doi-asserted-by":"crossref","unstructured":"Raguram, R., Frahm, J.-M., Pollefeys, M.: Exploiting uncertainty in random sample consensus. In: Proceedings of ICCV, pp. 2074\u20132081 (2009)","key":"1019_CR28","DOI":"10.1109\/ICCV.2009.5459456"},{"issue":"1","key":"1019_CR29","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/LGRS.2014.2325970","volume":"12","author":"Y Wu","year":"2015","unstructured":"Wu, Y., Ma, W., Gong, M., et al.: A novel point-matching algorithm based on fast sample consensus for image registration. IEEE Geosci. Remote Sens. Lett. 12(1), 43\u201347 (2015)","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"doi-asserted-by":"crossref","unstructured":"Zach, C.: Robust bundle adjustment revisited. In: Proceedings of ECCV, pp. 772\u2013787 (2014)","key":"1019_CR30","DOI":"10.1007\/978-3-319-10602-1_50"},{"doi-asserted-by":"crossref","unstructured":"Choi, S., Kim, T., Yu, W.: Performance evaluation of RANSAC family. In: Proceedings of BMVC, pp. 1\u201312 (2009)","key":"1019_CR31","DOI":"10.5244\/C.23.81"},{"issue":"1","key":"1019_CR32","first-page":"21","volume":"21","author":"A Hast","year":"2013","unstructured":"Hast, A., Nysj\u00f6, J., Marchetti, A.: Optimal RANSAC-towards a repeatable algorithm for finding the optimal set. J. WSCG 21(1), 21\u201330 (2013)","journal-title":"J. WSCG"},{"doi-asserted-by":"crossref","unstructured":"Le, H., Chin, T.J., Suter, D.: An exact penalty method for locally convergent maximum consensus. In: Proceedings of CVPR, pp. 79\u2013387 (2017)","key":"1019_CR33","DOI":"10.1109\/CVPR.2017.48"},{"doi-asserted-by":"crossref","unstructured":"Chin, T.J., Yang, H.K., Eriksson, A., et al.: Guaranteed outlier removal with mixed integer linear programs. In: Proceedings of CVPR, pp. 5858\u20135866 (2016)","key":"1019_CR34","DOI":"10.1109\/CVPR.2016.631"},{"issue":"4","key":"1019_CR35","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1109\/TPAMI.2016.2631531","volume":"39","author":"TJ Chin","year":"2017","unstructured":"Chin, T.J., Purkait, P., Eriksson, A., et al.: Efficient globally optimal consensus maximisation with tree search. IEEE Trans. Pattern Anal. Mach. Intell. 39(4), 758 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Espuny, F., Monasse, P., Moisan, L.: A new a contrario approach for the robust determination of the fundamental matrix. image and video technology\u2014PSIVT 2013 workshops, Springer, Berlin, pp. 181\u2013192 (2014)","key":"1019_CR36","DOI":"10.1007\/978-3-642-53926-8_17"},{"doi-asserted-by":"crossref","unstructured":"Cheng, Y., Lopez, J.A., Camps, O., et al.: A convex optimization approach to robust fundamental matrix estimation. In: Proceedings of CVPR, pp. 2170\u20132178 (2015)","key":"1019_CR37","DOI":"10.1109\/CVPR.2015.7298829"},{"issue":"1","key":"1019_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cvi.2014.0436","volume":"10","author":"L Wang","year":"2016","unstructured":"Wang, L., Liu, Z., Zhang, Z.: Efficient image features selection and weighting for fundamental matrix estimation. IET Comput. Vis. 10(1), 67\u201378 (2016)","journal-title":"IET Comput. Vis."},{"doi-asserted-by":"crossref","unstructured":"Yang, J., Li, H., Jia, Y.: Optimal essential matrix estimation via inlier-set maximization. In: Proceedings of ECCV, pp. 111\u2013126. Springer, Cham (2014)","key":"1019_CR39","DOI":"10.1007\/978-3-319-10590-1_8"},{"issue":"7","key":"1019_CR40","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/TPAMI.2012.264","volume":"35","author":"J Bazin","year":"2013","unstructured":"Bazin, J., Li, H., Kweon, I.S., et al.: A branch-and-bound approach to correspondence and grouping problems. IEEE Trans. Pattern Anal. Mach. Intell. 35(7), 1565\u20131576 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Zheng, Y., Sugimoto, S., Okutomi, M.: A branch and contract algorithm for globally optimal fundamental matrix estimation. In: Proceedings of CVPR, pp. 2953\u20132960 (2011)","key":"1019_CR41","DOI":"10.1109\/CVPR.2011.5995352"},{"issue":"2","key":"1019_CR42","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.patrec.2010.09.019","volume":"32","author":"ME Fathy","year":"2011","unstructured":"Fathy, M.E., Hussein, A.S., Tolba, M.F.: Fundamental matrix estimation: a study of error criteria. Pattern Recogn. Lett. 32(2), 383\u2013391 (2011)","journal-title":"Pattern Recogn. Lett."},{"issue":"10","key":"1019_CR43","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1109\/TPAMI.2005.188","volume":"27","author":"K Mikolajczyk","year":"2005","unstructured":"Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1615\u20131630 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"1019_CR44","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T.: An introduction to ROC analysis. Pattern Recogn. Lett. 27(8), 861\u2013874 (2006)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-019-01019-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00138-019-01019-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-019-01019-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:05:19Z","timestamp":1584576319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00138-019-01019-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,20]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1019"],"URL":"https:\/\/doi.org\/10.1007\/s00138-019-01019-7","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"type":"print","value":"0932-8092"},{"type":"electronic","value":"1432-1769"}],"subject":[],"published":{"date-parts":[[2019,3,20]]},"assertion":[{"value":"1 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}