loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th International Conference on Pattern Recognition (ICPR'02) - Volume 4
Curve Morphing by Weighted Mean of Strings
Quebec City, QC, Canada
August 11-August 15
ISBN: 0-7695-1695-X
Xiaoyi Jiang, Technical University of Berlin
Horst Bunke, University of Bern
Karin Abegglen, University of Bern
Abraham Kandel, University of South Florida
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.
Citation:
Xiaoyi Jiang, Horst Bunke, Karin Abegglen, Abraham Kandel, "Curve Morphing by Weighted Mean of Strings," icpr, vol. 4, pp.40192, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 4, 2002
Usage of this product signifies your acceptance of the Terms of Use.