A Stable Marriages Algorithm to Optimize Satisfaction and Equity
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.
KeywordsStable Match Stereo Match Global Satisfaction Feature Pairing Preference List
Unable to display preview. Download preview PDF.
- 1.Zavidovique, B., Suvonvorn, N., Seetharaman, G.S.: A novel representation and algorithms for (quasi) stable marriages. In: ICINCO 2005 (September 2005)Google Scholar
- 5.Hartke, S., Bianco, D., Larimer, A.: Stable matchings in the couples problem. Morehead Electronic Journal of Applicable Mathematics 2 (June 2001)Google Scholar
- 6.Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical Report TR-1999-29, Computing Science Department of Glasgow University (January 1999)Google Scholar
- 8.Abeledo, H., Rothblum, U.G.: Paths to marriage stability. Elsevier: Discrete Applied Mathematics 63(1-12) (1995)Google Scholar