{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:51:52Z","timestamp":1742403112646,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540302872"},{"type":"electronic","value":"9783540320982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11585978_14","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:41:17Z","timestamp":1129628477000},"page":"203-219","source":"Crossref","is-referenced-by-count":4,"title":["Linear Programming Matching and Appearance-Adaptive Object Tracking"],"prefix":"10.1007","author":[{"given":"Hao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Drew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ze-Nian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Ishikawa, H.: Global Optimization using Embedded Graphs, Ph.D. Dissertation, NYU (May 2000)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Breuel, T.M.: A comparison of search strategies for geometric branch and bound algorithms. In: ECCV, vol.\u00a0III, pp. 837\u2013850 (2002)","DOI":"10.1007\/3-540-47977-5_55"},{"issue":"6","key":"14_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","volume":"6","author":"A. Rosenfeld","year":"1976","unstructured":"Rosenfeld, A., Hummel, R.A., Zucker, S.W.: Scene labeling by relaxation operations. IEEE Trans. Systems, Man, and Cybernetics\u00a06(6), 420\u2013433 (1976)","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statistical analysis of dirty pictures. J. R. Statis. Soc. Lond. B\u00a048, 259\u2013302 (1986)","journal-title":"J. R. Statis. Soc. Lond. B"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. PAMI\u00a023, 1222\u20131239 (2001)","journal-title":"PAMI"},{"key":"14_CR6","volume-title":"Probabilistic reasoning in intelligent systems \u2013 Networks of plausible inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic reasoning in intelligent systems \u2013 Networks of plausible inference. Morgan-Kaufmann, San Francisco (1988)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y. Weiss","year":"2001","unstructured":"Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Trans. on Information Theory\u00a047(2), 736\u2013744 (2001)","journal-title":"IEEE Trans. on Information Theory"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: CVPR, vol.\u00a0I, pp. 261\u2013268 (2004)","DOI":"10.1109\/CVPR.2004.1315041"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: ECCV, vol.\u00a0III, pp. 82\u201396 (2002)","DOI":"10.1007\/3-540-47977-5_6"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: ICCV, vol.\u00a0II, pp. 508\u2013515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"issue":"7","key":"14_CR11","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/TPAMI.2003.1206509","volume":"25","author":"J. Sun","year":"2003","unstructured":"Sun, J., Shum, H.Y., Zheng, N.N.: Stereo matching using belief propagation. PAMI\u00a025(7), 787\u2013800 (2003)","journal-title":"PAMI"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Coughlan, J.M., Ferreira, S.J.: Finding deformable shapes using loopy belief propagation. In: ECCV, vol.\u00a0III, pp. 453\u2013468 (2002)","DOI":"10.1007\/3-540-47977-5_30"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural matching using the EM algorithm and singular value decomposition. PAMI\u00a023, 1120\u20131136 (2001)","journal-title":"PAMI"},{"key":"14_CR14","unstructured":"Chui, H., Rangarajan, A.: A new algorithm for non-rigid point matching. In: CVPR, vol.\u00a0II, pp. 44\u201351 (2000)"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-63046-5_3","volume-title":"Information Processing in Medical Imaging","author":"A. Rangarajan","year":"1997","unstructured":"Rangarajan, A., Chui, H.L., Bookstein, F.L.: The softassign procrustes matching algorithm. In: Information Processing in Medical Imaging, pp. 29\u201342. Springer, Heidelberg (1997)"},{"issue":"1","key":"14_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1051\/m2an\/1997310100571","volume":"31","author":"P.D. Tao","year":"1997","unstructured":"Tao, P.D., Phong, T.Q., Horaud, R., Quan, L.: Stability of Lagrangian duality for nonconvex quadratic programming solution methods and applications to computer vision. Mathematical Modelling and Numerical Analysis\u00a031(1), 57\u201390 (1997)","journal-title":"Mathematical Modelling and Numerical Analysis"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Bai, X., Yu, H., Hancock, E.: Graph matching using embedding and semidefinite programming. In: BMVC (2004)","DOI":"10.5244\/C.18.32"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Ben-Ezra, M., Peleg, S., Werman, M.: Real-time motion analysis with linear programming. In: ICCV, pp. 703\u2013709 (1999)","DOI":"10.1109\/ICCV.1999.790290"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. In: IEEE Symposium on Foundations of Computer Science, pp. 14\u201323 (1999)","DOI":"10.1109\/SFFCS.1999.814572"},{"key":"14_CR20","unstructured":"Chekuri, C., Khanna, S., Naor, J., Zosin, L.: Approximation algorithms for the metric labeling problem via a new linear programming formulation. In: Symp. on Discrete Algs, pp. 109\u2013118 (2001)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Comaniciu, D., Ramesh, V., Meer, P.: Real-time tracking of non-rigid objects using mean shift. In: CVPR, vol.\u00a0II, pp. 142\u2013149 (2000)","DOI":"10.1109\/CVPR.2000.854761"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Black, M.J., Jepson, A.D.: Eigentracking: robust matching and tracking of articulated objects using a view-based representation. In: ECCV, pp. 329\u2013342 (1996)","DOI":"10.1007\/BFb0015548"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Morency, L.P., Rahimi, A., Darrell, T.: Adaptive view-based appearance models. In: CVPR, vol.\u00a0I, pp. 803\u2013810 (2003)","DOI":"10.1109\/CVPR.2003.1211435"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, Z.N., Drew, M.S.: Optimizing motion estimation with linear programming and detail-preserving variational method. In: CVPR, vol.\u00a0I, pp. 738\u2013745 (2004)","DOI":"10.1109\/CVPR.2004.1315105"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, Z.N., Drew, M.S.: Posture recognition with convex programming. In: ICME (2005)","DOI":"10.1109\/ICME.2005.1521488"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11585978_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T00:16:56Z","timestamp":1736036216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11585978_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540302872","9783540320982"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11585978_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}