{"department":[{"_id":"VlKo"}],"day":"08","publication_status":"published","page":"259 - 271","status":"public","doi":"10.1109/TPAMI.2012.105","title":"A dual decomposition approach to feature correspondence","publisher":"IEEE","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","date_updated":"2021-01-12T07:00:46Z","month":"05","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:00:24Z","issue":"2","scopus_import":1,"_id":"2931","type":"journal_article","language":[{"iso":"eng"}],"author":[{"last_name":"Torresani","full_name":"Torresani, Lorenzo","first_name":"Lorenzo"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"abstract":[{"lang":"eng","text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n"}],"publist_id":"3805","citation":{"chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>.","apa":"Torresani, L., Kolmogorov, V., &#38; Rother, C. (2012). A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>","short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>.","ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2012;35(2):259-271. doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271."},"oa_version":"None","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This research was funded in part by Microsoft Research.","date_published":"2012-05-08T00:00:00Z","intvolume":"        35","volume":35,"quality_controlled":"1","year":"2012"}