ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 学会発表・講演等
  2. 口頭発表

Scan path algorithm for SFUD fields delivered by raster scanned charged particles beams

https://repo.qst.go.jp/records/64332
https://repo.qst.go.jp/records/64332
fc77dcec-6ea0-4e7b-9594-31afd48e965e
Item type 会議発表用資料 / Presentation(1)
公開日 2011-10-03
タイトル
タイトル Scan path algorithm for SFUD fields delivered by raster scanned charged particles beams
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_c94f
資源タイプ conference object
アクセス権
アクセス権 metadata only access
アクセス権URI http://purl.org/coar/access_right/c_14cb
著者 Marius, Zenklusen Silvan

× Marius, Zenklusen Silvan

WEKO 634282

Marius, Zenklusen Silvan

Search repository
Mori, Shinichiro

× Mori, Shinichiro

WEKO 634283

Mori, Shinichiro

Search repository
Zenklusen Silvan Marius

× Zenklusen Silvan Marius

WEKO 634284

en Zenklusen Silvan Marius

Search repository
森 慎一郎

× 森 慎一郎

WEKO 634285

en 森 慎一郎

Search repository
抄録
内容記述タイプ Abstract
内容記述 Purpose: Scanning on an optimal path is important for raster scanning since the beam is not turned off in between two spots. The beam trajectory should stay within the tumor contours in order to minimize dose to the surrounding tissue. Typically this traveling salesman problem (TSP) is solved by optimization, though the optimization can be rather slow and it is often difficult to guarantee that the trajectory stays within the tumor contours.
Methods: A heuristic algorithm based on a decision tree and segmentation was developed to find almost ideal scan paths through the spot maps and tested on a lung case.
Results: The algorithm was bench-marked on the delivered scan trajectory and the computational time. The trajectory for the solvable cases was very similar to the one obtained with a classical TSP solver. The scan time was calculated and found to be acceptably short. Depending on the number of spots per energy layer the computational time could be lowered up to three orders of magnitude.
Conclusions: The developed algorithm showed to be robust, reliable and fast, though clinical cases exist, for example in the head and neck region, where our algorithm cannot be applied and a TSP optimization is required.
会議概要(会議名, 開催地, 会期, 主催者等)
内容記述タイプ Other
内容記述 6th Japan-Korea Joint Meeting on Medical Physics (JKMP) and 11th Asia-Oceania Congress of Medical Physics (AOCMP)
発表年月日
日付 2011-10-01
日付タイプ Issued
戻る
0
views
See details
Views

Versions

Ver.1 2023-05-15 21:12:49.006120
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3