Unstructured point cloud matching within graph-theoretic and thermodynamic frameworks

Proceedings - 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005

Volumn II, Issue , 2005, Pages 1008-1015

  Jagannathan, A ^a   Miller, E L ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA HANDLING; ENTROPY; GIBBS FREE ENERGY; GRAPH THEORY; MATHEMATICAL MODELS; OBJECT RECOGNITION; OPTIMIZATION; SET THEORY;

ENTROPY MINIMIZATION; GRAPH ENTHALPIES; GRAPH ENTROPIES; STRUCTURAL DIFFERENCES;

PATTERN MATCHING;

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

References (20)

1. Y. Keselman, A. Shokoufandeh, M. F. Demirci and S. Dickinson, "Many-to-Many Graph Matching via Metric Embedding", IEEE Conference on Computer Vision and Pattern Recognition, 2003
2. H. Chui and A. Rangarajan, "A New Algorithm tor non-rigid point matching", Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 44-51, 2000
3. E. R. Hancock, M. Vento (eds.), Graph based Representations in Pattern Recognition, Springer Verlag, 2003
4. S. Umeyama, "An eigendecomposition Approach to weighted Graph matching problems", IEEE Transactions on Pattern Analysis and Machine Intelligence, 10(5), 1988
5. W. Kim and A. C. Kak. "3D object recognition using bipartite matching embedded in discrete relaxation", IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(3), 1991
6. T. Sebastian, P. Klein and B. Kimia, "Recognition of Shapes by editing their Shock Graphs", IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(5), 550-571, 2004
7. L.S. Shapiro and J.M. Brady, "Feature based correspondencean eigenvector approach", Image and Vision Computing, 283-288, 1992
8. M. Carcassoni and E.R. Hancock, "Point Pattern Matching with Robust Spectral Correspondence", Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2000
9. K. Siddiqi, A. Shokoulandeh, S. Dickinson and S. Zucker, "Shock Graphs and Shape matching", International Journal of Computer Vision, 30, 1-24, 1999
10. B. Ma, A. O. Hero, J. Gorman, O. Michel, "Image Registration with minimum spanning tree algorithm". Proceedings of International Conference on Image Processing, 2001
11. S.A. Nene and S. K. Nayar, "A simple algorithm for nearest neighbor search in higher dimensions", IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(9), 999-1013, 1997
12. C. Godsil and G. Royle, Algebraic Graph Theory, Springer-Verlag, 2001
13. A.T. Balaban (ed), Chemical Applications of graph theory, Academic Press, 1976
14. J. E. Goodman and J. O'Rourke, Handbook of Discrete and Computational Geometry, CRC Press, 1997
15. P. Atkins, Physical Chemistry, Oxford University Press, 1998
16. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, 1998
17. T.S. Caetano, T. Caelli and D.A.C. Barone, "Graphical Models for Graph Matching", Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2004
18. E. R. Hancock and R. C. Wilson, "Graph based methods for vision: A yorkist manifesto", SSPR & SPR. LNCS 2396, 2002
19. M. T. Dickerson and D. Eppstein, "Algorithms for proximity problems in higher dimensions" Computational Geometry: Theory & Applications,5(5), 277-291, 1996
20. S. Belongie, J. Malik and J. Puzicha, "Shape Matching and object recognition using shape contexts", IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(24), 509-522, 2002