Reconstructing Geometrically Consistent Tree Structures from Noisy Images
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.
The first part of this thesis studies the problem of symmetry breaking in the context of simple mechanical systems with compact symmetry Lie group G. In this part we shall assume that the principal stratum of the G-action on the configuration space Q of a ...
Tree structures for computing orthogonal transforms are introduced. Two cases, delay trees and decimation trees, are investigated. A simple condition, namely the orthogonality of branches with a common root, is shown to be necessary and sufficient for the ...
Boiling water reactor (BWR) stability analysis is usually carried out using large system codes. However, because of the large computational efforts required, such codes cannot in practice be employed for the detailed investigation of the complete manifold ...
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent wor ...
This work is dedicated to the study of Dynamical Systems, depending on a slowly varying parameter. It contains, in particular, a detailed analysis of memory effects, such as hysteresis, which frequently appear in systems involving several time scales. In a ...
Building good sparse approximations of functions is one of the major themes in approximation theory. When applied to signals, images or any kind of data, it allows to deal with basic building blocks that essentially synthesize all the information at hand. ...
In a bog site in way of paludification, a pine stand is declining, which presently is an infrequent phenomenon on the Swiss Jura scale. A transect was positioned in the bog, from the external and driest part (pine-spruce stand) towards the central and wett ...
This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...
