An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem

Beier, Thorsten; Andres, Bjoern; Köthe, Ullrich; Hamprecht, Fred A.

doi:10.1007/978-3-319-46475-6_44

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem

MPS-Authors

/persons/resource/persons98382

Andres, Bjoern
Computer Vision and Multimodal Computing, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

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

Beier, T., Andres, B., Köthe, U., & Hamprecht, F. A. (2016). An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem. In B. Leibe, J. Matas, & M. Welling (Eds.), Computer Vision - ECCV 2016. Berlin: Springer. doi:10.1007/978-3-319-46475-6_44.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-26F1-7

Abstract

There is no abstract available