Abstract
This paper deals with designing an algorithm for feature pairing in vision, based on the ”stable marriages” paradigm. Our SZ is an extension of the recently published BZ algorithm. BZ scans the so-called ”marriage table” to optimize global satisfaction and equity over all couples. It still gets about 5% unstable results in average. After a case study that sorts blocking situations into 4 types, we explain here how to resolve unstability in forcing blocking pairs to marry wrt. their type. SZ is compared to BZ and Gale-Shapley on 40000 instances of a 200 persons large population. An example of stereo reconstruction by SZ is given for illustration.
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
Zavidovique, B., Suvonvorn, N., Seetharaman, G.S.: A novel representation and algorithms for (quasi) stable marriages. In: ICINCO 2005 (September 2005)
Suvonvorn, N., Bouchafa, S., Zavidovique, B.: Marrying level lines for stereo or motion. In: Kamel, M.S., Campilho, A.C. (eds.) ICIAR 2005. LNCS, vol. 3656, pp. 391–398. Springer, Heidelberg (2005)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)
Teo, C.-P., Sethuraman, J., Tan, W.-P.: Gale-shapley stable marriage problem revisited: Strategic issues and applications. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 429–438. Springer, Heidelberg (1999)
Hartke, S., Bianco, D., Larimer, A.: Stable matchings in the couples problem. Morehead Electronic Journal of Applicable Mathematics 2 (June 2001)
Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, Computing Science Department of Glasgow University (January 1999)
Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Strongly stable matchings in time o(nm) and extension to the hospitals-residents problem. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 222–233. Springer, Heidelberg (2004)
Abeledo, H., Rothblum, U.G.: Paths to marriage stability. Elsevier: Discrete Applied Mathematics 63(1-12) (1995)
McVitie, D.G., Wilson, L.B.: Three procedures for the stable marriage problem. Communications of the ACM 14(7), 491–492 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suvonvorn, N., Zavidovique, B. (2006). A Stable Marriages Algorithm to Optimize Satisfaction and Equity. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2006. Lecture Notes in Computer Science, vol 4142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867661_38
Download citation
DOI: https://doi.org/10.1007/11867661_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44894-5
Online ISBN: 978-3-540-44896-9
eBook Packages: Computer ScienceComputer Science (R0)