Publication

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Publications associées (43)

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

Beltrami-Flow to Generate a Scale-Space of Cortical Feature Maps on the Sphere.

Jean-Philippe Thiran, Dominique Zosso

In this paper we define a scale-space for cortical mean curvature maps on the sphere, that offers a hierarchical representation of the cortical structures, useful in multi-scale algorithms. A spherical feature map is obtained through inflation of the corti ...

2009

A Scale-Space of Cortical Feature Maps

Jean-Philippe Thiran, Dominique Zosso

In this paper we define a scale-space for cortical mean curvature maps on the sphere, that offers a hierarchical representation of the brain cortical structures, useful in multi-scale registration and analysis algorithms. A spherical feature map is obtaine ...

2009

Un modèle itératif de surfaces pour la construction en bois

Yves Weinand, Ivo Stotz, Gilles Gouaty, Eric Tosan

Dans le cadre de la construction en bois, nous nous intéressons à la modélisation de maillages surfaciques 3D basés sur un modèle itératif inspiré du modèle IFS (Iterated Function System). Les formes modélisées doivent satisfaire certaines propriétés afin ...

2009

Curvature-domain shape processing

Mark Pauly

We propose a framework for 3D geometry processing that provides direct access to surface curvature to facilitate advanced shape editing, filtering, and synthesis algorithms. The central idea is to map a given surface to the curvature domain by evaluating i ...

2008

Fast Non-Rigid Surface Detection, Registration and Realistic Augmentation

Pascal Fua, Vincent Lepetit, Julien Pilet

We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches between an undeformed image of the object and the image in which it is to be d ...

2008

Implicit Meshes for Effective Silhouette Handling

Pascal Fua, Mathieu Salzmann, Slobodan Ilic

Using silhouettes in uncontrolled environments typically requires handling occlusions as well as changing or cluttered backgrounds, which limits the applicability of most silhouette based methods. For the purpose of 3--D shape modeling, we show that repres ...

Springer Verlag2007

Implicit meshes

Slobodan Ilic

This thesis proposes novel ways both to represent the static surfaces, and to parameterize their deformations. This can be used both by automated algorithms for efficient 3–D shape reconstruction, and by graphics designers for editing and animation. Deform ...

EPFL2005

Real-Time Non-Rigid Surface Detection

Pascal Fua, Vincent Lepetit, Julien Pilet

2005

White matter fiber tract segmentation in DT-MRI using geometric flows

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Xavier Bresson, Olivier Cuisenaire, Lisa Jonasson

In this paper, we present a 3D geometric flow designed to segment the main core of fiber tracts in diffusion tensor magnetic resonance images. The fundamental assumption of our fiber segmentation technique is that adjacent voxels in a tract have similar pr ...

2005

Data Hiding on 3D Polygonal Meshes

Touradj Ebrahimi

This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improvements have been brought. By construction, the new embedding algorithm is robust ...

ACM2004