Parallel Computation of Component Trees on Distributed Memory Machines

Component trees are region-based representations that encode the inclusion relationship of the threshold sets of an image. These representations are one of the most promising strategies for the analysis and the interpretation of spatial information of complex scenes as they allow the simple and effi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 29; H. 11; S. 2582 - 2598
Hauptverfasser:	Gotz, Markus, Cavallaro, Gabriele, Geraud, Thierry, Book, Matthias, Riedel, Morris
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.11.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Schlagworte:	Algorithms Component-trees Computer memory Computer Science connected component labeling Distributed memory Distributed, Parallel, and Cluster Computing Electronic mail Flooding Gray-scale high-performance computing hybrid application Image acquisition Image Processing Image resolution max-tree Merging Morphology MPI multithreading Parallel processing Remote sensing Representations Shape Spatial data threshold decomposition Trees Connected Component Labeling Component-Trees Multithreading Threshold Decomposition MPI High-Performance Computing Max-Tree Hybrid Application
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Component trees are region-based representations that encode the inclusion relationship of the threshold sets of an image. These representations are one of the most promising strategies for the analysis and the interpretation of spatial information of complex scenes as they allow the simple and efficient implementation of connected filters. This work proposes a new efficient hybrid algorithm for the parallel computation of two particular component trees-the max- and min-tree-in shared and distributed memory environments. For the node-local computation a modified version of the flooding-based algorithm of Salembier is employed. A novel tuple-based merging scheme allows to merge the acquired partial images into a globally correct view. Using the proposed approach a speed-up of up to 44.88 using 128 processing cores on eight-bit gray-scale images could be achieved. This is more than a five-fold increase over the state-of-the-art shared-memory algorithm, while also requiring only one-thirty-second of the memory.
AbstractList	Component trees are region-based representations that encode the inclusion relationship of the threshold sets of an image. These representations are one of the most promising strategies for the analysis and the interpretation of spatial information of complex scenes as they allow the simple and efficient implementation of connected filters. This work proposes a new efficient hybrid algorithm for the parallel computation of two particular component trees-the max- and min-tree-in shared and distributed memory environments. For the node-local computation a modified version of the flooding-based algorithm of Salembier is employed. A novel tuple-based merging scheme allows to merge the acquired partial images into a globally correct view. Using the proposed approach a speed-up of up to 44.88 using 128 processing cores on eight-bit gray-scale images could be achieved. This is more than a five-fold increase over the state-of-the-art shared-memory algorithm, while also requiring only one-thirty-second of the memory.
Author	Book, Matthias Gotz, Markus Riedel, Morris Cavallaro, Gabriele Geraud, Thierry
Author_xml	– sequence: 1 givenname: Markus surname: Gotz fullname: Gotz, Markus email: m.goetz@fz-juelich.de organization: Julich Supercomput. Center, Julich, Germany – sequence: 2 givenname: Gabriele surname: Cavallaro fullname: Cavallaro, Gabriele email: g.cavallaro@fz-juelich.de organization: Julich Supercomput. Center, Julich, Germany – sequence: 3 givenname: Thierry surname: Geraud fullname: Geraud, Thierry email: thierry.geraud@lrde.epita.fr organization: EPITA R&D Lab., Le Kremlin-Bicêtre, France – sequence: 4 givenname: Matthias surname: Book fullname: Book, Matthias email: book@hi.is organization: Univ. of Iceland, Reykjavik, Iceland – sequence: 5 givenname: Morris surname: Riedel fullname: Riedel, Morris email: m.riedel@fz-juelich.de organization: Julich Supercomput. Center, Julich, Germany
BackLink	https://hal.science/hal-02181876$$DView record in HAL
BookMark	eNp9kEFPwjAUxxuDiYB-AONliScPw752o-2RgIgJRBLx3HRbF0rGim0x4du7OfTgwVPbl9-_773fAPVqW2uEbgGPALB43KxnbyOCgY8IJ4KR5AL1IU15TIDTXnPHSRoLAuIKDbzfYQxJipM-mq-VU1Wlq2hq94djUMHYOrLl97NpUYdo47T2UVOdGR-cyY5BF9FK7607RSuVb02t_TW6LFXl9c35HKL3-dNmuoiXr88v08kyzinDIc54QZnIM4ZTmmVJQQogqWAlgSzLxwLyEhRlRAmORVGIjCUlU6XmCrNCCwF0iB66f7eqkgdn9sqdpFVGLiZL2dZwsy9wNv5s2fuOPTj7cdQ-yJ09uroZTxIgCYiUUtZQrKNyZ713upS56SwEp0wlActWsGwFy1awPAtukvAn-TPQf5m7LmO01r88p2NMBaFfnuGHeA
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_1109_TIP_2021_3064223 crossref_primary_10_3390_en15062088 crossref_primary_10_3390_rs13101969 crossref_primary_10_1016_j_patrec_2019_11_038 crossref_primary_10_1109_TIP_2025_3586495 crossref_primary_10_1109_MGRS_2022_3145478 crossref_primary_10_1007_s10851_025_01234_0 crossref_primary_10_1109_TPDS_2022_3158488
Cites_doi	10.1016/j.patrec.2014.05.007 10.1145/321879.321884 10.1109/TIP.2014.2336551 10.1007/978-3-662-05088-0 10.1051/0004-6361/201219448 10.1023/A:1008144113494 10.1109/TPAMI.2007.70836 10.4018/jehmc.2010070102 10.1090/S0002-9939-1956-0078686-7 10.1109/TIP.2017.2664667 10.1109/JSTSP.2012.2208177 10.1016/j.patcog.2015.11.012 10.1016/0167-8191(96)00024-5 10.1109/TGRS.2013.2286953 10.1109/LGRS.2012.2222340 10.1109/83.403422 10.1109/TPAMI.2017.2689765 10.1109/TIP.2006.877518 10.1016/0196-6774(82)90008-6 10.1109/TPAMI.2007.1045 10.1016/0743-7315(92)90075-X 10.1109/83.663500 10.2788/48773 10.1109/TGRS.2015.2436335 10.1016/j.ipl.2003.08.003 10.1006/cviu.1996.0066 10.1109/TIP.2015.2480599 10.1016/j.parco.2015.02.005 10.1109/83.841934 10.1109/TPAMI.2011.245 10.1109/34.3918 10.1016/j.jpdc.2005.02.003 10.1006/cviu.1999.0777
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES
DOI	10.1109/TPDS.2018.2829724
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	2598
ExternalDocumentID	oai:HAL:hal-02181876v1 10_1109_TPDS_2018_2829724 8360392
Genre	orig-research
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AGQYO AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD ESBDL HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS TN5 TWZ UHB AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG 1XC VOOES
ID	FETCH-LOGICAL-c370t-b8d379cb7053bb4d2d12597f21bbc691cf1a372a9809dd9b74f7afe8a07de9913
IEDL.DBID	RIE
ISICitedReferencesCount	22
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000447046200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1045-9219
IngestDate	Sat Nov 29 15:08:53 EST 2025 Sun Jun 29 15:29:17 EDT 2025 Sat Nov 29 06:06:46 EST 2025 Tue Nov 18 22:43:54 EST 2025 Wed Aug 27 02:47:15 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	Connected Component Labeling Component-Trees Multithreading Threshold Decomposition MPI High-Performance Computing Max-Tree Hybrid Application
Language	English
License	https://creativecommons.org/licenses/by/3.0/legalcode Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c370t-b8d379cb7053bb4d2d12597f21bbc691cf1a372a9809dd9b74f7afe8a07de9913
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-0380-7948 0000-0003-2472-5201 0000-0002-3239-9904 0000-0002-2233-1041
OpenAccessLink	https://ieeexplore.ieee.org/document/8360392
PQID	2124195337
PQPubID	85437
PageCount	17
ParticipantIDs	proquest_journals_2124195337 hal_primary_oai_HAL_hal_02181876v1 crossref_citationtrail_10_1109_TPDS_2018_2829724 crossref_primary_10_1109_TPDS_2018_2829724 ieee_primary_8360392
PublicationCentury	2000
PublicationDate	2018-11-01
PublicationDateYYYYMMDD	2018-11-01
PublicationDate_xml	– month: 11 year: 2018 text: 2018-11-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2018
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers
References	ref13 ref12 ref11 ref10 jones (ref9) 1997 ref19 ref18 kruskal (ref6) 1956; 7 serra (ref2) 1982 flick (ref28) 2015 ref51 nistér (ref35) 2008 aldeborgh (ref26) 2017 (ref53) 2017 ref45 abdi (ref56) 2010 berger (ref16) 2007 wilkinson (ref36) 2011 ref41 (ref50) 2016; 2 ref44 ref43 (ref48) 2017 ouzounis (ref27) 2007 levillain (ref54) 2010 ref49 ref8 dalla mura (ref14) 2009 ref7 ref4 ref3 ref5 ref40 ref34 ref31 ref30 ref33 ref32 matas (ref37) 2008 ref39 ref38 crozet (ref57) 2014 kazemier (ref55) 2017 ref24 ref23 ref25 ref20 teeninga (ref17) 2015 ref22 gropp (ref47) 2000 ref21 benediktsson (ref15) 2011 ref29 de bruijn (ref42) 1946; 49 matheron (ref1) 1975 (ref52) 2017 goetz (ref46) 2017
References_xml	– year: 2017 ident: ref53 – start-page: 2933 year: 2014 ident: ref57 article-title: A first parallel algorithm to compute the morphological tree of shapes of $n$ D images publication-title: Proc 21st IEEE Int Conf Image Process – ident: ref5 doi: 10.1016/j.patrec.2014.05.007 – ident: ref33 doi: 10.1145/321879.321884 – ident: ref31 doi: 10.1109/TIP.2014.2336551 – start-page: 1 year: 2015 ident: ref28 article-title: A parallel connectivity algorithm for De Bruijn graphs in metagenomic applications publication-title: Proc Int Conf High Perform Comput Netw Storage Anal – start-page: 169 year: 2010 ident: ref56 article-title: Coefficient of variation publication-title: Encyclopedia of Research Design – ident: ref44 doi: 10.1007/978-3-662-05088-0 – ident: ref51 doi: 10.1051/0004-6361/201219448 – year: 1997 ident: ref9 article-title: Component trees for image filtering and segmentation publication-title: Proc IEEE Workshop Nonlinear Signal Image Process – year: 1982 ident: ref2 publication-title: Image Analysis and Mathematical Morphology – start-page: 183 year: 2008 ident: ref35 article-title: Linear time maximally stable extremal regions publication-title: Proc Eur Conf Comput Vis – ident: ref10 doi: 10.1023/A:1008144113494 – year: 2000 ident: ref47 publication-title: Using MPI Portable parallel programming with the message-passing interface – ident: ref38 doi: 10.1109/TPAMI.2007.70836 – ident: ref18 doi: 10.4018/jehmc.2010070102 – year: 2017 ident: ref48 article-title: Hierachical data format 5. – volume: 7 start-page: 48 year: 1956 ident: ref6 article-title: On the shortest spanning subtree of a graph and the traveling salesman problem publication-title: Proc Amer Math Soc doi: 10.1090/S0002-9939-1956-0078686-7 – year: 2017 ident: ref46 article-title: Distributed max tree implementation – volume: 49 start-page: 758 year: 1946 ident: ref42 article-title: A combinatorial problem publication-title: Proc Koninklijke Nederlandse Akademie Van Wetenschappen – ident: ref20 doi: 10.1109/TIP.2017.2664667 – ident: ref23 doi: 10.1109/JSTSP.2012.2208177 – start-page: 1941 year: 2010 ident: ref54 article-title: Why and how to design a generic and efficient image processing framework: The case of the Milena library publication-title: Proc IEEE Int Conf Image Process – start-page: iv-41 year: 2007 ident: ref16 article-title: Effective component tree computation with application to pattern recognition in astronomical imaging publication-title: Proc IEEE Int Conf Image Process – start-page: 1021 year: 2011 ident: ref36 article-title: A fast component-tree algorithm for high dynamic-range images and second generation connectivity publication-title: Proc Int Conf Image Process – ident: ref19 doi: 10.1016/j.patcog.2015.11.012 – start-page: 275 year: 2017 ident: ref26 article-title: Unsupervised object detection on remote sensing imagery using hierarchical image representations and deep learning publication-title: Proc Conf Big Data Space – ident: ref49 doi: 10.1016/0167-8191(96)00024-5 – ident: ref21 doi: 10.1109/TGRS.2013.2286953 – ident: ref24 doi: 10.1109/LGRS.2012.2222340 – start-page: 157 year: 2015 ident: ref17 article-title: Improved detection of faint extended astronomical objects through statistical attribute filtering publication-title: Proc 12th Int Symp Math Morphology Appl Signal Image Process – start-page: 357 year: 2017 ident: ref55 publication-title: Connected Morphological Attribute Filters on Distributed Memory Parallel Machines – start-page: 306 year: 2011 ident: ref15 article-title: Hierarchical analysis of remote sensing data: Morphological attribute profiles and binary partition trees publication-title: Proc Int Symp Math Morphology Appl Signal Image Process – ident: ref12 doi: 10.1109/83.403422 – volume: 2 year: 2016 ident: ref50 article-title: JURECA: General-purpose supercomputer at Jülich Supercomputing Centre publication-title: Journal of large-scale research facilities JLSRF – start-page: 449 year: 2007 ident: ref27 article-title: A parallel dual-input max-tree algorithm for shared memory machines publication-title: Proc 8th Int Symp Math Morphology Appl Signal Image Process – start-page: 230 year: 2008 ident: ref37 article-title: Parallel algorithm for concurrent computation of connected component Tree publication-title: Proc Int Conf Adv Concepts Intell Vis Syst – ident: ref32 doi: 10.1109/TPAMI.2017.2689765 – start-page: 2 year: 2009 ident: ref14 article-title: Morphological attribute filters for the analysis of very high resolution remote sensing images publication-title: Proc IEEE Int Geosci Remote Sens Symp – ident: ref30 doi: 10.1109/TIP.2006.877518 – year: 2017 ident: ref52 – ident: ref41 doi: 10.1016/0196-6774(82)90008-6 – ident: ref13 doi: 10.1109/TPAMI.2007.1045 – year: 1975 ident: ref1 publication-title: Random Sets and Integral Geometry – ident: ref45 doi: 10.1016/0743-7315(92)90075-X – ident: ref4 doi: 10.1109/83.663500 – ident: ref7 doi: 10.2788/48773 – ident: ref22 doi: 10.1109/TGRS.2015.2436335 – ident: ref34 doi: 10.1016/j.ipl.2003.08.003 – ident: ref3 doi: 10.1006/cviu.1996.0066 – ident: ref11 doi: 10.1109/TIP.2015.2480599 – ident: ref40 doi: 10.1016/j.parco.2015.02.005 – ident: ref8 doi: 10.1109/83.841934 – ident: ref25 doi: 10.1109/TPAMI.2011.245 – ident: ref39 doi: 10.1109/34.3918 – ident: ref43 doi: 10.1016/j.jpdc.2005.02.003 – ident: ref29 doi: 10.1006/cviu.1999.0777
SSID	ssj0014504
Score	2.379464
Snippet	Component trees are region-based representations that encode the inclusion relationship of the threshold sets of an image. These representations are one of the...
SourceID	hal proquest crossref ieee
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	2582
SubjectTerms	Algorithms Component-trees Computer memory Computer Science connected component labeling Distributed memory Distributed, Parallel, and Cluster Computing Electronic mail Flooding Gray-scale high-performance computing hybrid application Image acquisition Image Processing Image resolution max-tree Merging Morphology MPI multithreading Parallel processing Remote sensing Representations Shape Spatial data threshold decomposition Trees
Title	Parallel Computation of Component Trees on Distributed Memory Machines
URI	https://ieeexplore.ieee.org/document/8360392 https://www.proquest.com/docview/2124195337 https://hal.science/hal-02181876
Volume	29
WOSCitedRecordID	wos000447046200014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5s8aAH6xPri0U8idE8tt3do6jFg0rBKt7CvoJCaaWtgv_emU0aFEXwliyzZMmX2fk28wI4kggy0gxK-0hNxKXSkfIyi0zquHLcdHVwtD_eiLs7-fSk-gtwUufCeO9D8Jk_pcvgy3dj-0a_ys4o4QDteQMaQnTLXK3aY8A7oVUgni46kUI1rDyYSazOBv3LewrikqfkNhQp_2aDGs8UARlaq_zYj4OR6bX-t7xVWKnIJDsv0V-DBT9ah9a8UQOr9HYdlr9UHdyAXl9PqIPKkJWSARs2LsLteITPYIOJ91OGo5dUV5daYnnHbiko94PdhvBLP92Eh97V4OI6qtopRDYT8Swy0mVCWSNQ74zhLnVIbpQo0sQY21WJLRKdiVQrGSvnlBG8ELrwUsfCeaSR2RY0R7iKbWBIE1Sa-kJ38FDblVZp0ykSpCKySLi1pg3x_AXntqo1Ti0vhnk4c8QqJ0xywiSvMGnDcT3ltSy08ZfwIaJWy1GJ7Ovzm5zGAmfBLf49acMGYVRLVfC0YW8Ocl7p6zRHA87JoZiJnd9n7cISLaDMQtyD5mzy5vdh0b7PXqaTg_ApfgIIM9k3
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB_6BeqDta3iaa1L8UlMm2w2t7uPxXqceHcceErflv0KCuVO7q4F_3tnNrlQUQp9S5ZZsuSX2flt5gvgnUKQkWZQ2gd3mVDaZjqqMnM8CB2E69vkaP8-kpOJurrS0y340OXCxBhT8Fk8o8vkyw8Lf0O_ys4p4QDt-TbsVkLwvMnW6nwGokrNAvF8UWUaFbH1YRa5Pp9NL79SGJc6I8eh5OIvK7T9g2IgU3OVf3bkZGYG-w9b4DN42tJJdtHgfwBbcX4I-5tWDazV3EN4cqfu4BEMpnZJPVSuWSOZ0GGLOt0u5vgMNlvGuGI4ekmVdakpVgxsTGG5v9k4BWDG1XP4Nvg0-zjM2oYKmS9lvs6cCqXU3knUPOdE4AHpjZY1L5zzfV34urCl5FarXIegnRS1tHVUNpchIpEsX8DOHFfxEhgSBc15rG2Fx9q-8tq6qi6QjKi6EN67HuSbF2x8W22cml5cm3TqyLUhTAxhYlpMevC-m_KrKbVxn_ApotbJUZHs4cXI0FhiLbjJ3xY9OCKMOqkWnh4cb0A2rcauDJpwQS7FUr76_6y38Gg4G4_M6PPky2t4TItpchKPYWe9vIlvYM_frn-ulifps_wDfMfcfg
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+Computation+of+Component+Trees+on+Distributed+Memory+Machines&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Gotz%2C+Markus&rft.au=Cavallaro%2C+Gabriele&rft.au=Geraud%2C+Thierry&rft.au=Book%2C+Matthias&rft.date=2018-11-01&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=29&rft.issue=11&rft.spage=2582&rft.epage=2598&rft_id=info:doi/10.1109%2FTPDS.2018.2829724&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TPDS_2018_2829724
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon