Abstract
In geometric shape matching problems one is given a pattern P, a model Q, a distance measure d (which formalizes the intuitive notion of similarity of such shapes), and a class of geometric transformations applicable to the pattern P. The task is to find a transformation t in the given class that minimizes the distance of the transformed pattern t(P) to the model Q (as measured by d) in order to compute the similarity of the given shapes.
In many applications, among them medical-image analysis, industrial design, robotics or computer vision, where local distortions and complex deformations can occur, this setting is too restrictive, since only the single transformation t is used to align the entire pattern with the model. Almost all known strategies that deal with non-rigid deformations apply heuristics (based on local descent, relaxed LP formulations, simulated annealing, or alike). The quality of the solution found by these heuristics can usually not be related to the quality of a global optimum.
Elastic geometric shape matching tries to remedy this situation by computing a whole set of transformations T. Each transformation \(t\in T\) is applied to a subpattern of P. The objective of the optimization problem becomes twofold: Minimize the distance of the (union of the) transformed subpatterns to the model while also maximizing the similarity of the transformations in the ensemble T. This modeling aims at strategies that compute provably optimal solutions, or alternatively approximative results of a guaranteed quality.
We consider variations of a simple elastic geometric shape matching problem in the plane where each subshape is just a single point. We show that this problem already is NP-hard for the directed Hausdorff- or bottleneck distance under arbitrary translations. We complement our result with efficient algorithms to compute transformation ensembles under both distances for variants of the problem where only translations in a prescribed, fixed direction are allowed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdelmunim, H., Farag, A.A.: Elastic shape registration using an incremental free form deformation approach with the icp algorithm. In: 2011 Canadian Conference on Computer and Robot Vision (CRV), pp. 212–218, May, 2011
Alt, H., Guibas, L.: Discrete geometric shapes: matching, interpolation, and approximation. In: Handbook of Computational Geometry, pp. 121–153. Elsevier B.V. (2000)
Bazen, A.M., Gerez, S.H.: Fingerprint matching by thin-plate spline modelling of elastic deformations. Pattern Recognition 36(8), 1859–1867 (2003)
Cabello, S., Giannopoulos, P., Knauer, C.: On the parameterized complexity of d-dimensional point set pattern matching. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 175–183. Springer, Heidelberg (2006)
Knauer, C., Kriegel, K., Stehn, F.: Non-uniform geometric matchings. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part III. LNCS, vol. 6784, pp. 44–57. Springer, Heidelberg (2011)
Antoine, J.B.: Maintz and Max A. Viergever. A Survey of Medical Image Registration. Medical Image Analysis 2(1), 1–36 (1998)
Myronenko, A., Song, X.: Point set registration: Coherent point drift. IEEE Transactions on Pattern Analysis and Machine Intelligence 32(12), 2262–2275 (2010)
Rohr, K., Stiehl, H.S., Sprengel, R., Buzug, T.M., Weese, J., Kuhn, M.H.: Landmark-based elastic registration using approximating thin-plate splines. IEEE Transactions on Medical Imaging 20(6), 526–534 (2001)
Rusinkiewicz, S., Levoy, M.: Efficient variants of the ICP algorithm. In: Proceedings of the Third International Conference on 3D Digital Imaging and Modeling, pp. 145–152 (2001)
Sankowski, P.: Faster dynamic matchings and vertex connectivity. In: Bansal, N., Pruhs, K., Stein, C., (eds.) SODA, pp. 118–126. SIAM (2007)
Stehn, F.: Geometric Hybrid Registration. PhD thesis, Freie Universität Berlin (2011)
Remco, C.: Veltkamp and michiel hagedoorn. principles of visual information retrieval. In: Lew, M.S. (ed.) Principles of Visual Information Retrieval Chapter State of the Art in Shape Matching. Advances in Pattern Recognition, pp. 87–119. Springer-Verlag, London (2001)
Venkatasubramanian, S.: Geometric Shape Matching and Drug Design. PhD thesis, Department of Computer Science, Stanford University (1999)
Yoshikawa, T., Koeda, M., Fujimoto, H.: Shape recognition and grasping by robotic hands with soft fingers and omnidirectional camera. In: IEEE International Conference on Robotics and Automation, ICRA 2008, pp. 299–304 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Knauer, C., Stehn, F. (2015). Elastic Geometric Shape Matching for Point Sets under Translations. In: Dehne, F., Sack, JR., Stege, U. (eds) Algorithms and Data Structures. WADS 2015. Lecture Notes in Computer Science(), vol 9214. Springer, Cham. https://doi.org/10.1007/978-3-319-21840-3_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-21840-3_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21839-7
Online ISBN: 978-3-319-21840-3
eBook Packages: Computer ScienceComputer Science (R0)