Abstract
Consensus strategies have been recently studied to help machine learning ensure better results. Likewise, optimisation in graph matching has been explored to accelerate and improve pattern recognition systems. In this paper, we present a fast and simple consensus method which, given two correspondences of sets generated by separate entities, enounces a final consensus correspondence. It is based on an optimisation method that minimises the cost of the correspondence while forcing it (to the most) to be a weighted mean. We tested our strategy comparing ourselves with the classical minimum cost matching system, using a palmprint database, with each palmprint is represented by an average of 1000 minutiae.
This research is supported by the Spanish CICYT project DPI2013-42458-P and Consejo Nacional de Ciencia y Tecnologías (CONACyT Mexico).
Chapter PDF
Similar content being viewed by others
References
Franek, F., Jiang, X., He, C.: Weighted Mean of a Pair of Clusterings. Pattern Analysis Applications. Springer (2012)
Mimaroglu, S., Erdil, E.: Combining multiple clusterings using similarity graphs. Pattern Recognition 44, 694–703 (2010)
Murino, L., Angelini, C., De Feis, I., Raiconi, G., Tagliaferri, R.: Beyond classical consensus clustering: The least squares approach to multiple solutions. Pattern Recognition Letters 32, 1604–1612 (2011)
Ghahramani, Z.: Unsupervised Learning. Advanced Lectures on Machine Learning, pp. 72–112. Springer (2004)
Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (July 1998)
Kuhn, H.W.: The Hungarian method for the assignment problem Export. Naval Research Logistics Quarterly 2(1-2), 83–97 (1955)
Qing, Y., Haizhen, W., Zhenzhen, J., Yan, P.: Graph Theory and its application in optimization of gas drainage system in coal mine. Procedia Engineering 45, 339–344 (2012)
Gao, L., Wang, Y., Tang, Z., Lin, X.: Newspaper article reconstruction using ant colony optimization and bipartite graph. Applied Soft Computing 13, 3033–3046 (2013)
Eberspächer, P., Verl, A.: Realizing energy reduction of machine tools through a control-integrated consumption graph-based optimization method. Procedia CIRP 7, 640–645 (2013)
Livi, L., Rizzi, A., Sadeghian, A.: Optimized dissimilarity space embedding for labeled graphs
Solé, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance cost: Properties and Applications. International Journal of Pattern Recognition and Artificial Intelligence. IJPRAI 26(5) (2012)
Jain, A.K., Feng, J.: Latent Palmprint Matching. IEEE Trans. on PAMI (2009)
Funada, J., et al.: Feature Extraction Method for Palmprint Considering Elimination of Creases. In: Proc. 14th Int. Conf. Pattern Recognition, pp. 1849–1854 (1998)
Dai, J., Zhou, J.: Multifeature-Based High-Resolution Palmprint Recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 33(5), 945–957 (2011)
Dai, J., Feng, J., Zhou, J.: Robust and Efficient Ridge Based Palmprint Matching. IEEE Transactions on Pattern Analysis and Matching Intelligence 34(8) (2012)
Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Franek, L., Jiang, X.: Ensemble clustering by means of clustering embedding in vector space. Pattern Recognition 47(2), 833–842 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moreno-García, C.F., Serratosa, F. (2014). Weighted Mean Assignment of a Pair of Correspondences Using Optimisation Functions. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. S+SSPR 2014. Lecture Notes in Computer Science, vol 8621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44415-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-44415-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44414-6
Online ISBN: 978-3-662-44415-3
eBook Packages: Computer ScienceComputer Science (R0)