Stereo matching using intra- and inter-row dynamic programming
Pattern Recognition Letters
International Journal of Robotics Research
SIAM Journal on Computing
Matching patterns in strings subject to multi-linear transformations
Theoretical Computer Science
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
The String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Order-n correction for regular languages
Communications of the ACM
Spelling correction in systems programs
Communications of the ACM
Robot Vision
Computer Vision
Formal languages and their relation to automata
Formal languages and their relation to automata
Dynamic Programming Alignment of Sequences Representing Cyclic Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Twenty Years of Document Image Analysis in PAMI
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
BAS: a perceptual shape descriptor based on the beam angle statistics
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Relaxing stylus typing precision by geometric pattern matching
Proceedings of the 10th international conference on Intelligent user interfaces
A curve matching algorithm for dynamic image sequences
ISCGAV'05 Proceedings of the 5th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
A genetic programming framework for content-based image retrieval
Pattern Recognition
Image retrieval with relevance feedback based on genetic programming
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
On the Training Patterns Pruning for Optimum-Path Forest
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
A compact shape descriptor based on the beam angle statistics
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
A model for embedding and authorizing digital signatures in printed documents
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Constraint solving over OCR graphs
INAP'01 Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support
Relevance feedback based on genetic programming for image retrieval
Pattern Recognition Letters
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Aquatic weed automatic classification using machine learning techniques
Computers and Electronics in Agriculture
Using contextual spaces for image re-ranking and rank aggregation
Multimedia Tools and Applications
| Hi-index | 0.15 |
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.