Start-up

Minsh

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

Symmetry in 3D Geometry: Extraction and Applications

Mark Pauly, Duygu Ceylan

The concept of symmetry has received significant attention in computer graphics and computer vision research in recent years. Numerous methods have been proposed to find, extract, encode and exploit geometric symmetries and high‐level structural informatio ...

2013

Hang With Your Buddies to Resist Intersection Attacks

Bryan Alexander Ford

Some anonymity schemes, such as DC-nets and MIX cascades, can guarantee anonymity even against traffic analysis – provided messages are independent and unlinkable. Users in practice often desire pseudonymity – sending messages intentionally linkable to eac ...

2013

Caustic Art

Mark Pauly

The computation of caustics created by reflection or refraction of light is a well-studied problem in computer graphics. This paper investigates the inverse problem: Given a greyscale intensity image, find the shape of a surface that will cast a caustic th ...

2012

Entity-based Classification of Twitter Messages

Karl Aberer, Zoltán Miklós, Surender Reddy Yerva

Twitter is a popular micro-blogging service on theWeb, where people can enter short messages, which then become visible to some other users of the service. While the topics of these messages varies, there are a lot of messages where the users express their ...

2012

An Interdisciplinary VR-Architecture for 3D Chatting with Non-verbal Communication

Daniel Thalmann, Stéphane Gobron, Junghyun Ahn, Quentin Silvestre

The communication between avatar and agent has already been treated from different but specialized perspectives. In contrast, this paper gives a balanced view of every key architectural aspect: from text analysis to computer graphics, the chatting system a ...

Eurographics Association2011

Computing correspondences in geometric data sets

Mark Pauly, Hao Li

Shape registration and, more generally speaking, computing correspondence across shapes are fundamental problems in computer graphics and vision. Problems from this area show up in many diff erent variants such as scan registration, deformable shape matchi ...

2011

Photo-Realistic Real-time Face Rendering

Daniel Chappuis

Face rendering is a really important topic in Computer Graphics because a lot of virtual simulations or video games contain virtual humans. In order to obtain a realistic face, we need to take care of skin rendering. Nowadays, we can use modern 3D scanning ...

2011

Data compression on the sphere

Yves Wiaux, Jason Douglas McEwen

Large data-sets defined on the sphere arise in many fields. In particular, recent and forthcoming observations of the anisotropies of the cosmic microwave background (CMB) made on the celestial sphere contain approximately three and fifty mega-pixels respe ...

Indian Academy of Sciences2011

Real-time textured volume reconstruction using virtual and real video cameras

Daniel Thalmann, Stéphane Gobron, Junghyun Ahn, Clément Marx

Reconstructing objects in three dimensions (3D) has always been one of the primary tasks in the domain of computer graphics (CG). Succeeding in this task in real-time, including texture reconstruction, and with very low-cost hardware is the challenge prese ...

2010

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

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