Publications related to Data Compression via Logic Synthesis

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.

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Pierre Vandergheynst, Christophe De Vleeschouwer, Benoît Macq

In this paper, we address the issues of analyzing and classifying JPEG 2000 code-streams. An original representation, called integral volume, is first proposed to compute local image features progressively from the compressed code-stream, on any spatial im ...

Institute of Electrical and Electronics Engineers2011

Compression with Graphical Constraints: An Interactive Browser

Amin Karbasi, Morteza Zadimoghaddam

We study the problem of navigating/searching through a database of objects with potentially different popularities using a membership oracle. The membership oracle, given a subset of objects

A

, and a target object

t

, determines whether

A

contains

t

...

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

Coupling matrix synthesis of dissipative microwave filters

Michael Mattes, Francisco Edén Sorolla Rosario, Diego Navarro Tapia

This study reviews the coupling matrix synthesis of dissipative microwave filters. It compares it to the synthesis of lossless transfer functions and shows that by correctly interpreting the mathematical operations in the lossless case, that is especially ...

Institution of Engineering and Technology2011

Lossless Source Coding with Polar Codes

Satish Babu Korada, Harm Cronie

In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optima ...

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

On the Information Rates of the Plenoptic Function

Martin Vetterli, Minh Do

The plenoptic function describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) are seen in video and in general visual content (images, mosaics, panoramic scenes, etc.), and rep- res ...

Institute of Electrical and Electronics Engineers2010

Netscope: Practical Network Loss Tomography

Patrick Thiran, Xuan Hung Nguyen, Maciej Kurant, Denisa Gabriela Ghita

We present Netscope, a tomographic technique that infers the loss rates of network links from unicast end-to-end measurements. Netscope uses a novel combination of first- and second-order moments of end-to-end measurements to identify and characterize the ...

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

An Information Theoretic Approach to Speaker Diarization of Meeting Data

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

A speaker diarization system based on an information theoretic framework is described. The problem is formulated according to the Information Bottleneck (IB) principle. Unlike other approaches where the distance between speaker segments is arbitrarily intr ...

2009

Arithmetic Coding of Sub-Band Residuals in FDLP Speech/Audio Codec

Petr Motlicek, Hynek Hermansky, Sriram Ganapathy

A speech/audio codec based on Frequency Domain Linear Prediction (FDLP) exploits auto-regressive modeling to approximate instantaneous energy in critical frequency sub-bands of relatively long input segments. The current version of the FDLP codec operating ...

ISCA 20092009

Compression with Graphical Constraints: An Interactive Browser

Amin Karbasi, Morteza Zadimoghaddam

We study the problem of navigating/searching through a database of objects with potentially different popularities using a membership oracle. The membership oracle, given a subset of objects

A

, and a target object

t

, determines whether

A

contains

t

...

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

Data Compression via Logic Synthesis

Graph Chatbot

Chat with Graph Search

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Compression with Graphical Constraints: An Interactive Browser

Coupling matrix synthesis of dissipative microwave filters

Lossless Source Coding with Polar Codes

On the Information Rates of the Plenoptic Function

Netscope: Practical Network Loss Tomography

Low bit-rate compression of omnidirectional images

An Information Theoretic Approach to Speaker Diarization of Meeting Data

Arithmetic Coding of Sub-Band Residuals in FDLP Speech/Audio Codec

Selected topics on distributed video coding

Coupling matrix synthesis of dissipative microwave filters

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Compression with Graphical Constraints: An Interactive Browser

On the Information Rates of the Plenoptic Function

Low bit-rate compression of omnidirectional images

An Information Theoretic Approach to Speaker Diarization of Meeting Data

Arithmetic Coding of Sub-Band Residuals in FDLP Speech/Audio Codec

Lossless Source Coding with Polar Codes

Netscope: Practical Network Loss Tomography

Selected topics on distributed video coding