Some new results on non-rigid correspondence and classification of curves

Authors:
Xiqiang Zheng;Yunmei Chen;David Groisser;David Wilson
Affiliations:
Department of Mathematics, University of Florida, Gainesville, FL;Department of Mathematics, University of Florida, Gainesville, FL;Department of Mathematics, University of Florida, Gainesville, FL;Department of Mathematics, University of Florida, Gainesville, FL
Venue:
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Year:
2005

Citing 8
Cited 1

Partial Shape Classification Using Contour Matching in Distance Transformation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computable elastic distances between shapes

SIAM Journal on Applied Mathematics
Non-Rigid Shape Comparison of Plane Curves in Images

Journal of Mathematical Imaging and Vision
Computation of Normalized Edit Distance and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
On Aligning Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Tracking Points on Deformable Objects Using Curvature Information

ECCV '92 Proceedings of the Second European Conference on Computer Vision
A new point matching algorithm for non-rigid registration

Computer Vision and Image Understanding - Special issue on nonrigid image registration

Shape of Elastic Strings in Euclidean Space

International Journal of Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two new algorithms for correspondence and classification of planar curves in a non-rigid sense. In the first algorithm we define deforming energy based on aligning curves using certain of their properties, namely Multi-Step-Size Local Similarity (MSSLS) and the difference between the angle changes of beginning and ending tangent lines of two corresponding curve segments, as well as local scale of stretching. MSSLS overcomes the noise of local shape information of curves to be aligned. In the second algorithm, we improve the computation of shape context so that it catches the local information of ordered sets representing planar curves better. The optimal correspondence is found by a modified dynamic-programming method. Based on deforming energy, we can do pattern recognition among curves, which is very important in many areas such as recognition of hand-written characters and cardiac curves where rigid transformations and scaling do not work well. Finally, the effect of correspondence and classification is shown in application to hand-written characters and cardiac curves.