Geodesics Between 3D Closed Curves Using Path-Straightening

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3951)


In order to analyze shapes of continuous curves in ℝ3, we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the closed curves, and study its differential geometry. To compute geodesics between any two such curves, we connect them with an arbitrary path, and then iteratively straighten this path using the gradient of an energy associated with this path. The limiting path of this path-straightening approach is a geodesic. Next, we consider the shape space of these curves by removing shape-preserving transformations such as rotation and re-parametrization. To construct a geodesic in this shape space, we construct the shortest geodesic between the all possible transformations of the two end shapes; this is accomplished using an iterative procedure. We provide step-by-step descriptions of all the procedures, and demonstrate them with simple examples.


Tangent Vector Closed Curve Parallel Transport Closed Curf Shape Space 
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.


  1. 1.
    Boothby, W.M.: An Introduction to Differential Manifolds and Riemannian Geometry. Academic Press, Inc., London (1986)zbMATHGoogle Scholar
  2. 2.
    Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Three-dimensional face recognition. International Journal of Computer Vision 64(1), 5–30 (2005)CrossRefGoogle Scholar
  3. 3.
    Dziuk, G., Kuwert, E., Schatzle, R.: Evolution of elastic curves in R n: existence and computation. SIAM J. Math. Anal 33, 1228–1245 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Eakins, J.P., Shields, K., Boardman, J.: ARTISAN – a shape retrieval system based on boundary family indexing. In: Storage and Retrieval for Still Image and Video Databases IV. Proceedings SPIE, vol. 2670, pp. 17–28 (1996)Google Scholar
  5. 5.
    Grenander, U., Miller, M.I.: Computational anatomy: An emerging discipline. Quarterly of Applied Mathematics LVI(4), 617–694 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Kazhdan, M.M.: Shape Representations and Algorithms for 3D Model Retrieval. PhD thesis, Computer Science, Princeton (April 2004)Google Scholar
  7. 7.
    Klassen, E., Srivastava, A.: A path-straightening method for finding geodesics in shape spaces of closed curves in ℝ3. SIAM Journal of Applied Mathematics, page in review (2005)Google Scholar
  8. 8.
    Klassen, E., Srivastava, A., Mio, W., Joshi, S.: Analysis of planar shapes using geodesic paths on shape spaces. IEEE Patt. Analysis and Machine Intell. 26(3), 372–383 (2004)CrossRefGoogle Scholar
  9. 9.
    Langer, J., Singer, D.A.: Curve straightening and a minimax argument for closed elastic curves. Topology 24, 75–88 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Langer, J., Singer, D.A.: Curve straightening in Riemannian manifolds. Ann. Global Anal. Geom. 5, 133–150 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Michor, P.W., Mumford, D.: Riemannian geometries on spaces of plane curves. Journal of the European Mathematical Society (to appear, 2005)Google Scholar
  12. 12.
    Mio, W., Srivastava, A.: Elastic string models for representation and analysis of planar shapes. In: Proc. of IEEE Computer Vision and Pattern Recognition (2004)Google Scholar
  13. 13.
    Mio, W., Srivastava, A., Klassen, E.: Interpolation by elastica in Euclidean spaces. Quarterly of Applied Mathematics LXII(2), 359–378 (2004)CrossRefzbMATHGoogle Scholar
  14. 14.
    Mokhtarian, F., Abbasi, S., Kittler, J.: Efficient and robust shape retrieval by shape content through curvature scale space. In: Proceedings of First International Conference on Image Database and MultiSearch, pp. 35–42 (1996)Google Scholar
  15. 15.
    Novotni, M., Klein, R.: A geometric approach to 3D object comparison. In: International Conference on Shape Modeling and Applications, pp. 167–175 (2001)Google Scholar
  16. 16.
    Osada, R., Funkhouser, T., Chazelle, B., Dobkin, D.: Matching 3D models with shape distributions. In: International Conference on Shape Modeling and Applications, pp. 154–166 (2001)Google Scholar
  17. 17.
    Palais, R.S.: Morse theory on Hilbert manifolds. Topology 2, 299–340 (1963)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Samir, C., Srivastava, A., Daoudi, M.: Human face recognition using 2D facial curves. In: International Conference on Acoustic, Speech, and Signal Processing, ICASSP (May 2006)Google Scholar
  19. 19.
    Younes, L.: Optimal matching between shapes via elastic deformations. Journal of Image and Vision Computing 17(5/6), 381–389 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Department of MathematicsFlorida State UniversityTallahasseeUSA
  2. 2.Department of StatisticsFlorida State UniversityTallahasseeUSA

Personalised recommendations