Advertisement

Stability and likelihood of views of three dimensional objects

  • Daphna Weinshall
  • Michael Werman
  • Naftali Tishby
Geometry and Shape I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 800)

Abstract

Can we say anything general about the distribution of two dimensional views of general three dimensional objects? In this paper we present a first formal analysis of the stability and likelihood of two dimensional views (under weak perspective projection) of three dimensional objects. This analysis is useful for various aspects of object recognition and database indexing. Examples are Bayesian recognition; indexing to a three dimensional database by invariants of two dimensional images; the selection of “good” templates that may reduce the complexity of correspondence between images and three dimensional objects; and ambiguity resolution using generic views.

We show the following results: (1) Both the stability and likelihood of views do not depend on the particular distribution of points inside the object; they both depend on only three numbers, the three second moments of the object. (2) The most stable and the most likely views are the same view, which is the “flattest” view of the object. Under orthographic projection, we also show: (3) the distance between one image to another does not depend on the position of its viewpoint with respect to the object, but only on the (geodesic) distance between the view-points on the viewing sphere. We demonstrate these results with real and simulated data.

Keywords

Object Recognition Ambiguity Resolution Geodesic Distance Scatter Matrix Dimensional Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    E. M. Arkin, K. Kedem, J. S. B. Mitchell, J. Sprinzak, and M. Werman. Matching points into pairwise disjoint noise regions: Combinatorial bounds and algorithms. ORSA Journal on Computing, special issue on computational geometry, 1992.Google Scholar
  2. 2.
    J. Ben-Arie. The probabilistic peaking effect of viewed angles and distances with application to 3-d object recognition. T-PAMI, pages 760–774, 1990.Google Scholar
  3. 3.
    J.B. Burns, R. Weiss, and E. Riseman. View variation of point-set and line segment features. In Proceedings Image Understanding Workshop, pages 650–659, April 1990.Google Scholar
  4. 4.
    W. T. Freeman. Exploiting the generic view assumption to estimate scene parameters. In Proceedings of the 4th International Conference on Computer Vision, pages 347–356, Berlin, Germany, 1993. IEEE, Washington, DC.Google Scholar
  5. 5.
    Y. Lamdan and H. Wolfson. Geometric hashing: a general and efficient recognition scheme. In Proceedings of the 2nd International Conference on Computer Vision, pages 238–251, Tarpon Springs, FL, 1988. IEEE, Washington, DC.Google Scholar
  6. 6.
    D. Weinshall and M. Werman. Similarity and affine distance between point sets, 1994. submitted for publication.Google Scholar
  7. 7.
    D. Weinshall, M. Werman, and N. Tishby. Stability and likelihood of views of three dimensional objects. TR 94-1, Hebrew University, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Daphna Weinshall
    • 1
  • Michael Werman
    • 1
  • Naftali Tishby
    • 1
  1. 1.Institute of Computer ScienceThe Hebrew University of JerusalemJerusalemIsrael

Personalised recommendations