1 / 30

EXAMPLE : Principle of Optimality and Dynamic Programming

EXAMPLE : Principle of Optimality and Dynamic Programming. 1.4. 1.3. 1.4. Dynamic Programming. Dynamic Programming. Search for best path Dynamic programming principle

ruby
Download Presentation

EXAMPLE : Principle of Optimality and Dynamic Programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. EXAMPLE : Principle of Optimality and Dynamic Programming

  2. 1.4 1.3

  3. 1.4

  4. Dynamic Programming

  5. Dynamic Programming • Search for best path • Dynamic programming principle • If B is on the shortest path from A to C, then the path from A to B that lies on the path from A to C is the shortest path from A to B … B … A C

  6. Dynamic Programming • If DP principle holds, then efficient search can be implemented • When at node B in search you can prune all paths to B that are not the shortest • You should not expand these paths … B … A C

  7. Address Interpretation – USPS Word Recognition ZIP + Street No. Hypotheses  “Small” Lexicons for Word Rec Applications to Handwriting Recognition Problem Statement and History Picture of Parsed Address Block Word Recognition Problem Results for NIST OCR Tests with refs

  8. Character Ambiguity in Handwriting Recognition

  9. DP Approach to handwriting recognition Mixed Linear Programming Self-Organizing Feature Maps Fuzzy Inferfence

  10. Segmentation-Based Handwritten Word RecognitionSearch Problem – How do we put the pieces together?

  11. DP Approach • Let I be a word image • L = {L1, L2, ..., LT} be a lexicon of strings representing all possible identities of I. • Word recognition requires finding the string in L that best matches I. • Search – DP, Heuristic

  12. DP Approach

  13. DP Approach

  14. DP Approach

More Related