Correspondence consensus of two sets of correspondences through optimisation functions.

Abstract

We present a consensus method which, given the two correspondences between sets of elements generated by separate entities, enounces a final correspondence consensus considering the existence of outliers. Our method is based on an optimisation technique that minimises the cost of the correspondence while forcing (to the most) to be the mean correspondence of the two original correspondences. The method decides the mapping of the elements that the original correspondences disagree and returns the same element mapping when both correspondences agree. We first show the validity of the method through an experiment in ideal conditions based on palmprint identification, and subsequently present two practical experiments based on image retrieval.

Citation

MORENO-GARCÍA, C.F. and SERRATOSA, F. 2017. Correspondence consensus of two sets of correspondences through optimisation functions. Pattern analysis and applications [online], 20(1), pages 201-213. Available from: https://doi.org/10.1007/s10044-015-0486-y

• Journal Article Type: Article
• Acceptance Date: May 7, 2015
• Online Publication Date: May 28, 2015
• Publication Date: Feb 28, 2017
• Deposit Date: Feb 17, 2020
• Publicly Available Date: Mar 2, 2020
• Journal: Pattern Analysis and Applications
• Print ISSN: 1433-7541
• Electronic ISSN: 1433-755X
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 20
• Issue: 1
• Pages: 201-213
• DOI: https://doi.org/10.1007/s10044-015-0486-y
• Keywords: Assignment problem; Consensus strategy; Weighted mean; Hamming distance; Optimisation
• Public URL: https://rgu-repository.worktribe.com/output/860407