{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T08:29:59Z","timestamp":1724747399832},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T00:00:00Z","timestamp":1412899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s11263-014-0766-9","type":"journal-article","created":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T07:55:26Z","timestamp":1412841326000},"page":"319-341","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sequential Monte Carlo for Maximum Weight Subgraphs with Application to Solving Image Jigsaw Puzzles"],"prefix":"10.1007","volume":"112","author":[{"given":"Nagesh","family":"Adluru","sequence":"first","affiliation":[]},{"given":"Xingwei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Longin Jan","family":"Latecki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"issue":"5","key":"766_CR1","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"HA Almohamad","year":"1993","unstructured":"Almohamad, H. A., & Duffuaa, S. O. (1993). A linear programming approach for the weighted graph matching problem. IEEE TPAMI, 15(5), 522\u2013525.","journal-title":"IEEE TPAMI"},{"key":"766_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.2307\/2987937","volume":"32","author":"D Altman","year":"1983","unstructured":"Altman, D., & Bland, J. (1983). Measurement in medicine: the analysis of method comparison studies. Statistician, 32, 307\u2013317.","journal-title":"Statistician"},{"key":"766_CR3","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., & Mutzel, P. (2013). The maximum weight connected subgraph problem. In: Facets of Combinatorial Optimization, pp. 245\u2013270. Berlin: Springer.","DOI":"10.1007\/978-3-642-38189-8_11"},{"key":"766_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Frieze, A., & Kaplan, H. (1996). A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 21\u201330.","DOI":"10.1109\/SFCS.1996.548460"},{"key":"766_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., & Iwama, K. (2002). Complexity of finding dense subgraphs. Discrete Applied Mathematics, 121, 15\u201326.","journal-title":"Discrete Applied Mathematics"},{"key":"766_CR6","unstructured":"Bisiani, R. (1987). Beam search. In S. C. Shapiro (Ed.), Encyclopedia of Artificial Intelligence (pp. 56\u201358). New York: Wiley."},{"key":"766_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0021-9991(75)90060-1","volume":"17","author":"AB Bortz","year":"1975","unstructured":"Bortz, A. B., Kalos, M. H., & Lebowitz, J. L. (1975). A new algorithm for monte carlo simulation of ising spin systems. Journal of Computational Physics, 17, 10\u201318.","journal-title":"Journal of Computational Physics"},{"key":"766_CR8","doi-asserted-by":"crossref","unstructured":"Burkard, R. E., Pardalos P. M., Cela, E., & Pitsoulis, L. (1998). The quadratic assignment problem. In: P. Pardalos, D.Z. Du (eds.) Handbook of combinatorial optimization, pp. 241\u2013338. Philip Drive Norwell, MA: Kluwer Academic.","DOI":"10.1007\/978-1-4613-0303-9_27"},{"issue":"10","key":"766_CR9","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1109\/TPAMI.2006.207","volume":"28","author":"T Caetano","year":"2006","unstructured":"Caetano, T., Caelli, T., Schuurmans, D., & Barone, D. (2006). Graphical models and point pattern matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1646\u20131663.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR10","unstructured":"Carpenter, J., Clifford, P., & Fearnhead, P. (1999). Building robust simulation-based filters for evolving data sets (pp. 1\u201327). Department of Statistics, University of Oxford."},{"key":"766_CR11","unstructured":"Chen, Z. (2003). Bayesian filtering: From Kalman filters to particle filters, and beyond. Technical report, McMaster University."},{"issue":"3","key":"766_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.tcs.2008.06.046","volume":"406","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., & Chleb\u00edkov\u00e1, J. (2008). The steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406(3), 207\u2013214.","journal-title":"Theoretical Computer Science"},{"key":"766_CR13","doi-asserted-by":"crossref","unstructured":"Cho, T. S., Avidan, S., & Freeman, W. T. (2010). A probabilistic image jigsaw puzzle solver. In: CVPR.","DOI":"10.1109\/CVPR.2010.5540212"},{"key":"766_CR14","unstructured":"Cho, T. S., Butman, M., Avidan, S., & Freeman, W. T. (2008). The patch transform and its applications to image editing. In: CVPR."},{"key":"766_CR15","doi-asserted-by":"crossref","unstructured":"Cho, M., Lee, J., & Lee, K. M. (2010). Reweighted random walks for graph matching. In: Proceedings of the 11th European conference on Computer vision: Part V, pp. 492\u2013505.","DOI":"10.1007\/978-3-642-15555-0_36"},{"issue":"5","key":"766_CR16","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.37.5.760","volume":"37","author":"N Christofides","year":"1989","unstructured":"Christofides, N., & Benavent, E. (1989). An exact algorithm for the quadratic assignment problem on a tree. Operations Research, 37(5), 760\u2013768.","journal-title":"Operations Research"},{"key":"766_CR17","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., & Shi, J. (2007). Balanced graph matching. Advances in Neural Information Processing Systems, 19, 313\u2013320.","DOI":"10.7551\/mitpress\/7503.003.0044"},{"issue":"3","key":"766_CR18","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/78.984773","volume":"50","author":"D Crisan","year":"2002","unstructured":"Crisan, D., & Doucet, A. (2002). A survey of convergence results on particle filtering methods for practitioners. IEEE Transactions on Signal Processing, 50(3), 736\u2013746.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"11","key":"766_CR19","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1109\/34.730557","volume":"20","author":"A Cross","year":"1998","unstructured":"Cross, A., & Hancock, E. (1998). Graph matching with a dual-step EM algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(11), 1236\u20131253.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"ED Demaine","year":"2007","unstructured":"Demaine, E. D., & Demaine, M. L. (2007). Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics, 23, 195\u2013208.","journal-title":"Graphs and Combinatorics"},{"key":"766_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3437-9","volume-title":"Sequential Monte Carlo methods in practice","author":"A Doucet","year":"2001","unstructured":"Doucet, A., Freitas, N. D., & Gordon, N. (2001). Sequential Monte Carlo methods in practice. Berlin: Springer."},{"issue":"1","key":"766_CR22","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(85)90288-7","volume":"20","author":"M Dyer","year":"1985","unstructured":"Dyer, M., Foulds, L., & Frieze, A. (1985). Analysis of heuristics for finding a maximum weight planar subgraph. European Journal of Operational Research, 20(1), 102\u2013114.","journal-title":"European Journal of Operational Research"},{"key":"766_CR23","volume-title":"Sequential Monte Carlo Methods in practice","author":"D Fox","year":"2000","unstructured":"Fox, D., Thrun, S., Dellaert, F., & Burgard, W. (2000). Particle filters for mobile robot localization. In A. Doucet, N. de Freitas, & N. Gordon (Eds.), Sequential Monte Carlo Methods in practice. New York: Springer."},{"issue":"3","key":"766_CR24","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"G Fred","year":"1989","unstructured":"Fred, G. (1989). Tabu search\u2014part i. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"766_CR25","first-page":"118","volume":"13","author":"H Freeman","year":"1964","unstructured":"Freeman, H., & Garder, L. (1964). Apictorial jigsaw puzzles: The computer solution of a problem in pattern recognition. IEEE TEC, 13, 118\u2013127.","journal-title":"IEEE TEC"},{"key":"766_CR26","unstructured":"Furcy, D., & Koenig, S. (2005). Limited discrepancy beam search. In: Proceedings of the 19th international joint conference on Artificial intelligence, pp. 125\u2013131."},{"key":"766_CR27","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1109\/TPAMI.2004.2","volume":"26","author":"B Georgescu","year":"2004","unstructured":"Georgescu, B., & Meer, P. (2004). Point matching under large image deformations and illumination changes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 674\u2013688.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"766_CR28","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., & Rangarajan, A. (1996). A graduated assignment algorithm for graph matching. IEEE Transactions Pattern Analysis and Machine Intelligence, 18(4), 377\u2013388.","journal-title":"IEEE Transactions Pattern Analysis and Machine Intelligence"},{"key":"766_CR29","doi-asserted-by":"crossref","unstructured":"Goldberg, D., Malon, C., & Bern, M. (2002). A global approach to automatic solution of jigsaw puzzles. In: Symposium on Computational Geometry.","DOI":"10.1145\/513400.513410"},{"key":"766_CR30","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1049\/ip-f-2.1993.0015","volume":"140","author":"N Gordon","year":"1993","unstructured":"Gordon, N., Salmond, D., & Smith, A. (1993). Novel approach to nonlinear\/non-gaussian bayesian state estimation. IEE Proceedings of Radar and Signal Processing, 140, 107\u2013113.","journal-title":"IEE Proceedings of Radar and Signal Processing"},{"key":"766_CR31","unstructured":"Hamze, F., & de Freitas, N. (2005). Hot coupling: A particle approach to inference and normalization on pairwise undirected graphs of arbitrary topology. In Advances in Neural Information Processing Systems, Vol. 18, pp. 1\u20138."},{"key":"766_CR32","unstructured":"Hamze, F., & de Freitas, N. (2007). Large-flip importance sampling. In Uncertainty in Artificial Intelligence, Vol. 1, pp. 167\u2013174."},{"issue":"3","key":"766_CR33","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(94)00086-7","volume":"51","author":"R Hassin","year":"1994","unstructured":"Hassin, R., & Rubinstein, S. (1994). Approximations for the maximum acyclic subgraph problem. Information Processing Letters, 51(3), 133\u2013140.","journal-title":"Information Processing Letters"},{"issue":"11","key":"766_CR34","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R Horaud","year":"1989","unstructured":"Horaud, R., & Skordas, T. (1989). Stereo correspondence through feature grouping and maximal cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(11), 1168\u20131180.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR35","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1011179004708","volume":"43","author":"S Ioffe","year":"2001","unstructured":"Ioffe, S., & Forsyth, D. (2001). Probabilistic methods for finding people. International Journal of Computer Vision, 43, 45\u201368.","journal-title":"International Journal of Computer Vision"},{"key":"766_CR36","doi-asserted-by":"crossref","unstructured":"Isard, M., & Blake, A. (1996). Contour tracking by stochastic propagation of conditional density. In: Proceedings of the 4th European Conference on Computer Vision, ECCV, pp. 343\u2013356.","DOI":"10.1007\/BFb0015549"},{"issue":"1","key":"766_CR37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008078328650","volume":"29","author":"M Isard","year":"1998","unstructured":"Isard, M., & Blake, A. (1998). Condensation\u2014conditional density propagation for visual tracking. International Journal of Computer Vision, 29(1), 5\u201328.","journal-title":"International Journal of Computer Vision"},{"issue":"6","key":"766_CR38","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/TPAMI.2007.1048","volume":"29","author":"H Jiang","year":"2007","unstructured":"Jiang, H., Drew, M., & Li, Z. (2007). Matching by linear programming and successive convexification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(6), 959\u2013975.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR39","doi-asserted-by":"crossref","unstructured":"Khan, Z., Balch, T., & Dellaert, F. (2004). An mcmc-based particle filter for tracking multiple interacting targets. In European Conference on Computer Vision, Vol. 3024, pp. 279\u2013290.","DOI":"10.1007\/978-3-540-24673-2_23"},{"key":"766_CR40","unstructured":"Kong, W., & Kimia, B. B. (2001). On solving 2d and 3d puzzles using curve matching. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 2, pp. 583\u2013590."},{"key":"766_CR41","unstructured":"Leordeanu, M., Hebert, M., & Sukthankar, R. (2009). An integer projected fixed point method for graph matching and map inference. In Advances in Neural Information Processing Systems, Vol. 1, pp. 1114\u20131122."},{"key":"766_CR42","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1109\/ICCV.2005.20","volume":"2","author":"M Leordeanu","year":"2005","unstructured":"Leordeanu, M., & Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints. Proceedings of the Tenth IEEE International Conference on Computer Vision, 2, 1482\u20131489.","journal-title":"Proceedings of the Tenth IEEE International Conference on Computer Vision"},{"key":"766_CR43","unstructured":"Liu, H., Latecki, L. J., & Yan, S. (2010). Robust clustering as ensembles of affinity relations. In Advances in Neural Information Processing Systems, Vol. 1, pp. 1414\u20131422."},{"key":"766_CR44","first-page":"223","volume-title":"Sequential Monte Carlo methods in practice","author":"JS Liu","year":"2001","unstructured":"Liu, J. S., Chen, R., & Logvinenko, T. (2001). A theoretical framework for sequential importance sampling with resampling. In A. Doucet, N. de Freitas, & J. Gordon (Eds.), Sequential Monte Carlo methods in practice (pp. 223\u2013233). Berlin: Springer."},{"key":"766_CR45","volume-title":"Monte Carlo strategies in scientific computing","author":"J Liue","year":"2001","unstructured":"Liue, J. (2001). Monte Carlo strategies in scientific computing. Berlin: Springer."},{"key":"766_CR46","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D. G. (2004). Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60, 91\u2013110.","journal-title":"International Journal of Computer Vision"},{"key":"766_CR47","unstructured":"Lu, C., Latecki, L. J., Adluru, N., Yang, X., & Ling, H. (2009). Shape guided contour grouping with particle filters. In IEEE International Conference on Computer Vision, Vol. 1, pp. 2288\u20132295."},{"issue":"1\u20134","key":"766_CR48","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1021525624027","volume":"117","author":"EM Macambira","year":"2002","unstructured":"Macambira, E. M. (2002). An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Annals of Operations Research, 117(1\u20134), 175\u2013190.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"766_CR49","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/TPAMI.2003.1177151","volume":"25","author":"J Maciel","year":"2003","unstructured":"Maciel, J., & Costeira, J. (2003). A global solution to sparse correspondence problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2), 187\u2013199.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR50","doi-asserted-by":"crossref","unstructured":"Makridis, M., & Papamarkos, N. (2006). A new technique for solving a jigsaw puzzle. In IEEE International Conference on Image Processing, Vol. 1, pp. 2001\u20132004.","DOI":"10.1109\/ICIP.2006.312891"},{"issue":"1","key":"766_CR51","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A Misevicius","year":"2005","unstructured":"Misevicius, A. (2005). A tabu search algorithm for the quadratic assignment problem. Computational Optimization and Applications, 30(1), 95\u2013111.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"766_CR52","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A Misevicius","year":"2012","unstructured":"Misevicius, A. (2012). An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectrum, 34(3), 665\u2013690.","journal-title":"OR Spectrum"},{"issue":"3","key":"766_CR53","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1561\/0400000003","volume":"1","author":"R Montenegro","year":"2006","unstructured":"Montenegro, R., & Tetali, P. (2006). Mathematical aspects of mixing times in markov chains. Foundations and Trends in Theoretical Computer Science, 1(3), 237\u2013354.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"766_CR54","doi-asserted-by":"crossref","first-page":"1924","DOI":"10.1016\/j.patrec.2008.05.027","volume":"29","author":"TR Nielsen","year":"2008","unstructured":"Nielsen, T. R., Drewsen, P., & Hansen, K. (2008). Solving jigsaw puzzles using image features. PRL, 29, 1924\u20131933.","journal-title":"PRL"},{"key":"766_CR55","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TPAMI.2007.250608","volume":"29","author":"M Pavan","year":"2007","unstructured":"Pavan, M., & Pelillo, M. (2007). Dominant sets and pairwise clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29, 167\u2013172.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR56","doi-asserted-by":"crossref","unstructured":"Pomeranz, D., Shemesh, M., & Ben-Shahar, O. (2011). A fully automated greedy square jigsaw puzzle solver. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 9\u201316.","DOI":"10.1109\/CVPR.2011.5995331"},{"key":"766_CR57","doi-asserted-by":"crossref","unstructured":"Radack, G. M., & Badler, N. I. (1982). Jigsaw puzzle matching using a boundary-centered polar encoding. Computer Graphics and Image Processing, 19(1), 1\u201317.","DOI":"10.1016\/0146-664X(82)90111-3"},{"key":"766_CR58","first-page":"1","volume":"43","author":"M Rysz","year":"2013","unstructured":"Rysz, M., Mirghorbani, M., Krokhmal, P., & Pasiliao, E. L. (2013). On risk-averse maximum weighted subgraph problems. Journal of Combinatorial Optimization, 43, 1\u201319.","journal-title":"Journal of Combinatorial Optimization"},{"key":"766_CR59","doi-asserted-by":"crossref","unstructured":"Sahni, S., & Gonzalez, T. (1976). P-complete approximation problems. Journal of the Association of Computing Machinery, 23, 555\u2013565.","DOI":"10.1145\/321958.321975"},{"key":"766_CR60","unstructured":"Singh, R., Xu, J., & Berger, B. (2007). Research in computational biology. Pairwise global alignment of protein interaction networks by matching neighborhood topology, vol. 4453. Berlin: Springer."},{"key":"766_CR61","doi-asserted-by":"crossref","unstructured":"Smith, K., Gatica-Perez, D., & Odobez, J. M. (2005). Using particles to track varying numbers of interacting people. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 962\u2013969.","DOI":"10.1109\/CVPR.2005.361"},{"key":"766_CR62","volume-title":"Optimization for Machine Learning","author":"D Sontag","year":"2010","unstructured":"Sontag, D., Globerson, A., & Jaakkola, T. (2010). Introduction to dual decomposition for inference. In S. Sra, S. Nowozin, & S. Wright (Eds.), Optimization for Machine Learning. Cambridge, MA: MIT Press."},{"key":"766_CR63","first-page":"624","volume":"7574","author":"Y Suh","year":"2012","unstructured":"Suh, Y., Cho, M., & Lee, K. M. (2012). Graph matching via sequential monte carlo. ECCV, 7574, 624\u2013637.","journal-title":"ECCV"},{"key":"766_CR64","doi-asserted-by":"crossref","unstructured":"Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17(4), 443\u2013455.","DOI":"10.1016\/S0167-8191(05)80147-4"},{"issue":"2","key":"766_CR65","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"ED Taillard","year":"1995","unstructured":"Taillard, E. D. (1995). Comparison of iterative searches for the quadratic assignment problem. Location Science, 3(2), 87\u2013105.","journal-title":"Location Science"},{"key":"766_CR66","unstructured":"Thrun, S. (2002). Particle filters in robotics. In: Proceedings of the 17th Annual Conference on Uncertainty in AI (UAI)."},{"key":"766_CR67","volume-title":"Probabilistic Robotics","author":"S Thrun","year":"2005","unstructured":"Thrun, S., Burgard, W., & Fox, D. (2005). Probabilistic Robotics. Cambridge: MIT Press."},{"issue":"1","key":"766_CR68","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1162\/089120103321337458","volume":"29","author":"C Tillmann","year":"2003","unstructured":"Tillmann, C., & Ney, H. (2003). Word reordering and a dynamic programming beam search algorithm for statistical machine translation. Computational Linguistics, 29(1), 97\u2013133.","journal-title":"Computational Linguistics"},{"issue":"5","key":"766_CR69","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. IEEE TPAMI, 10(5), 695\u2013703.","journal-title":"IEEE TPAMI"},{"issue":"3","key":"766_CR70","first-page":"44","volume":"6","author":"V Vassilevska","year":"2010","unstructured":"Vassilevska, V., Williams, R., & Yuster, R. (2010). Finding heaviest h-subgraphs in real weighted graphs, with applications. ACM Transactions on Algorithms (TALG), 6(3), 44.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"3","key":"766_CR71","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/09076619X","volume":"42","author":"VV Williams","year":"2013","unstructured":"Williams, V. V., & Williams, R. (2013). Finding, minimizing, and counting weighted subgraphs. SIAM Journal on Computing, 42(3), 831\u2013854.","journal-title":"SIAM Journal on Computing"},{"key":"766_CR72","doi-asserted-by":"crossref","unstructured":"Wolfson, H., Schonberg, E., Kalvin, A., & Lamdam, Y. (1988). Solving jigsaw puzzles by computer. Annals of Operations Research, 12, 51\u201364.","DOI":"10.1007\/BF02186360"},{"key":"766_CR73","doi-asserted-by":"crossref","unstructured":"Yang, X., & Latecki, L. J. (2010). Weakly supervised shape based object detection with particle filter. In European Conference on Computer Vision, Vol. 1, pp. 757\u2013770.","DOI":"10.1007\/978-3-642-15555-0_55"},{"key":"766_CR74","doi-asserted-by":"crossref","unstructured":"Yang, X., Adluru, N., & Latecki, L. J. (2011). Particle filter with state permutations for solving image jigsaw puzzles. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 2873\u20132880.","DOI":"10.1109\/CVPR.2011.5995535"},{"key":"766_CR75","doi-asserted-by":"crossref","unstructured":"Yao, F. H., & Shao, G. F. (2003). A shape and image merging technique to solve jigsaw puzzles. PRL, 24, 1819\u20131835.","DOI":"10.1016\/S0167-8655(03)00006-0"},{"issue":"12","key":"766_CR76","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., & Vert, J. (2009). A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12), 2227\u20132242.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"766_CR77","doi-asserted-by":"crossref","unstructured":"Zass, R., & Shashua, A. (2008). Probabilistic graph and hypergraph matching. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 1\u20138.","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"766_CR78","unstructured":"Zhou, F., & De la Torre, F. (2012). Factorized graph matching. In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 127\u2013134."},{"key":"766_CR79","doi-asserted-by":"crossref","unstructured":"Zhou, F., & De la Torre, F. (2013). Deformable graph matching.In IEEE Conference on Computer Vision and Pattern Recognition, Vol. 1, pp. 2922\u20132929.","DOI":"10.1109\/CVPR.2013.376"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-014-0766-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-014-0766-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-014-0766-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T04:46:41Z","timestamp":1689569201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-014-0766-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":79,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s11263-014-0766-9","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}