Title :
A Dynamic Programming Algorithm for the Distance Between Two Finite Areas
Author_Institution :
Department of Phonetics and Linguistics, University College London, London, England.
Abstract :
The problems of speech recognition and orthographic word correction have been greatly mitigated by the use of dynamic programming techniques for finding the distance between two finite sequences. This paper extends the technique into two dimensions, and presents an algorithm for finding the distance between two finite areas. Applications of the algorithm are suggested.
Keywords :
Cost function; Councils; Dynamic programming; Filling; Heuristic algorithms; Proteins; Spectrogram; Speech recognition; Character recognition; distance between areas; dynamic programming; spectrogram matching; two-dimensional elastic matching;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1979.4766879
