{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:46:04Z","timestamp":1649094364047},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,9,22]],"date-time":"2013-09-22T00:00:00Z","timestamp":1379808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s11263-013-0657-5","type":"journal-article","created":{"date-parts":[[2013,9,21]],"date-time":"2013-09-21T07:52:12Z","timestamp":1379749932000},"page":"49-58","source":"Crossref","is-referenced-by-count":3,"title":["An Interactive Approach to Solving Correspondence Problems"],"prefix":"10.1007","volume":"108","author":[{"given":"Stefanie","family":"Jegelka","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Kapoor","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Horvitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,22]]},"reference":[{"key":"657_CR1","doi-asserted-by":"crossref","unstructured":"Caetano, T., McAuley, J., Cheng, L., Le, Q., & Smola, A. (2009). Learning graph matching. In IEEE Trans. on Pattern Analysis and Machine Intelligence (pp. 2349\u20132374).","DOI":"10.1109\/TPAMI.2009.28"},{"key":"657_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","volume":"18","author":"CR Chegireddy","year":"1987","unstructured":"Chegireddy, C. R., & Hamacher, H. W. (1987). Algorithms for finding $$k$$ k -best perfect matchings. Discrete Applied Mathematics, 18, 155\u2013165.","journal-title":"Discrete Applied Mathematics"},{"key":"657_CR3","unstructured":"Chli, M., & Davison, A. J. (2008). Active matching. In European Conference on Computer Vision (ECCV) 2008, Part I. Lecture Note in Computer Science (Vol. 5302, pp. 72\u201385). Heidelberg: Springer."},{"key":"657_CR4","doi-asserted-by":"crossref","unstructured":"Cho, Y., Lee, J., & Lee, K. M. (2010). Reweighted random walks for graph matching. In European Conference on Computer Vision (ECCV).","DOI":"10.1007\/978-3-642-15555-0_36"},{"issue":"3","key":"657_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V. (1979). A greedy heuristic for the set covering problem. Math of Operations Research, 4(3), 233\u2013235.","journal-title":"Math of Operations Research"},{"key":"657_CR6","unstructured":"Cour, T., Srinivasan, P., & Shi, J. (2006). Balanced graph matching. In Advances in Neural Information Processing Systems (NIPS)."},{"key":"657_CR7","unstructured":"Dasgupta, S. (2004). Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems (NIPS)."},{"key":"657_CR8","doi-asserted-by":"crossref","unstructured":"Debevec, P., Taylor, C., & Malik, J. (1996). Modeling and rendering architecture from photographs: A hybrid geometry- and image-based approach. In Computer Graphics SIGGRAPH 1996 Proceedings.","DOI":"10.1145\/237170.237191"},{"key":"657_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I., & Ponce, J. (2009). A tensor-based algorithm for high-order graph matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"657_CR10","doi-asserted-by":"crossref","unstructured":"Escolano, F., Hancock, E., & Lozano, M. (2011). Graph matching through entropic manifold alignment. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2011.5995583"},{"issue":"2\u2014-3","key":"657_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007330508534","volume":"28","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28(2\u2014-3), 133\u2013168.","journal-title":"Machine Learning"},{"issue":"4","key":"657_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/34.761267","volume":"21","author":"M Goodrich","year":"1999","unstructured":"Goodrich, M., & Mitchell, J. (1999). Approximate geometric pattern matching under rigid motions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(4), 371\u2013379.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"657_CR13","doi-asserted-by":"crossref","unstructured":"Handa, A., Chli, M., Strasdat, H., & Davison, A. J. (2010). Scalable active matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2010.5539788"},{"key":"657_CR14","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1055\/s-0038-1634867","volume":"31","author":"D Heckerman","year":"1992","unstructured":"Heckerman, D., Horvitz, E., & Nathwani, B. N. (1992). Toward normative expert systems: Part i the pathfinder project. Methods of Information in Medicine, 31, 90\u2013105.","journal-title":"Methods of Information in Medicine"},{"issue":"1","key":"657_CR15","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TSSC.1967.300108","volume":"SSC\u20133","author":"R Howard","year":"1967","unstructured":"Howard, R. (1967). Value of information lotteries. IEEE Transaction on Systems, Science and, Cybernetics, SSC\u20133(1), 54\u201360.","journal-title":"IEEE Transaction on Systems, Science and, Cybernetics"},{"key":"657_CR16","doi-asserted-by":"crossref","unstructured":"Joshi, A. J., & Porikli, F. N. P. (2009). Multi-class active learning for image classification. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2009.5206627"},{"key":"657_CR17","unstructured":"Kamar, E. , & Horvitz, E. (2013). A Monte-Carlo approach to computing value of information: Procedure and experiments. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS)."},{"key":"657_CR18","unstructured":"Kamar, E., Hacker, S., & Horvitz, E. (2012). Combining human and machine intelligence in large-scale crowdsourcing. In International Conference on Autonomous Agents and Multiagent Systems (AAMAS)."},{"key":"657_CR19","unstructured":"Kapoor, A., Horvitz, E., & Basu, S. (2007). Selective supervision: Guiding supervised learning with decision-theoretic active learning. In International Joint Conference on Artificial Intelligence."},{"issue":"2","key":"657_CR20","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s11263-009-0268-3","volume":"88","author":"A Kapoor","year":"2009","unstructured":"Kapoor, A., Grauman, K., Urtasun, R., & Darrell, T. (2009). Gaussian processes for object categorization. International Journal of Computer Vision, 88(2), 169\u2013188.","journal-title":"International Journal of Computer Vision"},{"key":"657_CR21","unstructured":"Kowdle, A., Chang, Y., Gallagher, A., & Chen, T. (2011). In IEEE Conference on Computer Vision and Pattern Recognition (CVPR)."},{"key":"657_CR22","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., & Guestrin, C. (2008). Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9, 235\u2013284.","journal-title":"Journal of Machine Learning Research"},{"key":"657_CR23","unstructured":"Lawrence, N., Seeger, M., Herbrich, R. (2002). Fast sparse Gaussian process method: Informative vector machines. In Advances in Neural Information Processing Systems (NIPS) (Vol. 15). Cambridge: MIT Press"},{"key":"657_CR24","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., & Lee, K. (2011). Hyper-graph matching via reweighted random walks. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"657_CR25","doi-asserted-by":"crossref","unstructured":"Lordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. In International Conference on Computer Vision (ICCV).","DOI":"10.1109\/ICCV.2005.20"},{"key":"657_CR26","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L. (1993). Random walks on graphs: a survey. Combinatorics: Paul Erd\u00f6s is Eighty, 2, 1\u201346.","journal-title":"Combinatorics: Paul Erd\u00f6s is Eighty"},{"issue":"4","key":"657_CR27","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1162\/neco.1992.4.4.590","volume":"4","author":"D MacKay","year":"1992","unstructured":"MacKay, D. (1992). Information-based objective functions for active data selection. Neural Computation, 4(4), 589.","journal-title":"Neural Computation"},{"key":"657_CR28","unstructured":"Maji, S., Shakhnarovich, G. (2012). Part annotations via pairwise correspondence. In 4th Workshop on Human Computation, AAAI."},{"key":"657_CR29","doi-asserted-by":"crossref","unstructured":"Mateus, D., Horaud, R., Knossow, D., Cuzzolin, F., & Boyer, E. (2008). Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2008.4587538"},{"key":"657_CR30","doi-asserted-by":"crossref","unstructured":"McAuley, J., & Caetano, T. (2012). Fast matching of large point sets under occlusion. Pattern recognition, 45, 563\u2013569.","DOI":"10.1016\/j.patcog.2011.05.008"},{"key":"657_CR31","doi-asserted-by":"crossref","unstructured":"McAuley, J., Caetano, T., & Barbosa, M. S. (2008). Graph rigidity, cyclic belief propagation and point pattern matching. In IEEE Trans. on Pattern Analysis and Machine Intelligence, 30(11), 2047\u20132054.","DOI":"10.1109\/TPAMI.2008.124"},{"issue":"1","key":"657_CR32","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32\u201338.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"657_CR33","doi-asserted-by":"crossref","unstructured":"Sharma, A., Horaud, R. P., Cech, J., & Boyer, E. (2011). Topologically-robust 3d shape matching based on diffusion geometry and seed growing. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2011.5995455"},{"key":"657_CR34","doi-asserted-by":"crossref","unstructured":"Starck, J., & Hilton, A. (2007). Correspondence labelling for wide-timeframe free-form surface matching. In International Conference on Computer Vision (ICCV).","DOI":"10.1109\/ICCV.2007.4409108"},{"key":"657_CR35","unstructured":"Tong, S., & Koller, D. (2000). Support vector machine active learning with applications to text classification. In International Conference on Machine Learning (ICML)."},{"key":"657_CR36","unstructured":"Torresani, L., & Kolmogorov, V. (2008). Rother, C. Feature correspondence via graph matching: Models and global optimization. In European Conference on Computer Vision (ECCV)."},{"key":"657_CR37","doi-asserted-by":"crossref","unstructured":"Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. In IEEE Trans. on Pattern Analysis and Machine Intelligence, 10(5), 695\u2013703.","DOI":"10.1109\/34.6778"},{"key":"657_CR38","unstructured":"Vijayanarasimhan, S. (2011). Active visual category learning. PhD Thesis, UT Austin."},{"key":"657_CR39","doi-asserted-by":"crossref","unstructured":"Vijayanarasimhan, S., & Kapoor, A. (2010). Visual recognition and detection under bounded computational resources. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2010.5540109"},{"key":"657_CR40","unstructured":"von Ahn, L., & Dabbish, L. (2004). Labeling images with a computer game. In CHI: SIGCHI Conference on Human Factors in Computing Systems. New York: ACM."},{"key":"657_CR41","doi-asserted-by":"crossref","unstructured":"Zass, R., & Shashua, A. (2008). Probabilistic graph and hypergraph matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","DOI":"10.1109\/CVPR.2008.4587500"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0657-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-013-0657-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0657-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T07:33:24Z","timestamp":1563953604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-013-0657-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,22]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["657"],"URL":"https:\/\/doi.org\/10.1007\/s11263-013-0657-5","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,22]]}}}