This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Bending Invariant Signatures for Surfaces
October 2003 (vol. 25 no. 10)
pp. 1285-1295

Abstract—Isometric surfaces share the same geometric structure, also known as the "first fundamental form." For example, all possible bendings of a given surface that includes all length preserving deformations without tearing or stretching the surface are considered to be isometric. We present a method to construct a bending invariant signature for such surfaces. This invariant representation is an embedding of the geometric structure of the surface in a small dimensional Euclidean space in which geodesic distances are approximated by Euclidean ones. The bending invariant representation is constructed by first measuring the intergeodesic distances between uniformly distributed points on the surface. Next, a multidimensional scaling (MDS) technique is applied to extract coordinates in a finite dimensional Euclidean space in which geodesic distances are replaced by Euclidean ones. Applying this transform to various surfaces with similar geodesic structures (first fundamental form) maps them into similar signature surfaces. We thereby translate the problem of matching nonrigid objects in various postures into a simpler problem of matching rigid objects. As an example, we show a simple surface classification method that uses our bending invariant signatures.

[1] F.J. Aherne, N.A. Thacker, and P.I. Rockett, Optimal Pairwise Geometric Histograms Proc. British Machine Vision Conf. (BMVC), pp. 480-490, 1997.
[2] F. Arman and J.K. Aggarwal, Model-Based Object Recognition in Dense-Range Images A Review ACM Computing Surveys, vol. 25, no. 1, pp. 5-43, 1993.
[3] A.P. Ashbrook, N.A. Thacker, and P.I. Rockett, Multiple Shape Recognition using Pairwise Geometric Histograms Based Algorithms Proc. IEEE Image Processing, 1995.
[4] A.P. Ashbrook, N.A. Thacker, and P.I. Rockett, Pairwise Geometric Histograms: A Scalable Solution for Recognition 2D Rigid Shapes Proc. Ninth Scandinavian Conf. Image Analysis, vol. 1, pp. 271-278, 1995.
[5] A.P. Ashbrook, N.A. Thacker, P.I. Rockett, and C.I. Brown, Robust Recognition of Scaled Shapes Using Pairwise Geometric Histograms Proc. British Machine Vision Conf. (BMVC), pp. 503-512, 1995.
[6] G. Barequet and M. Sharir, “Partial Surface and Volume Matching in Three Dimensions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 9, pp. 929-948, Sept. 1997.
[7] P.J. Besl, "Geometric Modeling and Computer Vision," Proc. IEEE, vol. 76, pp. 936-958, 1988.
[8] P.J. Besl, The Free Form Matching Problem Machine Vision for Three-Dimensional Scene, H. Freeman, ed., New York: Academic, 1990.
[9] P.J. Besl, Triangles as a Primary Representation Object Recognition in Computer Vision, pp. 191-206, 1994.
[10] P.J. Besl and R.C. Jain, Three-Dimensional Object Recognition ACM Computing Surveys, vol. 17, no. 1, pp. 75-154, 1985.
[11] J. Bloomenthal and C. Lin, Skeletal Methods of Shape Manipulation Proc. Shape Modeling and Applications, pp. 44-47, 1999.
[12] I. Borg and P. Groenen, Modern Multidimensional Scaling Theory and Applications. Springer, 1997.
[13] A. Bronstein, M. Bronstein, and R. Kimmel, Expression-Invariant 3D Face Recognition Proc. Audio and Video-Based Biometric Person Authentication (AVBPA), pp. 62-69, 2003.
[14] M.A.A. Cox and T.F. Cox, Multidimensional Scaling. Chapman and Hall, 1994.
[15] A. Elad and R. Kimmel, Bending Invariant Representations for Surfaces Proc. Computer Vision and Pattern Recognition (CVPR), Dec. 2001.
[16] Y. Eldar, M. Lindenbaum, M. Porat, and Y.Y. Zeevi, The Farthest Point Strategy for Progressive Image Sampling IEEE Trans. Image Processing, vol. 6, no. 9, pp. 1305-1315, 1997.
[17] C. Faloutsos and K.D. Lin, A Fast Algorithm for Indexing, Data-Mining and Visualisation of Traditional and Multimedia Datasets ACM SIGMOD, pp. 163-174, May 1995.
[18] O.D. Faugeras, New Steps towards a Flexible 3D Vision System for Robotics Proc. IEEE Seventh Int'l Conf. Pattern Recognition, vol. 2, pp. 796-805, 1984.
[19] O.D. Faugeras and M. Hebert, A 3D Recognition and Positioning Algorithm Using Geometrical Matching between Primitive Surfaces Proc. Seventh Int'l Joint Conf. Artificial Intelligence, pp. 996-1002, Aug. 1983.
[20] R. Grossman, N. Kiryati, and R. Kimmel, Computational Surface Flattening: A Voxel-Based Approach IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 433-441, Apr. 2002.
[21] M. Hilaga, Y. Shinagawa, T. Kohmura, and T.L. Kunii, Topology Matching for Fully Automatic Similarity Estimation of 3D Shapes Proc. SIGGRAPH '01, pp. 203-212, 2001.
[22] B.K.P Horn, Extended Gaussian Images Proc. IEEE, vol. 72, no. 12, pp. 1671-1686, 1984.
[23] R. Kimmel and J.A. Sethian, Computing Geodesic Paths on Manifolds Proc. Nat'l Academy of Science, vol. 95, pp. 8431-8435, 1998.
[24] E. Kreyszig, Differential Geometry. Dover, 1991.
[25] J.B. Kruskal and M. Wish, Multidimensional Scaling. Sage, 1978.
[26] S. Lavallee and R. Szeliski, "Recovering the Position and Orientation of Free-Form Objects From Image Contours Using 3D Distance Maps," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 4, pp. 378-390, 1995.
[27] S. Loncaric, A Survey of Shape Analysis Techniques Pattern Recognition, vol. 31, no. 8, pp. 983-1001, 1998.
[28] S. Melax, A Simple, Fast and Effective Polygon Reduction Algorithm Game Developer J., Nov. 1998.
[29] R. Osada, T. Funkhouser, B. Chazelle, and D. Dobkin, Matching 3D Models with Shape Distributions Shape Modeling Int'l, May 2001.
[30] A.R. Pope, Model-Based Object Recognition: A Survey of Recent Research Technical Report TR-94-04, Univ. of British Colombia, 1994.
[31] M. Potmesil, Generation of 3D Surface Descriptions from Images of Pattern-Illuminated Objects Proc. IEEE Conf. Pattern Recognition and Image Processing, pp. 553-559, 1979.
[32] E.L. Schwartz, A. Shaw, and E. Wolfson, “A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1005-1008, 1989.
[33] J.A. Sethian, A Review of the Theory, Algorithms, and Applications of Level Set Method for Propagating Surfaces Acta Numerica, 1996.
[34] D.W. Storti, G. Turkiyyah, M. Ganter, C. Lim, and D. Stal, Skeleton Based Modeling Operations on Solids Proc. Third ACM Solid Modeling, pp. 141-154, 1997.
[35] A. Tal and M. Elad, Similarity between 3D Objects An Iterative and Interactive Approach IEEE Trans. Neural Networks, submitted
[36] J.N. Tsitsiklis, Efficient Algorithm for Globally Optimal Trajectories IEEE Trans. Automatic Control, vol. 40, no. 9, pp. 1528-1538, 1995.
[37] G. Zigelman, R. Kimmel, and N. Kiryati, “Texture Mapping Using Surface Flattening via Multi-Dimensional Scaling,” IEEE Trans. Visualization and Computer Graphics, to appear.

Index Terms:
MDS (Multi-Dimensional Scaling), FMTD (Fast Marching Method on Triangulate Domains), isometric signature, classification, geodesic distance.
Citation:
Asi Elad, Ron Kimmel, "On Bending Invariant Signatures for Surfaces," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1285-1295, Oct. 2003, doi:10.1109/TPAMI.2003.1233902
Usage of this product signifies your acceptance of the Terms of Use.