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.
In this note we review some classical algorithms for fluid-structure interaction problems and we propose an alternative viewpoint mutuated from the domain decomposition theory. This approach yields preconditioned Richardson iterations on the Steklov-Poinca ...
For the development and evaluation of methods for person identification, verification, and other tasks, databases play an important role. Despite this fact, there exists no measure whether a given database is sufficient to train and/or to test a given algo ...
Starting from a sample of a given size, texture synthesis algorithms are used to create larger texture images. A good algorithm produces synthesized textures that are pixelwise different but perceptually indistinguishable from the original image. The sampl ...
We investigate the learning of the appearance of an object from a single image of it. Instead of using a large number of pictures of an object to be recognized, we use pictures of other objects to learn invariance to noise and variations in pose and illumi ...
Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...
An efficient inverse kinematics solver is a key element in applications targeting the on-line or off-line postural control of complex articulated figures. In the present paper we progressively describe the strategic components of a very general and robust ...
Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...
When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...
In this paper we review some classical algorithms for fluid-structure interaction problems and we propose an alternative viewpoint mutuated from the domain decomposition theory. This approach yields preconditioned Richardson iterations on the Steklov-Poinc ...
In this paper, we propose an algorithm for automated segmentation of midsagittal brain MR images. First, we apply thresholding to obtain binary images. From the binary images, we locate some landmarks. Based on the landmarks and anatomical information, we ...
