Softening discrete relaxation

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 438-444

  Finch, Andrew M ^a   Wilson, Richard C ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; HAMMING DISTANCE;

BAYESIAN; CONSISTENCY MEASURES; DISCRETE COMPONENTS; GRAPH-MATCHING ALGORITHMS; NON-LINEAR OPTIMISATION; QUADRATIC ASSIGNMENT PROBLEMS; RELATIONAL GRAPH; STRUCTURAL DIFFERENCES;

PATTERN MATCHING;

EID: 0000784126     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Bridle J.S. '"Braining stochastic model recognition algorithms can lead to maximum mutual information estimation of parameters" NIPS2, pp. 211-217, 1990.
2. Cross A.D.J., R.C.Wilson and E.R. Hancock, "Genetic search for structural matching", Proceedings ECCV96, LNCS 1064, pp. 514-525, 1996.
3. Cross A.D.J, and E.R.Hancock, "Relational matching with stochastic optimisation" IEEE Computer Society International Symposium on Computer Vision, pp. 365-370, 1995.
4. Geman S. and D. Geman, "Stochastic relaxation, Gibbs distributions and Bayesian restoration of images," IEEE PAMI, PAMI-6, pp.721-741, 1984.
5. Gold S., A. Rangarajan and E. Mjolsness, "Learning with pre-knowledge: Clustering with point and graph-matching distance Measures", Neural Computation, 8, pp. 787-804, 1996.
6. Gold S. and A. Rangarajan, "A graduated assignment algorithm for graph matching", IEEE PAMI, 18, pp. 377-388, 1996.
7. Sanfeliu A. and Fu K.S., "A distance measure between attributed relational graphs for pattern recognition", IEEE SMC, 13, pp 353-362, 1983.
8. Shapiro L. and R.M.Haralick, "Structural description and inexact matching", IEEE PAMI, 3, pp 504-519, 1981.
9. Simic P., "Constrained nets for graph matching and other quadratic assignment problems", Neural Computation, 3 , pp. 268-281, 1991.
10. Suganathan P.N., E.K. Teoh and D.P. Mital, "Pattern recognition by graph matching using Potts MFT networks", Pattern Recognition, 28, pp. 997-1009, 1995.
11. Wilson R.C., Evans A.N. and Hancock E.R., "Relational matching by discrete relaxation", Image and Vision Computing, 13, pp. 411-421, 1995.
12. Wilson R.C and Hancock E.R., "Relational matching with dynamic graph structures", Proceedings of the Fifth International Conference on Computer Vision, pp. 450-456, 1995.
13. Yuille A., "Generalised deformable models, statistical physics and matching problems", Neural Computation, 2, pp. 1-24, 1990.