Investigating execution-characteristics of feature-detection algorithms
We discuss how to obtain information of execution characteristics, such as parallelizability and memory utilization, with the final aim to improve the performance and predictability of feature and corner detection algorithms for use in e.g. robotics and autonomous machines. Our aim is to obtain a be...
Uloženo v:
| Vydáno v: | 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) Ročník Part F134116; s. 1 - 4 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.01.2017
|
| Témata: | |
| ISSN: | 1946-0740, 1946-0759, 1946-0759 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We discuss how to obtain information of execution characteristics, such as parallelizability and memory utilization, with the final aim to improve the performance and predictability of feature and corner detection algorithms for use in e.g. robotics and autonomous machines. Our aim is to obtain a better understanding of how computer vision algorithms use hardware resources and how to improve the time predictability and execution time of such algorithms when executing on multi-core CPUs. We evaluate a fork-join model applicable to feature detection algorithms and present a method for measuring how well the algorithm performance correlates with hardware resource usage. We have applied our method to the Featured from Accelerated Segment Test (FAST) algorithm. Our characterization of FAST reveals that it is an algorithm with excellent parallelism opportunities, resulting in an almost linear speed-up per core. Our measurements also reveal that the performance of FAST correlates very little with the number of misses in the L1 data cache, L1 instruction cache, data translation lookaside buffer and L2 cache. Thus, the FAST algorithm will not have a negative effect on the execution time when the input data fits in the L2 cache. |
|---|---|
| AbstractList | We discuss how to obtain information of execution characteristics, such as parallelizability and memory utilization, with the final aim to improve the performance and predictability of feature and corner detection algorithms for use in e.g. robotics and autonomous machines. Our aim is to obtain a better understanding of how computer vision algorithms use hardware resources and how to improve the time predictability and execution time of such algorithms when executing on multi-core CPUs. We evaluate a fork-join model applicable to feature detection algorithms and present a method for measuring how well the algorithm performance correlates with hardware resource usage. We have applied our method to the Featured from Accelerated Segment Test (FAST) algorithm. Our characterization of FAST reveals that it is an algorithm with excellent parallelism opportunities, resulting in an almost linear speed-up per core. Our measurements also reveal that the performance of FAST correlates very little with the number of misses in the L1 data cache, L1 instruction cache, data translation lookaside buffer and L2 cache. Thus, the FAST algorithm will not have a negative effect on the execution time when the input data fits in the L2 cache. We discuss how to obtain information of execution characteristics, such as parallelizability and memory utilization, with the final aim to improve the performance and predictability of feature and corner detection algorithms for use in e.g. robotics and autonomous machines. Our aim is to obtain a better understanding of how computer vision algorithms use hardware resources and how to improve the time predictability and execution time of such algorithms when executing on multi-core CPUs. We evaluate a fork-join model applicable to feature detection algorithms and present a method for measuring how well the algorithm performance correlates with hardware resource usage. We have applied our method to the Featured from Accelerated Segment Test (FAST) algorithm. Our characterization of FAST reveals that it is an algorithm with excellent parallelism opportunities, resulting in an almost linear speed-up per core. Our measurements also reveal that the performance of FAST correlates very little with the number number of misses in the L1 data cache, L1 instruction cache, data translation lookaside buffer and L2 cache. Thus, the FAST algorithm will not have a negative effect on the execution time when the input data fits in the L2 cache. |
| Author | Behnam, Moris Sjodin, Mikael Danielsson, Jakob Jagemar, Marcus |
| Author_xml | – sequence: 1 givenname: Jakob surname: Danielsson fullname: Danielsson, Jakob email: jakob.danielsson@mdh.se organization: Malardalen Univ., Vasteras, Sweden – sequence: 2 givenname: Marcus surname: Jagemar fullname: Jagemar, Marcus organization: Ericsson AB, Stockholm, Sweden – sequence: 3 givenname: Moris surname: Behnam fullname: Behnam, Moris organization: Malardalen Univ., Vasteras, Sweden – sequence: 4 givenname: Mikael surname: Sjodin fullname: Sjodin, Mikael organization: Malardalen Univ., Vasteras, Sweden |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38918$$DView record from Swedish Publication Index (Mälardalens högskola) |
| BookMark | eNo9kMtuwjAURN2KSqWUD6i6yQc09NpJ_FgiChQJqRvabeTYN8EVJMg2ffx9U4FYzUhzNNLMHRm0XYuEPFCYUArqeb5ZTCcMqJhIlgtRyCsyVkLSAhTwAgp1TYZU5TwFUajBxedwS8YhfAJA38JVpoZkuWq_METX6OjaJsEfNMfoujY1W-21iehdn5qQdHVSo45Hj6nFiOYfSvSu6byL2324Jze13gUcn3VE3hfzzew1Xb8tV7PpOnWMspiiEEiV0QwMg8pohH6B5FZnlaVG5wK1lKziUAvIaGXzmlprgYvc1Mihykbk6dQbvvFwrMqDd3vtf8tOu_LFfUzLzjfl3m7LTCoqe_zxhDtEvMDn17I_Icdidg |
| ContentType | Conference Proceeding Journal Article |
| DBID | 6IE 6IL CBEJK RIE RIL ADTPV AOWAS DF7 |
| DOI | 10.1109/ETFA.2017.8247758 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present SwePub SwePub Articles SWEPUB Mälardalens högskola |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781509065059 1509065059 |
| EISSN | 1946-0759 |
| EndPage | 4 |
| ExternalDocumentID | oai_DiVA_org_mdh_38918 8247758 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK OCL RIE RIL ADTPV ADZIZ AOWAS CHZPO DF7 IPLJI M43 RNS |
| ID | FETCH-LOGICAL-i212t-e77e19ca20c20bcae082486da3bd1ca47ea882b60f7031bd4f1ddd0674cfe60b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000427812000193&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1946-0740 1946-0759 |
| IngestDate | Tue Nov 04 16:18:24 EST 2025 Wed Aug 27 02:41:14 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i212t-e77e19ca20c20bcae082486da3bd1ca47ea882b60f7031bd4f1ddd0674cfe60b3 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_8247758 swepub_primary_oai_DiVA_org_mdh_38918 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-01-01 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – month: 01 year: 2017 text: 2017-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA) |
| PublicationTitleAbbrev | ETFA |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001096939 ssj0001968306 |
| Score | 2.043778 |
| Snippet | We discuss how to obtain information of execution characteristics, such as parallelizability and memory utilization, with the final aim to improve the... |
| SourceID | swepub ieee |
| SourceType | Open Access Repository Publisher |
| StartPage | 1 |
| SubjectTerms | Detection algorithms Feature extraction Hardware Monitoring Prediction algorithms Velocity measurement |
| Title | Investigating execution-characteristics of feature-detection algorithms |
| URI | https://ieeexplore.ieee.org/document/8247758 https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38918 |
| Volume | Part F134116 |
| WOSCitedRecordID | wos000427812000193&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LT8JAEMc3QDzoxQcY8ZUe9OZCC9vd9kgU9EQ4oOHW7GMWaqQ1UIwf391tg2i8mPTQZNOmmWnyn8zjNwjdGE0iXMchNmqlMempAEdaKByG3KibFiETwi2bYONxNJvFkxq6287CAIBrPoOOvXW1fJXLjU2VdaMeYSa-raM6Y7Sc1frOp5hYPK4Il68l9iUy4XBVyDSn3eF0NLC9XKxTvadaqPILEuqEZXT4v086Qq3vCT1vstWeY1SD7AQd7MAFm-hxB6GRzT34BOl-Mix_Mpq9XHsaHN8TKyhca1bm8bd5vkqLxXLdQs-j4fT-CVdrE3BqdKjAwBgEseQ9X_Z8ITkYlScRVbwvVCA5YcBNWC2ory27XiiiA6WUUS0iNVBf9E9RI8szOEMes3B5IgNuXE2oojwWFHSoo0jH5qJt1LQmSd5LMkZSWaONbkuLbg8sxPohfRkkxnjJUi0SWx6Nzv9-_ALtWzeViY5L1ChWG7hCe_KjSNera-f2Ly4br_U |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1JS8QwFMcfbqBeXEZxXHvQm9G2pk16FHVU1MHDKHMrWV5mRrQjM1X8-CZpGRe8CD0UQkp5Cfwfb_k9gH2rSVSYLCFWrQyhsY4IN1KTJBFW3YxMmJR-2ARrt3m3m91PweGkFwYRffEZHrlXn8vXQ_XmQmXHPKbM-rfTMJtQGodVt9ZXRMV641nNuHyqwC_cOsR1KtOuHl90Wqeumosd1V-qR6r8woR6aWkt_e-nlmHtq0cvuJ-ozwpMYbEKi9_wgg24_AbRKHoBfqDy14yon5TmYGgCg57wSTSWvjirCMRzbzgalP2X8Ro8tC46Z1ekHpxABlaJSoKMYZQpEYcqDqUSaHWe8lSLE6kjJShDYR1rmYbG0eulpibSWlvdospgGsqTdZgphgVuQMAcXp6qSNjDpqlORSZTNInh3GT2SZvQcCbJXys2Rl5bowkHlUUnCw5jfT54PM2t8fIX3c9dgpRv_r19D-avOne3-e11-2YLFtyRVWGPbZgpR2-4A3PqvRyMR7v-CnwCfzmzPA |
| 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%3Abook&rft.genre=proceeding&rft.title=2017+22nd+IEEE+International+Conference+on+Emerging+Technologies+and+Factory+Automation+%28ETFA%29&rft.atitle=Investigating+execution-characteristics+of+feature-detection+algorithms&rft.au=Danielsson%2C+Jakob&rft.au=Jagemar%2C+Marcus&rft.au=Behnam%2C+Moris&rft.au=Sjodin%2C+Mikael&rft.date=2017-01-01&rft.pub=IEEE&rft.eissn=1946-0759&rft.spage=1&rft.epage=4&rft_id=info:doi/10.1109%2FETFA.2017.8247758&rft.externalDocID=8247758 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1946-0740&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1946-0740&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1946-0740&client=summon |