{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T20:08:32Z","timestamp":1790539712464,"version":"4.1.0"},"reference-count":55,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1521092"],"award-info":[{"award-number":["1521092"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1548562"],"award-info":[{"award-number":["1548562"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007065","name":"Nvidia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Journal on Mathematics of Data Science"],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>Optimal transport (OT) is a prominent framework for point set registration, that is, to align points in two sets. Point set registration becomes particularly difficult when points are organized into objects and the correspondence among the objects is to be established. The registration of pixels must maintain consistency at the object level despite the possibility of object division, merging, and substantial alteration in size and shape over time. Existing approaches in OT exploit either similarity in shape for the entire set of points or spatial closeness of individual points, but not the two simultaneously. We propose a new weighted Gromov--Wasserstein distance (WGWD) to combine both sources of information. Importantly, we use a bipartite graph partitioning strategy to regularize OT in order to achieve object-level consistency and to enhance computational efficiency. We apply the method to cell tracking, specifically, the task of associating biological cells in consecutive image frames from time-lapse image sequences. We call the system SCOTT Shape-Location COmbined Tracking with Optimal Transport). By establishing a pixel-to-pixel correspondence, our method can effectively detect intricate scenarios including cell division and merging (overlapping). Experiments show that our method achieves high accuracy in tracking the movements of cells and outperforms existing methods in the detection of cell division and merging. Location information is shown to be more useful than shape information, while the combination of the two achieves optimal results.<\/jats:p>","DOI":"10.1137\/19m1253976","type":"journal-article","created":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T10:59:10Z","timestamp":1586343550000},"page":"284-308","source":"Crossref","is-referenced-by-count":4,"title":["SCOTT: Shape-Location Combined Tracking with Optimal Transport"],"prefix":"10.1137","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4422-7528","authenticated-orcid":true,"given":"Xinye","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianbo","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4379-4173","authenticated-orcid":true,"given":"James Z.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.yexcr.2009.10.004","volume":"316","author":"Adanja I.","year":"2010","journal-title":"Exp. Cell Res."},{"key":"atypb2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.4161\/cc.5.3.2426","volume":"5","author":"Al-Kofahi O.","year":"2006","journal-title":"Cell Cycle"},{"key":"atypb3","first-page":"1964","author":"Altschuler J.","year":"2017","journal-title":"MA"},{"key":"atypb4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11263-010-0390-2","volume":"92","author":"Baker S.","year":"2011","journal-title":"Int. J. Comput. Vis."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"atypb6","first-page":"246309","volume":"2008","author":"Bernardin K.","year":"2008","journal-title":"EURASIP J. Image Vide."},{"key":"atypb7","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/TIP.2005.852794","volume":"14","author":"Bonneau S.","year":"2005","journal-title":"IEEE Trans. Image Process."},{"key":"atypb8","first-page":"413","author":"Bunyak F.","year":"2011","journal-title":"New York"},{"key":"atypb9","first-page":"113","author":"Chen J.","year":"2014","journal-title":"Heidelberg"},{"key":"atypb10","first-page":"153","volume":"7","author":"Coraluppi S.","year":"2012","journal-title":"J. Adv. Inf. Fusion"},{"key":"atypb11","first-page":"2292","author":"Cuturi M.","year":"2013","journal-title":"MA"},{"key":"atypb12","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1109\/TMI.2005.846851","volume":"24","author":"Debeir O.","year":"2005","journal-title":"IEEE Trans. Med. Imaging"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/1115049"},{"key":"atypb14","doi-asserted-by":"crossref","first-page":"1925","DOI":"10.1109\/TIP.2010.2099125","volume":"20","author":"Dufour A.","year":"2011","journal-title":"Image Process."},{"key":"atypb15","unstructured":"P. Dvurechensky, A. Gasnikov, and A. Kroshnin,\n                      Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn's algorithm\n                      , in Proceedings of the 35th International Conference on Machine Learning, 2018."},{"key":"atypb16","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1109\/TMI.2009.2038693","volume":"29","author":"Dzyubachyk O.","year":"2010","journal-title":"IEEE Trans. Med. Imaging"},{"key":"atypb17","unstructured":"R. Flamary and N. Courty,\n                      POT Python Optimal Transport Library\n                      ,https:\/\/github.com\/rflamary\/POT(accessed 2019\/04\/01)."},{"key":"atypb18","first-page":"2440","volume":"18","author":"Gerber S.","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"atypb19","first-page":"261","author":"Gramfort A.","year":"2015","journal-title":"Cham"},{"key":"atypb20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1090\/S0002-9939-1992-1097344-5","volume":"115","author":"Hanin L. G.","year":"1992","journal-title":"Proc. Amer. Math. Soc."},{"key":"atypb21","first-page":"144","author":"Kausler B. X.","year":"2012","journal-title":"Heidelberg"},{"key":"atypb22","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/7.913664","volume":"37","author":"Kirubarajan T.","year":"2001","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"atypb23","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.micron.2011.03.009","volume":"42","author":"Ko B. C.","year":"2011","journal-title":"Micron"},{"key":"atypb24","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/TMI.2009.2027813","volume":"29","author":"Li F.","year":"2010","journal-title":"IEEE Trans. Med. Imaging"},{"key":"atypb25","first-page":"847","author":"Li K.","year":"2008","journal-title":"Proceedings of the IEEE International Symposium on Biomedical Imaging: From Nano to Macro"},{"key":"atypb26","first-page":"1296","author":"Lou X.","year":"2011","journal-title":"MA"},{"key":"atypb27","first-page":"382","author":"Magnusson K. E.","year":"2012","journal-title":"Proceedings of the IEEE International Symposium on Biomedical Imaging (ISBI)"},{"key":"atypb28","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TMI.2014.2370951","volume":"34","author":"Magnusson K. E.","year":"2014","journal-title":"IEEE Trans. Med. Imaging"},{"key":"atypb29","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1093\/bioinformatics\/btu080","volume":"30","author":"Ma\u0161ka M.","year":"2014","journal-title":"Bioinformatics"},{"key":"atypb30","first-page":"183","author":"Meijering E.","year":"2012","journal-title":"Amsterdam"},{"key":"atypb31","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"M\u00e9moli F.","year":"2011","journal-title":"Found. Comput. Math."},{"key":"atypb32","unstructured":"A. Milan, L. Leal-Taix\u00e9, I. Reid, S. Roth, and K. Schindler,\n                      Mot16: A Benchmark for Multi-object Tracking\n                      , preprint,https:\/\/arxiv.org\/abs\/1603.00831, 2016."},{"key":"atypb33","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1051\/m2an\/2015020","volume":"49","author":"Pass B.","year":"2015","journal-title":"ESAIM Math. Model. Numer. Anal."},{"key":"atypb34","first-page":"1312","author":"Pastor-Escuredo D.","year":"2012","journal-title":"images, in Proceedings of the IEEE International Symposium on Biomedical Imaging (ISBI)"},{"key":"atypb35","first-page":"2664","author":"Peyr\u00e9 G.","year":"2016","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"atypb36","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10878-011-9438-7","volume":"26","author":"Pferschy U.","year":"2013","journal-title":"J. Comb. Optim."},{"key":"atypb37","doi-asserted-by":"crossref","first-page":"e27315","DOI":"10.1371\/journal.pone.0027315","volume":"6","author":"Rapoport D. H.","year":"2011","journal-title":"PloS One"},{"key":"atypb38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Rubner Y.","year":"2000","journal-title":"Int. J. Comput. Vis."},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/140988814"},{"key":"atypb40","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1093\/bioinformatics\/btu764","volume":"31","author":"Schiegg M.","year":"2014","journal-title":"Bioinformatics"},{"key":"atypb41","first-page":"2928","author":"Schiegg M.","year":"2013","journal-title":"Proceedings of the IEEE International Conference on Computer Vision"},{"key":"atypb42","doi-asserted-by":"crossref","unstructured":"T. Sixta, J. Cao, J. Seebach, H. Schnittler, and B. Flach,\n                      Coupling Cell Detection and Tracking by Temporal Feedback Software\n                      ,http:\/\/celltrackingchallenge.net\/participants\/CVUT-CZ\/(accessed 2019\/04\/01).","DOI":"10.1007\/s00138-020-01072-7"},{"key":"atypb43","first-page":"230","author":"Sommer C.","year":"2011","journal-title":"Proceedings of the IEEE International Symposium on Biomedical Imaging: From Nano to Macro"},{"key":"atypb44","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ceb.2008.10.005","volume":"20","author":"Takaki T.","year":"2008","journal-title":"Curr. Opin. Cell Biol."},{"key":"atypb45","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.ceb.2006.10.001","volume":"18","author":"Thery M.","year":"2006","journal-title":"Curr. Opin. Cell Biol."},{"key":"atypb46","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TMI.2016.2640859","volume":"36","author":"T\u00fcretken E.","year":"2017","journal-title":"IEEE Trans. Med. Imaging"},{"key":"atypb47","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1038\/nmeth.4473","volume":"14","author":"Ulman V.","year":"2017","journal-title":"Nat. Methods"},{"key":"atypb48","unstructured":"C. Villani,\n                      Topics in Optimal Transportation\n                      , Grad. Stud. Math. 58, American Mathematical Society, Providence, RI, 2003."},{"key":"atypb49","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/S0960-9822(07)00515-5","volume":"8","author":"Waterman-Storer C. M.","year":"1998","journal-title":"Curr. Biol."},{"key":"atypb50","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0734-189X(85)90055-6","volume":"32","author":"Werman M.","year":"1985","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"atypb51","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1038\/srep00503","volume":"2","author":"Wienert S.","year":"2012","journal-title":"Sci. Rep."},{"key":"atypb52","first-page":"302","author":"Yang F.","year":"2005","journal-title":"Heidelberg"},{"key":"atypb53","first-page":"25","author":"Zha H.","year":"2001","journal-title":"Proceedings of the Tenth ACM International Conference on Information and Knowledge Management"},{"key":"atypb54","first-page":"1","author":"Zhang L.","year":"2008","journal-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"atypb55","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TMI.2002.806292","volume":"21","author":"Zimmer C.","year":"2002","journal-title":"IEEE Trans. Med. Imaging"}],"container-title":["SIAM Journal on Mathematics of Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/19M1253976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:54:33Z","timestamp":1787334873000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/19M1253976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1137\/19M1253976"],"URL":"https:\/\/doi.org\/10.1137\/19m1253976","relation":{},"ISSN":["2577-0187"],"issn-type":[{"value":"2577-0187","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}