default search action
Thomas Schoenemann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c21]Thomas Schoenemann:
Training Nondeficient Variants of IBM-3 and IBM-4 for Word Alignment. ACL (1) 2013: 22-31 - 2012
- [j5]Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Daniel Cremers
:
A Linear Framework for Region-Based Image Segmentation and Inpainting Involving Curvature Penalization. Int. J. Comput. Vis. 99(1): 53-68 (2012) - [j4]Thomas Schoenemann, Daniel Cremers
A Coding-Cost Framework for Super-Resolution Motion Layer Decomposition. IEEE Trans. Image Process. 21(3): 1097-1110 (2012) - [c20]Thomas Schoenemann:
Comparing Linear and Convex Relaxations for Stereo and Motion. ICPRAM (2) 2012: 5-14 - [i3]Vladimir Kolmogorov, Thomas Schoenemann:
Generalized sequential tree-reweighted message passing. CoRR abs/1205.6352 (2012) - 2011
- [j3]Petter Strandmark, Fredrik Kahl, Thomas Schoenemann:
Parallel and distributed vision algorithms using dual decomposition. Comput. Vis. Image Underst. 115(12): 1721-1732 (2011) - [j2]Thomas Schoenemann, Simon Masnou, Daniel Cremers:
The Elastic Ratio: Introducing Curvature Into Ratio-Based Image Segmentation. IEEE Trans. Image Process. 20(9): 2565-2581 (2011) - [c19]Thomas Schoenemann:
Probabilistic Word Alignment under the $L_0$-norm. CoNLL 2011: 172-180 - [c18]Thomas Schoenemann:
Minimizing Count-Based High Order Terms in Markov Random Fields. EMMCVPR 2011: 17-30 - [c17]Thomas Schoenemann, Yubin Kuang, Fredrik Kahl:
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming. EMMCVPR 2011: 163-176 - [c16]Thomas Schoenemann:
Regularizing Mono- and Bi-Word Models for Word Alignment. IJCNLP 2011: 1313-1322 - [i2]Thomas Schoenemann, Simon Masnou, Daniel Cremers:
On a linear programming approach to the discrete Willmore boundary value problem and generalizations. CoRR abs/1101.0777 (2011) - [i1]Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Daniel Cremers:
A linear framework for region-based image segmentation and inpainting involving curvature penalization. CoRR abs/1102.3830 (2011) - 2010
- [j1]Thomas Schoenemann, Daniel Cremers
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking. IEEE Trans. Pattern Anal. Mach. Intell. 32(7): 1153-1164 (2010) - [c15]Thomas Schoenemann, Simon Masnou, Daniel Cremers
On a Linear Programming Approach to the Discrete Willmore Boundary Value Problem and Generalizations. Curves and Surfaces 2010: 629-646 - [c14]Thomas Schoenemann:
Computing Optimal Alignments for the IBM-3 Translation Model. CoNLL 2010: 98-106
2000 – 2009
- 2009
- [c13]Dennis Mitzel, Thomas Pock, Thomas Schoenemann, Daniel Cremers
Video Super Resolution Using Duality Based TV-L1 Optical Flow. DAGM-Symposium 2009: 432-441 - [c12]Thomas Schoenemann, Fredrik Kahl, Daniel Cremers
Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation. ICCV 2009: 17-23 - [c11]Thomas Windheuser, Thomas Schoenemann, Daniel Cremers
Beyond connecting the dots: A polynomial-time algorithm for segmentation and boundary estimation with imprecise user input. ICCV 2009: 717-722 - [p1]Thomas Schoenemann:
Kombinatorische Lösungen für Segmentierungsprobleme im Maschinensehen. Ausgezeichnete Informatikdissertationen 2009: 241-250 - 2008
- [b1]Thomas Schoenemann:
Combinatorial solutions for shape optimization in computer vision. University of Bonn, Germany, 2008, pp. 1-146 - [c10]Thomas Schoenemann, Frank R. Schmidt, Daniel Cremers
Image Segmentation with Elastic Shape Priors via Global Geodesics in Product Spaces. BMVC 2008: 1-10 - [c9]Thomas Schoenemann, Daniel Cremers
High resolution motion layer decomposition using dual-space graph cuts. CVPR 2008 - [c8]Thomas Schoenemann, Daniel Cremers
Globally optimal shape-based tracking in real-time. CVPR 2008 - [c7]Thomas Schoenemann, Daniel Cremers
Matching non-rigidly deformable shapes across images: A globally optimal solution. CVPR 2008 - [c6]Maria Klodt, Thomas Schoenemann, Kalin Kolev, Marek Schikora, Daniel Cremers
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods. ECCV (1) 2008: 332-345 - [c5]Thomas Pock, Thomas Schoenemann, Gottfried Graber, Horst Bischof, Daniel Cremers
A Convex Formulation of Continuous Multi-label Problems. ECCV (3) 2008: 792-805 - 2007
- [c4]Andreas Wedel, Thomas Schoenemann, Thomas Brox, Daniel Cremers
WarpCut - Fast Obstacle Segmentation in Monocular Video. DAGM-Symposium 2007: 264-273 - [c3]Thomas Schoenemann, Daniel Cremers
Globally Optimal Image Segmentation with an Elastic Shape Prior. ICCV 2007: 1-6 - [c2]Thomas Schoenemann, Daniel Cremers
Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs. ICCV 2007: 1-6 - 2006
- [c1]Thomas Schoenemann, Daniel Cremers
Near Real-Time Motion Segmentation Using Graph Cuts. DAGM-Symposium 2006: 455-464
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-04-25 05:57 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: