Publication

Matrix Recipes for Hard Thresholding Methods

Publications associées (59)

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

Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection using Decision Trees

While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomo ...

IDIAP2000

Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection using Decision Trees

2000

Distance transformations: fast algorithms and applications to medical image processing

Olivier Cuisenaire

Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...

1999

A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse

Ali H. Sayed

A Schur-type algorithm is presented for the simultaneous triangular factorization of a given (non-degenerate) structured matrix and its inverse. The algorithm takes the displacement generator of a Hermitian, strongly regular matrixR as an input, and comput ...

Springer Milan1996

On the Implementation and Use of Message Logging

Willy Zwaenepoel

We present a number of experiments showing that for compute-intensive applications executing in parallel on clusters of workstations, message logging has higher failure-free overhead than coordinated checkpointing. Message logging protocols, however, resul ...

1994

A unified derivation of square-root multichannel least-squares filtering algorithms

Ali H. Sayed

The authors present a new derivation of exact least-squares multichannel and multidimensional adaptive algorithms, based on explicitly formulating the problem as a state-space estimation problem and then using different square-root versions of the Kalman, ...

IEEE1993

A high-performance cost-effective pole-zero MMSE-DFE

Ali H. Sayed

In this paper we derive a computationally efficient algorithm for accurately approximatinga long FIR filter by a reduced-parameter pole-zero filter. Our derivation successfully extends the "embedding" approach of [1,2] to the case of an unequal number of p ...

1993

Adaptive filtering in sub-bands with critical sampling: analysis, experiments, and application to acoustic echo cancellation

Martin Vetterli

An exact analysis of the critically subsampled two-band modelization scheme is given, and it is demonstrated that adaptive cross-filters between the subbands are necessary for modelization with small output errors. It is shown that perfect reconstruction f ...

Institute of Electrical and Electronics Engineers1992

A theory of multirate filter banks

Martin Vetterli

Multirate filter banks produce multiple output signals by filtering and subsampling a single input signal, or conversely, generate a single output by upsampling and interpolating multiple inputs. Two of their main applications are subband coders for speech ...

1987