Concept

Clustal

Publications associées (26)

Comparing Annual Glare Simulation Methods

Stephen William Wasilewski

Recently, there have been multiple proposals for faster methods to calculate glare metrics, daylight glare probability (DGP) in particular. This is driven simultaneously by the lengthy times required to simulate DGP with a conventional image-based approach ...
2022

Poly-NL: Linear Complexity Non-local Layers With 3rd Order Polynomials

Grigorios Chrysos, Filippos Kokkinos

Spatial self-attention layers, in the form of Non-Local blocks, introduce long-range dependencies in Convolutional Neural Networks by computing pairwise similarities among all possible positions. Such pairwise functions underpin the effectiveness of non-lo ...
IEEE2021

MPGM: Scalable and Accurate Multiple Network Alignment

Matthias Grossglauser, Ehsan Kazemi

Protein-protein interaction (PPI) network alignment is a canonical operation to transfer biological knowledge among species. The alignment of PPI-networks has many applications, such as the prediction of protein function, detection of conserved network mot ...
IEEE COMPUTER SOC2020

Exponentially long orbits in Hopfield neural networks

Wulfram Gerstner, Johanni Michael Brea, Samuel Pavio Muscinelli

We show that Hopfield neural networks with synchronous dynamics and asymmetric weights admit stable orbits that form sequences of maximal length. For N units, these sequences have length T = 2^N; that is, they cover the full state space. We present a mathe ...
Massachusetts Institute of Technology Press2017

Optical Tomographic Image Reconstruction Based on Beam Propagation and Sparse Regularization

Michaël Unser, Demetri Psaltis, Cédric René Jean Vonesch, Ulugbek Kamilov

Optical tomographic imaging requires an accurate forward model as well as regularization to mitigate missing-data artifacts and to suppress noise. Nonlinear forward models can provide more accurate interpretation of the measured data than their linear coun ...
2016

Progressive Geometric Algorithms

Timur Bagautdinov

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...
Carleton Univ, Dept Mathematics & Statistics2015

Registration with the Point Cloud Library A Modular Framework for Aligning in 3-D

Alexandru Eugen Ichim

The open-source point cloud library (PCL) and the tools available for point cloud registration is presented. Pairwise registration is usually carried out by means of one of the several variants of the ICP algorithm. Due to the nonconvexity of the optimizat ...
Ieee-Inst Electrical Electronics Engineers Inc2015

Systematic errors of skin-friction measurements by oil-film interferometry

Peter Monkewitz, Jean-Daniel Rüedi

In recent years, the independent measurement of wall shear stress with oil-film or oil-drop interferometry has become a cornerstone of turbulent-boundary-layer research as many arguments depend critically on a precise knowledge of the skin friction tau(w)* ...
Cambridge University Press2015

Analysis of image registration with tangent distance

Pascal Frossard, Elif Vural

The computation of the geometric transformation between a reference and a target image, known as image registration or alignment, corresponds to the projection of the target image onto the transformation manifold of the reference image (the set of images g ...
2014

Analysis of Image Registration with Tangent Distance

Pascal Frossard, Elif Vural

The computation of the geometric transformation between a reference and a target image, known as image registration or alignment, corresponds to the projection of the target image onto the transformation manifold of the reference image (the set of images g ...
2014

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.