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

A platform for mixed HW/SW algorithm specifications for the exploration of SW and HW partitioning

Marco Mattavelli, Christophe Lucarz

The increasing complexity in particular of video and multimedia processing has lead to the need of developing the algorithms specification using software implementations that become in practice generic reference implementations. Mapping directly such softw ...

Springer-Verlag2007

Efficient algorithms for the k-distance transformation

Olivier Cuisenaire

The k-distance transformation (k-DT) computes the k nearest patterns from each location on a discrete regular grid within a D dimensional volume, which Warfield [Patt. Rec. Letters, 17(1996) 713-721] proposed to implement using 2^D raster scans. We investi ...

2006

Tracking Atoms with Particles

Pierre Vandergheynst, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2006

Keypoint Recognition using Randomized Trees

Pascal Fua, Vincent Lepetit

In many 3--D object-detection and pose-estimation problems, run-time performance is of critical importance. However, there usually is time to train the system, which we will show to be very useful. Assuming that several registered images of the target obje ...

2006

Locally Adaptable Mathematical Morphology Using Distance Transformations

Olivier Cuisenaire

We investigate how common binary mathematical morphology operators can be adapted so that the size of the structuring element can vary across the image pixels. We show that when the structuring elements are balls of a metric, locally adaptable erosion and ...

2006

Reverse Search for Parametric Linear Programming

Colin Neil Jones

This paper introduces a new enumeration technique for (multi)parametric linear programs (pLPs) based on the reverse-search paradigm. We prove that the proposed algorithm has a computational complexity that is linear in the size of the output (number of so- ...

IEEE2006

On the facet-to-facet property of solutions to convex parametric quadratic programs

Colin Neil Jones

In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...

Elsevier2006

On the facet-to-facet property of solutions to convex parametric quadratic programs

Colin Neil Jones

2006

Improved MRSI with Field Inhomogeneity Compensation

Michaël Unser, Dimitri Nestor Alice Van De Ville, Ildar Khalidov, Mathews Jacob

Magnetic resonance spectroscopy imaging (MRSI) is a promising and developing tool in medical imaging. Because of various difficulties imposed by the imperfections of the scanner and the reconstruction algorithms, its applicability in clinical practice is r ...

SPIE2006

Partial and approximate symmetry detection for 3D geometry

Mark Pauly

"Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. Perlis Many natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models ...

2006