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.
A new algorithm for finding straight lines in images under a bounded error model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters. It measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost. The algorithm can find interpretations of all the lines in the image that satisfy the constraint that each image feature supports at most one line hypothesis. It can be extended to compute efficiently the maxima of the probabilistic Hough transform and the generalized Hough transform under a variety of statistical error models.