Demo Data from EDBT 2026 / reviewers in the wild / expert
Matthias Heiler
dblp:47/5745
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 5 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 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 |
Representation and self-supervised learning · 85% Segmentation and scene understanding · 15% | |
| Computer graphics and multimedia
2 papers |
Image and video processing · 81% Audio and music processing · 19% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 17 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning
matrix factorization |
0.1 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Machine learning › Representation and self-supervised learning › matrix factorization
nonnegative matrix factorization |
0.1 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Machine learning › Representation and self-supervised learning › tensor decomposition
non-negative tensor factorization |
0.1 | 1 | 2006 | Controlling Sparseness in Non-negative Tensor Factorization · ECCV (1) 2006 |
Machine learning › Representation and self-supervised learning
tensor decomposition |
0.1 | 1 | 2006 | Controlling Sparseness in Non-negative Tensor Factorization · ECCV (1) 2006 |
Mathematical optimization
continuous optimization |
0.1 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Mathematical optimization › continuous optimization
convex optimization |
0.1 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Mathematical optimization › continuous optimization › convex optimization › conic optimization
second-order cone programming |
0.1 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Computer vision › Segmentation and scene understanding
image segmentation |
0.1 | 1 | 2005 | Natural Image Statistics for Natural Image Segmentation · Int. J. Comput. Vis. 2005 |
Machine learning › Representation and self-supervised learning
natural image statistics |
0.1 | 1 | 2005 | Natural Image Statistics for Natural Image Segmentation · Int. J. Comput. Vis. 2005 |
Image and video processing
image representation |
0.1 | 1 | 2005 | Learning Non-Negative Sparse Image Codes by Convex Programming · ICCV 2005 |
Audio and music processing
nonnegative matrix factorization |
0.1 | 1 | 2005 | Learning Non-Negative Sparse Image Codes by Convex Programming · ICCV 2005 |
Image and video processing › sparse representation
sparse image representation |
0.1 | 1 | 2005 | Learning Non-Negative Sparse Image Codes by Convex Programming · ICCV 2005 |
Image and video processing
image segmentation |
0.0 | 1 | 2003 | Natural Image Statistics for Natural Image Segmentation · ICCV 2003 |
Image and video processing › image segmentation
natural image segmentation |
0.0 | 1 | 2003 | Natural Image Statistics for Natural Image Segmentation · ICCV 2003 |
Image and video processing › image segmentation
variational segmentation |
0.0 | 1 | 2003 | Natural Image Statistics for Natural Image Segmentation · ICCV 2003 |
Mathematical optimization › continuous optimization
nonlinear optimization |
0.0 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Mathematical optimization › continuous optimization › nonlinear optimization
sequential quadratic programming |
0.0 | 1 | 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming · J. Mach. Learn. Res. 2006 |
Methods — techniques the papers use, named apart from their topics
sequential quadratic programming · 0.1second-order cone programming · 0.1sparsity control · 0.1non-negative tensor factorization · 0.1convex programming · 0.1conic programming · 0.1probabilistic distance measure · 0.0natural image statistics · 0.0level set · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Controlling Sparseness in Non-negative Tensor Factorization
Matthias Heiler, Christoph Schnörr |
ECCV (1) | 1 |
| 2006 | Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone ProgrammingabstractWe exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and second order cone programming. We show that for ordinary NMF, our approach performs as well as existing state-of-the-art algorithms, while for sparsity-constrained NMF, as recently proposed by P. O. Hoyer in JMLR 5 (2004), it outperforms previous methods. In addition, we show how to extend NMF learning within the same optimization framework in order to make use of class membership information in supervised learning problems. Matthias Heiler, Christoph Schnörr |
J. Mach. Learn. Res. | 1 |
| 2005 | Learning Non-Negative Sparse Image Codes by Convex ProgrammingabstractExample-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently non negative matrix factorization (NMF) was suggested to provide image code that was both sparse and localized, in contrast to established non local methods like PCA. In this paper, we adopt and generalize this approach to develop a novel learning framework that allows to efficiently compute sparsity-controlled invariant image codes by a well defined sequence of convex conic programs. Applying the corresponding parameter-free algorithm to various image classes results in semantically relevant and transformation-invariant image representations that are remarkably robust against noise and quantization Matthias Heiler, Christoph Schnörr |
ICCV | 1 |
| 2005 | Natural Image Statistics for Natural Image Segmentation
Matthias Heiler, Christoph Schnörr |
Int. J. Comput. Vis. | 1 |
| 2003 | Natural Image Statistics for Natural Image SegmentationabstractBuilding on recent progress in modeling filter response statistics of natural images we integrate a statistical model into a variational framework for image segmentation. Incorporated in a sound probabilistic distance measure the model drives level sets toward meaningful segmentations of complex textures and natural scenes. Since each region comprises two model parameters only the approach is computationally efficient and enables the application of variational segmentation to a considerably larger class of real-world images. We validate the statistical basis of our approach on thousands of natural images and demonstrate that our model outperforms recent variational segmentation methods based on second-order statistics. Matthias Heiler, Christoph Schnörr |
ICCV | 1 |