Publication

Image Compression Using Binary Space Partitioning Trees

Related publications (49)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Geometrical Image Denoising Using Quadtree Segmentation

Martin Vetterli, Rahul Shukla

We propose a quadtree segmentation based denoising algo- rithm, which attempts to capture the underlying geometrical structure hidden in real images corrupted by random noise. The algorithm is based on the quadtree coding scheme pro- posed in our earlier w ...

2004

Grammar-Based Tree Compression

Grammar-based compression means to find a small grammar that generates a given object. Such a grammar reveals the structure of the object (according to the grammar formalism used); the main advantage of this compression method is that the resulting grammar ...

2004

Image security and processing in the JPEG 2000 compressed domain

Raphaël Grosbois

Digital images are becoming increasingly successful thanks to the development and the facilitated access to systems permitting their generation (i.e. camera, scanner, imaging software, etc). A digital image basically corresponds to a 2D discrete set of reg ...

EPFL2003

Low rate and scalable image coding with redundant representations

Pascal Frossard, Pierre Vandergheynst

New breakthroughs in image coding possibly rely in signal decomposition through non-separable basis functions. The work proposed in this paper provides an adaptive way of representing images as a sum of two-dimensional features. It presents a low bit-rate ...

2003

On Wyner-Ziv networks

Michael Christoph Gastpar

Wyner and Ziv [1] determined the rate-distortion function of source coding with side information. In this paper, we consider a network extension of their scenario: Many sources have to be compressed in a rate-distortion sense for a decoder that has access ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2003

3D encoding/2D decoding of medical data

Jean-Philippe Thiran, Gloria Menegaz

We propose a fully three-dimensional wavelet-based coding system featuring 3D encoding/2D decoding functionalities. A fully three-dimensional transform is combined with context adaptive arithmetic coding; 2D decoding is enabled by encoding every 2D subband ...

2003

Oligoquantization in low-rate lossy source coding

The theory of high rate lossy source coding is well developed both with respect to the practice of quantization and its fundamental rate distortion limits. But many modern compression systems for natural signals such as audio and images operate at lower ra ...

EPFL2002

An ASIC implementation of adaptive arithmetic coding

Andreas Peter Burg

In this work, we present an improved version of an ASIC implementation of the adaptive arithmetic coding algorithm which uses a two-level memory hierarchy. We propose algorithmic modifications and a special hardware structure to speed-up the design without ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2002

The JPEG 2000 still image compression standard

Touradj Ebrahimi

With the increasing use of multimedia technologies, image compression requires higher performance as well as new features. To address this need in the specific area of still image encoding, a new standard is currently being developed, the JPEC2000. It is n ...

2001

Extension of Wavelet Compression Algorithms to 3D and 4D Image Data: Exploitation of Data Coherence in Higher Dimensions Allows Very High Compression Ratios

Michaël Unser

High resolution multidimensional image data yield huge datasets. For compression and analysis, 2D approaches are often used, neglecting the information coherence in higher dimensions, which can be exploited for improved compression. We designed a wavelet c ...

SPIE2001