Publication

Distance transformations: fast algorithms and applications to medical image processing

Publications associées (441)

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

Comparing Algorithms for Reconstructing Digital Off-Axis Fresnel Holograms

Michaël Unser

Three-dimensional information about an object, such as its depth, may be captured and stored digitally in a single, two-dimensional, real-valued hologram acquired in an off-axis geometry. Digital reconstruction of the hologram permits the quantitative retr ...

SPIE2005

Action Semantics in Smart Objects

Daniel Thalmann, Tolga Abaci, Jan Ciger

We present a method of formal description of the action semantics in smart objects. Smart objects were primarily used for behavioral animation in the past. We demonstrate, how a formally described semantics can be used for action planning purposes by intel ...

2005

Computation of Observability Regions for Piecewise Affine Systems: A Projection-Based Algorithm

Giancarlo Ferrari Trecate

In this paper we consider the problem of computing sets of observable states for discrete-time, piecewise affine systems. When the maximal set of observable states is full-dimensional, we provide an algorithm for reconstructing it up to a zero measure set. ...

2005

Images Identification Based on Equivalence Classes

Touradj Ebrahimi

The image identification problem consists in identifying all the equivalent forms of a given reference image. An image is equivalent to the reference image, if the former results from the application of an image operator (or a composition of image operator ...

SPIE2005

Large scale stereo reconstruction by a minimum s-t cut formulation

Rico Zenklusen

An important problem in computer vision is the reconstruction problem which consists in reconstructing a three dimensional surface on the base of different images of the surface. The classical formulations for solving this problem work with the so called ≪ ...

2005

Multiscale Image Segmentation Using Active Contours

Jean-Philippe Thiran, Xavier Bresson, Laura Ioana Gui

We propose a new approach for image segmentation at different scales of observation, based on a multiscale image decomposition and on the active contour segmentation model. The proposed method consists of two steps. Firstly, a representation of a given ima ...

2005

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004

Rate-distortion optimized geometrical image processing

Rahul Shukla

Since geometrical features, like edges, represent one of the most important perceptual information in an image, efficient exploitation of such geometrical information is a key ingredient of many image processing tasks, including compression, denoising and ...

EPFL2004

The Overhead of Consensus Failure Recovery

Rachid Guerraoui, Partha Dutta

Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free periods, and a slower recovery mode following failures. A lot of work has been devoted to optimizing the normal mode, but little ...

2004

Lower Bounds on Generic Broadcast Algorithms

André Schiper, Fernando Pedone

This paper establishes tight lower bounds on the time complexity of algorithms solving the generic broadcast problem. Generic broadcast assumes a symmetric, non-reflexive conflict relation on the set of messages, and requires ordered delivery only for conf ...

2004