High-Throughput Lossy-to-Lossless 3D Image Compression
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.
Since geometrical features, like edges, represent one of the most important perceptual information in an image, efficient exploitation of such geometrical information is a key ingredient of many image processing tasks, including compression, denoising and ...
This paper tackles low delay adaptive video streaming over error-prone networks. Our framework consists of an encoding station, an edge server and a set of clients with various access rates. The edge server is capable of performing simple error concealment ...
International Society for Magnetic Resonance in Medicine2004
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 ...
In most watermarking systems, masking models, inherited from data compression algorithms, are used to preserve fidelity by controlling the perceived distortion resulting from adding the watermark to the original signal. So far, little attention has been pa ...
This paper presents an algorithm in a purely lossless text compression setting based on fountain codes and the Burrows-Wheeler transform (BWT). The scheme consists of five stages, each of which is briefly described in the paper. The algorithm offers encour ...
In many applications, the amount and resolution of digi- tal images have significantly increased over the past few years. For this reason, there is a growing interest for techniques allowing to efficiently browse and seek information inside such huge data ...
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 ...
In this paper we introduce a low complexity and accurate technique for target image search and retrieval. This method, which oper- ates directly in the compressed JPEG domain, addresses two of the CBIR challenges stated by The Benchathlon Network regarding ...
JPEG2000, the new standard for still image coding, provides a new framework and an integrated toolbox to better address increasing needs for compression. It offers a wide range of functionalities such as lossless and lossy coding, embedded lossy to lossles ...
In this paper, we discuss a framework for the distributed compression of vector sources, based on our previous work on distributed transform coding. In particular, our goal is to develop a strategy of first applying a suitable distributed Karhunen-Loeve tr ...