Skip to main content
Log in

Receiver architectures for real-time image-compression algorithms based on a feature-visibility model

  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

Receiver architectures for a computationally simple image-compression scheme based on an explicit feature-visibility criterion are discussed. The compression algorithms use the feature-visibility criterion to remove image detail not visible under normal viewing conditions. The algorithms are of low complexity, use integer arithmetic operations, and are well suited to simple real-time implementation in hardware. The algorithms break the image into square regions of uniform intensity. A lossless code has been developed that efficiently encodes the region size and organization information. The receiver stages used to decode the lossless code, to reconstruct the compressed image, and to postfilter the image for smoothing are described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Borisenko VI, Zlatopolskii, Muchnik IB (1987) Image segmentation (state-of-the-art survey). Automation Remote Control 48:837–879

    Google Scholar 

  • Cowlishaw MF (1985) Fundamental requirements for picture presentation. Proc 26:101–107

    Google Scholar 

  • Farrelle PM (1990) Recursive block coding for image data compression, Springer, Berlin Heidelberg New York pp 198–202

    Google Scholar 

  • Haralick RM, Shapiro LG (1985) Image segmentation techniques. Comput Vision, Graph, Image Processing 29:100–132

    Google Scholar 

  • Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proc Institute of Radio Engineers 40:1098–1101

    Google Scholar 

  • Hunter GM, Steiglitz K (1979) Operations on images using quadtrees. IEEE Trans Pattern Anal Machine Intell PAMI-1:145–153

    Google Scholar 

  • Johnson-Bey C and Warter PJ (1993) Error diffusion over quadtree representations of images. Proc Conference on Information Sciences and Systems, Johns Hopkins University

  • Johnson-Bey C, Sureshchandran S, Warter PJ Image compression based on a feature visibility criterion: algorithms and architectures for real-time operation. Proc IEEE 8th Workshop on Image and Multidimensional Signal Processing, Cannes, France

  • Kunt M, Benard M, Leonardi R (1987) Recent results in high-compression image coding. IEEE Trans Circuits Syst CAS34:1306–1336

    Google Scholar 

  • Kunt M, Ikonomopoulos, Kocher M (1985) Second-generation image-coding techniques. Proc IEEE:549–574

  • Lim JS (1990) Two-dimensional signal and image processing, Prentice Hall, p479

  • Mead C, Conway L (1980) Introduction to VLSI Systems, Addison Wesley

  • Milford DJ, Willis PJ (1984) Quad encoded display. Proc IEE 131, Pt. E

  • Mukherjee A, Ranganathan N, Bassiouni M (1991) Efficient VLSI on data transformation of tree-based codes. IEEE Trans Circuits Syst 38:306–314

    Google Scholar 

  • Parhi KK (1992) High-speed VLSI architectures for Huffman and Viterbi decoders. IEEE Trans Circuits Syst 39:385–391

    Google Scholar 

  • Pavlidis T, Liow Y (1990) Integrating region growing and edge detection. IEEE Trans Pattern Anal Machine Intell 12:225–233

    Google Scholar 

  • Rao A, Lee L, Bhargava S (1992) A vector quantization-based coding scheme for television transmission via satellite. Proc IEEE International Conference on Communications, Chicago

  • Reeve HC, Lim JS (1983) Reduction of blocking effect in image coding. Proc International Conference on Acoustics, Speech and Signal Processing, pp 1212–1215

  • Roman S (1992) Coding and information theory. Graduate Texts in Mathematics, Springer, Berlin Heidelberg New York pp 43–50

    Google Scholar 

  • Rose A, The sensitivity performance of the human eye on an absolute scale. J Optical Soc Am 38:196–208

  • Sureshchandran S, Warter PJ (1993) Algorithms and architectures for real-time image compression using a feature visibility criterion. Proc IEEE Systems, Man, and Cybernetics Conference, Le Touquet France, 2:339–344

    Google Scholar 

  • Sureshchandran S, Warter PJ Image sequence coding using a feature visibility criterion. Conference on Information Sciences and Systems, Princeton University, Princeton, NJ (submitted)

  • Wang Y, Mitra SK (1993) Image representation using block pattern models and its image processing applications. IEEE Trans Pattern Machine Intell 15:321–336

    Google Scholar 

  • Warter PJ, Boncelet CG (1990) Image filtering derived from a model of quantum limited detection Proc SPIE: Nonlinear Image Processing 1, Santa Clara, Calif.

  • Waiter PJ, Sureshchandran S (1992) Studies in the pruning of quad tree images using a feature visibility criterion. Proc Conference on Information Sciences and Systems, Princeton University, Princeton N.J.

    Google Scholar 

  • Yang K, Fujiwara H, Sakaguchi T, Shimazu A (1990) VLSI architecture design of a versatile length decoding chip for real-time video codecs. Proc IEEE Region 10 Conference on Computer and Communication Systems, Hong Kong, pp 551–554

  • Zucker SW (1976) Region growing: childhood and adoloscence. Comput Graph Image Processing 5:382–399

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter J. Warter.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sureshchandran, S., Warter, P.J. Receiver architectures for real-time image-compression algorithms based on a feature-visibility model. Multimedia Systems 2, 15–25 (1994). https://doi.org/10.1007/BF01213580

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01213580

Key words

Navigation