Blind texture segmentation

Abstract

The technique presented solves the problem of texture segmentation in two steps. In the first, a textured image is divided into small squares (20*20 in this case) and a hierarchical clustering algorithm related to a choice of ultrametric distances is used to obtain an initial segmentation. In the second step, the texture boundaries are improved using a recursive procedure with vertical and horizontal segments of smaller and smaller size, converging towards the correct texture boundaries.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>