Shape decomposition by (d1, d2)-weighted skeleton and directional information

A binary pattern represented by means of its (d₁, d₂)-weighted skeleton is decomposed into elementary regions of given shape by selecting among its skeletal pixels those representing the considered regions. The selection is achieved by combining distance and directional information associated to each skeletal pixel with the notion of power of expansion of a pixel. A novel algorithm using these concepts to achieve a decomposition into possibly overlapping parts is presented and its performance in terms of naturalness and stability of the achieved decomposition is discussed