EXAMPLE Principle of Optimality and Dynamic Programming 1

  • Slides: 30
Download presentation
EXAMPLE : Principle of Optimality and Dynamic Programming

EXAMPLE : Principle of Optimality and Dynamic Programming

1. 4 1. 3

1. 4 1. 3

1. 4

1. 4

Dynamic Programming

Dynamic Programming

Dynamic Programming • Search for best path • Dynamic programming principle – If B

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 A … B … C

Dynamic Programming • If DP principle holds, then efficient search can be implemented •

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 A … B … C

Applications to Handwriting Recognition • Address Interpretation – USPS • Word Recognition – ZIP

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

Character Ambiguity in Handwriting Recognition

Character Ambiguity in Handwriting Recognition

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

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

Segmentation-Based Handwritten Word Recognition Search Problem – How do we put the pieces together?

Segmentation-Based Handwritten Word Recognition Search Problem – How do we put the pieces together?

DP Approach • Let I be a word image • L = {L 1,

DP Approach • Let I be a word image • L = {L 1, L 2, . . . , 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

DP Approach

DP Approach

DP Approach

DP Approach

DP Approach

DP Approach

Static Optimality and Dynamic Search Optimality in ListsStatic Optimality and Dynamic Search Optimality in Lists
Dynamic Programming 1 Recursion Principle of Optimality 1Dynamic Programming 1 Recursion Principle of Optimality 1
DYNAMIC PROGRAMMING Principle of optimality Coin changing problemDYNAMIC PROGRAMMING Principle of optimality Coin changing problem
Dynamic Programming Dynamic Programming Dynamic programming like theDynamic Programming Dynamic Programming Dynamic programming like the
Dynamic Programming Dynamic Programming Dynamic Programming is aDynamic Programming Dynamic Programming Dynamic Programming is a
Dynamic Programming Dynamic Programming Dynamic programming is aDynamic Programming Dynamic Programming Dynamic programming is a
MODULE4 DYNAMIC PROGRAMMING Dynamic Programming Dynamic Programming isMODULE4 DYNAMIC PROGRAMMING Dynamic Programming Dynamic Programming is
HicksKaldor Optimality Law and EconomicsCharles W Upton OptimalityHicksKaldor Optimality Law and EconomicsCharles W Upton Optimality
Dynamic Programming Several problems Principle of dynamic programmingDynamic Programming Several problems Principle of dynamic programming
Dynamic Programming Several problems Principle of dynamic programmingDynamic Programming Several problems Principle of dynamic programming
Dynamic Programming Optimization Problems Dynamic Programming Paradigm ExampleDynamic Programming Optimization Problems Dynamic Programming Paradigm Example
Multiplication Principle and Addition Principle 1 Multiplication PrincipleMultiplication Principle and Addition Principle 1 Multiplication Principle
Dynamic Programming What is dynamic programming Programming aDynamic Programming What is dynamic programming Programming a
Uncertainty Principle Uncertainly Principle 1 Uncertainty Principle SummaryUncertainty Principle Uncertainly Principle 1 Uncertainty Principle Summary
The Pigeonhole Principle Pigeonhole principle The pigeonhole principleThe Pigeonhole Principle Pigeonhole principle The pigeonhole principle
Chapter 19 Avogadros Principle Avogadros Principle Avogadros PrincipleChapter 19 Avogadros Principle Avogadros Principle Avogadros Principle
PASCALS PRINCIPLE Bernoullis Principle Pascals Principle In thePASCALS PRINCIPLE Bernoullis Principle Pascals Principle In the
HardyWeinberg Principle HardyWeinberg Principle HardyWeinberg Principle enables usHardyWeinberg Principle HardyWeinberg Principle HardyWeinberg Principle enables us
ROOM ACOUSTICS II EXAMPLE PROBLEM EXAMPLE EXAMPLE EXAMPLEROOM ACOUSTICS II EXAMPLE PROBLEM EXAMPLE EXAMPLE EXAMPLE
Example 1 Example 2 Example 3 Example 4Example 1 Example 2 Example 3 Example 4
DECISION TREE Example Example DECISION TREE Example ExampleDECISION TREE Example Example DECISION TREE Example Example
Deadlocks Example 1 Example 2 Example 2 ExampleDeadlocks Example 1 Example 2 Example 2 Example
Objectives Example 1 Example 2 Example 3 ExampleObjectives Example 1 Example 2 Example 3 Example
258 Optimality Principle Assume that optimal path is258 Optimality Principle Assume that optimal path is