Shape recognition using attributed string matching with polygon vertices as the primitives
Pattern Recognition Letters
Shape Retrieval by Hierarchical Evolution
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Robust symbolic representation for shape recognition and retrieval
Pattern Recognition
Robust symbolic representation for shape recognition and retrieval
Pattern Recognition
High performance bio-image database retrieval using MPI
International Journal of Bioinformatics Research and Applications
A largest common d-dimensional subsequence of two d-dimensional strings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |
A two-stage string matching method for the recognition of two-dimensional (2-D) objects is proposed in this work. The first stage is a global cyclic string matching. The second stage is a local matching with local dissimilarity measure computing. The dissimilarity measure function of the input shape and the reference shape are obtained by combining the global matching cost and the local dissimilarity measure. The proposed method has the advantage that there is no need to set any parameter in the recognition process. Experimental results indicate that the hostage string matching approach significantly improves the recognition rates compared to the one-stage string matching method