An importance sampling approach to learning structural representations of shape

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

Volumn , Issue , 2008, Pages

  Torsello, Andrea ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI TRIALS; DELAUNAY GRAPH; EXPONENTIAL EXPLOSION; GENERATIVE MODELING; IMAGE FEATURES; IMPORTANCE SAMPLING; LOCAL STRUCTURES; PAPER ADDRESSES; SHOCK GRAPHS; STRUCTURAL MODELING;

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; ESTIMATION; FEATURE EXTRACTION; GRAPH THEORY; IMAGE PROCESSING; MODEL STRUCTURES; PATTERN RECOGNITION;

PARAMETER ESTIMATION;

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

References (20)

1. H. G. Barrow and R. M. Burstall, "Subgraph isomorphism, matching relational structures and maximal cliques." Inf. Proc. Letters, 4:83-84, 1976.
2. I. Beichl and F. Sullivan, "Approximating the permanent via importance sampling with application to the dimer covering problem." J. Comput. Phys. 149(1):128-147, 1999.
3. B. Bonev et al., "Constellations and the Unsupervised Learning of Graphs." In Graph Based representations in Pattern Recognition, Springer, LNCS Vol. 4538, 2007.
4. H. Bunke et al., "Graph Clustering Using the Weighted Minimum Common Supergraph." In Graph Based Representations in Pattern Recognition, Springer, pp. 235-246, 2003.
5. S. J. Dickinson, A. P. Pentlan, and A. Rosenfeld, "3-D shape recovery using distributed aspect matching." IEEE Trans. Pattern Analysis and Machine Intelligence, 14(2):174-198, 1992.
6. P. Erdös and A. Rényi, "Asymmetric graphs." Acta Math. Acad. Sci. Hungar. 14:295-315, 1963.
7. N. Friedman and D. Koller, "Being Bayesian about Network Structure." Machine Learning, 50(1-2):95-125, 2003.
8. L. Getoor et al., "Learning Probabilistic models of relational structure." In 8th Int. Conf. on Machine Learning, 2001.
9. M. Hagenbuchner, A. Sperduti, and A.C. Tsoi, "A Self-Organizing Map for Adaptive Processing of Structured Data." IEEE Trans. Neural Networks, 14:491-505, 2003.
10. J. M. Hammersley and D. C. Handscomb, Monte Carlo Methods, Wiley, New York, 1964.
11. D. Heckerman, D. Geiger, and D. M. Chickering, "Learning Bayesian networks: the combination of knowledge and statistical data." Machine Learning, 20(3):197-243, 1995.
12. Ioffe, S. and Forsyth, D.A., "Human Tracking with Mixtures of Trees." In IEEE Comp. Soc. Int. Conf. Computer Vision, Vol. I, pp. 690-695, 2001.
13. B. J. Jain and F. Wysotzki, "Central Clustering of Attributed Graphs." Machine Learning, 56:169-207, 2004.
14. B. B. Kimia, A. R. Tannenbaum, and S.W. Zucker, "Shapes, shocks, and deformations I." International Journal of Computer Vision, 15:189-224, 1995.
15. Liu, T. and Geiger, D., "Approximate Tree Matching and Shape Similarity." In IEEE Comp. Soc. Int. Conf. Computer Vision, pp. 456-462, 1999.
16. R. Sinkhorn, "A relationship between arbitrary positive matrices and double stochastic matrices." Ann. Math. Stat. 35:876-879, 1964.
17. S. Todorovic and N. Ahuja, "Extracting Subimages of an unknown category from a set of images." In IEEE Comp. Soc. conf. Computer Vision and Pattern Recognition, Vol. 1, pp. 927-934, 2006.
18. A. Torsello, E. R. Hancock, "Learning Shape-Classes Using a Mixture of Tree-Unions." IEEE Trans. Pattern Analysis and Machine Intelligence, 28(6):954-967, 2006.
19. D. White and R. C. Wilson, "Spectral Generative Models for Graphs." In Int. Conf. Image Analysis and Processing, IEEE Computer Society, pp. 35-42, 2007.
20. Zhu, S.C. and Yuille, A.L., "FORMS: A Flexible Object Recognition and Modelling System." International Journal of Computer Vision, 20(3):187-212, 1996.