Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Zöller

dblp:47/3937 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2007
0009-0000-8825-7588ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Segmentation and scene understanding · 60% Probabilistic and Bayesian machine learning · 40%
Computer graphics and multimedia
3 papers
Image and video processing · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
image segmentation
0.122007
Robust Image Segmentation Using Resampling and Shape Constraints · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Parametric Distributional Clustering for Image Segmentation · ECCV (3) 2002
Image and video processing
image segmentation
0.122004
Shape Constrained Image Segmentation by Parametric Distributional Clustering · CVPR (1) 2004
Parametric Distributional Clustering for Image Segmentation · ECCV (3) 2002
Computer vision › Segmentation and scene understanding › image segmentation › model-based segmentation
shape-prior segmentation
0.112007
Robust Image Segmentation Using Resampling and Shape Constraints · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Machine learning › Probabilistic and Bayesian machine learning
clustering
0.012004
Shape Constrained Image Segmentation by Parametric Distributional Clustering · CVPR (1) 2004
Image and video processing
image resampling
0.012007
Robust Image Segmentation Using Resampling and Shape Constraints · IEEE Trans. Pattern Anal. Mach. Intell. 2007

Methods — techniques the papers use, named apart from their topics

parametric distributional clustering · 0.2resampling · 0.1generative clustering · 0.1bayesian inference · 0.1shape constraints · 0.0shape constraint · 0.0
YearPublicationVenuePosition
2007 Robust Image Segmentation Using Resampling and Shape Constraints
abstract
Automated segmentation of images has been considered an important intermediate processing task to extract semantic meaning from pixels. We propose an integrated approach for image segmentation based on a generative clustering model combined with coarse shape information and robust parameter estimation. The sensitivity of segmentation solutions to image variations is measured by image resampling. Shape information is included in the inference process to guide ambiguous groupings of color and texture features. Shape and similarity-based grouping information is combined into a semantic likelihood map in the framework of Bayesian statistics. Experimental evidence shows that semantically meaningful segments are inferred even when image data alone gives rise to ambiguous segmentations.
Thomas Zöller, Joachim M. Buhmann
IEEE Trans. Pattern Anal. Mach. Intell.1
2004 Shape Constrained Image Segmentation by Parametric Distributional Clustering
Thomas Zöller, Joachim M. Buhmann
CVPR (1)1
2002 Parametric Distributional Clustering for Image Segmentation
Lothar Hermes, Thomas Zöller, Joachim M. Buhmann
ECCV (3)2
2000 Active Learning for Hierarchical Pairwise Data Clustering
abstract
Pairwise data clustering is a well founded grouping technique based on relational data of objects which has a widespread application domain. However, its applicability suffers from the disadvantageous fact that N objects give rise to N(N-1)/2 relations. To cure this unfavorable scaling, techniques to sparsely sample the relations have been developed. Yet a randomly chosen subset of the data might not grasp the structure of the complete data set. To overcome this deficit, we use active learning methods from the field of statistical decision theory. Extending existing approaches we present an algorithm for actively learning hierarchical group structures based on mean field annealing optimization.
Joachim M. Buhmann, Thomas Zöller
ICPR2