An Energy Function and Continuous Edit Process for Graph Matching
暂无分享,去创建一个
[1] Geoffrey E. Hinton,et al. The Helmholtz Machine , 1995, Neural Computation.
[2] Carsten Peterson,et al. A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Edwin R. Hancock,et al. Gauging relational consistency and correcting structural errors , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[5] Petar D. Simic. Constrained Nets for Graph Matching and Other Quadratic Assignment Problems , 1991, Neural Comput..
[6] Edwin R. Hancock,et al. A Bayesian compatibility model for graph matching , 1996, Pattern Recognit. Lett..
[7] Kim L. Boyer,et al. Structural Stereopsis for 3-D Vision , 1988, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Josef Kittler,et al. Discrete relaxation , 1990, Pattern Recognit..
[9] J. Buhmann,et al. Pairwise Data Clustering , 1997 .
[10] Edwin R. Hancock,et al. Relational matching with dynamic graph structures , 1995, Proceedings of IEEE International Conference on Computer Vision.
[11] Steven Gold,et al. A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[12] Eam Khwang Teoh,et al. Pattern recognition by graph matching using the Potts MFT neural networks , 1995, Pattern Recognit..
[13] Michael I. Jordan,et al. Exploiting Tractable Substructures in Intractable Networks , 1995, NIPS.
[14] Edwin R. Hancock,et al. Relational matching by discrete relaxation , 1995, Image Vis. Comput..
[15] Andrew K. C. Wong,et al. Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Eric Mjolsness,et al. A Novel Optimizing Network Architecture with Applications , 1996, Neural Computation.
[17] Alan L. Yuille,et al. Generalized Deformable Models, Statistical Physics, and Matching Problems , 1990, Neural Computation.
[18] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[19] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[20] Andrew Blake,et al. Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.
[21] Alan L. Yuille,et al. Statistical Physics, Mixtures of Distributions, and the EM Algorithm , 1994, Neural Computation.
[22] Edwin R. Hancock,et al. Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[23] Robert M. Haralick,et al. A Metric for Comparing Relational Descriptions , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Edwin R. Hancock,et al. Matching Delaunay Graphs , 1995, ICIAP.
[25] P. Anandan,et al. Optimization in Model Matching and Perceptual Organization , 1989, Neural Computation.
[26] John S. Bridle,et al. Training Stochastic Model Recognition Algorithms as Networks can Lead to Maximum Mutual Information Estimation of Parameters , 1989, NIPS.
[27] Benoit Huet,et al. Sensitivity analysis for object recognition from large structural libraries , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[28] Eric Mjolsness,et al. Learning with Preknowledge: Clustering with Point and Graph Matching Distance Measures , 1996, Neural Computation.
[29] Edwin R. Hancock,et al. Inexact graph matching using genetic search , 1997, Pattern Recognit..
[30] Robert M. Haralick,et al. Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] Andrew D. J. Cross,et al. Relational matching with stochastic optimisation , 1995, Proceedings of International Symposium on Computer Vision - ISCV.
[32] Edwin R. Hancock,et al. Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[33] F. R. A. Hopgood,et al. Machine Intelligence 6 , 1972, The Mathematical Gazette.
[34] Alan L. Yuille,et al. A Convergence Proof for the Softassign Quadratic Assignment Algorithm , 1996, NIPS.
[35] J. J. Kosowsky,et al. Statistical Physics Algorithms That Converge , 1994, Neural Computation.
[36] King-Sun Fu,et al. A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.