Concept

Quantum complexity theory

Publications associées (357)

Wavelet-based texture retrieval using generalized Gaussian density and Kullback-Leibler distance

We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a con- sistent estimator ...

2002

Evolutionary Multiresolution Matching Pursuit and its Relations with the Human Visual System

Pascal Frossard, Pierre Vandergheynst

This paper proposes a multiresolution Matching Pursuit decomposition of natural images. Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary, by iteratively picking the wav ...

EUSIPCO2002

Sampling signals with finite rate of innovation: the noisy case

Martin Vetterli, Andrea Ridolfi, Irena Maravic

Recently a sampling theorem for a certain class of signals with finite rate of innovation (which includes for example stream of Diracs) has been developed. In essence, such non band-limited signals can be sampled at or above the rate of innovation. In the ...

2002

On the coupling of 3D and 1D Navier-Stokes equations for flow problems in compliant vessels

Alfio Quarteroni, Fabio Nobile, Luca Formaggia

For the analysis of flows in compliant vessels, we propose an approach to couple the original 3D equations with a convenient 1D model. This multi-scale strategy allows for a dramatic reduction of the computational complexity and is suitable for "absorbing" ...

2001

Least-Squares Image Resizing Using Finite Differences

Michaël Unser, Thierry Blu

We present an optimal spline-based algorithm for the enlargement or reduction of digital images with arbitrary (noninteger) scaling factors. This projection-based approach can be realized thanks to a new finite difference method that allows the computation ...

IEEE2001

Unsupervised image segmentation using a telegraph parameterization of Pickard random fields

Andrea Ridolfi

This communication presents a nonsupervised three-dimensional segmentation method based upon a discrete-level unilateral Markov field model for the labels and conditionally Gaussian densities for the observed voxels. Such models have been shown to yield nu ...

Springer Verlag2001

On the Complexity of Matsui's Attack

Pascal Junod

Linear cryptanalysis remains the most powerful attack against DES at this time. Given

2^{43}

known plaintext-ciphertext pairs, Matsui expected a complexity of less than

2^{43}

DES evaluations in 85% of the cases for recovering the key. In this paper, w ...

2001

Evolutionary Multiresolution Matching Pursuit and its relations with the Human Visual System

Pascal Frossard, Pierre Vandergheynst

2001

Multidimensional Elastic Registration of Images Using Splines

Michaël Unser

We present an algorithm for nonlinear multidimensional registration. The correspondence function is represented in a spline space, as well as the volumes being registered. We also use the cubic splines to interpolate the volumetric data to be registered. W ...

IEEE2000

Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations

Martin Vetterli, Pina Marziliano

The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irreg- ular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view ...

2000

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the Complexity of Matsui's Attack

Pascal Junod

Linear cryptanalysis remains the most powerful attack against DES at this time. Given

2^{43}

known plaintext-ciphertext pairs, Matsui expected a complexity of less than

2^{43}

DES evaluations in 85% of the cases for recovering the key. In this paper, w ...

2001