
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ali Shokoufandeh, Diego Macrini, Sven Dickinson, Kaleem Siddiqi, Steven W. Zucker, "Indexing Hierarchical Structures Using Graph Spectra," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 11251140, July, 2005.  
BibTex  x  
@article{ 10.1109/TPAMI.2005.142, author = {Ali Shokoufandeh and Diego Macrini and Sven Dickinson and Kaleem Siddiqi and Steven W. Zucker}, title = {Indexing Hierarchical Structures Using Graph Spectra}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, number = {7}, issn = {01628828}, year = {2005}, pages = {11251140}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2005.142}, 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  Indexing Hierarchical Structures Using Graph Spectra IS  7 SN  01628828 SP1125 EP1140 EPD  11251140 A1  Ali Shokoufandeh, A1  Diego Macrini, A1  Sven Dickinson, A1  Kaleem Siddiqi, A1  Steven W. Zucker, PY  2005 KW  Index Terms Structural indexing KW  graph spectra KW  object recognition KW  shock graphs. VL  27 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] A. Witkin , “Scale Space Filtering,” From Pixels to Predicates, A. Pentland, ed., Norwood, NJ: Ablex, 1986.
[2] T. Lindeberg , “Detecting Salient BlobLike Image Structures and Their Scales with a ScaleSpace Primal Sketch— A Method for FocusofAttention,” Int'l J. Computer Vision, vol. 11, no. 3, pp. 283318, 1993.
[3] S. Dickinson , A. Pentland , and A. Rosenfeld , “3D Shape Recovery Using Distributed Aspect Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 174198, Feb. 1992.
[4] S.J. Dickinson , A.P. Pentland , and A. Rosenfeld , “From Volumes to Views: An Approach to 3D Object Recognition,” CVGIP: Image Understanding, vol. 55, no. 2, pp. 130154, 1992.
[5] B.B. Kimia , A. Tannenbaum , and S.W. Zucker , “Shape, Shocks, and Deformations I: The Components of TwoDimensional Shape and the ReactionDiffusion Space,” Int'l J. Computer Vision, vol. 15, pp. 189224, 1995.
[6] K. Siddiqi , A. Shokoufandeh , S. Dickinson , and S. Zucker , “Shock Graphs and Shape Matching,” Int'l J. Computer Vision, vol. 30, pp. 124, 1999.
[7] P. Dimitrov , C. Phillips , and K. Siddiqi , “Robust and Efficient Skeletal Graphs,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, 2000.
[8] K. Siddiqi , S. Bouix , A.R. Tannenbaum , and S.W. Zucker , “HamiltonJacobi Skeletons,” Int'l J. Computer Vision, vol. 48, no. 3, pp. 215231, 2002.
[9] D. Macrini , “Indexing and Matching for ViewBased 3D Object Recognition Using Shock Graphs,” master's thesis, Dept. of Computer Science, Univ. of Toronto, 2003.
[10] M. Turk and A. Pentland , “Eigenfaces for Recognition,” J. Cognitive Neuroscience, vol. 3, no. 1, pp. 7186, 1991.
[11] H. Murase and S. Nayar , “Visual Learning and Recognition of 3D Objects from Appearance,” Int'l J. Computer Vision, vol. 14, pp. 524, 1995.
[12] S. Sclaroff and A. Pentland , “Modal Matching for Correspondence and Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545561, June 1995.
[13] B. Luo , R.C. Wilson , and E. Hancock , “Graph Spectral Approach for Learning View Structure,” Proc. 16th Int'l Conf. Pattern Recognition, vol. 3, pp. 785788, Aug. 2002.
[14] B. Luo , R.C. Wilson , and E.R. Hancock , “Spectral Embedding of Graphs,” Pattern Recognition, vol. 36, pp. 22132223, 2003.
[15] J. Beis and D. Lowe , “Shape Indexing Using Approximate NearestNeighbor Search in Highdimensional Spaces,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, pp. 10001006, 1997.
[16] D. Lowe , “Object Recognition from Local ScaleInvariant Features,” Proc. Int'l Conf. Computer Vision, pp. 11501157, 1999.
[17] Y. Lamdan , J. Schwartz , and H. Wolfson , “On Recognition of 3D Objects from 2D Images,” Proc. IEEE Int'l Conf. Robotics and Automation, pp. 14071413, Apr. 1988.
[18] D. Forsyth , J. Mundy , A. Zisserman , C. Coelho , A. Heller , and C. Rothwell , “Invariant Descriptors for 3D Object Recognition and Pose,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 971992, Oct. 1991.
[19] D. Clemens and D. Jacobs , “Space and Time Bounds on Indexing 3D Models from 2D Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 10071017, Oct. 1991.
[20] P.J. Flynn and A.K. Jain , “3D Object Recognition Using Invariant Feature Indexing of Interpretation Tables,” CVGIP: Image Understanding, vol. 55, no. 2, pp. 119129, 1992.
[21] B. Messmer and H. Bunke , “Subgraph Isomorphism in Polynomial Time,” Technical Report IAM 95003, Univ. of Bern, 1995.
[22] K. Sengupta and K. Boyer , “Modelbase Partitioning Using Property Matrix Spectra,” Computer Vision and Image Understanding, vol. 70, no. 2, pp. 177196, 1998.
[23] L. Shapiro and R. Haralick , “Organization of Relational Models for Scene Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 6, pp. 595602, Nov. 1982.
[24] K. Sengupta and K. Boyer , “Organizing Large Structural Modelbases,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 4, pp. 321332, 1995.
[25] T.B. Sebastian , P.N. Klein , and B.B. Kimia , “ShockBased Indexing into Large Shape Databases,” Proc. European Conf. Computer Vision, pp. 731746, 2002.
[26] C. Irniger and H. Bunke , “Graph Database Filtering Using Decision Trees,” Proc. 17th Int'l Conf. Pattern Recognition, vol. 3, pp. 383388, Aug. 2004.
[27] A. Sanfeliu and K.S. Fu , “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, pp. 353362, May 1983.
[28] L.G. Shapiro and R.M. Haralick , “A Metric for Comparing Relational Descriptions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 1, pp. 9094, Jan. 1985.
[29] L.G. Shapiro and R.M. Haralick , “Structural Descriptions and Inexact Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 504519, 1981.
[30] A.K.C. Wong and M. You , “Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 9, pp. 599609, Sept. 1985.
[31] A. Wong , S. Lu , and M. Rioux , “Recognition and Shape Synthesis of 3D Objects Based on Attributed Hypergraphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 279290, 1989.
[32] K. Boyer and A. Kak , “Structural Stereopsis for 3D Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 2, pp. 144166, Mar. 1988.
[33] W. Kim and A.C. Kak , “3D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 3, pp. 224251, Mar. 1991.
[34] B.T. Messmer and H. Bunke , “A New Algorithm for ErrorTolerant Subgraph Isomorphism Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 493504, May 1998.
[35] W.J. Christmas , J. Kittler , and M. Petrou , “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749764, Aug. 1995.
[36] M.A. Eshera and K.S. Fu , “A Graph Distance Measure for Image Analysis,” IEEE Trans. Systems, Man, & Cybernatics, vol. 14, pp. 398408, May 1984.
[37] M. Pelillo , K. Siddiqi , and S. Zucker , “Matching Hierarchical Structures Using Association Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 11051120, Nov. 1999.
[38] S. Gold and A. Rangarajan , “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377388, Apr. 1996.
[39] S. 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.
[40] A. Cross and E. Hancock , “Graph Matching with a DualStep EM Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 11, pp. 12361253, Nov. 1998.
[41] B. Huet and E. Hancock , “Relational Object Recognition from Large Structural Libraries,” Pattern Recognition, vol. 35, pp. 18951915, 2002.
[42] M. Costa and L. Shapiro , “Relational Indexing,” Proc. Int'l Workshop Structural and Syntactic Pattern Recognition, pp. 130139, 1996.
[43] H. Sossa and R. Horaud , “Model Indexing: The GraphHashing Approach,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, pp. 811814, 1992.
[44] R. Kaushik , P. Shenoy , P. Bohannon , and E. Gudes , “Exploiting Local Similarity for Efficient Indexing of Paths in Graph Structured Data,” Proc. Int'l Conf. Data Eng., 2002.
[45] R. Goldman and J. Widom , “Dataguides: Enabling Query Formulation and Optimization in Semistructured Databases,” Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 436445, 1997.
[46] M. Garofalakis , A. Gionis , R. Rastogi , S. Seshadri , and K. Shim , “Xtract: A System for Extracting Document Type Descriptors from XML Documents,” Proc. ACM SIGMOD Conf., pp. 165176, 2000.
[47] D. Lee and M. Yannakakis , “Online Minimization of Transition Systems,” Proc. 24th ACM Symp. Theory of Computing, pp. 264274, 1992.
[48] P. Buneman , S. Davidson , G. Hillebrand , and D. Suciu , “A Query Language and Optimization Techniques for Unstructured Data,” Proc. ACM SIGMOD Conf. Management of Data, pp. 505516, 1996.
[49] P. Drineas and R. Kannan , “Pass Efficient Algorithms for Approximating Large Matrices,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 223232, 2003.
[50] P. Drineas , R. Kannan , and M.W. Mahoney , “Fast Monte Carlo Algorithms for Matrices II: Computing LowRank Approximations to a Matrix,” http://cswww.cs.yale.edu/homes/mmahoney matrix/, May 2003.
[51] S.C. Deerwester , S.T. Dumais , T.K. Landauer , G.W. Furnas , and R.A. Harshman , “Indexing by Latent Semantic Analysis,” J. Am. Soc. Information Science, vol. 41, no. 6, pp. 391407, 1990.
[52] C.H. Papadimitriou , H. Tamaki , P. Raghavan , and S. Vempala , “Latent Semantic Indexing: A Probabilistic Analysis,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 159168, 1998.
[53] J. Wilkinson , The Algebraic Eigenvalue Problem. Oxford, England: Clarenson Press, 1965.
[54] G. Stewart and J. Sun , Matrix Perturbation Theory. San Diego: Academic Press, 1990.
[55] A. Neumaier , “Second Largest Eigenvalue of a Tree,” Linear Algebra and Its Applications, vol. 46, pp. 925, 1982.
[56] L. Lovász and J. Pelicán , “On the Eigenvalues of a Tree,” Periodica Math. Hungarica, vol. 3, pp. 10821096, 1970.
[57] D. Cvetković , P. Rowlinson , and S. Simić , Eigenspaces of Graphs. Cambridge Univ. Press, 1997.
[58] Y. Lamdan , J. Schwartz , and H. Wolfson , “Affine Invariant ModelBased Object Recognition,” IEEE Trans. Robotics and Automation, vol. 6, no. 5, pp. 578589, Oct. 1990.
[59] P. Flynn and A. Jain , “3D Object Recognition Using Invariant Feature Indexing of Interpretation Tables,” CVGIP: Image Understanding, vol. 55, no. 2, pp. 119129, Mar., 1992.
[60] K. Sengupta and K. Boyer , “Using Geometric Hashing with Information Theoretic Clustering for Fast Recognition from a Large CAD Modelbase,” Proc. IEEE Int'l Symp. Computer Vision, pp. 151156, Nov. 1995.
[61] K. Boyer and K. Sengupta , “Object Recognition Using Large Structural Modelbases,” Proc Third Int'l Workshop on Visual Form, May 1997.
[62] C. Böhm , S. Berchtold , and D.A. Keim , “Searching in HighDimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases,” ACM Computing Surveys (CSUR), vol. 33, no. 3, pp. 322373, 2001.
[63] N. Katayama and S. Satoh , “The SRTree: An Index Structure for HighDimensional Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Multimedia and Design, pp. 369380, May 1997.
[64] D. Cvetković and P. Rowlinson , “The Largest Eigenvalue of a Graph: A Survey,” Linear and Multilinear Algebra, vol. 28, pp. 333, 1990.
[65] N. Biggs , Algebraic Graph Theory. Cambridge Univ. Press, 1993.
[66] A. Shokoufandeh , S. Dickinson , K. Siddiqi , and S. Zucker , “Indexing Using a Spectral Encoding of Topological Structure,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, pp. 491497, June 1999.