The problem of an image best approximation within the class of piecewise constant functions is considered. This allows a simpler data representation with a lower number of grey levels while retaining all information relevant to the particular application considered. The approximant can be found by solving a segmentation problem. The search for a solution is solved efficiently by training an artificial neural network (ANN) on a suitable set of templates by a standard procedure. The samples of the training alphabet fit the signal’s local behaviour in the homogeneous image subregions and in the regions crossed by the edges. Therefore the original image domain is partitioned into disjoint 2D intervals (tiling), and for each one of them, the network selects the alphabet element closest to the corresponding image component. The main motivation of this work consists in devising a methodology suitable for real-time applications; indeed, the ANN tool is attractive for a hardware implementation
Discrete image modelling for piecewise constant segmentation by artificial neural networks / DE SANTIS, Alberto; Iacoviello, Daniela. - In: IET IMAGE PROCESSING. - ISSN 1751-9659. - STAMPA. - 2:1(2008), pp. 37-47. [10.1049/iet-ipr:20070039]
Discrete image modelling for piecewise constant segmentation by artificial neural networks
DE SANTIS, Alberto;IACOVIELLO, Daniela
2008
Abstract
The problem of an image best approximation within the class of piecewise constant functions is considered. This allows a simpler data representation with a lower number of grey levels while retaining all information relevant to the particular application considered. The approximant can be found by solving a segmentation problem. The search for a solution is solved efficiently by training an artificial neural network (ANN) on a suitable set of templates by a standard procedure. The samples of the training alphabet fit the signal’s local behaviour in the homogeneous image subregions and in the regions crossed by the edges. Therefore the original image domain is partitioned into disjoint 2D intervals (tiling), and for each one of them, the network selects the alphabet element closest to the corresponding image component. The main motivation of this work consists in devising a methodology suitable for real-time applications; indeed, the ANN tool is attractive for a hardware implementationI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.