Affine invariant pattern metrics are useful for shape recognition. It is important that such a metric is robust for various defects. We formalize these types of robustness using four axioms. Then, we present the reflection metric. This is an affine invariant metric defined for the large family of "boundary patterns". A boundary pattern is a finite union of n-1 dimensional algebraic surface patches in ℝn. Such a pattern may have multiple connected components. We prove that the reflection metric satisfies the four robustness axioms.

Article A general method for partial point set matching Share on Authors: Michiel Hagedoorn Utrecht University, Department of Computing Science, Padualaan 14, 3584 CH Utrecht, The Netherlands Utrecht University, Department of Computing Science, Padualaan 14, 3584 CH Utrecht, The NetherlandsView Profile , Remco Veltkamp Utrecht University, Department of Computing Science, Padualaan 14, 3584 CH Utrecht, The Netherlands Utrecht University, Department of Computing Science, Padualaan 14, 3584 CH Utrecht, The NetherlandsView Profile Authors Info & Claims SCG '97: Proceedings of the thirteenth annual symposium on Computational geometryAugust 1997 Pages 406–408https://doi.org/10.1145/262839.263030Published:01 August 1997 5citation510DownloadsMetricsTotal Citations5Total Downloads510Last 12 Months2Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access