Publication

Image coding with incomplete transforms competition for HEVC

Related publications (43)

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.

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008

Dictionary Identifiability from Few Training Samples

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

ell^1

minimisation, or more precisely the problem of identifying a dictionary

dico

from a set of training samples

Y

knowing that $ ...

2008

The Marr Wavelet Pyramid

Michaël Unser, Dimitri Nestor Alice Van De Ville

We introduce a new semi-orthogonal complex wavelet basis of

L _{ 2 }

(\mathbb{R} ^{ 2 }

). The basis functions are associated to the complex gradient-Laplace operator, which plays a central role in image processing. We define analytically a single- ...

IEEE2008

On Comparing Image and Video Compression Algorithms

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret

In this work, a performance evaluation of AVC Intra and JPEG2000 in terms of rate-distortion performance is conducted. A set of High Definition sequences with different spatial resolutions is used for this purpose. Results obtained show quite competitive p ...

2007

Dimensionality Reduction with Adaptive Approximation

Pascal Frossard, Effrosyni Kokiopoulou

In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant ...

2007

Image coding using redundant dictionaries

Pascal Frossard, Pierre Vandergheynst

This chapter discusses the problem of coding images using very redundant libraries of waveforms, also referred to as dictionaries. We start with a discussion of the shortcomings of classical approaches based on orthonormal bases. More specifically, we show ...

CRC Press2006

Semi-Automated Design of a MOS Current Mode Logic Standard Cell Library from Generic Components

Yusuf Leblebici, Stéphane Badel, Ilhan Hatirnaz

This paper describes the design and semi-automated generation of a MOS current-mode logic standard cell library. A set of generic components implementing a wide range of combinational and sequential functions is proposed. The layout of the generic componen ...

2005

From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about ...

2004

Sufficient conditions for the existence of Q-balls in gauge theories

1998

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997

Dictionary Identifiability from Few Training Samples

Rémi Gribonval, Karin Schnass

This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via

ell^1

minimisation, or more precisely the problem of identifying a dictionary

dico

from a set of training samples

Y

knowing that $ ...

2008

The Marr Wavelet Pyramid

Michaël Unser, Dimitri Nestor Alice Van De Ville

We introduce a new semi-orthogonal complex wavelet basis of

L _{ 2 }

(\mathbb{R} ^{ 2 }

). The basis functions are associated to the complex gradient-Laplace operator, which plays a central role in image processing. We define analytically a single- ...

IEEE2008

On the Decomposition of Polychotomies into Dichotomies

Many important classification problems are emphpolychotomies, emphi.e. the data are organized into

K

classes with

K>2

. Given an unknown function

F : Omega to {1, dots, K}

representing a polychotomy, an algorithm aimed at ``learning'' this polychotomy ...

Morgan Kaufmann1997