Optimal correspondence of string subsequences
Wang, Y.P.
Pavlidis, T.
Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Nov 1990
Volume: 12,
Issue: 11
On page(s): 1080-1087
ISSN: 0162-8828
References Cited: 33
CODEN: ITPIDJ
INSPEC Accession Number: 3837628
Digital Object Identifier: 10.1109/34.61707
Current Version Published: 2002-08-06
Abstract
The definition of optimal correspondent subsequence (OCS), which
extends the finite alphabet editing error minimization matching to
infinite alphabet penalty minimization matching, is given. The authors
prove that the string distance derived from OCS is a metric. An
algorithm to compute the string-to-string OCS is given. The
computational complexity of OCS is analyzed. OCS is more efficient than
relaxation and elastic matching for 1D problems. An algorithm combining
syntactic information in template matching is given to show the ease of
integrating regular grammar into the OCS technique. Since in different
applications different penalty functions may be required, two of them
are discussed: one pointwise and the other piecewise. The pointwise
application consists of a stereo epipolar line matching problem solved
by using string-to-string OCS. The feasibility of applying OCS to UPC
bar-code recognition is investigated, showing the elegance of
string-to-regular-expression OCS compared to the relaxation and elastic
matching techniques
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
