Because of its attractive features, second order segmentation has shown to be a promising tool in remote sensing. A known drawback about its implementation is computational complexity, above all for large set of data. Recently in Zanetti et al. [1], an efficient version of the block-coordinate descent algorithm (BCDA) has been proposed for the minimization of a second order elliptic approximation of the Blake–Zissermann functional. Although the parallelization of linear algebra operations is expected to increase the performance of BCDA when addressing the segmentation of large-size gridded data (e.g., full-scene images or Digital Surface Models (DSMs)), numerical evidence shows that this is not sufficient to get significant reduction of computational time. Therefore a novel approach is proposed which exploits a decomposition technique of the image domain into tiles. The solution can be computed by applying BCDA on each tile in parallel way and combining the partial results corresponding to the different blocks of variables through a proper interconnection rule. We prove that this parallel method (OPARBCDA) generates a sequence of iterates which converges to a critical point of the functional on the level set devised by the starting point. Furthermore, we show that the parallel method can be efficiently implemented even in a commodity multicore CPU. Numerical results are provided to evaluate the efficiency of the parallel scheme on large images in terms of computational cost and its effectiveness with respect to the behavior on the tile junctions.

Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional / Zanella, Riccardo; Porta, F.; Ruggiero, Valeria; Zanetti, M.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - 318:(2018), pp. 153-175. [10.1016/j.amc.2017.07.021]

Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional

ZANELLA, RICCARDO;Porta, F.;RUGGIERO, Valeria;
2018

Abstract

Because of its attractive features, second order segmentation has shown to be a promising tool in remote sensing. A known drawback about its implementation is computational complexity, above all for large set of data. Recently in Zanetti et al. [1], an efficient version of the block-coordinate descent algorithm (BCDA) has been proposed for the minimization of a second order elliptic approximation of the Blake–Zissermann functional. Although the parallelization of linear algebra operations is expected to increase the performance of BCDA when addressing the segmentation of large-size gridded data (e.g., full-scene images or Digital Surface Models (DSMs)), numerical evidence shows that this is not sufficient to get significant reduction of computational time. Therefore a novel approach is proposed which exploits a decomposition technique of the image domain into tiles. The solution can be computed by applying BCDA on each tile in parallel way and combining the partial results corresponding to the different blocks of variables through a proper interconnection rule. We prove that this parallel method (OPARBCDA) generates a sequence of iterates which converges to a critical point of the functional on the level set devised by the starting point. Furthermore, we show that the parallel method can be efficiently implemented even in a commodity multicore CPU. Numerical results are provided to evaluate the efficiency of the parallel scheme on large images in terms of computational cost and its effectiveness with respect to the behavior on the tile junctions.
2018
318
153
175
Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional / Zanella, Riccardo; Porta, F.; Ruggiero, Valeria; Zanetti, M.. - In: APPLIED MATHEMATICS AND COMPUTATION. - ISSN 0096-3003. - 318:(2018), pp. 153-175. [10.1016/j.amc.2017.07.021]
Zanella, Riccardo; Porta, F.; Ruggiero, Valeria; Zanetti, M.
File in questo prodotto:
File Dimensione Formato  
VOR_Serial and parallel approaches.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 7.79 MB
Formato Adobe PDF
7.79 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
segmentation_revised0.pdf

Open access

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 4.12 MB
Formato Adobe PDF
4.12 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1171761
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact