A Chip Set for Lossless Image Compression

IEEE Journal of Solid-State Circuits

Volumn 26, Issue 3, 1991, Pages 237-244

  Shah, Imran Ali ^a   Akiwumi Assani, Olu ^a   Johnson, Brian ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC; COMPUTER PROGRAMMING - ALGORITHMS; INTEGRATED CIRCUITS - APPLICATIONS; MATHEMATICAL TRANSFORMATIONS;

APPLICATION SPECIFIC INTEGRATED CIRCUITS (ASIC'S); CODING ALGORITHMS; ENTROPY CODING; LOSSLESS COMPRESSION; LOSSLESS IMAGE COMPRESSION; TRANSFORM ALGORITHM;

IMAGE PROCESSING;

EID: 0026118975     PISSN: 00189200     EISSN: 1558173X     Source Type: Journal    
DOI: 10.1109/4.75001     Document Type: Article

References (13)

1. P. Lux, “A novel set of closed orthogonal functions for picture coding,” Arch. Elek. Ubertragung., vol. 31, pp. 267–274, 1977.
2. Th. Wendler and D. Meyer-Ebrecht, “Proposed standard for variable format picture processing and a codec approach to match diverse imaging devices,” Proc. SPIE, vol. 318, pp. 298–305, 1982.
3. H. Blume and A. Fand, “Reversible and irreversible image data compression using the S-transform and Lempel-Ziv coding,” Proc. SPIE, vol. 1091, Medical Imaging III: Image Capture and Display, pp. 2–18, 1989.
4. I. A. Shah, O. Akiwumi-Assani, and B. Johnson, “A chip-set for lossless image compression,” in Proc. Custom Integrated Circuits Conf. (Boston, MA), May 13–16, 1990, paper 17.7.
5. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 337–343, 1977.
6. J. Ziv and A. Lempel, “Compression of individual sequences via variable-rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530–536, Sept. 1978.
7. O. Akiwumi-Assani, I. A. Shah, and B. Johnson, “VLSI for picture archiving and communication systems,” Proc. SPIE, vol. 1246, Parallel Architectures for Image Processing, pp. 33–44, Feb. 1990.
8. S. Ranganath and H. Blume, “Hierarchical image decomposition and filtering using the S transform,” Proc. SPIE, vol. 914, Medical Imaging II, pp. 799–814, 1988.
9. T. A. Welch, “A technique for high performance data compression,” Computer, vol. 17, no. 6, pp. 8–19, June 1984.
10. D. E. Knuth, The Art Of Computer Programming: Sorting and Searching, vol. 3. Reading, MA: Addison-Wesley, 1975.
11. J. S. Vitter, “Analysis of coalesced hashing,” Dept. Computer Sci., Stanford Univ., Stanford, CA, Rep. STAN-CS-80-817, 1980.
12. A. C. Yao, “Uniform hashing is optimal,” Dept. Computer Sci., Stanford Univ., Stanford, CA, Rep. STAN-CS-85-1038, 1985.
13. L. J. Guibas, “The analysis of hashing algorithms,” Ph.D. dissertation, Stanford Univ., Stanford, CA, 1976.