✦ LIBER ✦

On holographic transform compression of images

✍ Scribed by Alfred M. Bruckstein; Robert J. Holt; Arun N. Netravali

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 1008 KB
Volume: 11
Category: Article
ISSN: 0899-9457
DOI: 10.1002/ima.1015

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Lossy transform compression of images is successful and widespread. The JPEG standard uses the discrete cosine transform on blocks of the image and a bit allocation process that takes advantage of the uneven energy distribution in the transform domain. For most images, 10:1 compression ratios can be achieved with no visible degradations. However, suppose that multiple versions of the compressed image exist in a distributed environment such as the internet, and several of them could be made available upon request. The classical approach would provide no improvement in the image quality if more than one version of the compressed image became available. In this paper, we propose a method, based on multiple description scalar quantization, that yields decompressed image quality that improves with the number of compressed versions available. © 2001 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 11, 292–314, 2000

📜 SIMILAR VOLUMES

VLSI Implementation of Discrete Wavelet

VLSI Implementation of Discrete Wavelet Transform for Lossless Compression of Medical Images

✍ I. Urriza; J.I. Artigas; L.A. Barragan; J.I. Garcia; D. Navarro 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 929 KB

his paper presents a VLSI architecture to implement the forward and inverse two dimensional Discrete Wavelet Transform (DWT), to compress medical images for storage and retrieval. Lossless compression is usually required in the medical image field. The word length required for lossless compression m

Compression of Binary Images on a Hyperc

Compression of Binary Images on a Hypercube Machine

✍ P. Scheuermann; A. Yaagoub; M.A. Ouksel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 993 KB

The S-tree linear representation is an efficient structure for representing binary images which requires three bits for each disjoint binary region. We present parallel algorithms for encoding and decoding the S-tree representation from/onto a binary pixel array in a hypercube connected machine. Bot

A posteriori image-correcting “deconvolu

A posteriori image-correcting “deconvolution” by holographic fourier-transform division

✍ G.W. Stroke; R.G. Zech 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Resolution of holographic images of unde

Resolution of holographic images of underwater objects

✍ J. Watson; P.W. Britton; A.C.S. Cran 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Lossless Image Compression Using the Dis

Lossless Image Compression Using the Discrete Cosine Transform

✍ Giridhar Mandyam; Nasir Ahmed; Neeraj Magotra 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 461 KB

The DCT has long been used as a method for image two-dimensional images based on the discrete cosine transform (DCT) is proposed. This method quantizes the high-energy coding and has now become the standard for video coding DCT coefficients in each block, finds an inverse DCT from [2]. Its energy co

Neural networks for image transformation

Neural networks for image transformation, analysis, and compression

✍ John G. Daugman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 99 KB

A three-layered neural network is described for transforming two-dimensional discrete signals into generalized representations which need not necessarily be either orthogonal or complete, for image analysis, segmentation, and compression. One such transform of particular interest is a conjoint spati