torchmatch

References

Every citation used throughout the documentation, collected in one place.

Download references.bib ↓

The entries below cover every citation used throughout the documentation.

To cite a torchmatch op or algorithm in a paper, cite the original publication for the algorithm and note torchmatch as the implementation in a footnote or methods section.

  • [Konig1931]Kőnig, Dénes. "Gráfok és mátrixok." Matematikai és Fizikai Lapok, vol. 38, pp. 116–119. 1931.
  • [Egervary1931]Egerváry, Jenő. "Matrixok kombinatorius tulajdonságairól." Matematikai és Fizikai Lapok, vol. 38, pp. 16–28. 1931.
  • [Kuhn1955]Kuhn, Harold W.. "The Hungarian method for the assignment problem." Naval Research Logistics Quarterly, vol. 2(1--2), pp. 83–97. 1955. doi:10.1002/nav.3800020109.
  • [Munkres1957]Munkres, James. "Algorithms for the assignment and transportation problems." Journal of the Society for Industrial and Applied Mathematics, vol. 5(1), pp. 32–38. 1957. doi:10.1137/0105003.
  • [Tomizawa1971]Tomizawa, Nobuaki. "On some techniques useful for solution of transportation network problems." Networks, vol. 1(2), pp. 173–194. 1971. doi:10.1002/net.3230010206.
  • [EdmondsKarp1972]Edmonds, Jack and Karp, Richard M.. "Theoretical improvements in algorithmic efficiency for network flow problems." Journal of the ACM, vol. 19(2), pp. 248–264. 1972. doi:10.1145/321694.321699.
  • [Lawler1976]Lawler, Eugene L.. "Combinatorial Optimization: Networks and Matroids." Holt, Rinehart and Winston. 1976.
  • [Bertsekas1979]Bertsekas, Dimitri P.. "A distributed algorithm for the assignment problem." 1979.
  • [JonkerVolgenant1987]Jonker, Roy and Volgenant, Anton. "A shortest augmenting path algorithm for dense and sparse linear assignment problems." Computing, vol. 38(4), pp. 325–340. 1987. doi:10.1007/BF02278710.
  • [Bertsekas1988]Bertsekas, Dimitri P.. "The auction algorithm: a distributed relaxation method for the assignment problem." Annals of Operations Research, vol. 14(1), pp. 105–123. 1988. doi:10.1007/BF02186476.
  • [GoldbergKennedy1995]Goldberg, Andrew V. and Kennedy, Robert. "An efficient cost scaling algorithm for the assignment problem." Mathematical Programming, vol. 71(2), pp. 153–177. 1995. doi:10.1007/BF01585996.
  • [Kuhn2010Variants]Kuhn, Harold W.. "The Hungarian method for the assignment problem." In 50 Years of Integer Programming 1958–2008, pp. 29–47. 2010. doi:10.1007/978-3-540-68279-0_2.
  • [BurkardDellAmicoMartello2012]Burkard, Rainer E. and Dell'Amico, Mauro and Martello, Silvano. "Assignment Problems." Society for Industrial and Applied Mathematics. 2012. doi:10.1137/1.9781611972238.
  • [Crouse2016]Crouse, David F.. "On implementing 2D rectangular assignment algorithms." IEEE Transactions on Aerospace and Electronic Systems, vol. 52(4), pp. 1679–1696. 2016. doi:10.1109/TAES.2016.140952.
  • [Monge1781]Monge, Gaspard. "Mémoire sur la théorie des déblais et des remblais." Histoire de l'Académie Royale des Sciences, pp. 666–704. 1781.
  • [Kantorovich1942]Kantorovich, Leonid V.. "On the translocation of masses." Doklady Akademii Nauk USSR, vol. 37(7--8), pp. 199–201. 1942.
  • [BenamouBrenier2000]Benamou, Jean-David and Brenier, Yann. "A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem." Numerische Mathematik, vol. 84(3), pp. 375–393. 2000. doi:10.1007/s002110050263.
  • [Rubner2000]Rubner, Yossi and Tomasi, Carlo and Guibas, Leonidas J.. "The earth mover's distance as a metric for image retrieval." International Journal of Computer Vision, vol. 40(2), pp. 99–121. 2000. doi:10.1023/A:1026543900054.
  • [Villani2003]Villani, Cédric. "Topics in Optimal Transportation." American Mathematical Society. 2003. doi:10.1090/gsm/058.
  • [Villani2008]Villani, Cédric. "Optimal Transport: Old and New." Springer. 2008. doi:10.1007/978-3-540-71050-9.
  • [Sinkhorn1967]Sinkhorn, Richard. "Diagonal equivalence to matrices with prescribed row and column sums." The American Mathematical Monthly, vol. 74(4), pp. 402–405. 1967. doi:10.2307/2314570.
  • [Cuturi2013]Cuturi, Marco. "Sinkhorn distances: lightspeed computation of optimal transportation distances." In Advances in Neural Information Processing Systems. 2013.
  • [Arjovsky2017]Arjovsky, Martin and Chintala, Soumith and Bottou, Léon. "Wasserstein generative adversarial networks." In International Conference on Machine Learning, pp. 214–223. 2017.
  • [Genevay2018]Genevay, Aude and Peyré, Gabriel and Cuturi, Marco. "Learning generative models with Sinkhorn divergences." In International Conference on Artificial Intelligence and Statistics, pp. 1608–1617. 2018.
  • [Chizat2018]Chizat, Lenaïc and Peyré, Gabriel and Vialard, François-Xavier and Schmitzer, Bernhard. "Scaling algorithms for unbalanced optimal transport problems." Mathematics of Computation, vol. 87(314), pp. 2563–2609. 2018. doi:10.1090/mcom/3303.
  • [Sejourne2019]Séjourné, Thibault and Feydy, Jean and Vialard, François-Xavier and Trouvé, Alain and Peyré, Gabriel. "Sinkhorn divergences for unbalanced optimal transport." arXiv preprint arXiv:1910.12958. 2019.
  • [Schmitzer2019]Schmitzer, Bernhard. "Stabilized sparse scaling algorithms for entropy regularized transport problems." SIAM Journal on Scientific Computing, vol. 41(3), pp. A1443–A1481. 2019. doi:10.1137/16M1106018.
  • [Orlin1997]Orlin, James B.. "A polynomial time primal network simplex algorithm for minimum cost flows." Mathematical Programming, vol. 78(2), pp. 109–129. 1997. doi:10.1007/BF02614374.
  • [Sejdinovic2013]Sejdinovic, Dino and Sriperumbudur, Bharath and Gretton, Arthur and Fukumizu, Kenji. "Equivalence of distance-based and RKHS-based statistics in hypothesis testing." The Annals of Statistics, vol. 41(5), pp. 2263–2291. 2013. doi:10.1214/13-AOS1140.
  • [Bewley2016]Bewley, Alex and Ge, Zongyuan and Ott, Lionel and Ramos, Fabio and Upcroft, Ben. "Simple online and realtime tracking." In IEEE International Conference on Image Processing (ICIP), pp. 3464–3468. 2016. doi:10.1109/ICIP.2016.7533003.
  • [Wojke2017]Wojke, Nicolai and Bewley, Alex and Paulus, Dietrich. "Simple online and realtime tracking with a deep association metric." In IEEE International Conference on Image Processing (ICIP), pp. 3645–3649. 2017. doi:10.1109/ICIP.2017.8296962.
  • [Zhang2022]Zhang, Yifu and Sun, Peize and Jiang, Yi and Yu, Dongdong and Weng, Fucheng and Yuan, Zehuan and Luo, Ping and Liu, Wenyu and Wang, Xinggang. "ByteTrack: Multi-object tracking by associating every detection box." In European Conference on Computer Vision (ECCV), pp. 1–21. 2022. doi:10.1007/978-3-031-20047-2_1.
  • [Aharon2022]Aharon, Nir and Orfaig, Roy and Bobrovsky, Ben-Zion. "BoT-SORT: Robust associations multi-pedestrian tracking." arXiv preprint arXiv:2206.14651. 2022.
  • [Cao2023]Cao, Jinkun and Pang, Jiangmiao and Weng, Xinshuo and Khirodkar, Rawal and Kitani, Kris. "Observation-centric SORT: Rethinking SORT for robust multi-object tracking." In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 9686–9696. 2023. doi:10.1109/CVPR52729.2023.00934.
  • [Carion2020]Carion, Nicolas and Massa, Francisco and Synnaeve, Gabriel and Usunier, Nicolas and Kirillov, Alexander and Zagoruyko, Sergey. "End-to-end object detection with transformers." In European Conference on Computer Vision (ECCV), pp. 213–229. 2020. doi:10.1007/978-3-030-58452-8_13.
  • [Cheng2021]Cheng, Bowen and Schwing, Alexander G. and Kirillov, Alexander. "Per-pixel classification is not all you need for semantic segmentation." In Advances in Neural Information Processing Systems, pp. 17864–17875. 2021.
  • [Pitie2007]Pitié, François and Kokaram, Anil C. and Dahyot, Rozenn. "Automated colour grading using colour distribution transfer." Computer Vision and Image Understanding, vol. 107(1--2), pp. 123–137. 2007. doi:10.1016/j.cviu.2006.11.011.
  • [Tolstikhin2018]Tolstikhin, Ilya and Bousquet, Olivier and Gelly, Sylvain and Schölkopf, Bernhard. "Wasserstein auto-encoders." In International Conference on Learning Representations. 2018.
  • [Lipman2022]Lipman, Yaron and Chen, Ricky T. Q. and Ben-Hamu, Heli and Nickel, Maximilian and Le, Matt. "Flow matching for generative modeling." In International Conference on Learning Representations. 2023.
  • [Liu2022]Liu, Xingchao and Gong, Chengyue and Liu, Qiang. "Flow straight and fast: Learning to generate and transfer data with rectified flow." In International Conference on Learning Representations. 2023.
  • [Courty2017]Courty, Nicolas and Flamary, Rémi and Tuia, Devis and Rakotomamonjy, Alain. "Optimal transport for domain adaptation." IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 39(9), pp. 1853–1865. 2017. doi:10.1109/TPAMI.2016.2615921.
  • [Damodaran2018]Damodaran, Bharath Bhushan and Kellenberger, Benjamin and Flamary, Rémi and Tuia, Devis and Courty, Nicolas. "DeepJDOT: Deep joint distribution optimal transport for unsupervised domain adaptation." In European Conference on Computer Vision (ECCV), pp. 467–483. 2018. doi:10.1007/978-3-030-01225-0_28.
  • [Agueh2011]Agueh, Martial and Carlier, Guillaume. "Barycenters in the Wasserstein space." SIAM Journal on Mathematical Analysis, vol. 43(2), pp. 904–924. 2011. doi:10.1137/100805741.
  • [Kusner2015]Kusner, Matt J. and Sun, Yu and Kolkin, Nicholas I. and Weinberger, Kilian Q.. "From word embeddings to document distances." In International Conference on Machine Learning, pp. 957–966. 2015.
  • [Schiebinger2019]Schiebinger, Geoffrey and Shu, Jian and Tabaka, Marcin and Cleary, Brian and Subramanian, Vidya and Solomon, Aryeh and Gould, Joshua and Liu, Siyan and Lin, Stacie and Berube, Peter and Lee, Lia and Chen, Jenny and Brumbaugh, Justin and Rigollet, Philippe and Hochedlinger, Konrad and Jaenisch, Rudolf and Regev, Aviv and Lander, Eric S.. "Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming." Cell, vol. 176(4), pp. 928–943. 2019. doi:10.1016/j.cell.2019.01.006.
  • [Klein2023]Klein, Dominik and Palla, Giovanni and Lange, Marius and Klein, Michal and Piran, Zoe and Gander, Manuel and Meng-Papaxanthos, Laetitia and Sterr, Michael and Treutlein, Barbara and Lickert, Heiko and Theis, Fabian J.. "Mapping cells through time and space with moscot." bioRxiv. 2023. doi:10.1101/2023.05.11.540374.

API Reference

Auto-generated API reference for the torchmatch package, generated directly from its docstrings and type hints.