Efficient Image Processing Algorithms on the Scan Line Array Processor

We develop efficient algorithms for low and intermediate level image processing on the scan line array processor that handles images in a scan line fashion. For low level processing, we present algorithms for block DFT, block DCT, convolution, template matching, shrinking, and expanding. These algorithms run in real-time - that is, the output lines are generated at the rate of O(m) time per line, where the required processing is based on neighborhoods of size m x m. For intermediate level processing, we present efficient algorithms for scaling, translation, connected components, and convex hulls of multiple figures.

[1]  Herb Taylor,et al.  The sarnoff engine: A massively parallel computer for high definition system simulation , 1994, J. VLSI Signal Process..

[2]  David N. Chin,et al.  The Princeton Engine: a real-time video system simulator , 1988 .

[3]  KSHITIJ A. DOSHI,et al.  Optimal Graph Algorithms on a Fixed-Size Linear Array , 1987, IEEE Transactions on Computers.

[4]  Allan L. Fisher,et al.  Computing the Hough Transform on a Scan Line Array Processor (Image Processing) , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Viktor K. Prasanna,et al.  Optimal geometric algorithms on fixed-size linear arrays and scan line arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Allan L. Fisher Scan line array processors for image computation , 1986, ISCA 1986.