Publication

On Local Features for Face Verification

Publications associées (40)

Dimensionality reduction of time-series data, and systems and devices that use the resultant embeddings

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dimensionality reduction of time-series using contrastive learning. A method can include receiving multidimensional input time series data that includes ...

2023

Practical Multiple-Scattering Sheen Using Linearly Transformed Cosines

Tizian Lucien Zeltner

We introduce a new volumetric sheen BRDF that approximates scattering observed in surfaces covered with normally-oriented fibers. Our previous sheen model was motivated by measured cloth reflectance, but lacked significant backward scattering. The model pr ...

ASSOC COMPUTING MACHINERY2022

Function Integration, Reconstruction And Approximation Using Rank-1 Lattices

Fabio Nobile, Giovanni Migliorati

We consider rank-1 lattices for integration and reconstruction of functions with series expansion supported on a finite index set. We explore the connection between the periodic Fourier space and the non-periodic cosine space and Chebyshev space, via tent ...

2021

Wavelet-Fourier CORSING techniques for multidimensional advection-diffusion-reaction equations

Fabio Nobile, Simone Brugiapaglia

We present and analyze a novel wavelet-Fourier technique for the numerical treatment of multidimensional advection–diffusion–reaction equations based on the COmpRessed SolvING (CORSING) paradigm. Combining the Petrov–Galerkin technique with the compressed ...

2020

MATHICSE Technical Report : Function integration, reconstruction and approximation using rank-1 lattices

Fabio Nobile, Giovanni Migliorati

MATHICSE2019

Design of Energy-Efficient Discrete Cosine Transform using Pruned Arithmetic Circuits

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter

Inexact circuits and approximate computing have been gaining a lot of interest in order to improve performances and energy efficiency beyond the boundaries of conventional digital circuits. Image and video processing is one of the best candidate for applyi ...

IEEE2016

Optimality of Operator-Like Wavelets for Representing Sparse AR(1) Processes

Michaël Unser, Pedram Pad

The discrete cosine transform (DCT) is known to be asymptotically equivalent to the Karhunen-Loève transform (KLT) of Gaussian first-order auto-regressive (AR(1)) processes. Since being uncorrelated under the Gaussian hypothesis is synonymous with independ ...

IEEE2015

Optimized Kaiser-Bessel Window Functions for Computed Tomography

Michaël Unser, Cédric René Jean Vonesch, John Paul Ward, Masih Nilchian

Kaiser-Bessel window functions are frequently used to discretize tomographic problems because they have two desirable properties: 1) their short support leads to a low computational cost and 2) their rotational symmetry makes their imaging transform indepe ...

Ieee-Inst Electrical Electronics Engineers Inc2015

On the Optimality of Operator-Like Wavelets for Sparse AR(1) Processes

Michaël Unser, Pedram Pad

Sinusoidal transforms such as the DCT are known to be optimal—that is, asymptotically equivalent to the Karhunen-Loève transform (KLT)—for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains ...

IEEE2013

On The Optimality Of Operator-Like Wavelets For Sparse Ar(1) Processes

Michaël Unser, Pedram Pad

Sinusoidal transforms such as the DCT are known to be optimal-that is, asymptotically equivalent to the Karhunen-Loeve transform (KLT)-for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains a ...

Ieee2013

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