On distances, paths and connections for hyperspectral image segmentation

Abstract

The present paper introduces the and connections in order to add regional information on -flat zones, which only take into account a local information. A top-down approach is considered. First -flat zones are built in a way leading to a sub-segmentation. Then a finer segmentation is obtained by computing -bounded regions and -geodesic balls inside the -flat zones. The proposed algorithms for the construction of new partitions are based on queues with an ordered selection of seeds using the cumulative distance. -bounded regions offers a control on the variations of amplitude in the class from a point, called center, and -geodesic balls controls the "size" of the class. These results are applied to hyperspectral images.

Tasks

Reproductions