Graph Matching with Hierarchical Discrete Relaxation
暂无分享,去创建一个
[1] Edwin R. Hancock,et al. Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[2] Edwin R. Hancock,et al. Genetic Algorithms for Structural Editing , 1998, SSPR/SPR.
[3] Thomas C. Henderson. Discrete relaxation techniques , 1989 .
[4] David Heckerman,et al. Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.
[5] K. Boyer,et al. Organizing Large Structural Modelbases , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[6] D. Cooper,et al. SimpleParallel Hierarchical andRelaxation Algorithms forSegmenting Noncausal MarkovianRandom Fields , 1987 .
[7] R. W. Ehrich,et al. A framework for uncertainty reasoning in hierarchical visual evidence space , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.
[8] K. Sengupta,et al. Using geometric hashing with information theoretic clustering for fast recognition from a large CAD modelbase , 1995, Proceedings of International Symposium on Computer Vision - ISCV.
[9] Basilis Gidas,et al. A Renormalization Group Approach to Image Processing Problems , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[11] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[12] Larry S. Davis,et al. Hierarchical Constraint Processes for Shape Analysis , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[13] Edwin R. Hancock,et al. Matching delaunay graphs , 1997, Pattern Recognit..
[14] Michael I. Jordan,et al. Probabilistic Independence Networks for Hidden Markov Probability Models , 1997, Neural Computation.
[15] David J. Spiegelhalter,et al. Sequential updating of conditional probabilities on directed graphical structures , 1990, Networks.