
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Andrea Torsello, Edwin R. Hancock, "Learning ShapeClasses Using a Mixture of TreeUnions," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 6, pp. 954967, June, 2006.  
BibTex  x  
@article{ 10.1109/TPAMI.2006.125, author = {Andrea Torsello and Edwin R. Hancock}, title = {Learning ShapeClasses Using a Mixture of TreeUnions}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {6}, issn = {01628828}, year = {2006}, pages = {954967}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.125}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Learning ShapeClasses Using a Mixture of TreeUnions IS  6 SN  01628828 SP954 EP967 EPD  954967 A1  Andrea Torsello, A1  Edwin R. Hancock, PY  2006 KW  Structural learning KW  tree clustering KW  mixture modelinq KW  minimum description length KW  model codes KW  shock graphs. VL  28 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] R. Baxter and J. Olivier, “MDL and MML: Similarities and Differences (Introduction to Minimum Encoding Inference— Part III),” Technical Report 207, Dept. of Computer Science, Monash Univ., 1994.
[2] H. Bunke et al., “Graph Clustering Using the Weighted Minimum Common Supergraph,” Graph Based Representations in Pattern Recognition, pp. 235246, 2003.
[3] C.J.K. Chow and C.N. Liu, “Approximating Discrete Probability Distributions with Dependence Trees,” IEEE Trans. Information Theory, vol. 14, no. 3, pp. 462467, 1968.
[4] T.F. Cootes, C.J. Taylor, and D.H. Cooper, “Active Shape Models— Their Training and Application,” Computer Vision and Image Understanding, vol. 61, pp. 3859, 1995.
[5] A.P. Dempster, N.M. Laird, and D.B. Rubin, “Maximum Likelihood from Incomplete Data via the EM Algorithm,” J. Royal Statistical Soc., Series B, vol. 39, pp. 138, 1977.
[6] M.A. Eshera and K.S. Fu, “An Image Understanding System Using Attributed Symbolic Representation And Inexact GraphMatching,” IEEE Trans. Pattern Recognition and Machine Intelligence, vol. 8, pp. 604618, 1986.
[7] M.A.T. Figueiredo and A.K. Jain, “Unsupervised Learning of Finite Mixture Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 3, pp. 381396, Mar. 2002.
[8] D. Fisher, “Knowledge Acquisition via Incremental Conceptual Clustering,” Machine Learning, vol. 2, no. 2, pp. 139172, 1987.
[9] N. Friedman, “Learning Bayesian Networks in the Presence of Missing Variables,” Proc. Int'l Conf. Machine Learning, pp. 125133, 1997.
[10] N. Friedman and D. Koller, “Being Bayesian about Network Structure,” Machine Learning, vol. 50, nos. 12, pp. 95125, 2003.
[11] L. Getoor et al., “Learning Probabilistic Models of Relational Structure,” Proc. Int'l Conf. Machine Learning, pp. 170177, 2001.
[12] P. Grünwald, “A Minimum Description Length Approach to Grammar Inference,” Proc. Symbolic, Connectionist, and Statistical Approaches to Learning for Natural Language Processing, pp. 203216, 1996.
[13] P. Grünwald, “Minimum Description Length Tutorial,” Advances in Minimum Description Length: Theory and Applications, Apr. 2005.
[14] D. Heckerman, D. Geiger, and D.M. Chickering, “Learning Bayesian Networks: The Combination of Knowledge and Statistical Data,” Machine Learning, vol. 20, no. 3, pp. 197243, 1995.
[15] M. Hagenbuchner, A. Sperduti, and A.C. Tsoi, “A SelfOrganizing Map for Adaptive Processing of Structured Data,” IEEE Trans. Neural Networks, vol. 14, pp. 491505, 2003.
[16] T. Horváth, S. Worbel, and U. Bohnebeck, “Relational InstanceBased Learning with Lists and Terms,” Machine Learning, vol. 43, pp. 5380, 2001.
[17] S. Ioffe and D.A. Forsyth, “Human Tracking with Mixtures of Trees,” Proc. Int'l Conf. Computer Vision, vol. I, pp. 690695, 2001.
[18] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Prentice Hall, 1988.
[19] B.J. Jain and F. Wysotzki, “Central Clustering of Attributed Graphs,” Machine Learning, vol. 56, pp. 169207, 2004.
[20] D.G. Kendall, “A Survey of Statistical Theory of Shape (with Discussion),” Statistical Science, vol. 4, no. 2, pp. 87120, 1989.
[21] B.B. Kimia, A.R. Tannenbaum, and S.W. Zucker, “Shapes, Shocks, and Deformations I,” Int'l J. Computer Vision, vol. 15, pp. 189224, 1995.
[22] A.D. Lanterman, “Schwarz, Wallace and Rissanen: Intertwining Themes in Theories of Model Selection,” Int'l Statistical Rev., vol. 69, no. 2, pp. 185212, 2001.
[23] T. Liu and D. Geiger, “Approximate Tree Matching and Shape Similarity,” Proc. Int'l Conf. Computer Vision, pp. 456462, 1999.
[24] M.A. Lozano and F. Escolano, “ACM Attributed Graph Clustering for Learning Classes of Images,” Graph Based Representations in Pattern Recognition, pp. 247258, 2003.
[25] M. Meilă, “Learning with Mixtures of Trees,” PhD thesis, Mass. Inst. of Tech nology, 1999.
[26] R.L. Ogniewicz, “A Multiscale Mat from Voronoi Diagrams: The SkeletonSpace and Its Application to Shape Description and Decomposition,” Aspects of Visual Form Processing, pp. 430439, 1994.
[27] R. Otter, “The Number of Trees,” Ann. Math., vol. 49, pp. 583599, 1948.
[28] P. Perona and W.T. Freeman, “A Factorization Approach to Grouping,” Proc. European Conf. Computer Vision, vol. 1, pp. 655670, 1998.
[29] J. Rissanen, “Modelling by Shortest Data Description,” Automatica, vol. 14, pp. 465471, 1978.
[30] A. RoblesKelly and E.R. Hancock, “A Probabilistic Spectral Framework for Segmentation and Grouping,” Pattern Recognition, vol. 37, pp. 13871406, 2004.
[31] A. Sanfeliu and K.S. Fu, “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition,” Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics, vol. 13, pp. 353362, 1983.
[32] A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker, “Indexing Using a Spectral Encoding of Topological Structure,” Computer Vision and Pattern Recognition, vol. 2, pp. 491497, 1999.
[33] K. Siddiqi et al., “Shock Graphs And Shape Matching,” Int'l J. Computer Vision, vol. 35, pp. 1332, 1999.
[34] E. Klassen, A. Srivastava, W. Mio, and S.H. Joshi, “Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 3, pp. 372383, Mar. 2004.
[35] A. Torsello and E.R. Hancock, “A Skeletal Measure of 2D Shape Similarity,” Computer Vision and Image Understanding, vol. 95, no. 1, pp. 129, 2004.
[36] A. Torsello and E.R. Hancock, “Correcting CurvatureDensity Effects in the HamiltonJacobi Skeleton,” IEEE Trans. Image Processing, vol. 15, no. 4, pp. 877891, 2006.
[37] A. Torsello and E.R. Hancock, “Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling,” Energy Minimization Methods in Computer Vision and Pattern Recognition, 2001.
[38] A. Torsello, D. HidovicRowe, M. Pelillo, “PolynomialTime Metrics for Attributed Trees,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 10871099, July 2005.
[39] C. Wallace and D. Burton, “An Information Measure for Classification,” The Computer J. , vol. 11, no. 2, pp. 195209, 1968.
[40] J.H.M. Wedderburn, “The Functional Equation $g(x^2) = 2ax +$ $ [ g(x) ]^2$ ,” Ann. Math., vol. 24, pp. 121140, 192223.
[41] S.C. Zhu and A.L. Yuille, “FORMS: A Flexible Object Recognition and Modelling System,” Int'l J. Computer Vision, vol. 20, no. 3, pp. 187212, 1996.