Dear Andrea,
you can use the iterative closest point (ICP) algorithm. The standard
version is available in vtk (class vtkIterativeClosestPointTransform)
and can be used from MITK. There also is the anisotropic ICP (A-ICP,
[1]) which was implemented in MITK and is available with UI as plugin
org.mitk.gui.qt.aicpregistration. However, please notice that this A-ICP
implementation is not as runtime optimized as the vtk ICP and might be
slower.
If your surfaces contain too many vertices this can lead to long
computation times. You might want to export and decimate them a bit,
e.g. using Meshlab (https://www.meshlab.net/).
I hope this helps.
Best,
Alfred
Am 17.12.2021 um 13:24 schrieb Andrea Roberti:
Dear all,
Is there any way to perform a registration algorithm between two
surfaces ?
We saw that the list of matchpoint algorithms accept as input images
and point sets, but no one with surface as DataType.
We thought to extract the points of the surface and then create point
sets, but in this way it could be computationally heavy.
Thanks in advance,
Andrea
_______________________________________________
mitk-users mailing list
mitk-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/mitk-users
--
Prof. Dr. Alfred Franz
Computer Assisted Medical Interventions / E130
German Cancer Research Center (DKFZ)
Im Neuenheimer Feld 280
69120 Heidelberg, Germany
a.fr...@dkfz.de
_______________________________________________
mitk-users mailing list
mitk-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/mitk-users
