Optimal Correspondence of String Subsequences

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. >

[1]  Micha Sharir,et al.  Identification of Partially Obscured Objects in Two and Three Dimensions by Matching Noisy Characteristic Curves , 1987 .

[2]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[3]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[4]  Jake K. Aggarwal,et al.  FINDING RANGE FROM STEREO IMAGES. , 1985 .

[5]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Martin A. Fischler,et al.  Computational Stereo , 1982, CSUR.

[7]  Tomaso Poggio,et al.  Cooperative computation of stereo disparity , 1988 .

[8]  S. A. Lloyd.  Stereo matching using intra- and inter-row dynamic programming , 1986, Pattern Recognit. Lett..

[9]  Berthold K. P. Horn.  Robot vision , 1986, MIT electrical engineering and computer science series.

[10]  Uzi Vishkin,et al.  Matching Patterns in Strings Subject to Multi-Linear Transformations , 1988, Theor. Comput. Sci..

[11]  Pietro Laface,et al.  Parallel Algorithms for Syllable Recognition in Continuous Speech , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Patrick A. V. Hall,et al.  Approximate String Matching , 1994, Encyclopedia of Algorithms.

[13]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[14]  David Savir,et al.  The Characteristics and Decodability of the Universal Product Code , 1975, IBM Syst. J..

[15]  Alfred V. Aho,et al.  Algorithms for Finding Patterns in Strings , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[16]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[17]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[18]  Bernard Dubuisson,et al.  String matching for stereo vision , 1989, Pattern Recognit. Lett..

[19]  Theodosios Pavlidis.  The Use of a Syntactic Shape Analyzer for Contour Matching , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Joseph B. Kruskall,et al.  The Symmetric Time-Warping Problem : From Continuous to Discrete , 1983 .

[21]  Robert A. Wagner,et al.  Order-n correction for regular languages , 1974, CACM.

[22]  B. Julesz.  Foundations of Cyclopean Perception , 1971 .

[23]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Howard Lee Morgan,et al.  Spelling correction in systems programs , 1970, Commun. ACM.

[25]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[26]  Karl R. Abrahamson.  Generalized String Matching , 1987, SIAM J. Comput..

[27]  David J. Burr,et al.  Elastic Matching of Line Drawings , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[28]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[29]  Theodosios Pavlidis.  Comment on "A Declustering Criterion for Feature Extraction in Pattern Recognition , 1979 .