WJ-CH07-模式识别-模板匹配 英文版 教学课件.pptVIP

TEMPLATE MATCHING The Goal: Given a set of reference patterns known as TEMPLATES, find to which one 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(基于最优路径搜索技术的测度p.208) Representation: Represent the template by a sequence of measurement vectors Template: Test pattern: In general Form a grid with I points (template) in horizontal and J points (test) in vertical 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贝尔曼最优化原理 p.211 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 stated as: The Edit distance(编辑距离) It is used for matching written words(手写体). Applications: Automatic Editing(自动编辑) Text Retrieva