Bearing estimation via spatial sparsity using compressive sensing
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.
Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...
In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...
In recent years, researchers have obtained impressive reconstructions of the refractive index (RI) of biological objects through the combined use of advanced physics (nonlinear forward model) and regularization. Here, we propose an adaptation of these tech ...
The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...
Dense conditional random fields (CRFs) have become a popular framework for modeling several problems in computer vision such as stereo correspondence and multiclass semantic segmentation. By modeling long-range interactions, dense CRFs provide a labeling t ...
Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...
In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...
This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...
For lumped homogeneous reaction systems, this paper presents a kinetic model identification scheme that provides maximum-likelihood parameter estimates and guarantees convergence to global optimality. The use of the extent-based incremental approach allows ...
We propose a distributed design method for decentralized control by exploiting the underlying sparsity properties of the problem. Our method is based on chordal decomposition of sparse block matrices and the alternating direction method of multipliers (ADM ...