Probabilistic graph and hypergraph matching

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Zass, Ron ^a   Shashua, Amnon ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; DOUBLY STOCHASTIC; EDGE WEIGHTS; FEATURE SETS; GLOBAL OPTIMUM; GRAPH MATCHING; HYPER GRAPH; INPUT AND OUTPUT; MATCHING PROBLEMS; PROBABILISTIC GRAPHS; PROBABILISTIC INTERPRETATION; PROJECTION ALGORITHMS; TWO GRAPHS; WEIGHT MATRICES;

ARTIFICIAL INTELLIGENCE; CHLORINE COMPOUNDS; COMPUTATIONAL GEOMETRY; COMPUTER VISION; FEATURE EXTRACTION; HEURISTIC PROGRAMMING; IMAGE PROCESSING; ITERATIVE METHODS; MATRIX ALGEBRA; PATTERN MATCHING; PATTERN RECOGNITION; PROBABILITY; SET THEORY; STOCHASTIC MODELS;

GRAPH THEORY;

EID: 51949115377     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587500     Document Type: Conference Paper

References (18)

1. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI): Special section on graph algorithms and computer vision. 23 (2001) 10401151.
2. Pattern Recognition Letters: Special issue on graph based representations. 24 (2003) 10331122.
3. Int. Journal of Pattern Recognition and Art. Intelligence: Special issue on graph matching in pattern recognition and computer vision. 18 (2004) 261517.
4. J. Boyle and R. Dykstra. A method for finding projections onto the intersections of convex sets in Hilbert spaces. Advances in order restricted statistical inference, Proc. Symp., Iowa City/Iowa, 1985.
5. R. Burkard, M. Dell'Amico, and S. Martello. Assignment Problems. SIAM Monographs on Discrete Mathematics and Applications, in preparation.
6. Y. Censor and S. Reich. The Dykstra algorithm with Bregman projections. Communications in Applied Analysis, 2(3):407-419, 1998.
7. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Articial Intelligence, 18:265-298, 2004.
8. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In Neural Information Processing Systems (NIPS), pages 313-320, 2007.
9. R. Dykstra. An iterative procedure for obtaining i-projections onto the intersection of convex sets. The Annals of Probability, 13:975-984, 1985.
10. S. Gold and A. Rangarajan. Softmax to softassign: neural network algorithms for combinatorial optimization. J. Artif. Neural Netw., 2(4):381-399, 1995.
11. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In International Conference of Computer Vision (ICCV), volume 2, pages 1482-1489, October 2005.
12. M. V. Menon. Matrix links, an extremization problem, and the reduction of a non-negative matrix to one with prescribed row and column sums. Canadian Journal of Mathematics, 20:225-232, 1968.
13. J. V. Neumann. Functional Operators Vol. II. Princeton University Press, 1950.
14. C. Schellewald and C. Schnörr. Probabilistic subgraph matching based on convex relaxation. In Computer Vision and Pattern Recognition (CVPR), 2005.
15. R. Sinkhorn and P. Knopp. Concerning nonnegative matrices and doubly stochastic matrices. Pacific Journal of Mathematics, 21(2):343348, 1967.
16. L. Torresani and C. Bregler. Space-time tracking. In ECCV, pages 801-812, 2002.
17. P. Tseng. Dual coordinate ascent methods for nonstrictly convex minimization. Mathematical Programming, 59(1):231-247, 1993.
18. B. J. vanWyk and M. A. vanWyk. A pocs-based graph matching algorithm. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI), 26(11):1526-1530, 2004.