Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines
Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence Jg. 30; H. 10; S. 1800 - 1813 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Los Alamitos, CA
IEEE
01.10.2008
IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0162-8828, 1939-3539 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72% on a single-core processor, due to reduced cache thrashing. |
|---|---|
| AbstractList | Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72% on a single-core processor, due to reduced cache thrashing. Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm which achieves efficient parallelism for a large class of attribute filters, including [abstract truncated by publisher]. Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm that achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72 percent on a single-core processor, due to reduced cache thrashing.Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm that achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72 percent on a single-core processor, due to reduced cache thrashing. Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm that achieves efficient parallelism for a large class of attribute filters, including attribute openings, closings, thinnings and thickenings, based on Salembier's Max-Trees and Min-trees. The image or volume is first partitioned in multiple slices. We then compute the Max-trees of each slice using any sequential Max-Tree algorithm. Subsequently, the Max-trees of the slices can be merged to obtain the Max-tree of the image. A C-implementation yielded good speed-ups on both a 16-processor MIPS 14000 parallel machine, and a dual-core Opteron-based machine. It is shown that the speed-up of the parallel algorithm is a direct measure of the gain with respect to the sequential algorithm used. Furthermore, the concurrent algorithm shows a speed gain of up to 72 percent on a single-core processor, due to reduced cache thrashing. |
| Author | Hesselink, W.H. Wilkinson, M.H.F. Meijster, A. Jonker, J.-E. Hui Gao |
| Author_xml | – sequence: 1 givenname: M.H.F. surname: Wilkinson fullname: Wilkinson, M.H.F. organization: Inst. for Math. & Comput. Sci., Univ. of Groningen, Groningen – sequence: 2 surname: Hui Gao fullname: Hui Gao – sequence: 3 givenname: W.H. surname: Hesselink fullname: Hesselink, W.H. – sequence: 4 givenname: J.-E. surname: Jonker fullname: Jonker, J.-E. – sequence: 5 givenname: A. surname: Meijster fullname: Meijster, A. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20628111$$DView record in Pascal Francis https://www.ncbi.nlm.nih.gov/pubmed/18703832$$D View this record in MEDLINE/PubMed |
| BookMark | eNqFkstrFEEQxhuJmE30LggyBKKnWau7p1_HZTExkNWA8dz09NaQDvNYu3sO-e-dfbiHgOZUUPy-en5n5KQfeiTkPYU5pWC-3N8tVjdzBqDmCjSXr8iMGm5KLrg5ITOgkpVaM31KzlJ6BKCVAP6GnFKtgGvOZuT7cuj9GCP2uVgO3WbMLoehL4amWOQcQz1mLK5CmzGmYsr_fHAR18UKuyE-FXcuurbFtlg5_xB6TG_J68a1Cd8d4jn5dfX1fvmtvP1xfbNc3Ja-kiaXci2kbrisG8dZTdcApqmV14I2WimqsRam8hQ8igpryvy0SQ2NlpTWAqXh5-Tzvu4mDr9HTNl2IXlsW9fjMCZrgEumDH2Z1EqAmE4kJ_LTf0lpKi4oqBdBXlUAsqITePEMfBzG2E-HsVoyJiq2G_DjARrrDtd2E0Pn4pP9-6MJuDwALnnXNtH1PqQjx0AyTem2m9xzPg4pRWysD_tv5uhCaynYrWnszjR2axq7M80khGfC4wz_lnzYSwIiHvFpb6WY4n8AdZzJdg |
| CODEN | ITPIDJ |
| CitedBy_id | crossref_primary_10_1109_TIP_2014_2362053 crossref_primary_10_1016_j_patcog_2011_03_025 crossref_primary_10_1016_j_patrec_2019_11_038 crossref_primary_10_1109_MSP_2009_934154 crossref_primary_10_1007_s10851_009_0136_3 crossref_primary_10_1007_s10851_025_01234_0 crossref_primary_10_1080_19479832_2012_702687 crossref_primary_10_1109_TPAMI_2011_245 crossref_primary_10_1016_j_media_2024_103364 crossref_primary_10_1007_s10851_013_0438_3 crossref_primary_10_1109_TPAMI_2015_2441070 crossref_primary_10_1007_s11227_018_2690_1 crossref_primary_10_1109_TGRS_2012_2230268 crossref_primary_10_1109_TPDS_2022_3158488 crossref_primary_10_1109_TIP_2021_3064223 crossref_primary_10_3390_ijgi5030022 crossref_primary_10_1016_j_sysarc_2011_06_002 crossref_primary_10_1109_TGRS_2010_2048116 crossref_primary_10_3390_en15062088 crossref_primary_10_1016_j_patcog_2015_11_012 crossref_primary_10_1088_0031_9155_59_9_2155 crossref_primary_10_1016_j_media_2012_08_004 crossref_primary_10_1109_TGRS_2015_2496167 crossref_primary_10_1007_s11554_016_0604_0 crossref_primary_10_1109_TPDS_2018_2829724 crossref_primary_10_1016_j_patrec_2022_09_005 crossref_primary_10_1016_j_fss_2009_08_006 crossref_primary_10_1109_TGRS_2016_2530690 crossref_primary_10_1109_TPAMI_2017_2689765 crossref_primary_10_1109_JSTARS_2013_2262996 crossref_primary_10_1109_TPAMI_2010_200 crossref_primary_10_1007_s11554_012_0248_7 crossref_primary_10_1016_j_cag_2022_09_002 crossref_primary_10_1109_TIP_2014_2336551 crossref_primary_10_1109_TPAMI_2010_74 crossref_primary_10_1109_JSTSP_2012_2201694 crossref_primary_10_1109_TGRS_2014_2358934 crossref_primary_10_1109_TGRS_2016_2561842 |
| Cites_doi | 10.1145/321879.321884 10.1109/VISUAL.2002.1183812 10.1006/cviu.1998.0703 10.1016/S0925-7721(02)00093-7 10.1006/cviu.1996.0066 10.1007/BF00268134 10.1109/34.993556 10.1023/A:1024476403183 10.1109/83.217222 10.1145/362875.362878 10.1006/cviu.1999.0777 10.1109/ICIP.2007.4379949 10.1007/s10851-005-4892-4 10.1016/j.ipl.2003.08.003 10.1007/0-306-47025-x_36 10.1007/s10851-005-4891-5 10.1109/TIT.1962.1057692 10.1016/0020-0190(96)00049-X 10.1016/S0167-8191(02)00103-5 10.1023/A:1008324520475 10.1109/34.55110 10.1109/TIP.2006.877518 10.1007/3-540-45468-3_92 10.1109/83.841532 10.1145/262839.269238 10.1145/364099.364331 10.1109/83.663500 10.1109/83.403422 10.1109/TPAMI.2007.28 10.1016/S0167-6423(01)00007-7 10.1109/83.199924 10.1016/0304-3975(94)00262-2 10.1007/978-3-662-03039-4_13 10.1109/VISUAL.2002.1183774 10.1109/TPAMI.2007.1045 |
| ContentType | Journal Article |
| Copyright | 2009 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| Copyright_xml | – notice: 2009 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW CGR CUY CVF ECM EIF NPM 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 7X8 |
| DOI | 10.1109/TPAMI.2007.70836 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library Online CrossRef Pascal-Francis Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database MEDLINE - Academic |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) 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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering MEDLINE - Academic |
| DatabaseTitleList | Technology Research Database Technology Research Database MEDLINE - Academic Technology Research Database MEDLINE |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1939-3539 |
| EndPage | 1813 |
| ExternalDocumentID | 2322656371 18703832 20628111 10_1109_TPAMI_2007_70836 4407727 |
| Genre | orig-research Journal Article |
| GroupedDBID | --- -DZ -~X .DC 0R~ 29I 4.4 53G 5GY 5VS 6IK 97E 9M8 AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P FA8 HZ~ H~9 IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TN5 UHB VH1 XJT ~02 AAYXX CITATION IQODW RIG CGR CUY CVF ECM EIF NPM 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 7X8 |
| ID | FETCH-LOGICAL-c469t-6d568f36bfa32b1d009fb7c851f87718eb594c10ce54eb12c016b0f8611b5e693 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 64 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258344900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0162-8828 |
| IngestDate | Thu Oct 02 10:01:59 EDT 2025 Sun Nov 09 10:05:28 EST 2025 Sat Sep 27 19:40:33 EDT 2025 Sat Sep 27 18:41:33 EDT 2025 Sun Nov 09 07:58:07 EST 2025 Mon Jul 21 06:00:58 EDT 2025 Mon Jul 21 09:14:16 EDT 2025 Sat Nov 29 08:04:58 EST 2025 Tue Nov 18 22:31:03 EST 2025 Tue Aug 26 16:47:22 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | connected filters mathematical morphology Enhancement Parallel algorithms Filtering algorithms Parallel algorithm Cache memory Parallel machines Distributed computing Mathematical morphology Morphological filter Distributed memory Concurrency Morphological analysis Minimax method Parallelism Tridimensional image Attribute filters Pattern analysis Artificial intelligence Shared memory parallel computing Single machine Thickening |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c469t-6d568f36bfa32b1d009fb7c851f87718eb594c10ce54eb12c016b0f8611b5e693 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| PMID | 18703832 |
| PQID | 862254219 |
| PQPubID | 23500 |
| PageCount | 14 |
| ParticipantIDs | proquest_miscellaneous_34400641 crossref_citationtrail_10_1109_TPAMI_2007_70836 proquest_journals_862254219 crossref_primary_10_1109_TPAMI_2007_70836 proquest_miscellaneous_903627919 ieee_primary_4407727 proquest_miscellaneous_875058286 pascalfrancis_primary_20628111 proquest_miscellaneous_69435107 pubmed_primary_18703832 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-10-01 |
| PublicationDateYYYYMMDD | 2008-10-01 |
| PublicationDate_xml | – month: 10 year: 2008 text: 2008-10-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Los Alamitos, CA |
| PublicationPlace_xml | – name: Los Alamitos, CA – name: United States – name: New York |
| PublicationTitle | IEEE transactions on pattern analysis and machine intelligence |
| PublicationTitleAbbrev | TPAMI |
| PublicationTitleAlternate | IEEE Trans Pattern Anal Mach Intell |
| PublicationYear | 2008 |
| Publisher | IEEE IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: IEEE Computer Society – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref35 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref32 ref2 ref1 ref17 ref16 ref38 ref19 ref18 Ouzounis (ref39) Klein (ref7) 1976 ref24 Urbach (ref12) ref23 ref26 ref25 ref22 ref21 ref28 ref27 ref29 ref8 ref9 ref4 ref3 ref6 ref5 Roubal (ref20) |
| References_xml | – ident: ref16 doi: 10.1145/321879.321884 – ident: ref37 doi: 10.1109/VISUAL.2002.1183812 – ident: ref6 doi: 10.1006/cviu.1998.0703 – ident: ref22 doi: 10.1016/S0925-7721(02)00093-7 – ident: ref5 doi: 10.1006/cviu.1996.0066 – ident: ref34 doi: 10.1007/BF00268134 – ident: ref15 doi: 10.1109/34.993556 – ident: ref27 doi: 10.1023/A:1024476403183 – ident: ref8 doi: 10.1109/83.217222 – start-page: 449 volume-title: Proc. Int’l Symp. Math. Morphology (ISMM ’07) ident: ref39 article-title: A Parallel Dual-Input Max-Tree Algorithm for Shared Memory Machines – ident: ref19 doi: 10.1145/362875.362878 – ident: ref17 doi: 10.1006/cviu.1999.0777 – ident: ref31 doi: 10.1109/ICIP.2007.4379949 – ident: ref26 doi: 10.1007/s10851-005-4892-4 – ident: ref35 doi: 10.1016/j.ipl.2003.08.003 – ident: ref3 doi: 10.1007/0-306-47025-x_36 – ident: ref25 doi: 10.1007/s10851-005-4891-5 – ident: ref36 doi: 10.1109/TIT.1962.1057692 – ident: ref2 doi: 10.1016/0020-0190(96)00049-X – ident: ref1 doi: 10.1016/S0167-8191(02)00103-5 – ident: ref28 doi: 10.1023/A:1008324520475 – ident: ref29 doi: 10.1109/34.55110 – ident: ref18 doi: 10.1109/TIP.2006.877518 – ident: ref14 doi: 10.1007/3-540-45468-3_92 – ident: ref24 doi: 10.1109/83.841532 – ident: ref21 doi: 10.1145/262839.269238 – ident: ref33 doi: 10.1145/364099.364331 – ident: ref11 doi: 10.1109/83.663500 – ident: ref4 doi: 10.1109/83.403422 – year: 1976 ident: ref7 article-title: Conception et Réalisation d’une Unité Logique Pour l’analyse Quantitative d’images – ident: ref13 doi: 10.1109/TPAMI.2007.28 – ident: ref30 doi: 10.1016/S0167-6423(01)00007-7 – start-page: 305 volume-title: Proc. Int’l Symp. Math. Morphology (ISMM ’02) ident: ref12 article-title: Shape-Only Granulometries and Grey-Scale Shape Filters – ident: ref9 doi: 10.1109/83.199924 – ident: ref32 doi: 10.1016/0304-3975(94)00262-2 – ident: ref10 doi: 10.1007/978-3-662-03039-4_13 – ident: ref23 doi: 10.1109/VISUAL.2002.1183774 – ident: ref38 doi: 10.1109/TPAMI.2007.1045 – start-page: 472 volume-title: Proc. Int’l Symp. Computer-Assisted Cartography (AUTOCARTO ’85) ident: ref20 article-title: Automated Contour Labeling and the Contour Tree |
| SSID | ssj0014503 |
| Score | 2.2249584 |
| Snippet | Morphological attribute filters have not previously been parallelized, mainly because they are both global and non-separable. We propose a parallel algorithm... |
| SourceID | proquest pubmed pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1800 |
| SubjectTerms | Algorithms Applied sciences Artificial Intelligence Cluster Analysis Computation Computer science; control theory; systems Computer systems and distributed systems. User interface Concurrent computing connected filters Enhancement Parallel algorithms Exact sciences and technology Filtering Filters Fourier transforms Gain Image Enhancement - instrumentation Image Enhancement - methods Image Interpretation, Computer-Assisted - instrumentation Image Interpretation, Computer-Assisted - methods Imaging, Three-Dimensional - instrumentation Imaging, Three-Dimensional - methods Information Storage and Retrieval - methods Intelligence mathematical morphology Microprocessors Morphology Parallel algorithms Parallel machines Parallel processing Pattern analysis Pattern Recognition, Automated - methods Senior members Shape Software Thinning Tree graphs |
| Title | Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines |
| URI | https://ieeexplore.ieee.org/document/4407727 https://www.ncbi.nlm.nih.gov/pubmed/18703832 https://www.proquest.com/docview/862254219 https://www.proquest.com/docview/34400641 https://www.proquest.com/docview/69435107 https://www.proquest.com/docview/875058286 https://www.proquest.com/docview/903627919 |
| Volume | 30 |
| WOSCitedRecordID | wos000258344900010&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 Electronic Library (IEL) customDbUrl: eissn: 1939-3539 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014503 issn: 0162-8828 databaseCode: RIE dateStart: 19790101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1La9tAEB6S0EN7aNKkDzWpu4deClUtySut9mhCTQK18SEF38RqdwSBIBXLLvTfd2b1aAN1oTchjZA0j91vNLvfAHxAZ8hrZRRWBDdCmSY2pBMuNIlmdjNpsfIkrl_VapVvNnp9BJ_GvTCI6Bef4Wc-9LV819g9_yqbSso-aL49hmOlVLdXa6wYyNR3QSYEQxFOacRQkoz09G49X952bIWKyZiZKJTclHKz5NFs5Nur8OJI05J-qq6xxWHk6Wegxen_vfsZPO-Rpph3rvECjrA-h9Ohi4Pog_ocnv1BSXgBq-umth1nk-hkvelEU4n5ruuOhWJxzzX2VtB5JnxGJ5a8YPenWJst92Z5EEu_RhPbl_Bt8eXu-ibsey6ElhLlXZi5NMurWVZWZpaUsSMIVpXKEi6rckXzGJapljaOLKaShvnEksLLqMqzOC5TzPTsFZzUTY1vQMTaOBMZFzPJHtJIoRwBiji3KKXSGgOYDrovbE9Izn0xHgqfmES68IbjRpmq8IYL4ON4x_eOjOMfshdshFGu138Ak0fmHa8nvJmUBv4ALgd7F304twWlfZRI0-AewPvxKsUhF1dMjc2-LWb0AIJ38WGJTBM0pWw7AHFAgnLHiMuY2WERzYhDaX6T150z_tZE79Nv__7ll_A0Gbh84ys42W33-A6e2B-7-3Y7oZDa5BMfUr8AowoaWw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB9qFawPVlu1abXdB18E42Vzm499PIpHi3fHPZzQt5BsJlAoiVzuCv73ndlNooWe4FtIJiSZj93fZHZ_A_AZy5y8VgV-RXDDV1FofDpR-nmomd1MGawsiessWSzSmxu93IOvw14YRLSLz_AbH9paftmYLf8qGynKPmi-fQbPI6VC6XZrDTUDFdk-yIRhKMYpkeiLkoEerZaT-bXjK0yYjpmpQslRKTsLH81HtsEKL4_MW9JQ5Vpb7Maedg6aHv7f27-B1x3WFBPnHG9hD-sjOOz7OIgurI_g1V-khMewuGxq41ibhJO1xhNNJSYb1x8LxfSWq-ytoPNM-YylmPOS3d9ima-5O8udmNtVmti-g5_T76vLK7_ruuAbSpU3flxGcVqN46LKx2EhSwJhVZEYQmZVmtBMhkWklZGBwUjRQB8aUngRVGksZRFhrMfvYb9uajwBIXVe5kFeSqbZQxorkpIghUwNKpVojR6Met1npqMk584Yd5lNTQKdWcNxq8wks4bz4Mtwxy9Hx_EP2WM2wiDX6d-D80fmHa6HvJ2Uhn4Pznp7Z11AtxklfpRK0_DuwcVwlSKRyyt5jc22zcb0AAJ4crdErAmcUr7tgdghQdljwIXMeLeIZsyRaH6TD84Z_2ii8-nTp7_8Al5ereazbHa9-HEGB2HP7Cs_wv5mvcVP8MLcb27b9bkNrAfG_By6 |
| 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=Concurrent+Computation+of+Attribute+Filters+on+Shared+Memory+Parallel+Machines&rft.jtitle=IEEE+transactions+on+pattern+analysis+and+machine+intelligence&rft.au=Wilkinson%2C+M.H.F.&rft.au=Hui+Gao&rft.au=Hesselink%2C+W.H.&rft.au=Jonker%2C+J.-E.&rft.date=2008-10-01&rft.issn=0162-8828&rft.volume=30&rft.issue=10&rft.spage=1800&rft.epage=1813&rft_id=info:doi/10.1109%2FTPAMI.2007.70836&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TPAMI_2007_70836 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0162-8828&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0162-8828&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0162-8828&client=summon |