Curve Morphing by Weighted Mean of Strings

  • Authors:
  • Affiliations:
  • Venue:
  • ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work we propose a novel approach to curve morphing. We represent curves by strings, i.e. sequences of symbols. The curve morphing problem is formulated as that of computing a weighted mean of two strings, which is then solved by a corresponding algorithm recently reported in the literature. Although only 2D curves are used in our experiments, the approach is applicable to curves in any dimension. Curve morphing has interesting applications in computer graphics, industrial design, robotics, etc. Additionally, it provides an alternative multiscale representation of curves.