A method for detecting correspondences in a sequence of modifying shapes
暂无分享,去创建一个
[1] Concettina Guerra,et al. A Graph-Theoretic Method for Decomposing Two-Dimensional Polygonal Shapes into Meaningful Parts , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Theodosios Pavlidis,et al. Structural pattern recognition , 1977 .
[3] Maria Francesca Costabile,et al. Matching shapes: A case study in time-varying images , 1985, Comput. Vis. Graph. Image Process..
[4] Robert M. Haralick,et al. Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Thomas S. Huang,et al. Image sequence analysis , 1981 .
[6] J.K. Aggarwal,et al. Correspondence processes in dynamic scene analysis , 1981, Proceedings of the IEEE.
[7] Herbert Freeman,et al. Computer Processing of Line-Drawing Images , 1974, CSUR.
[8] Azriel Rosenfeld,et al. Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[9] John Fairfield. Segmenting blobs into subregions , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[10] Shimon Ullman,et al. Analysis of Visual Motion by Biological and Computer Systems , 1981, Computer.
[11] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .
[12] G. Pieroni. Un metodo di interpolazione adatto al tracciamento automatico di curve piane , 1968 .