Abstract :

We propose fast algorithms to compute shapes, considered as level lines of a bilinear interpolated image, yielding smooth lines, to organize them in a tree structure, and to reduce their number by keeping only statistically relevant ones. Two fast algorithms are exposed in order to extract them. This results in visually clear features, which we compare with the classical definition of edges, and we show how to use them for some image analysis tasks, instead of edges.