ראידה נעאמנה (מדעי המחשב, טכניון)
יום ראשון, 11.8.2013, 13:00
חדר 337, בניין טאוב למדעי המחשב
We propose an algorithm for reconstructing a multi-label object from cross-sections in a fair manner. We handle the problem in its full generality: Cross-sections need not be parallel or complete, every section may contain an unlimited number of contours with any geometries and in any level of containment hierarchy. We focus on the simultaneous reconstruction of an object from contours with multiple labels "colors", in scenarios in which interpolating separately between contours of each color results in conflicting (intersecting) reconstructions. We suggest a flexible scheme for combing all the individual reconstructions and resolving fairly the conflicts between them.
This talk summarizes the M.Sc. research of the speaker under the supervision of Prof. Gill Barequet.