6_模板匹配.pptVIP

* TEMPLATE MATCHING The Goal: Given a set of reference patterns known as TEMPLATES, find the one to which an unknown pattern matches best. That is, each class is represented by a single typical pattern. The crucial point is to adopt an appropriate “measure” to quantify similarity or matching. These measures must accommodate, in an efficient way, deviations between the template and the test pattern. For example, the word beauty may have been read a beeauty or beuty, etc., due to errors. * Typical Applications Speech Recognition Motion Estimation in Video Coding Data Base Image Retrieval Written Word Recognition Bioinformatis Measures based on optimal path searching techniques Representation: Represent the template by a sequence of measurement vectors Template: Test pattern: * In general Form a grid with I points (template) in the horizontal and J points (test) in the vertical axes, respectively. Each point (i,j) of the grid measures the distance between r(i) and t(j) * Path: A path through the grid, from an initial node (i0 , j0) to a final one (if , jf), is an ordered set of nodes(i0 , j0), (i1 , j1), (i2 , j2) … (ik , jk) … (if , jf) . Each path is associated with a cost where K is the number of nodes across the path. * Search for the path with the optimal cost Dopt. The matching cost between template and test pattern is Dopt. * BELLMAN’S OPTIMALITLY PRINCIPLE Optimum path: Let (i,j) be an intermediate node, i.e., Then write the optimal path through (i, j) * Bellman’s Principle: In words: The overall optimal path from (i0 ,j0) to (if ,jf) through (i,j) is the concatenation of the optimal paths from (i0 ,j0) to (i,j) and from (i,j) to (if ,jf). Let Dopt. (i,j) is the optimal path to reach (i,j) from (i0 ,j0), then Bellman’s principle is expressed mathematically as: * * The Edit distance It is used for matching written words. Applications: Automatic Editing Text Retrieval Bioinformatics The me