Concept

Discrete sine transform

Publications associées (75)

Fusing Matching and Biometric Similarity Measures for Face Diarization in Video

This paper addresses face diarization in videos, that is, deciding which face appears and when in the video. To achieve this face-track clustering task, we propose a hierarchical approach combining the strength of two complementary measures: (i) a pairwise ...

ACM2013

Modified parallel code-phase search for acquisition in presence of sign transition

Pierre-André Farine, Cyril Botteron, Jérôme Leclère

One of the method to have a fast acquisition of GNSS signals is the parallel code-phase search, which uses the fast Fourier transform (FFT) to perform the correlation. A problem with this method is the potential sign transition that can happen between two ...

2013

Fast continuous Fourier and Haar transforms of rectilinear polygons from very-large-scale integration layouts

Paul Hurley, Robin Scheibler, Amina Chebira

We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts ...

2013

A Probabilistic Map Matching Method for Smartphone GPS data

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

Smartphones have the capability of recording various kinds of data from built-in sensors such as GPS in a non-intrusive, systematic way. In transportation studies, such as route choice modeling, the discrete sequences of GPS data need to be associated with ...

Pergamon-Elsevier Science Ltd2013

Cross-pollination of normalisation techniques from speaker to face authentication using Gaussian mixture models

Sébastien Marcel

This paper applies score and feature normalization techniques to parts-based Gaussian mixture model (GMM) face authentication. In particular, we propose to utilize techniques that are well established in state-of-the-art speaker authentication, and apply t ...

2012

Low complexity RST invariant image recognition using Fourier Mellin transform

Pierre-André Farine, Sara Grassi Pauletti, Pradyumna Ayyalasomayajula

In this paper we propose a low complexity method for Rotation, Scale and Translation (RST) invariant content-based image retrieval, suitable for a handheld image recognition device. The RST compensation method is based on Fourier-Mellin Transform (FMT) whi ...

EURASIP2011

Use of Learned Dictionaries in Tomographic Reconstruction

Martin Vetterli, Ivana Jovanovic, Vincent Etter

We study the use and impact of a dictionary in a tomographic reconstruction setup. First, we build two different dictionaries: one using a set of bases functions (Discrete Cosine Transform), and the other that is learned using patches extracted from traini ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

Parts-Based Face Verification using Local Frequency Bands

Sébastien Marcel

In this paper we extend the Parts-Based approach of face verification by performing a frequency-based decomposition. The Parts-Based approach divides the face into a set of blocks which are then considered to be separate observations, this is a spatial dec ...

Idiap2011

Monte Carlo study of the critical properties of the three-dimensional 120 degrees model

Sandro Wenzel

We report on large scale finite-temperature Monte Carlo simulations of the classical 120 degrees or e(g) orbital-only model on the simple cubic lattice in three dimensions with a focus towards its critical properties. This model displays a continuous phase ...

2011

Sensing and Recovery under Sparsity Constraints

Ali Hormati

Popular transforms, like the discrete cosine transform or the wavelet transform, owe their success to the fact that they promote sparsity. These transforms are capable of extracting the structure of a large class of signals and representing them by a few t ...

EPFL2010

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