Publication

Distance transformations: fast algorithms and applications to medical image processing

Related publications (441)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Dendrite Tracking in Microscopic Images using Minimum Spanning Trees and Localized E-M

Pascal Fua, François Fleuret

We describe in this document our preliminary results regarding the tracking of dendrites spreading from a neuron in confocal microscope im- ages. When using a small number of image layers, we obtain good results by combining a EM-based local estimate of th ...

2006

Image/video representation and scalable coding using redundant dictionaries

Adel Rahmoune

Compact or efficient representation for either images or image sequences is key operation to performing image and video processing tasks, such as compression, analysis, etc. The efficiency of an approximation is evaluated by the sparsity measure of the app ...

EPFL2005

Approximations in Distributed Optimization

Boi Faltings, Adrian Petcu

We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...

2005

Super-Resolution from Highly Undersampled Images

Martin Vetterli, Sabine Süsstrunk, Luciano Sbaiz, Patrick Vandewalle

Aliasing artifacts in images are visually very disturbing. Therefore, most imaging devices apply a low-pass filter before sampling. This removes all aliasing from the image, but it also creates a blurred image. Actually, all the image information above hal ...

2005

The Euclidean k-Distance Transformartion in Arbitrary Dimensions - a Separable Implementation

Olivier Cuisenaire

The signed k-distance transformation (k-DT) computes the k nearest prototypes from each location on a discrete regular grid within a given D dimensional volume. We propose a new k-DT algorithm that divides the problem into D 1-dimensional problems and comp ...

EUSIPCO2005

High Level Extraction of SoC Architectural Information from Generic C Algorithmic Descriptions

Marco Mattavelli, Massimo Ravasi

The complexity of nowadays, algorithms in terms of number of lines of codes and cross-relations among processing algorithms that are activated by specific input signals, goes far beyond what the designer can reasonably grasp from the “pencil & paper” analy ...

IEEE2005

Range queries in trie-structured overlays

Karl Aberer, Manfred Hauswirth, Anwitaman Datta, Roman Schmidt, Renault John Lecoultre

Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This ...

2005

Interpolation-based QR decomposition in MIMO-OFDM systems

Andreas Peter Burg

The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requires the computation of a QR decomposition for each of the data-carrying OFDM ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2005

Time-complexity bounds on agreement problems

Partha Dutta

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...

EPFL2005

Results on Range Image Segmentation for Service Robots

This report presents an experimental evaluation of a plane extraction method using various line extraction algorithms. Four different algorithms are chosen, which are well known in mobile robotics and computer vision. Experiments are performed on two sets ...

2005