A new frame-based registration algorithm

被引:0
|
作者
Department of Electrical Engineering, Stanford University, Stanford, CA 94305, United States [1 ]
不详 [2 ]
不详 [3 ]
不详 [4 ]
不详 [5 ]
机构
来源
Med. Phys. | / 1卷 / 121-128期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] A new frame-based registration algorithm
    Yan, CH
    Whalen, RT
    Beaupre, GS
    Sumanaweera, TS
    Yen, SY
    Napel, S
    MEDICAL PHYSICS, 1998, 25 (01) : 121 - 128
  • [2] An efficient algorithm for frame-based signal processing
    Wan, Y
    Nowak, RD
    2002 45TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL III, CONFERENCE PROCEEDINGS, 2002, : 243 - 246
  • [3] Intraoperative Computed Tomography for Registration of Stereotactic Frame in Frame-Based Deep Brain Stimulation
    Jones, Michael R.
    Baskaran, Archit B.
    Nolt, Mark J.
    Rosenow, Joshua M.
    OPERATIVE NEUROSURGERY, 2021, 20 (03) : E186 - E189
  • [4] Intraoperative Computed Tomography for Registration of Stereotactic Frame in Frame-Based Deep Brain Stimulation
    Jones, Michael R.
    Baskaran, Archit B.
    Nolt, Mark J.
    Rosenow, Joshua M.
    NEUROSURGERY, 2021, 89 : S163 - S163
  • [5] An Efficient training algorithm for frame-based phoneme classification
    Pfeifer, Vaclav
    Muller, Jakub
    Vrba, Kamil
    12TH INTERNATIONAL CONFERENCE ON RESEARCH IN TELECOMMUNICATION TECHNOLOGIES (RTT 2010), 2010, : 203 - 208
  • [7] Stereotactic body frame (frame-based)
    Wulf, J.
    RADIOTHERAPY AND ONCOLOGY, 2007, 84 : S12 - S13
  • [8] Frame-based fast sorting scheduling algorithm for packet networks
    Wang, WJ
    Wei, G
    ELECTRONICS LETTERS, 2001, 37 (02) : 83 - 85
  • [9] Fair and efficient frame-based scheduling algorithm for multimedia networks
    Al-Khasib, T
    Alnuweiri, H
    Fattah, H
    Leung, VCM
    10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2005, : 597 - 603
  • [10] An efficient frame-based scheduling algorithm: Credit Round Robin
    Do, VL
    Yun, KY
    HPSR 2003: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2003, : 103 - 110