8.2. Measures Based on Optimal Path Searching Techniques
We will first focus on a category of template matching, where the involved patterns consist of strings of identified symbols or feature vectors (string patterns). That is, each of the reference and test patterns is represented as a sequence (string) of measured parameters, and one has to decide which reference sequence the test-pattern matches best.
Let r(i), i = 1, 2,…,I, and t(j), j = 1, 2,…,J, be the respective feature vector sequences for a specific pair of reference and test patterns, where in general I ≠ J. The objective is to develop an appropriate distance measure between the two sequences. To this end, we form a two-dimensional grid with the elements of the two sequences as ...
Get Pattern Recognition, 4th Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.