Topology-based Digital Image Processing (II): Contractibility, Transformability and Shortest path Problems

Author: Pedro Real (Univ. Sevilla)

In this talk, we deals with the problems of contractibility (determining if a cycle-for example, a closed curve without auto-intersections- can be "continuously" deformed to a point or not), transformability (determining if two cycles are homologous, that is, they can be deformed one to each other) and of the shortest path (to find the shortest "geodesic" between two points of the object) for a digital two-dimensional context. We make use of HSF representation techniques in order to design algorithms solving these problems. We use specific pedagogical software in simple examples for showing the effectiveness of the HSF approach.




Return Program