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.
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approxima ...
We propose a new method to compute the morphological dilation of a binary image with a circular structuring element of any given size, on a discrete lattice. The algorithm is equivalent to applying a threshold on an exact Euclidean distance map, but comput ...
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 propose a method for the automatic segmentation, recognition and measurement of neuronal fibers in microscopic images of nerves. This permits a quantitative analysis of the distribution of the areas of the fibers, while nowadays such morphometrical meth ...
