LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Languages: English
Types: Article
Subjects:
This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] N. Ahuja, “Dot Pattern Processing Using Voronoi Neighborhoods,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, no. 3, pp. 336-343, 1982.
    • [2] N. Ahuja, B. An, and B. Schachter, “Image Representation Using Voronoi Tessellation,” Computer Vision, Graphics, and Image Processing, vol. 29, pp. 286-295, 1985.
    • [3] N. Ahuja and M. Tuceryan, “Extraction of Early Perceptual Structure in Dot Patterns: Integrating Region, Boundary and Component Gestalt,” Computer Vision, Graphics, and Image Processing, vol. 48, pp. 304-356, 1989.
    • [4] T.D. Alter, “3D Pose From Three Points Using Weak Persective,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 8, pp. 802-808, 1994.
    • [5] Y. Amit and A. Kong, “Graphical Templates for Model Registration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 225-236, 1996.
    • [6] P.A. Beardsley, A. Zisserman, and D.W. Murray, “Navigation Using Affine Structure and Motion” Proc. Third European Conf. Computer Vision, pp. 85-96, 1994.
    • [7] J-D. Boissonnat, “Geometric Structures for Three-Dimensional Shape Representation,” ACM Trans. Graphics, vol. 3, pp. 266-286, 1984.
    • [8] T.F Cootes, C.J. Taylor, D.H. Cooper, and J. Graham, “Active Shape Models-Their Training and Application,” Computer Vision, Graphics and Image Understanding, vol. 61, pp. 38-59, 1995.
    • [9] T.F Cootes and C.J. Taylor, “Combining Point Distribution Models With Shape Models Based on Finite-Element Analysis,” Image and Vision Computing, vol. 13, pp. 403-409, 1995.
    • [10] A.D.J. Cross and E.R. Hancock, “Perspective Pose Recovery With a Dual Step EM Algorithm,” Advances in Neural Information Processing Systems, M. Jordan, M. Kearns, and S. Solla, eds., vol. 10, pp. 780-786. Cambridge, Mass.: MIT Press, 1998.
    • [11] D.F. DeMenthon and L.S. Davis, “Exact and Approximate Solutions of the Perspective Three-Point Problem,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no, 11, pp. 1,100-1,105, 1992.
    • [12] A.P. Dempster, N.M. Laird, and D.B. Rubin, “MaximumLikelihood From Incomplete Data via the EM Algorithm,” J. Royal Statistical Soc. Series B (methodological), vol. 39, pp. 1-38, 1977.
    • [13] O.D. Faugeras, E. Le Bras-Mehlman, and J-D. Boissonnat, “Representing Stereo Data With the Delaunay Triangulation,” Artificial Intelligence, vol. 44, pp. 41-87, 1990.
    • [14] A.M. Finch, R.C. Wilson, and E.R. Hancock, “An Energy Function and Continuous Edit Process for Graph Matching,” Neural Computation, vol. 10, pp. 1,873-1,894, 1998.
    • [15] S. Gold, A. Rangarajan, and E. Mjolsness, “Learning With PreKnowledge: Clustering With Point and Graph-Matching Distance measures,” Neural Computation, vol. 8, pp. 787-804, 1996.
    • [16] R.M Haralick, C.N. Lee, K. Ottenberg, and M. Nolle, “Review and Analysis of Solutions of the Three-Point Perspective Pose Estimation Problem,” Int'l J. Computer Vision, vol. 13, pp. 331-356, 1994.
    • [17] R.I. Hartley, “Projective Reconstruction and Invariants From Multiple Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 10, pp. 1,036-1,041, 1994.
    • [18] R.I. Hartley, “In Defence of the Eight-Point Algorithm,” Proc. Fifth Int'l Conf. Computer Vision, pp. 1,064-1,070, 1995.
    • [19] F. Hempel, E. Ronchetti, R. Rousseeuw, and W. Stahel, Robust Statistics: The Approach Based on Influence Functions. John Wiley, 1986.
    • [20] R. Horaud, F. Dornaika, B. Lamiroy, and S. Christy, “Object Pose: The Link Between Weak Perspective, Para-Perspective and Full Perspective,” Int'l J. Computer Vision, vol. 22, pp. 173-189, 1997.
    • [21] M. Irani, P.Anandan, and S. Hsu, “Mosaic-Based Representations of Video Sequences and Their Applications,” Proc. Fifth Int'l Conf. Computer Vision, pp. 605-611, 1995.
    • [22] D.W. Jacobs, “Optimal Matching of Planar Models in 3D Scenes,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 269- 274, 1991.
    • [23] M.I. Jordan and R.A. Jacobs, “Hierarchical Mixtures of Experts and the EM Algorithm,” Neural Computation, vol. 6, pp. 181-214, 1994.
    • [24] D.G. Kendall, “Shape Manifolds: Procrustean Metrics and Complex Projective Spaces,” Bulletin London Math. Soc., vol. 16, pp. 81- 121, 1984.
    • [25] J.J. Koenderink and A.J. Van Doorn, “Affine Structure From Motion” J. Optical Soc. Am.-Series A, vol. 8, pp. 377-385, 1992.
    • [26] M. Lades, J.C. Vorbruggen, J. Buhmann, J. Lange, C. von der Maalsburg, R.P. Wurtz, and W.Konen, “Distortion-Invariant Object-Recognition in a Dynamic Link Architecture,” IEEE Trans. Computers, vol. 42, no. 3, pp. 300-311, 1993
    • [27] D.P. McReynolds and D.G. Lowe, “Rigidity Checking of 3D Point Correspondences Under Perspective Projection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 1,174-1,185, no. 12, 1996.
    • [28] S. Moss and E.R. Hancock, “Registering Incomplete Radar Images With the EM Algorithm,” Image and Vision Computing, vol. 15, pp. 637-648, 1997.
    • [29] D. Oberkampf, D.F. DeMenthon, and L.S. Davis, “Iterative Pose Estimation Using Coplanar Feature Points,” Computer Vision and Image Understanding, vol. 63, pp. 495-511, 1996.
    • [30] H. Ogawa, “Labeled Point Pattern Matching by Delaunay Triangulation and Maximal Cliques,” Pattern Recognition, vol. 19, pp. 35- 40, 1986.
    • [31] C.J. Poelman and T. Kanade, “A Para-Perspective Factorization Method for Shape and Motion Recovery,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 3, pp. 206-218, 1997.
    • [32] M. Polleyfeys and L. Van Gool, “A Stratified Approach to Metric Self Calibration,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition Conference, pp. 407-412, no. 3, 1997.
    • [33] G.L. Scott and H.C. Longuet-Higgins, “An Algorithm for Associating the Features of Two Images,” Proc. Royal Soc. London Series B-Biological, vol. 244, pp. 21-26, 1991.
    • [34] S. Sclaroff and A.P. Pentland, “Modal Matching for Correspondence and Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545-661, 1995.
    • [35] L.S. Shapiro and J.M. Brady, “Feature-Based Correspondence-An Eigenvector Approach,” Image and Vision Computing, vol. 10, pp. 283-288, 1992.
    • [36] L.S. Shapiro and J.M. Brady, “Rejecting Outliers and Estimating Errors in an Orthogonal-Regression Framework,” Phil. Trans. Royal Soc. A, vol. 350, pp. 403-439, 1995.
    • [37] P. Torr and D.W. Murray, “The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix,” Int'l J. Computer Vision, vol. 24, pp. 271-300, 1997.
    • [38] M. Tuceryan and T Chorzempa, “Relative Sensitivity of a Family of Closest Point Graphs in Computer Vision Applications,” Pattern Recognition, vol. 25, pp. 361-373, 1991.
    • [39] S. Ullman, The Interpretation of Visual Motion. Cambridge, Mass.: MIT Press, 1979.
    • [40] S. Umeyama, “An Eigen Decomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, 1988.
    • [41] S. Umeyama, “Least Squares Estimation of Transformation Parameters Between Point Sets,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 4, pp. 376-380, 1991.
    • [42] S. Umeyama, “Parameterized Point Pattern Matching and its Application to Recognition of Object Families,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 2, pp. 136-144, 1993.
    • [43] J. Utans, “Mixture Models and the EM Algorithms for Object Recognition Within Compositional Hierarchies,” ICSI Berkeley Technical Report TR-93-004, 1993.
    • [44] R.C. Wilson, A.D.J. Cross and E.R. Hancock, “Structural Matching with Active Triangulations,” Computer Vision and Image Understanding, vol. 72, pp. 21-38, 1998.
    • [45] R.C. Wilson and E.R. Hancock, “Structural Matching by Discrete Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 634-648, 1997. Andrew D.J. Cross gained his BSc in computational physics with first-class honors from the University of Manchester Institute of Science and Technology in 1994. Between 1994 and 1998, he undertook research in the area of optimization methods for computer vision at the University of York. He was awarded the DPhil degree for this work in July 1998. Following a period of postdoctoral research at York, Dr. Cross took up an appointment with NewTek in San Antonio, Texas. His interests are in computer vision, graphics, and image processing.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article