Learning the Graph Edit Distance Parameters for Point-Set Image Registration

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Alignment of point sets is frequently used in pattern recognition when objects are represented by sets of coordinate points. The idea behind this problem is to be able to compare two objects regardless of the effect of a given transformation on their coordinate data. This paper presents a method to align point sets based on the graph edit distance. The main idea is to learn the edit costs (in a learning step) and then apply graph edit distance (in a pattern recognition step) with the learned edit costs. Thus, the edit cost would have to incorporate the transformation parameters. In the experimental section, we show that the method is competitive if the graph edit distance parameters are automatically learned considering the learning set. These parameters are the insertion and deletion costs and also the weights on the substitution costs.

Cite

CITATION STYLE

APA

Algabli, S., Santacruz, P., & Serratosa, F. (2019). Learning the Graph Edit Distance Parameters for Point-Set Image Registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11678 LNCS, pp. 447–456). Springer Verlag. https://doi.org/10.1007/978-3-030-29888-3_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free