Dr. Isaak Lim
Study Lifecycle Management
Mail: isaak.lim@cs.rwth-aachen.de
Phone: +49 241 8021805
Ahornstraße 55, building E3, room
D-52074 Aachen / Germany
Ich bin im Studiencenters Informatik für das Study Lifecycle Management zuständig.
Weiterhin bin ich Affiliated Researcher der Graphics, Geometry & Multimedia Group des Visual Computing Institute der RWTH Aachen. Mein Forschungsbereich ist 3D shape analysis and shape learning.
Ich bin zuständig für die folgenden Aufgabenbereich:
- Klassifikation von Bewerbungen und Koordination der Bewerberauswahl für die Master Studiengänge der Informatik
- Entwicklung und Wartung des Computer Science Application Management (CSAM) Tools
- Förderung von Studierenden (Dean’s List, Porsche IT Campus RWTH Aachen-Stipendium)
- Unterstützung bei der Kohortenverfolgung und Datenanalyse zur Entfaltung der Potenziale von Studierenden
Lehre
Ich biete Vorlesungen, Seminare und Praktika aus dem Bereich 3D shape analysis und shape learning an:
Sommersemester 2022
Wintersemester 21/22
Publikationen
2023
Ibing, Moritz; Lim, Isaak; Kobbelt, Leif
Localized Latent Updates for Fine-Tuning Vision-Language Models Proceedings Article
In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2023, IEEE, 2023.
@inproceedings{ibing_localized,
title = {Localized Latent Updates for Fine-Tuning Vision-Language Models},
author = {Moritz Ibing and Isaak Lim and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03349/},
year = {2023},
date = {2023-01-01},
urldate = {2023-01-01},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, CVPR Workshops 2023},
publisher = {IEEE},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
2021
Dielen, Alexander; Lim, Isaak; Lyon, Max; Kobbelt, Leif
Learning Direction Fields for Quad Mesh Generation Artikel
In: Computer Graphics Forum, Bd. 40, Nr. 5, 2021.
@article{dielen2021learning_direction_fields,
title = {Learning Direction Fields for Quad Mesh Generation},
author = {Alexander Dielen and Isaak Lim and Max Lyon and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03337/},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
journal = {Computer Graphics Forum},
volume = {40},
number = {5},
abstract = {State of the art quadrangulation methods are able to reliably and robustly convert triangle meshes into quad meshes. Most of these methods rely on a dense direction field that is used to align a parametrization from which a quad mesh can be extracted. In this context, the aforementioned direction field is of particular importance, as it plays a key role in determining the structure of the generated quad mesh. If there are no user-provided directions available, the direction field is usually interpolated from a subset of principal curvature directions. To this end, a number of heuristics that aim to identify significant surface regions have been proposed. Unfortunately, the resulting fields often fail to capture the structure found in meshes created by human experts. This is due to the fact that experienced designers can leverage their domain knowledge in order to optimize a mesh for a specific application. In the context of physics simulation, for example, a designer might prefer an alignment and local refinement that facilitates a more accurate numerical simulation. Similarly, a character artist may prefer an alignment that makes the resulting mesh easier to animate. Crucially, this higher level domain knowledge cannot be easily extracted from local curvature information alone. Motivated by this issue, we propose a data-driven approach to the computation of direction fields that allows us to mimic the structure found in existing meshes, which could originate from human experts or other sources. More specifically, we make use of a neural network that aggregates global and local shape information in order to compute a direction field that can be used to guide a parametrization-based quad meshing method. Our approach is a first step towards addressing this challenging problem with a fully automatic learning-based method. We show that compared to classical techniques our data-driven approach combined with a robust model-driven method, is able to produce results that more closely exhibit the ground truth structure of a synthetic dataset (i.e. a manually designed quad mesh template fitted to a variety of human body types in a set of different poses).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
State of the art quadrangulation methods are able to reliably and robustly convert triangle meshes into quad meshes. Most of these methods rely on a dense direction field that is used to align a parametrization from which a quad mesh can be extracted. In this context, the aforementioned direction field is of particular importance, as it plays a key role in determining the structure of the generated quad mesh. If there are no user-provided directions available, the direction field is usually interpolated from a subset of principal curvature directions. To this end, a number of heuristics that aim to identify significant surface regions have been proposed. Unfortunately, the resulting fields often fail to capture the structure found in meshes created by human experts. This is due to the fact that experienced designers can leverage their domain knowledge in order to optimize a mesh for a specific application. In the context of physics simulation, for example, a designer might prefer an alignment and local refinement that facilitates a more accurate numerical simulation. Similarly, a character artist may prefer an alignment that makes the resulting mesh easier to animate. Crucially, this higher level domain knowledge cannot be easily extracted from local curvature information alone. Motivated by this issue, we propose a data-driven approach to the computation of direction fields that allows us to mimic the structure found in existing meshes, which could originate from human experts or other sources. More specifically, we make use of a neural network that aggregates global and local shape information in order to compute a direction field that can be used to guide a parametrization-based quad meshing method. Our approach is a first step towards addressing this challenging problem with a fully automatic learning-based method. We show that compared to classical techniques our data-driven approach combined with a robust model-driven method, is able to produce results that more closely exhibit the ground truth structure of a synthetic dataset (i.e. a manually designed quad mesh template fitted to a variety of human body types in a set of different poses).
Ibing, Moritz; Lim, Isaak; Kobbelt, Leif
3D Shape Generation with Grid-based Implicit Functions Proceedings Article
In: IEEE Computer Vision and Pattern Recognition (CVPR), 2021.
@inproceedings{ibing20213Dshapeb,
title = {3D Shape Generation with Grid-based Implicit Functions},
author = {Moritz Ibing and Isaak Lim and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03332/},
year = {2021},
date = {2021-01-01},
urldate = {2021-01-01},
booktitle = {IEEE Computer Vision and Pattern Recognition (CVPR)},
abstract = {Previous approaches to generate shapes in a 3D setting train a GAN on the latent space of an autoencoder (AE). Even though this produces convincing results, it has two major shortcomings. As the GAN is limited to reproduce the dataset the AE was trained on, we cannot reuse a trained AE for novel data. Furthermore, it is difficult to add spatial supervision into the generation process, as the AE only gives us a global representation. To remedy these issues, we propose to train the GAN on grids (i.e. each cell covers a part of a shape). In this representation each cell is equipped with a latent vector provided by an AE. This localized representation enables more expressiveness (since the cell-based latent vectors can be combined in novel ways) as well as spatial control of the generation process (e.g. via bounding boxes). Our method outperforms the current state of the art on all established evaluation measures, proposed for quantitatively evaluating the generative capabilities of GANs. We show limitations of these measures and propose the adaptation of a robust criterion from statistical analysis as an alternative.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Previous approaches to generate shapes in a 3D setting train a GAN on the latent space of an autoencoder (AE). Even though this produces convincing results, it has two major shortcomings. As the GAN is limited to reproduce the dataset the AE was trained on, we cannot reuse a trained AE for novel data. Furthermore, it is difficult to add spatial supervision into the generation process, as the AE only gives us a global representation. To remedy these issues, we propose to train the GAN on grids (i.e. each cell covers a part of a shape). In this representation each cell is equipped with a latent vector provided by an AE. This localized representation enables more expressiveness (since the cell-based latent vectors can be combined in novel ways) as well as spatial control of the generation process (e.g. via bounding boxes). Our method outperforms the current state of the art on all established evaluation measures, proposed for quantitatively evaluating the generative capabilities of GANs. We show limitations of these measures and propose the adaptation of a robust criterion from statistical analysis as an alternative.
2019
Kalojanov, Javor; Lim, Isaak; Mitra, Niloy; Kobbelt, Leif
String-Based Synthesis of Structured Shapes Artikel
In: Computer Graphics Forum, Bd. 38, Nr. 2, S. 027-036, 2019.
@article{Kalojanov2019,
title = {String-Based Synthesis of Structured Shapes},
author = {Javor Kalojanov and Isaak Lim and Niloy Mitra and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03299/},
doi = {10.1111/cgf.13616},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {Computer Graphics Forum},
volume = {38},
number = {2},
pages = {027-036},
abstract = {We propose a novel method to synthesize geometric models from a given class of context-aware structured shapes such as buildings and other man-made objects. Our central idea is to leverage powerful machine learning methods from the area of natural language processing for this task. To this end, we propose a technique that maps shapes to strings and vice versa, through an intermediate shape graph representation. We then convert procedurally generated shape repositories into text databases that in turn can be used to train a variational autoencoder which enables higher level shape manipulation and synthesis like, e.g., interpolation and sampling via its continuous latent space.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We propose a novel method to synthesize geometric models from a given class of context-aware structured shapes such as buildings and other man-made objects. Our central idea is to leverage powerful machine learning methods from the area of natural language processing for this task. To this end, we propose a technique that maps shapes to strings and vice versa, through an intermediate shape graph representation. We then convert procedurally generated shape repositories into text databases that in turn can be used to train a variational autoencoder which enables higher level shape manipulation and synthesis like, e.g., interpolation and sampling via its continuous latent space.
Lim, Isaak; Ibing, Moritz; Kobbelt, Leif
A Convolutional Decoder for Point Clouds using Adaptive Instance Normalization Artikel
In: Computer Graphics Forum, Bd. 38, Nr. 5, 2019.
@article{Lim:2019:ConvolutionalDecoder,
title = {A Convolutional Decoder for Point Clouds using Adaptive Instance Normalization},
author = {Isaak Lim and Moritz Ibing and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03303/},
year = {2019},
date = {2019-01-01},
urldate = {2019-01-01},
journal = {Computer Graphics Forum},
volume = {38},
number = {5},
abstract = {Automatic synthesis of high quality 3D shapes is an ongoing and challenging area of research. While several data-driven methods have been proposed that make use of neural networks to generate 3D shapes, none of them reach the level of quality that deep learning synthesis approaches for images provide. In this work we present a method for a convolutional point cloud decoder/generator that makes use of recent advances in the domain of image synthesis. Namely, we use Adaptive Instance Normalization and offer an intuition on why it can improve training. Furthermore, we propose extensions to the minimization of the commonly used Chamfer distance for auto-encoding point clouds. In addition, we show that careful sampling is important both for the input geometry and in our point cloud generation process to improve results. The results are evaluated in an auto-encoding setup to offer both qualitative and quantitative analysis. The proposed decoder is validated by an extensive ablation study and is able to outperform current state of the art results in a number of experiments. We show the applicability of our method in the fields of point cloud upsampling, single view reconstruction, and shape synthesis.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Automatic synthesis of high quality 3D shapes is an ongoing and challenging area of research. While several data-driven methods have been proposed that make use of neural networks to generate 3D shapes, none of them reach the level of quality that deep learning synthesis approaches for images provide. In this work we present a method for a convolutional point cloud decoder/generator that makes use of recent advances in the domain of image synthesis. Namely, we use Adaptive Instance Normalization and offer an intuition on why it can improve training. Furthermore, we propose extensions to the minimization of the commonly used Chamfer distance for auto-encoding point clouds. In addition, we show that careful sampling is important both for the input geometry and in our point cloud generation process to improve results. The results are evaluated in an auto-encoding setup to offer both qualitative and quantitative analysis. The proposed decoder is validated by an extensive ablation study and is able to outperform current state of the art results in a number of experiments. We show the applicability of our method in the fields of point cloud upsampling, single view reconstruction, and shape synthesis.
2018
Gehre, Anne; Lim, Isaak; Kobbelt, Leif
Feature Curve Co-Completion in Noisy Data Proceedings Article
In: Computer Graphics Forum, Wiley Online Library 2018.
@inproceedings{gehre2018feature,
title = {Feature Curve Co-Completion in Noisy Data},
author = {Anne Gehre and Isaak Lim and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03287/},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
booktitle = {Computer Graphics Forum},
volume = {37},
number = {2},
organization = {Wiley Online Library},
abstract = {Feature curves on 3D shapes provide important hints about significant parts of the geometry and reveal their underlying structure. However, when we process real world data, automatically detected feature curves are affected by measurement uncertainty, missing data, and sampling resolution, leading to noisy, fragmented, and incomplete feature curve networks. These artifacts make further processing unreliable. In this paper we analyze the global co-occurrence information in noisy feature curve networks to fill in missing data and suppress weakly supported feature curves. For this we propose an unsupervised approach to find meaningful structure within the incomplete data by detecting multiple occurrences of feature curve configurations (co-occurrence analysis). We cluster and merge these into feature curve templates, which we leverage to identify strongly supported feature curve segments as well as to complete missing data in the feature curve network. In the presence of significant noise, previous approaches had to resort to user input, while our method performs fully automatic feature curve co-completion. Finding feature reoccurrences however, is challenging since naive feature curve comparison fails in this setting due to fragmentation and partial overlaps of curve segments. To tackle this problem we propose a robust method for partial curve matching. This provides us with the means to apply symmetry detection methods to identify co-occurring configurations. Finally, Bayesian model selection enables us to detect and group re-occurrences that describe the data well and with low redundancy.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Feature curves on 3D shapes provide important hints about significant parts of the geometry and reveal their underlying structure. However, when we process real world data, automatically detected feature curves are affected by measurement uncertainty, missing data, and sampling resolution, leading to noisy, fragmented, and incomplete feature curve networks. These artifacts make further processing unreliable. In this paper we analyze the global co-occurrence information in noisy feature curve networks to fill in missing data and suppress weakly supported feature curves. For this we propose an unsupervised approach to find meaningful structure within the incomplete data by detecting multiple occurrences of feature curve configurations (co-occurrence analysis). We cluster and merge these into feature curve templates, which we leverage to identify strongly supported feature curve segments as well as to complete missing data in the feature curve network. In the presence of significant noise, previous approaches had to resort to user input, while our method performs fully automatic feature curve co-completion. Finding feature reoccurrences however, is challenging since naive feature curve comparison fails in this setting due to fragmentation and partial overlaps of curve segments. To tackle this problem we propose a robust method for partial curve matching. This provides us with the means to apply symmetry detection methods to identify co-occurring configurations. Finally, Bayesian model selection enables us to detect and group re-occurrences that describe the data well and with low redundancy.
Lim, Isaak; Dielen, Alexander; Campen, Marcel; Kobbelt, Leif
A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes Proceedings Article
In: Proceedings of the European Conference on Computer Vision (ECCV) Workshops, 2018.
@inproceedings{lim2018simple,
title = {A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes},
author = {Isaak Lim and Alexander Dielen and Marcel Campen and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03296/},
year = {2018},
date = {2018-01-01},
urldate = {2018-01-01},
booktitle = {Proceedings of the European Conference on Computer Vision (ECCV) Workshops},
abstract = {The question of representation of 3D geometry is of vital importance when it comes to leveraging the recent advances in the field of machine learning for geometry processing tasks. For common unstructured surface meshes state-of-the-art methods rely on patch-based or mapping-based techniques that introduce resampling operations in order to encode neighborhood information in a structured and regular manner. We investigate whether such resampling can be avoided, and propose a simple and direct encoding approach. It does not only increase processing efficiency due to its simplicity - its direct nature also avoids any loss in data fidelity. To evaluate the proposed method, we perform a number of experiments in the challenging domain of intrinsic, non-rigid shape correspondence estimation. In comparisons to current methods we observe that our approach is able to achieve highly competitive results.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The question of representation of 3D geometry is of vital importance when it comes to leveraging the recent advances in the field of machine learning for geometry processing tasks. For common unstructured surface meshes state-of-the-art methods rely on patch-based or mapping-based techniques that introduce resampling operations in order to encode neighborhood information in a structured and regular manner. We investigate whether such resampling can be avoided, and propose a simple and direct encoding approach. It does not only increase processing efficiency due to its simplicity – its direct nature also avoids any loss in data fidelity. To evaluate the proposed method, we perform a number of experiments in the challenging domain of intrinsic, non-rigid shape correspondence estimation. In comparisons to current methods we observe that our approach is able to achieve highly competitive results.
2016
Gehre, Anne; Lim, Isaak; Kobbelt, Leif
Adapting Feature Curve Networks to a Prescribed Scale Proceedings Article
In: Computer Graphics Forum, S. 319–330, Wiley Online Library 2016.
@inproceedings{gehre2016adapting,
title = {Adapting Feature Curve Networks to a Prescribed Scale},
author = {Anne Gehre and Isaak Lim and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03258/},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
booktitle = {Computer Graphics Forum},
volume = {35},
number = {2},
pages = {319--330},
organization = {Wiley Online Library},
abstract = {Feature curves on surface meshes are usually defined solely based on local shape properties such as dihedral angles and principal curvatures. From the application perspective, however, the meaningfulness of a network of feature curves also depends on a global scale parameter that takes the distance between feature curves into account, i.e., on a coarse scale, nearby feature curves should be merged or suppressed if the surface region between them is not representable at the given scale/resolution. In this paper, we propose a computational approach to the intuitive notion of scale conforming feature curve networks where the density of feature curves on the surface adapts to a global scale parameter. We present a constrained global optimization algorithm that computes scale conforming feature curve networks by eliminating curve segments that represent surface features, which are not compatible to the prescribed scale. To demonstrate the usefulness of our approach we apply isotropic and anisotropic remeshing schemes that take our feature curve networks as input. For a number of example meshes, we thus generate high quality shape approximations at various levels of detail.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Feature curves on surface meshes are usually defined solely based on local shape properties such as dihedral angles and principal curvatures. From the application perspective, however, the meaningfulness of a network of feature curves also depends on a global scale parameter that takes the distance between feature curves into account, i.e., on a coarse scale, nearby feature curves should be merged or suppressed if the surface region between them is not representable at the given scale/resolution. In this paper, we propose a computational approach to the intuitive notion of scale conforming feature curve networks where the density of feature curves on the surface adapts to a global scale parameter. We present a constrained global optimization algorithm that computes scale conforming feature curve networks by eliminating curve segments that represent surface features, which are not compatible to the prescribed scale. To demonstrate the usefulness of our approach we apply isotropic and anisotropic remeshing schemes that take our feature curve networks as input. For a number of example meshes, we thus generate high quality shape approximations at various levels of detail.
Lim, Isaak; Gehre, Anne; Kobbelt, Leif
Identifying Style of 3D Shapes using Deep Metric Learning Artikel
In: Computer Graphics Forum, Bd. 35, Nr. 5, 2016.
@article{Lim:2016:StyleLearning,
title = {Identifying Style of 3D Shapes using Deep Metric Learning},
author = {Isaak Lim and Anne Gehre and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03262/},
year = {2016},
date = {2016-01-01},
urldate = {2016-01-01},
journal = {Computer Graphics Forum},
volume = {35},
number = {5},
abstract = {We present a method that expands on previous work in learning human perceived style similarity across objects with different structures and functionalities. Unlike previous approaches that tackle this problem with the help of hand-crafted geometric descriptors, we make use of recent advances in metric learning with neural networks (deep metric learning). This allows us to train the similarity metric on a shape collection directly, since any low- or high-level features needed to discriminate between different styles are identified by the neural network automatically. Furthermore, we avoid the issue of finding and comparing sub-elements of the shapes. We represent the shapes as rendered images and show how image tuples can be selected, generated and used efficiently for deep metric learning. We also tackle the problem of training our neural networks on relatively small datasets and show that we achieve style classification accuracy competitive with the state of the art. Finally, to reduce annotation effort we propose a method to incorporate heterogeneous data sources by adding annotated photos found online in order to expand or supplant parts of our training data.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We present a method that expands on previous work in learning human perceived style similarity across objects with different structures and functionalities. Unlike previous approaches that tackle this problem with the help of hand-crafted geometric descriptors, we make use of recent advances in metric learning with neural networks (deep metric learning). This allows us to train the similarity metric on a shape collection directly, since any low- or high-level features needed to discriminate between different styles are identified by the neural network automatically. Furthermore, we avoid the issue of finding and comparing sub-elements of the shapes. We represent the shapes as rendered images and show how image tuples can be selected, generated and used efficiently for deep metric learning. We also tackle the problem of training our neural networks on relatively small datasets and show that we achieve style classification accuracy competitive with the state of the art. Finally, to reduce annotation effort we propose a method to incorporate heterogeneous data sources by adding annotated photos found online in order to expand or supplant parts of our training data.
2013
Kremer, Michael; Bommes, David; Lim, Isaak; Kobbelt, Leif
Advanced Automatic Hexahedral Mesh Generation from Surface Quad Meshes Proceedings Article
In: Proceedings of the 22nd International Meshing Roundtable, Springer-Verlag, Berlin, 2013.
@inproceedings{Kremer:2013:IMR,
title = {Advanced Automatic Hexahedral Mesh Generation from Surface Quad Meshes},
author = {Michael Kremer and David Bommes and Isaak Lim and Leif Kobbelt},
url = {https://www.graphics.rwth-aachen.de/publication/03203/},
year = {2013},
date = {2013-01-01},
urldate = {2013-01-01},
booktitle = {Proceedings of the 22nd International Meshing Roundtable},
publisher = {Springer-Verlag},
address = {Berlin},
abstract = {A purely topological approach for the generation of hexahedral meshes from quadrilateral surface meshes of genus zero has been proposed by M. M\"{u}ller-Hannemann: in a first stage, the input surface mesh is reduced to a single hexahedron by successively eliminating loops from the dual graph of the quad mesh; in the second stage, the hexahedral mesh is constructed by extruding a layer of hexahedra for each dual loop from the first stage in reverse elimination order. In this paper, we introduce several techniques to extend the scope of target shapes of the approach and significantly improve the quality of the generated hexahedral meshes. While the original method can only handle "almost convex" objects and requires mesh surgery and remeshing in case of concave geometry, we propose a method to overcome this issue by introducing the notion of concave dual loops. Furthermore, we analyze and improve the heuristic to determine the elimination order for the dual loops such that the inordinate introduction of interior singular edges, i.e. edges of degree other than four in the hexahedral mesh, can be avoided in many cases.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
A purely topological approach for the generation of hexahedral meshes from quadrilateral surface meshes of genus zero has been proposed by M. Müller-Hannemann: in a first stage, the input surface mesh is reduced to a single hexahedron by successively eliminating loops from the dual graph of the quad mesh; in the second stage, the hexahedral mesh is constructed by extruding a layer of hexahedra for each dual loop from the first stage in reverse elimination order. In this paper, we introduce several techniques to extend the scope of target shapes of the approach and significantly improve the quality of the generated hexahedral meshes. While the original method can only handle "almost convex" objects and requires mesh surgery and remeshing in case of concave geometry, we propose a method to overcome this issue by introducing the notion of concave dual loops. Furthermore, we analyze and improve the heuristic to determine the elimination order for the dual loops such that the inordinate introduction of interior singular edges, i.e. edges of degree other than four in the hexahedral mesh, can be avoided in many cases.