A Comparative Study of Graph Matching Algorithms in Computer Vision

Haller, Stefan; Feineis, Lorenz; Hutschenreiter, Lisa; Bernard, Florian; Rother, Carsten; Kainmüller, Dagmar; Swoboda, Paul; Savchynskyy, Bogdan

doi:10.1007/978-3-031-20050-2_37

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Comparative Study of Graph Matching Algorithms in Computer Vision

MPS-Authors

/persons/resource/persons221924

Swoboda, Paul
Computer Vision and Machine Learning, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/c260l
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Haller, S., Feineis, L., Hutschenreiter, L., Bernard, F., Rother, C., Kainmüller, D., et al. (2022). A Comparative Study of Graph Matching Algorithms in Computer Vision. In S. Avidan, G. Brostow, M. Cissé, G. Farinella, & T. Hassner (Eds.), Computer Vision -- ECCV 2022 (pp. 636-653). Berlin: Springer. doi:10.1007/978-3-031-20050-2_37.

Cite as: https://hdl.handle.net/21.11116/0000-000C-2AA3-D

Abstract

There is no abstract available