Fast Euclidean distance transformations by propagation using multiple neighbourhoods
Related publications (32)
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.
DNA is a long polymer with the form of a double helix of about two nanometers diameter (2.10-9 meters). It is composed of nucleotides whose sequence carries the information of heredity. The four possible nucleotides have slightly different geometries, and ...
We use cryo-electron microscopy to compare 3D shapes of 158 bp long DNA minicircles that differ only in the sequence within an 18 bp block containing either a TATA box or a catabolite activator protein binding site. We present a sorting algorithm that corr ...
In order to cope with sustainable development policy, buildings should be at least healthy, comfortable and energy efficient. Criteria for assessing individually the occupant's perceived health, the provided thermal, visual, acoustical comfort, the indoor ...
Inspired by the combinatorial denoising method {\tt DUDE} \cite{WOSVW04}, we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators ...
In chip multiprocessors (CMPs), limiting the number of off-chip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlapp ...
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance of hand-coded message passing by translating data-parallel programs into mes ...
This note illustrates how Voronoi diagrams and Delaunay triangula- tions of point sets can be computed by applying parametric linear pro- gramming techniques. We specify parametric linear programming prob- lems that yield the Delaunay triangulation or the ...
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the ...
We compare two systems for parallel programming on networks of workstations: Parallel Virtual Machine (PVM) a message passing system, and TreadMarks, a software distributed shared memory (DSM) system. We present results for eight applications that were imp ...