|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MI |
2019-01-23 10:55 |
Okinawa |
|
Semi-Automated Segmentation of Rotator Cuff in MR Images with Statistical Shape Model Kazuki Ishiro, Kento Morita, Manabu Nii (Univ. of Hyogo), Tomoyuki Muto, Hiroshi Tanaka, Hiroaki Inui (Nobuhara Hospital), Syoji Kobashi (Univ. of Hyogo), Katsuya Nobuhara (Nobuhara Hospital) MI2018-91 |
A surgical method to repair rotator cuff tear is decided by a tear form. To diagnose the tear form, we previously propos... [more] |
MI2018-91 pp.131-136 |
SIP, EA, SP, MI (Joint) [detail] |
2018-03-20 11:10 |
Okinawa |
|
3-Dimensional Humerus Statistical Shape Model for Making Artificial Shoulder Joint Design Yuki Kubo, Kazuki Ishiro, Kento Morita, Manabu Nii (Univ. of Hyogo), Tomoyuki Muto, Hiroshi Tanaka, Hiroaki Inui (Nobuhara Hospital), Syoji Kobashi (Univ. of Hyogo), Katsuya Nobuhara (Nobuhara Hospital) MI2017-91 |
Currently, the humeral head portion of the artificial shoulder joint is mostly designed to approximate a sphere or ellip... [more] |
MI2017-91 pp.93-98 |
AP |
2011-08-02 14:05 |
Akita |
|
Study of Bistatic Radar using EBG Structure Tomoyuki Muto, Takuji Arima, Toru Uno (TUAT) AP2011-51 |
The bistatic radars consist of transmitting antenna and receiving antenna. There antennas are placed side by side. Howev... [more] |
AP2011-51 pp.13-17 |
PRMU, DE |
2011-06-07 14:00 |
Kanagawa |
|
Duplicate Registration of Data in Approximate Nearest Neighbor Masakazu Iwamura, Tomoyuki Muto, Koichi Kise (Osaka Prefecture Univ.) DE2011-20 PRMU2011-51 |
We propose a new method based on duplicate registration of data
in approximate nearest neighbor problem.
In the experi... [more] |
DE2011-20 PRMU2011-51 pp.111-116 |
PRMU, SP, MVE, CQ |
2010-01-21 13:10 |
Kyoto |
Kyoto Univ. |
Derivation of Theoretical Formulae of Accuracy and Memory Amount on Accessing Neighboring Buckets in Hash-Based Approximate Nearest Neighbor Search Tomoyuki Muto, Masashi Tada, Masakazu Iwamura, Koichi Kise (Osaka Prefecture Univ.) CQ2009-71 PRMU2009-170 SP2009-111 MVE2009-93 |
Approximate nearest neighbor search is a technique which greatly
reduces processing time and required amount of memory ... [more] |
CQ2009-71 PRMU2009-170 SP2009-111 MVE2009-93 pp.109-114 |
PRMU |
2009-11-27 09:30 |
Ishikawa |
Ishikawa Industrial Promotion Center |
Approximate Nearest Neighbor Search Based on a Multi-Valued Expression of Closeness Masashi Tada, Tomoyuki Muto, Masakazu Iwamura, Koichi Kise (Osaka Pref. Univ.) PRMU2009-110 |
Approximate nearest neighbor search is a technique which greatly
reduces processing time and required amount of memory
... [more] |
PRMU2009-110 pp.121-126 |
PRMU |
2009-06-19 10:20 |
Hokkaido |
Hokkaido Univ. |
Efficient Approximate Nearest Neighbor Search Based on Accessing Neighboring Buckets Tomoyuki Muto, Masashi Tada, Masakazu Iwamura, Koichi Kise (Osaka Pref. Univ.) PRMU2009-53 |
[more] |
PRMU2009-53 pp.83-88 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|