We describe an image data compression strategy featuring progressive transmission. The method exploits subband coding and arithmetic coding for compression. We analyze the Laplacian probability density, which closely approximates the statistics of individual subbands, to determine a strategy for ordering the compressed subband data in a way that improves rate-distortion performance. Results axe...

K e y w o r d s P r o g r e s s i v e transmission of images, Adaptive transmission, 3-D images. I N T R O D U C T I O N In the evolving fields of medical imaging, problems of manipulating, processing, or analyzing large data sets grow in complexity. Routinely now, CT scans can generate 50MB of data, for one patient in one examination, representing a single 3-D digital replication of a part of ...

In this paper, a progressive image compression and transmission using edge detection scheme is adopted. The image is decomposed into two (primary and secondary) components. Canny method is adopted to detect the edges of the encoded image. These edges are replaced with a pre-designed nine basis nameplates. Then, the Macro edge detection technique is used to reduce the number of these nameplates ...

Progressive image transmission is a mechanism that transmits the most significant portion of an image, followed by its less important parts. Applications of such a mechanism include browsing large image files on the Internet. We propose an adaptive mechanism, based on the characteristics of images. The mechanism use neighbor pixels to guess a target pixel value, without actually transmitting th...

We present and compare several video transmission systems with various feedback and coding strategies for wireless real-time transmission. A channel coding system based on high-memory convolutional codes (CCs) is deployed which aims on delaying the first error within a progressively coded data frame as far as possible. A low-rate feedback channel is introduced to communicate the number of error...

A very fast mesh simplification algorithm based on halfedge collapse is proposed in this work with a focus on progressive graphic transmission applications. We generalize the Quadric Error Metric (QEM) method to accommodate new topological operations. A flatness criterion is combined with the defined metric to preserve the visual quality of simplified meshes. We further adopt the vertex-based p...

An image compression algorithm has been developed that is well-suited to astronomical images. The method has 3 steps: an intensity mapping to generate an image that has roughly constant noise in each pixel, an orthonormal wavelet transform, and quadtree coding of the bit-planes of the wavelet coe cients. The quadtree values may be further compressed by any standard compression technique, such a...

Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of industries, including manufacturing, architecture, geographic information systems, medical imaging, robotics, entertainment, and military applications. Because of its widespread use, it is desirable to compress polygonal meshes stored in file servers and exchanged over computer networks to reduce ...

Coded as conventional color-map addresses, a colormapped image can be decoded only when a full color map address is available. We present the first known scheme that adds progression capability in spatial resolution as well as color resolution, enabling more flexible progression of color-mapped images. During coding, approximate pixel colors are keyed with truncated versions of the original col...

1. ABSTRACT Fractal coding is gaining in popularity as an efficient still-image coder. One drawback of conventional block-based fractal coders, however, is that they do not offer progressive image transmission. This paper proposes two new methods by which fractal image coders can progressively transmit the image data. The first method, the transmission-sequence-based fractal coder (TSFC), progr...