Journal ArticleDOI
On aligning curves
TLDR
The optimal correspondence is found by an efficient dynamic-programming method both for aligning pairs of curve segments and pairs of closed curves, and is effective in the presence of a variety of transformations of the curve.Abstract:
We present a novel approach to finding a correspondence (alignment) between two curves. The correspondence is based on a notion of an alignment curve which treats both curves symmetrically. We then define a similarity metric based on the alignment curve using two intrinsic properties of the curve, namely, length and curvature. The optimal correspondence is found by an efficient dynamic-programming method both for aligning pairs of curve segments and pairs of closed curves, and is effective in the presence of a variety of transformations of the curve. Finally, the correspondence is shown in application to handwritten character recognition, prototype formation, and object recognition, and is potentially useful in other applications such as registration and tracking.read more
Citations
More filters
Journal ArticleDOI
Shape Classification Using the Inner-Distance
Haibin Ling,David W. Jacobs +1 more
TL;DR: It is suggested that the inner-distance can be used as a replacement for the Euclidean distance to build more accurate descriptors for complex shapes, especially for those with articulated parts.
Journal ArticleDOI
Recognition of shapes by editing their shock graphs
TL;DR: An edit-distance algorithm for shock graphs that finds the optimal deformation path in polynomial time is employed and gives intuitive correspondences for a variety of shapes and is robust in the presence of a wide range of visual transformations.
Journal ArticleDOI
Time-series data mining
Philippe Esling,Carlos Agon +1 more
TL;DR: A survey of the techniques applied for time-series data mining, namely representation techniques, distance measures, and indexing methods, is provided.
Journal ArticleDOI
Shape Analysis of Elastic Curves in Euclidean Spaces
TL;DR: This paper introduces a square-root velocity (SRV) representation for analyzing shapes of curves in euclidean spaces under an elastic metric and demonstrates a wrapped probability distribution for capturing shapes of planar closed curves.
Journal ArticleDOI
Analysis of planar shapes using geodesic paths on shape spaces
TL;DR: This work uses a Fourier basis to represent tangents to the shape spaces and a gradient-based shooting method to solve for the tangent that connects any two shapes via a geodesic.
References
More filters
Journal ArticleDOI
Snakes : Active Contour Models
TL;DR: This work uses snakes for interactive interpretation, in which user-imposed constraint forces guide the snake near features of interest, and uses scale-space continuation to enlarge the capture region surrounding a feature.
Journal ArticleDOI
A method for registration of 3-D shapes
Paul J. Besl,H.D. McKay +1 more
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
Journal ArticleDOI
Visual pattern recognition by moment invariants
TL;DR: It is shown that recognition of geometrical patterns and alphabetical characters independently of position, size and orientation can be accomplished and it is indicated that generalization is possible to include invariance with parallel projection.
Journal ArticleDOI
Features of Similarity
TL;DR: The metric and dimensional assumptions that underlie the geometric representation of similarity are questioned on both theoretical and empirical grounds and a set of qualitative assumptions are shown to imply the contrast model, which expresses the similarity between objects as a linear combination of the measures of their common and distinctive features.
Journal ArticleDOI
Dynamic programming algorithm optimization for spoken word recognition
TL;DR: This paper reports on an optimum dynamic progxamming (DP) based time-normalization algorithm for spoken word recognition, in which the warping function slope is restricted so as to improve discrimination between words in different categories.