12.3.1.10 String Matching, Syntatic Matching

Chapter Contents (Back)
String Matching. Syntactic Analysis. Contour Matching.

Hirschberg, D.S.,
A Linear Space Algorithm for Computing Maximal Common Subsequences,
CACM(18), 1975, pp. 341-343. BibRef 7500

Bird, R.S.,
Two-Dimensional Pattern Matching,
IPL(6), No. 5, October 1977, pp. 168-170. BibRef 7710

Tsai, W.H., and Yu, S.S.,
Attributed String Matching with Merging for Shape Recognition,
PAMI(7), No. 4, July 1985, pp. 453-462. BibRef 8507

Zhu, R.F., Takaoka, T.,
A Technique for Two-Dimensional Pattern Matching,
CACM(32), No. 9, September 1989, pp. 1110-1120. Reduce an array matching problem to string matching and apply efficient string matching to arrays. Good summary of string matching algorithms and others. BibRef 8909

Tsay, Y.T., Tsai, W.H.,
Model-Guided Attributed String Matching by Split-and-Merge for Shape Recognition,
PRAI(3), 1989, pp. 159-179. BibRef 8900

Fong, D.Y.S.[David Yu-Shan], Chu, J.L.[Jwo-Liang],
A string pattern recognition approach to polygon clipping,
PR(23), No. 8, 1990, pp. 879-892.
WWW Link. 0401
Clipping line segment by a polygon. Inside/outside. BibRef

Bunke, H., Bühler, U.,
Applications of approximate string matching to 2D shape recognition,
PR(26), No. 12, December 1993, pp. 1797-1812.
WWW Link. 0401
string edit distance matching. BibRef

Bunke, H., Csirik, J.,
Parametric string edit distance and its application to pattern recognition,
SMC(25), No 1, January 1995 pp.202-206.
IEEE DOI BibRef 9501
Earlier:
Inference of edit costs using parametric string matching,
ICPR92(II:549-552).
IEEE DOI 9208
BibRef
Earlier: A2, A1:
Longest k-distance substrings of two strings,
ICPR88(I: 69-71).
IEEE DOI 8811
BibRef

Maes, M.[Maurice],
Polygonal Shape Recognition Using String-Matching Techniques,
PR(24), No. 5, 1991, pp. 433-440.
WWW Link. Extend linear string matching to cyclic strings. BibRef 9100

Cortelazzo, G.M., Mian, G.A., Vezzi, G., Zamperoni, P.,
Trademark Shapes Description by String-Matching Techniques,
PR(27), No. 8, August 1994, pp. 1005-1018.
WWW Link. Logo Recognition. BibRef 9408

Dinstein, I., Landau, G.M.,
Parallel Computable Contour Based Feature Strings for 2-D Shape Recognition,
PRL(12), 1991, pp. 299-306. BibRef 9100
Earlier:
Using Parallel String Matching Algorithm for Contour Based 2-D Shape Recognition,
ICPR90(II: 415-415).
IEEE DOI 9208
BibRef

Pao, D.C.W.[Derek C.W.], Sun, M.C., Lam, M.C.H.[Murphy C.H.],
An Approximate String-Matching Algorithm for Online Chinese Character-Recognition,
IVC(15), No. 9, September 1997, pp. 695-703.
WWW Link. 9709
\ linear sequence of line segments. BibRef

Chen, S.W., Tung, S.T., Fang, C.Y., Cherng, S.[Shen], Jain, A.K.[Anil K.],
Extended Attributed String Matching for Shape Recognition,
CVIU(70), No. 1, April 1998, pp. 36-50.
DOI Link BibRef 9804

Torr, P.H.S., Zisserman, A.,
MLESAC: A New Robust Estimator with Application to Estimating Image Geometry,
CVIU(78), No. 1, April 2000, pp. 138-156.
DOI Link 0004
BibRef

Kaygin, S.[Serkan], Bulut, M.M.[M. Mete],
Shape recognition using attributed string matching with polygon vertices as the primitives,
PRL(23), No. 1-3, January 2002, pp. 287-294.
Elsevier DOI 0201
BibRef

Rico-Juan, J.R.[Juan Ramón], Micó, L.[Luisa],
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances,
PRL(24), No. 9-10, June 2003, pp. 1417-1426.
WWW Link. 0304
Characters. BibRef

Calvo, J.[Jorge], Rizo, D.[David], Iñesta, J.M.[José M.],
A Distance for Partially Labeled Trees,
IbPRIA11(492-499).
Springer DOI 1106
BibRef

Rico-Juan, J.R.[Juan Ramón], Iñesta, J.M.[José M.],
Edit Distance for Ordered Vector Sets: A Case of Study,
SSPR06(200-207).
Springer DOI 0608
BibRef

Abreu Salas, J.I.[José Ignacio], Rico-Juan, J.R.[Juan Ramón],
Characterization of contour regularities based on the Levenshtein edit distance,
PRL(32), No. 10, 15 July 2011, pp. 1421-1427.
Elsevier DOI 1106
BibRef
Earlier:
Contour Regularity Extraction Based on String Edit Distance,
IbPRIA09(160-167).
Springer DOI 0906
Contour regularities; Shape prototypes; Edit distance BibRef


Liu, Y.Q.[Yun-Qiang], Caselles, V.[Vicent],
Spatial String Matching for Image Classification,
ICPR10(2937-2940).
IEEE DOI 1008
BibRef

Dengel, A.R., Pleyer, A., Hoch, R.,
Fragmentary string matching by selective access to hybrid tries,
ICPR92(II:149-153).
IEEE DOI 9208
BibRef

Chapter on Registration, Matching and Recognition Using Points, Lines, Regions, Areas, Surfaces continues in
Piecewise Segment Matching of Contours .


Last update:Nov 18, 2017 at 20:56:18