| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Graphical Templates for Model Registration
March 1996 (vol. 18 no. 3)
pp. 225-236
Abstract-A new method of model registration is proposed using graphical templates. A graph of landmarks is chosen in the template image. All possible candidates for these landmarks are found in the data image using local operators. A dynamic programming algorithm on decomposable subgraphs of the template graph finds the optimal match to a subset of the candidate points in polynomial time. This combination of local operators to describe points of interest/landmarks and a graph to describe their geometric orientation in the plane, yields fast and precise matches of the model to the data, with no initialization required.
[1] 225 Y. Amit, "A non-linear variational problem for image matching," SIAM J. of Sci. Comput., vol. 15, no. 1, pp. 207-224, 1994.[2] Y. Amit, U. Grenander, and M. Piccioni, "Structural image restoration through deformable templates," J. American Statistical Assoc., vol. 86, no. 414, pp. 376-387, 1991.[3] R. Bajscy and S. Kovacic, "Multiresolution Elastic Matching," Computer Vision, Graphics&Image Processing, vol. 46, no. 1, pp. 1-21, 1989.[4] M. Barzohar and D.B. Cooper, "Automatic finding of main roads in aerial images by using geometric—Stochastic models and estimation," Proc. ARPA IU Workshop Washington, D. C., 1993.[5] C. Berge, Graphs and Hypergraphs, NorthHolland, Amsterdam, 1973.[6] U. Bertele and F. Brioschi, "Nonserial dynamic programming," Mathematics in Science and Engineering series, vol. 91, Academic Press, 1972.[7] L.F. Bookstein, "Size and shape spaces for landmark data in two dimensions," Statistical Science, vol. 1, no. 2, pp. 181-242, 1986.[8] L.F. Bookstein, "Toward a notion of feature extraction for plane mappings," Proc. Tenth Int'l Conf. Information Processing in Medical Imaging, 1987.[9] L.F. Bookstein, Morphometric Tools for Landmark Data: Geometry and Biology.Cambridge, Mass. Cambridge University Press, 1991.[10] T.F. Cootes, C.J. Taylor, D.H. Cooper, and J. Graham, "Training models of shape from sets of examples," Proc. BMVC, pp. 9-19, 1992.[11] T.F. Cootes and C.J. Taylor, "Active shape models—Smart snakes," Proc. BMVC, pp. 267-275, 1992.[12] J.N. Darroch, S.L. Lauritzen, and T.P. Speed, "Markov fields and log-linear interaction models for contingency tables," Ann. of Stat., vol. 8, pp. 522-539, 1980.[13] U. Grenander, "A unified approach to pattern analysis," Advances in Computers, vol. 10, 1970.[14] S.J. Haberman, The Analysis of Frequency Data, IMS mo nographs, Chicago: Univ. Chicago Press, 1974.[15] R.M. Haralick and L.G. Shapiro, Computer and Robot Vision. New York: Addison-Wesley, 1993.[16] H. Ogawa, "Labeled Point Pattern Matching by Delaunay Triangulation and Maximal Cliques," Pattern Recognition, vol. 19, no. 1, pp. 35-40, 1986.[17] B.K.P. Horn and B.G. Schunck, "Determining optical flow," Artificial Intelligence, vol. 17, pp. 185-203, 1981.[18] T.S. Huang and R.Y. Tsai, "Image sequence analysis: Motion estimation," Image Sequence Analysis, T.S. Huang, ed., New York: Springer-Verlag, 1981.[19] Z. Jin and P. Mowforth, "A discrete approach to signal mapping," Technical Report TIRM-88-036, the Turing Institute, Glasgow, Scotland, 1988.[20] J. Meinguet, "Multivariate interpolation at arbitrary points made simple," Zeit. für Angewandte Mathematik und Physik (ZAMP), vol. 30, pp. 292-304, 1979.[21] M. Miller, G. Christensen, Y. Amit, and U. Grenander, "A mathematical textbook of deformable neuro-anatomies," Proc. National Academy of Science, vol. 90, pp. 11,944-11,948, 1993,.[22] H.H. Nagel, "Displacement vectors derived from second-order intensity variations in image sequences," Computer Vision, Graphics and Image Processing, vol. 21, pp. 85-117, 1983.[23] Y. Ohta and T. Kanade, "Stereo by intra and inter scanline search using dynamic programming," IEEE Pattern Analysis and Machine Intelligence, vol. 7, no. 2, pp. 139-154, 1985.[24] R.R. Petrocelli, J.L. Elion, and M.M. Manbeck, "A new method for structure recognition in unsubtracted digital angiograms," Proc. Computers in Cardiology, IEEE Computer Soc., pp. 207-210, 1992.[25] D.B. Phillips and A.F.M. Smith, "Bayesian Faces," Technical Report TR-93-02, Dept. of Mathematics, Imperial College 1993.[26] D.J. Rose, R.E. Tarjan, and G.S. Leuker, "Algorithmic aspects of vertex elimination on graphs," Siam J. Comput., vol. 5, pp. 266-283, 1976.[27] D. Terzopoulos, "Image Analysis Using Multigrid Relaxation Methods," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 2, pp. 129-139, Mar. 1986.[28] A.L. Yuille, D.S. Cohen, and P.W. Hallinan, "Feature Extraction from Faces Using Deformable Templates," Proc. Computer Vision and Pattern Recognition,San Diego, June 1989.
Index Terms:
Graphical templates, decomposable graphs, model registration, dynamic programming, image matching.
Citation:
Yali Amit, Augustine Kong, "Graphical Templates for Model Registration," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 225-236, Mar. 1996, doi:10.1109/34.485529
