Jan Lellmann

Papers

Total Citations

H-Index

About

Jan Lellmann is a researcher whose work bridges the fields of computer vision, optimization, and robotics, with a particular focus on variational methods and inverse problems. His major contributions lie in the development of efficient algorithms for image processing and analysis, notably in the areas of segmentation, denoising, and reconstruction. Lellmann is perhaps best known for his pioneering work on convex relaxation techniques for non-convex optimization problems, which have become foundational in modern computer vision. His highly cited paper on "Total Variation Regularization for Functions with Values in a Manifold" has garnered significant attention, amassing over 200 citations, and has been instrumental in advancing the theoretical and practical understanding of geometric data processing. Additionally, his work on "Continuous Multiclass Labeling Approaches" has been widely adopted, with more than 150 citations, demonstrating his impact on both theoretical and applied fronts. Lellmann’s research has been recognized with several awards, including the prestigious DAGM Prize for his contributions to pattern recognition. His ability to combine rigorous mathematical theory with practical algorithmic solutions makes his work essential reading for students and researchers in computational imaging and optimization.