30 January 1990 Image Processing By Pixel Recursion Method
Author Affiliations +
How to use one-chip processor and small size memory to recognize the shape of object is the most important topic in modern industrial application. Usually, it is impossible to get the front view of fast flying object, the images taken at the view direction are called plane projection images. The plane projection image is composed of "object" and "background", that is what we say pixel recursion image The image processing by the using of pixel recursion is the most simple and fast approach. The pixel recursion image can be achieved by the scanning, and the image after size and orientation normalization can be recognized by the Quad String Array (QSA) approach. The size normalization can be achieved by the scanning device and the orientation normalization can be handle by the Circular Layer String method. In the orientation normalization, the principle axis of unknown image is achieved by rotation and compared with the standard patterns which are pre-estimation. The unknown image can divided into several subimages and each subimage is coded by the Vertical String Array. By the using of Vertical String Array, the shape of unknown object can be described precisely. In this paper, the experiment results of Vertical String Array, Random Walk and Gauss-Markov-R-process are also discussed. Index Terms--Pattern Recognition, String Array Code, Circular Layer Code, Image Processing, Kolmogorov Complexity Program, Turing Machine, Automaton, Quad String Array, Gauss-Markov-R-process, Random Walk, Pixel recursion, Block matching Algorithm.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yung-Lung Ma, Yung-Lung Ma, Hua Kang, Hua Kang, Yang Ming Shan, Yang Ming Shan, } "Image Processing By Pixel Recursion Method", Proc. SPIE 1153, Applications of Digital Image Processing XII, (30 January 1990); doi: 10.1117/12.962328; https://doi.org/10.1117/12.962328

Back to Top