Task redistribution algorithm for contour extraction

A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution time of tasks is not known in advance, the task scheduling algorithm speculates that a heavily-loaded processor might have more tasks in the n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:10th International Conference on Telecommunications : ICT'2003 : February 23-March 1, 2003, Sofitel Coralia Maeva Beach Hotel, Tahiti, Papeete, French Polynesia Jg. 2; S. 1610 - 1616 vol.2
1. Verfasser: Wakatani, A.
Format: Tagungsbericht
Sprache:Englisch
Japanisch
Veröffentlicht: IEEE 01.01.2003
Schlagworte:
Active contours
Algorithm design and analysis
Image analysis
Image coding
Image segmentation
Load management
Parallel algorithms
Performance analysis
Processor scheduling
Scheduling algorithm
ISBN:0780376617, 9780780376618
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution time of tasks is not known in advance, the task scheduling algorithm speculates that a heavily-loaded processor might have more tasks in the near future and schedules less tasks to the processor than average. Thus, this algorithm keeps the balance of the parallel tasks over processors as fairly as possible and both the empirical and analytical evaluations show that the algorithm provides better performance than the balanced algorithm for the active contour extraction. The optimal scheduling parameter is also described for a special case. The analytical evaluation confirms the effectiveness of the algorithm and the experimental result shows that the algorithm provides up to 10% better performance than the balanced algorithm for the active contour extraction.
AbstractList A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution time of tasks is not known in advance, the task scheduling algorithm speculates that a heavily-loaded processor might have more tasks in the near future and schedules less tasks to the processor than average. Thus, this algorithm keeps the balance of the parallel tasks over processors as fairly as possible and both the empirical and analytical evaluations show that the algorithm provides better performance than the balanced algorithm for the active contour extraction. The optimal scheduling parameter is also described for a special case. The analytical evaluation confirms the effectiveness of the algorithm and the experimental result shows that the algorithm provides up to 10% better performance than the balanced algorithm for the active contour extraction.
Author Wakatani, A.
Author_xml – sequence: 1
  givenname: A.
  surname: Wakatani
  fullname: Wakatani, A.
  organization: Fac. of Sci. & Eng., Konan Univ., Kobe, Japan
BookMark eNotj8tKAzEYhQNa0Na-gG7mBab-mdwmSxmqLQy4Gdcll39qtJ1IkoK-vRV7NocPDh-cObme4oSE3FNYUQr6cdsN637VALAzayqVuCJzUC0wJSVVN2SZ8wecw7QUUt8SPpj8WSX0IZcU7KmEOFXmsI8plPdjNcZUuTiVeEoVfpdk3N_gjsxGc8i4vPSCvD2vh25T968v2-6pr0OjoNS-BW-1ElxYqdCjd7pxjCFrnda0dcI1Eql1njvQY8u9MQygMcAFGm85W5CHf29AxN1XCkeTfnaXY-wXsstGzA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICTEL.2003.1191675
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 1616 vol.2
ExternalDocumentID 1191675
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i270t-d80db97545b67ededc92c33e38c9918c5c26e1bcd4c09f84daa3002a045eadb43
IEDL.DBID RIE
ISBN 0780376617
9780780376618
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000182692000261&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 16:53:59 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i270t-d80db97545b67ededc92c33e38c9918c5c26e1bcd4c09f84daa3002a045eadb43
ParticipantIDs ieee_primary_1191675
PublicationCentury 2000
PublicationDate 2003-01-01
PublicationDateYYYYMMDD 2003-01-01
PublicationDate_xml – month: 01
  year: 2003
  text: 2003-01-01
  day: 01
PublicationDecade 2000
PublicationTitle 10th International Conference on Telecommunications : ICT'2003 : February 23-March 1, 2003, Sofitel Coralia Maeva Beach Hotel, Tahiti, Papeete, French Polynesia
PublicationTitleAbbrev ICTEL
PublicationYear 2003
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000396569
Score 1.3126932
Snippet A dynamic parallel algorithm for the active contour extraction with the varying number of control points has been developed. For the case where the execution...
SourceID ieee
SourceType Publisher
StartPage 1610
SubjectTerms Active contours
Algorithm design and analysis
Image analysis
Image coding
Image segmentation
Load management
Parallel algorithms
Performance analysis
Processor scheduling
Scheduling algorithm
Title Task redistribution algorithm for contour extraction
URI https://ieeexplore.ieee.org/document/1191675
Volume 2
WOSCitedRecordID wos000182692000261&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/eLvHCXMwlV1LTwIxEJ4A8aAXH2B8pwePLtRt6eNMIJoQwgENN7LbzipRgSyLv9-2LKsmXrx1e2i2z_k6ne8bgFuhu1Zr42dA0Ih34yxKZRyoT1RbxUQWtPSeh3I0UtOpHtfgruLCIGIIPsO2L4a3fLs0G-8q63gxMgdw61CXUmy5WpU_hTLtoIkON3NF3bZxprkU2Nl9qx1phurOY2_SHwY50HbZ6q_0KsG6DA7_919H0Pqm6ZFxZYCOoYaLEzj4oTDYBD5J1m8k9-TbKrUVSd5flvm8eP0gDrESH6zuFhRxp3S-ZTm04GnQn_QeojJRQjR3Y1pEVlGbaunAUCokWrRGx4YxZMo4-KdM18QC71NjuaE6U9wmCXMnYeLgnFtIKWen0FgsF3gGxEiHyCwaK7wwu2EpzyhyRMq4xTiz59D0_Z-ttloYs7LrF39XX8J-CH4LLosraBT5Bq9hz3wW83V-EybwCzBdmFY
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VggQsPFrEGw-MpDWxm9hz1YqKUHUIqFuV2BeogBalKb8f200DSCxsjgcrft7n833fAVwHsqOlVHYGAurxjp95aeg76hOVWrAgc1p6T1E4HIrxWI5qcFNxYRDRBZ9hyxbdW76eq6V1lbWtGJkBuBuwaTNnlWytyqNCmTTgRLq7uaBm4xjjXErsrL_FmjZDZXvQjXuREwRtle3-SrDi7Et_739_tg_Nb6IeGVUm6ABqODuE3R8agw3gcbJ4Jbml31bJrUjy9jzPp8XLOzGYldhwdbOkiDmn8xXPoQmP_V7cvfPKVAne1Ixq4WlBdSpDA4fSIESNWklfMYZMKAMAheooP8DbVGmuqMwE10nCzFmYGEBnllLK2RHUZ_MZHgNRocFkGpUOrDS7YinPKHJEyrhGP9Mn0LD9n3ys1DAmZddP_66-gu27-CGaRIPh_RnsuFA458A4h3qRL_ECttRnMV3kl24yvwBUE5uf
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=10th+International+Conference+on+Telecommunications+%3A+ICT%272003+%3A+February+23-March+1%2C+2003%2C+Sofitel+Coralia+Maeva+Beach+Hotel%2C+Tahiti%2C+Papeete%2C+French+Polynesia&rft.atitle=Task+redistribution+algorithm+for+contour+extraction&rft.au=Wakatani%2C+A.&rft.date=2003-01-01&rft.pub=IEEE&rft.isbn=9780780376618&rft.volume=2&rft.spage=1610&rft.epage=1616+vol.2&rft_id=info:doi/10.1109%2FICTEL.2003.1191675&rft.externalDocID=1191675
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780376618/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780376618/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780376618/sc.gif&client=summon&freeimage=true