default search action
Thorsten Beier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Tobias Fischer, Isabel Paredes, Michael Batchelor, Thorsten Beier, Jesse Haviland, Silvio Traversaro, Wolf Vollprecht, Markus Schmitz, Michael Milford:
ROS2WASM: Bringing the Robot Operating System to the Web. CoRR abs/2409.09941 (2024) - 2022
- [c11]Alberto Bailoni, Constantin Pape, Nathan Hütsch, Steffen Wolf, Thorsten Beier, Anna Kreshuk, Fred A. Hamprecht:
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation. CVPR 2022: 11635-11645
2010 – 2019
- 2019
- [i2]Alberto Bailoni, Constantin Pape
, Steffen Wolf, Thorsten Beier, Anna Kreshuk, Fred A. Hamprecht:
A Generalized Framework for Agglomerative Clustering of Signed Graphs applied to Instance Segmentation. CoRR abs/1906.11713 (2019) - 2018
- [b1]Thorsten Beier:
Multicut algorithms for neurite segmentation. University of Heidelberg, Germany, 2018, pp. 1-104 - [j1]Nikola Krasowski, Thorsten Beier, Graham Knott
Neuron Segmentation With High-Level Biological Priors. IEEE Trans. Medical Imaging 37(4): 829-839 (2018) - 2017
- [c10]Constantin Pape
Solving Large Multicut Problems for Connectomics via Domain Decomposition. ICCV Workshops 2017: 1-10 - 2016
- [c9]Thorsten Beier, Björn Andres
An Efficient Fusion Move Algorithm for the Minimum Cost Lifted Multicut Problem. ECCV (2) 2016: 715-730 - 2015
- [c8]Thorsten Beier, Fred A. Hamprecht, Jörg H. Kappes:
Fusion moves for correlation clustering. CVPR 2015: 3507-3516 - [c7]Nikola Krasowski, Thorsten Beier, Graham W. Knott
Improving 3D EM data segmentation by joint optimization over boundary evidence and biological priors. ISBI 2015: 536-539 - 2014
- [c6]Thorsten Beier, Thorben Kröger, Jörg H. Kappes, Ullrich Köthe, Fred A. Hamprecht:
Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning. CVPR 2014: 73-80 - [c5]Thorben Kröger, Jörg H. Kappes, Thorsten Beier, Ullrich Köthe
Asymmetric Cuts: Joint Image Labeling and Partitioning. GCPR 2014: 199-211 - [c4]Jörg Hendrik Kappes, Thorsten Beier, Christoph Schnörr:
MAP-Inference on Large Scale Higher-Order Discrete Graphical Models by Fusion Moves. ECCV Workshops (2) 2014: 469-484 - [c3]Julian Yarkony, Thorsten Beier, Pierre Baldi, Fred A. Hamprecht:
Parallel Multicut Segmentation via Dual Decomposition. NFMCP 2014: 56-68 - 2012
- [c2]Björn Andres
The Lazy Flipper: Efficient Depth-Limited Exhaustive Search in Discrete Graphical Models. ECCV (7) 2012: 154-166 - [i1]Björn Andres, Thorsten Beier, Jörg H. Kappes:
OpenGM: A C++ Library for Discrete Graphical Models. CoRR abs/1206.0111 (2012) - 2011
- [c1]Björn Andres
Probabilistic image segmentation with closedness constraints. ICCV 2011: 2611-2618
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: