Gray-scale image processing algorithms using finite-state machine concepts

e pte Abstract. The early work on separated-kernel image processing using finite state machines (SKIPSM) concentrated mainly on binary processing which provided a fast means to implement binary morphology with very large structuring elements in a single pass using relatively small lookup tables. The basic concept can be extended to certain gray-scale processing techniques with a useful improvement in processing speed. Gray-scale SKIPSM algorithms present more of a challenge because the extremely large number of states that exist make the use of the lookup tables for the direct implementation of finite state machines impractical. However, as will be demonstrated, it is still possible to realize significant speed advantages with SKIPSM-implemented gray-scale processing using appropriate coding techniques. This paper describes two such techniques, grayscale morphology and Gaussian low-pass filtering. © 2001 SPIE and IS&T. [DOI: 10.1117/1.1329334]

[1]  Terry Caelli,et al.  On the Representation of Visual Information , 2001, IWVF.

[2]  Frederick M. Waltz,et al.  Application of SKIPSM to binary morphology , 1994, Other Conferences.

[3]  Frederick M. Waltz.  Separated-kernel image processing using finite-state machines (SKIPSM) , 1994, Other Conferences.

[4]  Frederick M. Waltz,et al.  Software implementation of 2D gray-level dilation using SKIPSM , 1997, Other Conferences.

[5]  James L. Crowley,et al.  A Representation for Shape Based on Peaks and Ridges in the Difference of Low-Pass Transform , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Frederick M. Waltz.  Application of SKIPSM to grey-level morphology , 1994, Other Conferences.

[7]  Frederick M. Waltz.  Binary dilation using SKIPSM: some interesting variations , 1997, Other Conferences.

[8]  Frederick M. Waltz,et al.  Fast computation of the grassfire transform using SKIPSM , 1994, Other Conferences.

[9]  Frederick M. Waltz.  Application of SKIPSM to various 3x3 image processing operations , 1998, Other Conferences.

[10]  Frederick M. Waltz.  SKIPSM implementations: morphology and much, much more , 1995, Optics East.

[11]  Frederick M. Waltz.  Image processing operations in color space using finite-state machines , 1998, Other Conferences.

[12]  Frederick M. Waltz.  Automated generation of efficient code for gray-scale image processing , 1998, Other Conferences.

[13]  Frederick M. Waltz.  Application of SKIPSM to binary template matching , 1994, Other Conferences.

[14]  Judea Pearl,et al.  Some Recent Results in Heuristic Search Theory , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Frederick M. Waltz.  Application of SKIPSM to the pipelining of certain global image processing operations , 1994, Other Conferences.

[16]  Frederick M. Waltz.  Application of SKIPSM to binary correlation , 1995, Optics East.

[17]  Frederick M. Waltz,et al.  Pipelined implementation of binary skeletonization using finite-state machines , 1995, Electronic Imaging.

[18]  Frederick M. Waltz.  Automated generation of finite-state machine lookup tables for binary morphology , 1996, Other Conferences.

[19]  Frederick M. Waltz,et al.  Software implementation of the SKIPSM paradigm under PIP , 1997, Other Conferences.

[20]  Frederick M. Waltz.  Implementation of SKIPSM for 3D binary morphology , 1997, Other Conferences.

[21]  Frederick M. Waltz.  Binary openings and closings in one pass using finite-state machines , 1996, Optics & Photonics.

[22]  Frederick M. Waltz,et al.  Extending the SKIPSM binary skeletonization implementation , 1995, Optics East.