| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ICSS, IPSJ-SPT | 2023-03-13 17:30 |
Okinawa | Okinawaken Seinenkaikan (Primary: On-site, Secondary: Online) |
Lessons Learned from Construction of the Security Technical Term Dictionary Misato Matsuda, Akira Fujita, Yu Tsuda, piyokango, Daisuke Inoue (NICT)  ICSS2022-65 |
In order to do OSINT, natural language processing technology for processing documents is an important elemental technolo... [more] | ICSS2022-65 pp.103-108 |
| IA, ICSS | 2021-06-22 11:15 |
Online | Online | A Solution for Recovering Missing Links in Network Topology using Sparse Modeling Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-14 ICSS2021-14 |
In recent years, sparse modeling, which is a statistical approach, has been applied to many practical problems mostly in... [more] | IA2021-14 ICSS2021-14 pp.74-79 |
| IA | 2020-10-01 13:15 |
Online | Online | A Study on Recovering Network Topology with Missing Links using Sparse Modeling Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2020-3 |
In recent years, sparse modeling, which is a statistical approach, has been applied to many practical problems mostly in... [more] | IA2020-3 pp.10-13 |
| MI, IE, SIP, BioX, ITE-IST, ITE-ME [detail] | 2020-05-28 10:50 |
Online | Online | [Special Talk]
High-dimensional Signal Restoration by Convolutional Networks Driving Fusion Across Multiple Disciplines
-- Sparse Modeling and Convolutional Dictionary Learning -- Shogo Muramatsu (Niigata Univ.) |
This talk outlines a restoration process of high-dimensional signals such as image and volumetric data. With the develop... [more] | |
| EA, SIP, SP | 2019-03-14 13:30 |
Nagasaki | i+Land nagasaki (Nagasaki-shi) | [Poster Presentation]
MR Image Reconstruction Using Two Types of Dictionaries and the Diagonalization of a BCCB Matrix Kazuma Nakamoto, Kosuke Fujii, Daichi Kitahara, Akira Hirabayashi (Ritsumeikan Univ.) EA2018-112 SIP2018-118 SP2018-74 |
We propose a high-quality MR image reconstruction method using both of an adaptive orthogonal dictionary and a pre-train... [more] | EA2018-112 SIP2018-118 SP2018-74 pp.75-80 |
| PRMU, MI, IE, SIP | 2018-05-18 14:45 |
Gifu | Low-Dose CT Image Reconstruction with Multiclass Dictionary Learning Hiryu Kamoshita, Daichi Kitahara, Akira Hirabayashi (Ritsumeikan Univ.) SIP2018-15 IE2018-15 PRMU2018-15 MI2018-15 |
We propose a high-precision CT image reconstruction method from low-dose X-ray projection data. In conventional reconstr... [more] | SIP2018-15 IE2018-15 PRMU2018-15 MI2018-15 pp.63-68 |
|
| KBSE | 2016-11-03 15:15 |
Nagano | Nagano-Engineering Campus, Shinshu University | Construction of Dictionary for Improving Requirement Descriptions by Differences of Japanese Expressions Yozo Takizawa (NIT, Ibaraki College), Shinpei Ogata, Kozo Okano (Shinshu Univ.) KBSE2016-26 |
It is reported that a construction method and supporting tools for dictionaries needed for improving descriptions to tel... [more] | KBSE2016-26 pp.13-18 |
| IBISML | 2016-03-18 11:05 |
Tokyo | Institute of Statistical Mathematics | Block-sparse Extensions of Recovery Conditions of Overcomplete Dictionaries Yasushi Terazono, Kenji Yamanishi (UTokyo) IBISML2015-101 |
In overcomplete dictionary learning problems, observed data are modeled as products of overcomplete dictionaries and spa... [more] | IBISML2015-101 pp.55-58 |
| COMP, IPSJ-AL | 2015-06-13 14:20 |
Hokkaido | On an Extension of Ukkonen's Online Suffix tree construction algorithm to Multi-Stream texts Takuya Takagi, Hiroki Arimura (Hokkaido Univ.) COMP2015-13 |
In this paper, we consider online construction of a text index for a set $S$ of $K$ strings in the dynamic setting that ... [more] |
COMP2015-13 pp.125-132 |
|
| NLC, IPSJ-NL, SP, IPSJ-SLP, JSAI-SLUD (Joint) [detail] |
2014-12-17 13:50 |
Kanagawa | Tokyo Institute of Technology (Suzukakedai Campus) | Construction of Hotel Review Analyzing System for Helping Hotel Refurbishment Takuma Monden, Koichi Takeuchi (Okayama Univ.) NLC2014-41 |
On the Web, there is an enormous quantity of hotel reviews data.The data can be effective for refurbishing hotel.And so,... [more] | NLC2014-41 pp.99-104 |
| NLC | 2014-06-14 16:50 |
Fukuoka | Kyushu Institute of Technology | Refining the Classification Hierarchy of the Verb Conceptual Dictionary in an Integrated Narrative Generation System Taisuke Akimoto, Takashi Ogata (Iwate Prefectural Univ.) NLC2014-8 |
In our integrated narrative generation system, the verb conceptual dictionary contains semantic information of verb conc... [more] | NLC2014-8 pp.41-46 |
| IBISML | 2014-03-07 11:10 |
Nara | Nara Women's University | Blind Separation of Sparse and Smooth Signals via Approximate Message Passing Algorithm Shigeki Yokoyama, Toshiyuki Tanaka (Kyoto Univ.) IBISML2013-76 |
We consider the problem to recover source signals from noisy mixed ones. This can be described as a matrix reconstructio... [more] | IBISML2013-76 pp.71-78 |
| HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto | Kumamoto-Shintoshin-plaza | Construction of Database for Medical Sign Language Words Keiko Watanabe, Yuji Nagashima (Kogakuin univ.), Hiroyuki Kaneko, Naoto Kato, Taro Miyazaki, Shuichi Umeda, Seiki Inoue, Toshihiro Shimizu, Nobuyuki Hiruma (NHK) |
We have been analyzing a medical sign language words to build a morpheme dictionary. The user is able to replay 3D anim... [more] | |
| NLC | 2012-08-31 14:40 |
Kanagawa | Fuji Xerox | Construction of Descriptive Elements Dictionary Mutsugu Kuboki, Kazuhide Yamamoto (Nagaoka Univ. of Technology) NLC2012-22 |
We present a new dictionary of relation names between theme and sentence. We call the relation name to descriptive elem... [more] | NLC2012-22 pp.67-72 |
| NLC, TL | 2011-10-11 14:50 |
Okayama | Bldg. of Graduate School NST Okayama Univ. | Construction of Verb-Adjectival Verb Dictionary toward Identifying Completion State of Verb's Activity Yasuhiro Ishihara, Koichi Takeuchi (Okayama Univ.) TL2011-38 NLC2011-35 |
In this paper we construct a verb-adjectival verb dictionary to deal with paraphrase relations between verbs and adjecti... [more] | TL2011-38 NLC2011-35 pp.73-78 |
| TL | 2011-02-04 15:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | For the integrative learning of phrase pattern and word meaning on Chinese resultative compound verbs through the construction of online dictionary Kazuko Sunaoka (Waseda Univ), Zhan Weidong (Peking Univ.) TL2010-53 |
As Chinese resultative compound verbs V-R have high productive forces and rich semantic meanings, they are quite effecti... [more] | TL2010-53 pp.43-47 |
| AI | 2010-02-23 11:15 |
Kyoto | Kyoto Univ. Yoshida Campus | Construction of Chinese-Japanese Katakana Bilingual Dictionary based on Wikipedia and its application to Language Grid Masaharu Yoshioka (Hokkaido Univ.) AI2009-37 |
The quality of the machine translation results based on dictionary relies on the quality of the dictionary. However, si... [more] |
AI2009-37 pp.43-46 |
| IT | 2006-07-27 15:00 |
Chiba | Univ. of Tokyo | Data Compression Using Antidictionary for Finite-Alphabet Sources Takahiro Ota (Pit-Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of words of minimal length that never appear in this string. And it is known that the antid... [more] | IT2006-31 pp.37-42 |
| ISEC, SITE, IPSJ-CSEC | 2006-07-21 13:50 |
Okayama | Okayama Univ. | An Efficient Anonymous Password-Authenticated Key Exchange Protocol SeongHan Shin, Kazukuni Kobara (AIST), Hideki Imai (AIST/Chuo Univ.) |
Recently, Viet et al., \cite{VYT05} have proposed an anonymous password-authenticated key exchange (PAKE) protocol agai... [more] |
ISEC2006-54 pp.107-114 |
| IT | 2005-07-22 10:50 |
Osaka | Osaka Prefecture Univ. | Construction Antidictionary of a Binary String Using Suffix Tree Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) |
An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a... [more] | IT2005-43 pp.9-14 |
[Return to Top Page]