Darko Dimitrov, Christian Knauer, Klaus Kriegel


We study approximation algorithms for a matching problem that is motivated by medical applications. Given a small set of points P ⊂ R3 and a surface S, the optimal matching of P with S is represented by a rigid transformation which maps P as ‘close as possible’ to S. Previous solutions either require polynomial runtime of high degree or they make use of heuristic techniques which could be trapped in some local minimum. We propose a modification of the problem setting by introducing small subsets of so called characteristic points Pc ⊆ P and Sc ⊆ S, and assuming that points from Pc must be matched with points from Sc. We focus our attention on the first nontrivial case that occurs if |Pc | = 2, and show that this restriction results in new fast and reliable algorithms for the matching problem. In contrast to heuristic approaches our algorithm provides guarantees on the approximation factor of the matching. Experimental results are provided for surfaces reconstructed from real and synthetic data.


  1. Alt, H. and Guibas, L. (1999). Discrete geometric shapes: Matching, interpolation, and approximation. In Sack, J.-R. and Urrutia, J., editors, Handbook of Computational Geometry, pages 121 - 153. Elsevier Science Publishers B.V. North-Holland, Amsterdam.
  2. Besl, P. J. and McKay, N. D. (1992). A method for registration of 3-d shapes. IEEE Trans. on Pattern Recognition and Machine Intelligence, 14(2):239-256.
  3. Cohen-Steiner, D. and Morvan, J.-M. (2003). Restricted delaunay triangulations and normal cycle. In Proceedings of the 19th Annual ACM Symposium on Computational Geometry, pages 237-246.
  4. Delingette, H., Hebert, M., and Ikeuchi, K. (1993). A spherical representation for the recognition of curved objects. International Conference on Computer Vision, pages 103-112.
  5. Dimitrov, D., Knauer, C., and Kriegel, K. (2005). Matching surfaces with characteristic points. In Proceedings of the 21th European Workshop on Computational Geometry (EWCG), Eindhoven, Netherlands.
  6. Hagedoorn, M. (2000). Pattern matching using similarity measures. PhD thesis, Utrecht University.
  7. Hoffmann, F., Kriegel, K., Schönherr, S., and Wenk, C. (1999). A simple and robust algorithm for landmark registration in computer assisted neurosurgery. Technical report, Freie Universität Berlin.
  8. Johnson, A. and Hebert, M. (1997). Surface registration by matching oriented points. International Conference on Recent Advances in 3-D Digital Imaging and Modeling, pages 121-128.
  9. Kim, S.-J., Jeong, W.-K., and Kim, C.-H. (1999). Lod generation with discrete curvature error metric. In 2nd Korea Israel Bi-National Conference on Geometrical Modeling and Computer Graphics in the WWW Era, pages 97-104.
  10. Mitra, N. J., Gelfand, N., Pottmann, H., and Guibas, L. (2004). Registration of point cloud data from a geometric optimization perspective. In Symposium on Geometry Processing, pages 23-32.
  11. Petitjean, S. (2002). A survey of methods for recovering quadrics in triangle meshes. ACM Comput. Surv., 34(2):211-262.
  12. Rusinkiewicz, S. and Levoy, M. (2001). Efficient variants of the icp algorithm. In Third International Conference on 3D Digital Imaging and Modeling, pages 145-152.
  13. Sharir, M. and Agarwal, P. (1995). Davenport-Schinzel sequences and their geometric applications. Cambridge University Press.
  14. Sun, Y. and Abidi, M. A. (2001). Surface matching by 3d point's fingerprint. In IEEE Int. Conf. On Computer Vision, vol. II, pages 263-269.
  15. van Laarhoven, P.-J.-M. and Aarts, E.-H.-L. (1987). Simulated Annealing: Theory and Applications. D.Reidel Publishing Company, Kluwer.
  16. Wang, Y., Peterson, B. S., and Staib, L. H. (2000). Shapebased 3d surface correspondence using geodesics and local geometry. Computer Vision and Pattern Recognition, 2:2644-2651.
  17. Yamany, S. M. and Farag, A. A. (2002). Surfacing signatures: An orientation independent free-form surface representation scheme for the purpose of objects registration and matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(8), pages 1105- 1120.
  18. Zhang, D. (1999). Harmonic Shape Images: A 3D Freeform Surface Representations and Its Applications in Surface Matching. PhD thesis, Carnegie Mellon University.
  19. Zhang, D. and Hebert, M. (1999). Harmonic maps and their applications in surface matching. In Computer Vision and Pattern Recognition, volume 2, page 2524.
  20. Table 2: Experimental results on noiseless data. The values in the table are the average of the results of 100 runs of the algorithm, each time with a newly generated point set P .

Paper Citation

in Harvard Style

Dimitrov D., Knauer C. and Kriegel K. (2006). REGISTRATION OF 3D - PATTERNS AND SHAPES WITH CHARACTERISTIC POINTS . In Proceedings of the First International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, ISBN 972-8865-40-6, pages 393-400. DOI: 10.5220/0001368303930400

in Bibtex Style

author={Darko Dimitrov and Christian Knauer and Klaus Kriegel},
booktitle={Proceedings of the First International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP,},

in EndNote Style

JO - Proceedings of the First International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP,
SN - 972-8865-40-6
AU - Dimitrov D.
AU - Knauer C.
AU - Kriegel K.
PY - 2006
SP - 393
EP - 400
DO - 10.5220/0001368303930400