Semantic Correspondence as an Optimal Transport Problem. Liu, Y., Zhu, L., Yamada, M., & Yang, Y. In CVPR, 2020. Paper doi bibtex 1 download @inproceedings{DBLP:conf/cvpr/LiuZYY20,
author = {Yanbin Liu and
Linchao Zhu and
Makoto Yamada and
Yi Yang},
title = {Semantic Correspondence as an Optimal Transport Problem},
booktitle = {CVPR},
year = {2020},
url = {https://openaccess.thecvf.com/content\_CVPR\_2020/html/Liu\_Semantic\_Correspondence\_as\_an\_Optimal\_Transport\_Problem\_CVPR\_2020\_paper.html},
doi = {10.1109/CVPR42600.2020.00452},
timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cvpr/LiuZYY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 1
{"_id":"55iaFZkuQ8pyAWHXH","bibbaseid":"liu-zhu-yamada-yang-semanticcorrespondenceasanoptimaltransportproblem-2020","author_short":["Liu, Y.","Zhu, L.","Yamada, M.","Yang, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Yanbin"],"propositions":[],"lastnames":["Liu"],"suffixes":[]},{"firstnames":["Linchao"],"propositions":[],"lastnames":["Zhu"],"suffixes":[]},{"firstnames":["Makoto"],"propositions":[],"lastnames":["Yamada"],"suffixes":[]},{"firstnames":["Yi"],"propositions":[],"lastnames":["Yang"],"suffixes":[]}],"title":"Semantic Correspondence as an Optimal Transport Problem","booktitle":"CVPR","year":"2020","url":"https://openaccess.thecvf.com/content\\_CVPR\\_2020/html/Liu\\_Semantic\\_Correspondence\\_as\\_an\\_Optimal\\_Transport\\_Problem\\_CVPR\\_2020\\_paper.html","doi":"10.1109/CVPR42600.2020.00452","timestamp":"Wed, 27 Oct 2021 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/cvpr/LiuZYY20.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/cvpr/LiuZYY20,\n author = {Yanbin Liu and\n Linchao Zhu and\n Makoto Yamada and\n Yi Yang},\n title = {Semantic Correspondence as an Optimal Transport Problem},\n booktitle = {CVPR},\n year = {2020},\n url = {https://openaccess.thecvf.com/content\\_CVPR\\_2020/html/Liu\\_Semantic\\_Correspondence\\_as\\_an\\_Optimal\\_Transport\\_Problem\\_CVPR\\_2020\\_paper.html},\n doi = {10.1109/CVPR42600.2020.00452},\n timestamp = {Wed, 27 Oct 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/cvpr/LiuZYY20.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Liu, Y.","Zhu, L.","Yamada, M.","Yang, Y."],"key":"DBLP:conf/cvpr/LiuZYY20","id":"DBLP:conf/cvpr/LiuZYY20","bibbaseid":"liu-zhu-yamada-yang-semanticcorrespondenceasanoptimaltransportproblem-2020","role":"author","urls":{"Paper":"https://openaccess.thecvf.com/content\\_CVPR\\_2020/html/Liu\\_Semantic\\_Correspondence\\_as\\_an\\_Optimal\\_Transport\\_Problem\\_CVPR\\_2020\\_paper.html"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/a6tWMqLRtcFTz3zv2","dataSources":["aczvoZgtaDfcHujRD","CFFv4a4bA6H73j9GB","qRhruWZstYHxz4e9q","tgKxDRxSnoPRC79cH","WKfsR8PDSWzp46ZNs","NMy64xygxcefaFhFL"],"keywords":[],"search_terms":["semantic","correspondence","optimal","transport","problem","liu","zhu","yamada","yang"],"title":"Semantic Correspondence as an Optimal Transport Problem","year":2020,"downloads":1}