By Topic

Trapezoidal DP matching with time reversibility

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Okochi ; IBM Japan, Ltd., Minato-Ku, Tokyo, Japan ; T. Sakai

DP matching is widely used in speech recognition. But none of the conventional formulations (Rectangular DP Matching) seem to have all the three properties: pattern commutativeness, time reversibility, and linear matching consistency. In this paper, a new formulation named "Trapezoidal DP Matching" is proposed, which preserves time reversibility and can have all the three properties. In addition, the following points are clarified; (1) The formulation gives a better approximation of continuous-time pattern distance, and is expected to improve recognition accuracy. (2) It has an effect of smoothing the weighting coefficients on local distances. (3) It provides a clear viewpoint on the relationship between weighting coefficients and the normalized time. (4) Its evaluation is reliable even for a transient portion matching.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.  (Volume:7 )

Date of Conference:

May 1982