July 31, 1998 Updated by Ms. Jade Y.S. Hsu
Vol.1 No.1, pp.83-97 (January 1985)

Pattern Recognition by Dynamic
Look-up-Table Programming°–
The Dynamic Pyramid Approach

Yung-Lung Ma and Jung-Shin Jour
The Institute of Electrical Engineering,
National Taiwan University,
Taipei, Taiwan 107, Republic of China

        This paper presents a rapid recognition method. Every input pattern can be represented by one state vector that corresponds to some class. So when a pattern is to be recognized we can calculate from the pattern data the corresponding state vector and find its class.
        To reduce the calculation time, the state vector can be calculated from part of the pattern. By the optimal stopping rule, the recognition process constitutes Dynamic Programming. That is to say, the specified part calculated in the latest stage is a subset of that in the current stage.
        We present another new idea on coding of the state, we call it circular layer coding. Two types of circular layer codings are deduced; one is independent circular layer coding, and the other is Markov circular layer coding.
        Experiments on five classes of hand tools verify that the proposed method is both efficient and versatile.


  1. A Semantic-Syntactic Approach to Image Analysis
  2. Imprecise Database, Imprecise Queries and View Navigation
  3. A New Thinning Algorithm for Removing Noise-Spurs and Retaining End-points
  4. The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm
  5. On Properties of Extended LL(k) Grammars
  6. Pattern Recognition by Dynamic Look-up-Table Programming -The Dynamic Pyramid Approach