Parallel image sequence coding on multiprocessor systems

The authors introduce dictionary-based image sequence coding (DISC) as a new approach to the problem of compression of image sequence data. The DISC algorithm is an adaptation of textual data compression techniques for image sequence data. The algorithm is extremely well suited for parallel implementation on standard configurations such as the rectangular mesh and the hypercube. For N*N images, the authors present SIMD (single-instruction multiple-data) algorithms of time complexities approximately theta (DN) for the mesh and theta (D log N+log/sup 2/ N) for the hypercube (D is proportional to dictionary size). The DISC approach has the additional advantage of involving essentially only simple data movement and lookup operations. Simulation results indicate that moderate to high compression ratios can be achieved along with good visual fidelity and quality of reconstruction.<<ETX>>

[1]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[2]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[3]  Jorge L. C. Sanz,et al.  SIMD architectures and algorithms for image processing and computer vision , 1989, IEEE Trans. Acoust. Speech Signal Process..

[4]  J. D. Robbins,et al.  Motion-compensated television coding: Part I , 1979, The Bell System Technical Journal.

[5]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[6]  Takahiro Saito,et al.  Some variants of universal pattern-matching interframe coding , 1990, Other Conferences.

[7]  R. Srinivasan,et al.  Predictive Coding Based on Efficient Motion Estimation , 1985, IEEE Trans. Commun..

[8]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[9]  Alan C. Bovik,et al.  Visual pattern image sequence coding , 1993, IEEE Trans. Circuits Syst. Video Technol..