
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y.P. Wang, T. Pavlidis, "Optimal Correspondence of String Subsequences," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 11, pp. 10801087, November, 1990.  
BibTex  x  
@article{ 10.1109/34.61707, author = {Y.P. Wang and T. Pavlidis}, title = {Optimal Correspondence of String Subsequences}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {12}, number = {11}, issn = {01628828}, year = {1990}, pages = {10801087}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.61707}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Optimal Correspondence of String Subsequences IS  11 SN  01628828 SP1080 EP1087 EPD  10801087 A1  Y.P. Wang, A1  T. Pavlidis, PY  1990 KW  stringtostring subsequence; stringtoregularexpression subsequence; string subsequences; optimal correspondent subsequence; finite alphabet editing error minimization matching; infinite alphabet penalty minimization matching; string distance; metric; computational complexity; relaxation; elastic matching; syntactic information; template matching; regular grammar; stereo epipolar line matching problem; UPC barcode recognition; computational complexity; optimisation; pattern recognition VL  12 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
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 stringtostring 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 stringtostring OCS. The feasibility of applying OCS to UPC barcode recognition is investigated, showing the elegance of stringtoregularexpression OCS compared to the relaxation and elastic matching techniques.
[1] K. Abe and N. Sugita, "Distances between strings of symbols, review and remarks," inProc. 6th Int. Conf. Pattern Recognition, Oct. 1982, pp. 172174.
[2] K. Abrahamson, "Generalized string matching,"SIAM J. Comput., vol. 16, no. 6, pp. 10391051, Dec. 1987.
[3] A. V. Aho, "Algorithms for finding pattern in strings," inThe Handbook of Theoretical Computer Science. Amsterdam, The Netherlands: NorthHolland, 1989.
[4] A. Aho, D. Hirschberg, and J. Ullman, "Bounds on the complexity of the longest common subsequence problem,"J. Assoc. Comput. Mach., vol. 23, no. 1, pp. 112, Jan. 1976.
[5] D. H. Ballard and C. M. Brown,Computer Vision. Englewood Cliffs, NJ: PrenticeHall, 1982.
[6] S. T. Barnard and M. A. Fischler, "Computational stereo,"Comput. Surveys, vol. 14, no. 4, pp. 553572, 1982.
[7] D. J. Burr, "Elastic matching of line drawings,"IEEE. Int. Joint Conf. Pattern Recognition, 1980, pp. 223228.
[8] H. Z. Dan and B. Dubuisson, "String matching for stereo vision,"Pattern Recognition Lett., vol. 9, pp. 117126, Feb. 1989.
[9] L. S. Davis, "Shape matching using relaxation techniques,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI1, no. 1, pp. 6072, Jan. 1979.
[10] R. de Mori, P. Laface, and Y. Mong, "Parallel algorithms for syllable recognition in continuous speech,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI7, no. 1, pp. 5669, Jan. 1985.
[11] G. R. Dowling and P. A. V. Hall, "Elastic template matching in speech recognition, using linguistic information," inProc. 2nd Int. Joint Conf. Pattern Recognition, Aug. 1974, pp. 249250.
[12] T. EilamTzoreff and U. Vishkin, "Matching patterns in strings subject to multilinear transformations,"Theoretical Comput. Sci., vol. 60, pp. 231254, 1988.
[13] K. S. Fu,Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: PrenticeHall, 1982.
[14] P. A. V. Hall and G. R. Dowling, "Approximate string matching,"ACM Comput. Surveys, vol. 12, pp. 381402, 1980.
[15] D. Hirschberg, "A linear space algorithm for computing maximal common sequences,"Commun. ACM, vol. 18, no. 6, pp. 341343, 1975.
[16] J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata. Reading, MA: AddisonWesley, 1969.
[17] B. K. P. Horn,Robot Vision. Cambridge, MA: M.I.T. Press, 1986.
[18] UPC Symbol Specification, Uniform Product Code Council, Inc., May 1982.
[19] B. Julesz,Foundations of Cyclopean Perception. Chicago, IL: University of Chicago Press, 1971.
[20] Y. C. Kim and J. K. Aggarwal, "Finding range from stereo images,"Comput. Vision Pattern Recognition, pp. 289294, 1985.
[21] D. Sankoff and J.B. Kruskal, Eds.,Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, MA: AddisonWesley, 1983.
[22] J. B. Kruskal and M. Liberman, "The symmetric timewarping problem: From continuous to discrete," inTime Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J. B. Kruskal, Eds. Reading, MA: AddisonWesley, 1983, ch. 4.
[23] S. A. Lloyd, "Stereo matching using intra and interrow dynamic programming,"Pattern Recognition Lett., vol. 4, pp. 273277, Sept. 1986.
[24] D. Marr and T. Poggio, "Cooperative computation of stereo disparity,"Science, vol. 194, pp. 283287, 1976.
[25] D. Marr,Vision. San Francisco, CA: Freeman, 1982.
[26] H. L. Morgan, "Spelling correction in systems programs,"Commun. ACM, vol. 13, no. 2, pp. 9094, Feb. 1970.
[27] Y. Ohta and T. Kanade, "Stereo by intra and interscanline search using dynamic programming,"IEEE Trans. Pattern Anal. Machine Intell., vol. 7, no. 2, pp. 139154, 1985.
[28] T. Pavlidis, "The use of a syntactic shape analyzer for contour matching,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI1, no. 3, pp. 307310, July 1979.
[29] D. Savir and G. J. Laurer, "The characteristics and decodability of the universal product code symbol,"IBM Syst. J., vol. 1, pp. 1633, 1975.
[30] J. T. Schwartz and M. Sharir, "Identification of objects in two and three dimensions by matching noisy characteristic curves,"Int. J. Robotics Res., vol. 6, no. 2, pp. 2944, 1987.
[31] R. A. Wagner, "Orderncorrection for regular languages,"Commun. ACM, vol. 17, no. 5, pp. 265268, May 1974.
[32] R. Wagner and M. Fischer, "The stringtostring correction problem,"J. ACM, vol. 21, pp. 168173, 1974.
[33] Y. P. Wang and T. Pavlidis, "Bar code recognition," Dep. Comput. Sci., SUNY at Stony Brook, Stony Brook, NY, Tech. Rep., Feb. 19, 1988.