A parallelizable framework for segmenting piecewise signals

Abstract : Piecewise signals appear in many application fields. Here, we propose a framework for segmenting such signals based on the modeling of each piece using a parametric probability distribution. The proposed framework first models the segmentation as an optimization problem with sparsity regularization. Then, an algorithm based on dynamic programming is utilized for finding the optimal solution. However, dynamic programming often suffers from a heavy computational burden. Therefore, we further show that the proposed framework is parallelizable and propose using GPU-based parallel computing to accelerate the computation. This approach is highly desirable for the analysis of large volumes of data which are ubiquitous. Experiments on both simulated and real genomic datasets from next generation sequencing demonstrate improved performance in terms of both segmentation quality and computational speed.
Type de document :
Article dans une revue
IEEE Access, IEEE, 2019, 7, pp.13217-13229. 〈10.1109/ACCESS.2018.2890077〉
Liste complète des métadonnées

Contributeur : David Brie <>
Soumis le : vendredi 11 janvier 2019 - 16:34:12
Dernière modification le : mardi 26 mars 2019 - 09:25:22

Lien texte intégral



Junbo Duan, Charles Soussen, David Brie, Jérôme Idier, Yu-Ping Wang, et al.. A parallelizable framework for segmenting piecewise signals. IEEE Access, IEEE, 2019, 7, pp.13217-13229. 〈10.1109/ACCESS.2018.2890077〉. 〈hal-01978681〉



Consultations de la notice