Publication

Systematic sensor placement for structural anomaly detection in the absence of damaged states

Publications associées (33)

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

, ,

In this paper, a novel optimality-tracking algorithm for solving Economic Nonlinear Model Predictive Control (ENMPC) problems in real-time is presented. Developing online schemes for ENMPC is challenging, since it is unclear how convexity of the Quadratic ...

IEEE2016

, ,

We address the problem of choosing a fixed number of sensor vertices in a graph in order to detect the source of a partially-observed diffusion process on the graph itself. Building on the definition of double resolvability we introduce a notion of vertex ...

2015

Classifiers based on sparse representations have recently been shown to provide excellent results in many visual recognition and classification tasks. However, the high cost of computing sparse representations at test time is a major obstacle that limits t ...

Springer2015

Assume that a stochastic process can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxima ...

2013

Sparse Binary Features for Image Classification

Johann Paratte

In this work a new method for automatic image classification is proposed. It relies on a compact representation of images using sets of sparse binary features. This work first evaluates the Fast Retina Keypoint binary descriptor and proposes imp ...

2013

We consider solving multi-objective optimization problems in a distributed manner by a network of cooperating and learning agents. The problem is equivalent to optimizing a global cost that is the sum of individual components. The optimizers of the individ ...

IEEE2013

Learning Discriminative Features and Structured Models for Segmentation in Microscopy and Natural Images

Aurélien Lucchi

Segmenting images is a significant challenge that has drawn a lot of attention from different fields of artificial intelligence and has many practical applications. One such challenge addressed in this thesis is the segmentation of electron microscope (EM) ...

EPFL2013

Isogeometric analysis (IGA) is a computational methodology recently developed to numerically approximate Partial Differential Equation (PDEs). It is based on the isogeometric paradigm, for which the same basis functions used to represent the geometry are t ...

2012

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010