Publications related to Perturbed Utility Stochastic Traffic Assignment

GPU-accelerated Convex Multi-phase Image Segmentation

Jean-Philippe Thiran, Xavier Bresson, Subrahmanyam Venkata Ravi Mohana Sai Gorthi, Hadrien Copponnex, Arnaud Le Carvennec

Image segmentation is a key area of research in computer vision. Recent advances facilitated reformulation of the non-convex multi-phase segmentation problem as a convex optimization problem (see for example [2, 4, 9, 10, 13, 16]). Recently, [3] proposed a ...

2011

An optimal first-order solver for the TV-$L_1$ optical flow problem

Pierre Vandergheynst, Gilles Puy, Emmanuel D'Angelo

In this study, we address the problem of computing efficiently a dense optical flow between two images under a total variation (TV) regularization and an

L_1

norm data fidelity constraint using a variational method. We build upon Nesterov's framework for ...

2010

Minimum distance between pattern transformation manifolds: Algorithm and Applications

Pascal Frossard, Effrosyni Kokiopoulou

Transformation invariance is an important property in pattern recognition, where different observations of the same object typically receive the same label. This paper focuses on a transformation invariant distance measure that represents the minimum dista ...

2009

Geometry-aware analysis of high-dimensional visual information sets

Effrosyni Kokiopoulou

Over the past few decades we have been experiencing a data explosion; massive amounts of data are increasingly collected and multimedia databases, such as YouTube and Flickr, are rapidly expanding. At the same time rapid technological advancements in mobil ...

EPFL2009

A heuristic for nonlinear global optimization relevant to discrete choice models estimation

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

In most applications related to transportation, it is of major importance to be able to identify the global optimum of the associated optimization problem. The work we present in this paper is motivated by the optimization problems arising in the maximum l ...

2007

Optimal trellis-based buffered compression and fast approximations

Martin Vetterli

The authors formalize the description of the buffer-constrained adaptive quantization problem. For a given set of admissible quantizers used to code a discrete nonstationary signal sequence in a buffer-constrained environment, they formulate the optimal so ...

1994

Perturbed Utility Stochastic Traffic Assignment

Graph Chatbot

Chat with Graph Search

GPU-accelerated Convex Multi-phase Image Segmentation

An optimal first-order solver for the TV-$L_1$ optical flow problem

Minimum distance between pattern transformation manifolds: Algorithm and Applications

Geometry-aware analysis of high-dimensional visual information sets

A heuristic for nonlinear global optimization relevant to discrete choice models estimation

Optimal trellis-based buffered compression and fast approximations

Geometry-aware analysis of high-dimensional visual information sets

GPU-accelerated Convex Multi-phase Image Segmentation

Optimal trellis-based buffered compression and fast approximations

Minimum distance between pattern transformation manifolds: Algorithm and Applications

A heuristic for nonlinear global optimization relevant to discrete choice models estimation

An optimal first-order solver for the TV-$L_1$ optical flow problem