Publication

Simple FFT and DCT algorithms with reduced number of operations

Publications associées (119)

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

Fast focus field calculations

Theo Lasser, Marcel Leutenegger, Rainer Leitgeb

We present a method for fast calculation of the electromagnetic field near the focus of an objective with a high numerical aperture (NA). Instead of direct integration, the vectorial Debye diffraction integral is evaluated with the fast Fourier transform f ...

SPIE2008

Adaptive Sleep/Wake Classification Based on Cardiorespiratory Signals for Wearable Devices

Dario Floreano, Claudio Mattiussi, Walter Karlen

We describe a method to classify online sleep/wake states of humans based on cardiorespiratory signals for wearable applications. The method is designed to be embedded in a portable microcontroller device and to cope with the resulting tight power and weig ...

IEEE Press2007

Fast focus field calculations

Theo Lasser, Marcel Leutenegger, Rainer Leitgeb, Ramachandra Rao

We present a fast calculation of the electromagnetic field near the focus of an objective with a high numerical aperture (NA). Instead of direct integration, the vectorial Debye diffraction integral is evaluated with the fast Fourier transform for calculat ...

2006

A Low Complexity Change Detection Algorithm Operating in the Compressed Domain

Pierre-André Farine, Michael Ansorge

This paper introduces a simple, fast, and efficient algorithm for image change detection in the compressed domain. The proposed technique operates directly on Discrete Cosine Transformed (DCT-ed) data which makes it suitable for processing compressed bitst ...

2005

Spline-Based Image-to-Volume Registration for Three-Dimensional Electron Microscopy

Michaël Unser, Philippe Thévenaz

This paper presents an algorithm based on a continuous framework for a posteriori angular and translational assignment in three-dimensional electron microscopy (3DEM) of single particles. Our algorithm can be used advantageously to refine the assignment of ...

Elsevier2005

On Local Features for Face Verification

{W}e compare four local feature extraction techniques for the task of face verification, namely (ordered in terms of complexity): raw pixels, raw pixels with mean removal, 2D Discrete Cosine Transform (DCT) and local Principal Component Analysis (PCA). The ...

IDIAP2004

Face Processing & Frontal Face Verification

In this report we first review important publications in the field of face recognition; geometric features, templates, Principal Component Analysis (PCA), pseudo-2D Hidden Markov Models, Elastic Graph Matching, as well as other points are covered; importan ...

IDIAP2003

Non-Linear Fresnelet Approximation for Interference Term Suppression in Digital Holography

Michaël Unser, Thierry Blu

We present a zero-order and twin image elimination algorithm for digital Fresnel holograms that were acquired in an off-axis geometry. These interference terms arise when the digital hologram is reconstructed and corrupt the result. Our algorithm is based ...

SPIE2003

Directional multiresolution image representations

Minh Do

Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an ob ...

EPFL2002

Reducing recovery time in a small recursively restartable system

George Candea, Pranav Garg

We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as functionality or state sharing. Recursive restartability (RR), a recently pr ...

2002