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.
This paper presents a fully automated brain segmentation method that has been applied to a group of patients with infratentorial ependymoma. The purpose of the study was to test the hypothesis that fully-automated atlas-based segmentation methods provide u ...
We propose a method for the registration of MRI brain images with the physical space. Points on the patients scalp are acquired using a magnetic-field digitizer. The registration transform is the rigid transform that minimizes the mean square distance bet ...
A method for the automatic segmentation, recognition and measurement of neuronal myelinated fibers in nerve histological sections is presented. In this method, the fiber parameters i.e. perimeter, area, position of the fiber and myelin sheath thickness are ...
Delineation of structures to irradiate (the tumors) as well as structures to be spared (e.g., optic nerve, brainstem, or eyes) is required for advanced radiotherapy techniques. Due to a lack of time and the number of patients to be treated these cannot alw ...
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 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 ...
