Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
