| 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 # | |
| SIS | 2024-03-14 14:50 |
Kanagawa | Kanagawa Institute of Technology (Primary: On-site, Secondary: Online) |
Improvement of Detection Accuracy for Detection of Calcification Regions in Dental Panoramic Radiographs Using LVAT Naoki Ikeda, Sei Takano, Mitsuji Muneyasu, Soh Yoshida, Akira Asano (Kansai Univ.), Nanae Dewake, Nobuo Yoshinari (Matsumoto Dental Univ.), Keiichi Uchida (Matsumoto Dental Univ. Hospital)  SIS2023-50 |
Carotid arteries on dental panoramic radiographs may show areas of calcification, a sign of vascular disease. The sudden... [more] | SIS2023-50 pp.27-32 |
| IE, MVE, CQ, IMQ (Joint) [detail] |
2024-03-14 15:20 |
Okinawa | Okinawa Sangyo Shien Center (Primary: On-site, Secondary: Online) |
Efficient regularizer for 4D light field image denoising based on graph-learning Rino Yoshida (TUS), Kazuya Kodama (NII), Gene Cheung (York Univ.), Takayuki Hamamoto (TUS) IMQ2023-56 IE2023-111 MVE2023-85 |
Advanced 3D visual media as promising technology often require 4D light fields composed of dense multi-view images for a... [more] | IMQ2023-56 IE2023-111 MVE2023-85 pp.235-240 |
| ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2024-02-20 12:45 |
Hokkaido | Hokkaido Univ. | 3D CG Coded Image Noise Removal and Quality Assessment Based on Optimal Design of Total Variation Regularization Norifumi Kawabata (Kanazawa Gakuin Univ.) ITS2023-67 IE2023-56 |
Sparse coding techniques, which reproduce and represent images with as few combinations as possible from a small amount ... [more] | ITS2023-67 IE2023-56 pp.112-117 |
| NLP, CAS | 2023-10-07 13:00 |
Gifu | Work plaza Gifu | An algorithm for finding regular graphs that maximize algebraic connectivity under a specified number of vertices and degree Masashi Kurahashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2023-54 NLP2023-53 |
Algebraic connectivity is a measure of network robustness, and defined by the second smallest eigenvalue of the Laplacia... [more] | CAS2023-54 NLP2023-53 pp.106-110 |
| SIS | 2022-12-05 15:10 |
Osaka | (Primary: On-site, Secondary: Online) |
Application of Adversarial Training in Detection of Calcification Regions from Dental Panoramic Radiographs Sei Takano, Mitsuji Muneyasu, Soh Yoshida, Akira Asano (Kansai Univ.), Keiichi Uchida (Matsumoto Dental Univ. Hospital) SIS2022-28 |
Calcification regions that are a sign of vascular diseases may be observed on dental panoramic radiographs. The finding ... [more] | SIS2022-28 pp.26-31 |
| LOIS, ICM | 2022-01-28 10:00 |
Online | Online | An Objective Article Search Method from Printed Japanese Contract Document Using Optical Character Recognition Shixi Chen, Masaki Sakagami, Nobuo Funabiki (Okayama Univ.), Takashi Toshida, Kohei Suga (Astrolab) ICM2021-39 LOIS2021-37 |
A contract is essential for the involved companies to have successful businesses among them. Then, the contract document... [more] | ICM2021-39 LOIS2021-37 pp.34-39 |
| IN, IA (Joint) |
2021-12-17 12:40 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
A Study on First Passage Time and Cover Time of Non-backtracking Random Walk on a Graph Tetsuya Kawagishi, Jo Hagikura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-41 |
Recently, mathematical properties of random walks on a graph have been studied. Also, several extended models of a simp... [more] |
IA2021-41 pp.56-59 |
| COMP | 2021-03-08 16:30 |
Online | Online | On the Existence of 4-regular Uniquely Hamiltonian Graphs Ryota Sakamoto (UEC Tokyo) COMP2020-36 |
In 1946, Smith showed that a Hamiltonian cubic graph contains at least three Hamiltonian cycles. Then, a lot of research... [more] | COMP2020-36 pp.46-50 |
| NLP | 2020-05-15 13:00 |
Online | Online | A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3 |
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] | NLP2020-3 pp.11-16 |
| COMP | 2019-03-18 11:45 |
Tokyo | The University of Tokyo | [Invited Talk]
The Diameter of Dense Random Regular Graphs Nobutaka Shimizu (Univ. Tokyo/RIKEN AIP) COMP2018-48 |
For fixed $n$ and $d$, we consider a graph with minimum diameter among all $d$-regular graphs on $n$ vertices. This p... [more] |
COMP2018-48 p.41 |
| PRMU, MI, IE, SIP | 2018-05-17 15:15 |
Gifu | On OCT Volumetric Data Restoration via Hierarchical Sparsity and Hard Constraint Shogo Muramatsu, Satoshi Nagayama, Samuel Choi (Niigata Univ.), Shunsuke Ono (Tokyo Institute of Tech.), Takeru Ota, Fumiaki Nin, Hiroshi Hibino (Niigata Univ.) SIP2018-3 IE2018-3 PRMU2018-3 MI2018-3 |
This work proposes a novel restoration method for optical coherence tomography (OCT) data. OCT is a measurement techniqu... [more] | SIP2018-3 IE2018-3 PRMU2018-3 MI2018-3 pp.7-12 |
|
| MBE, NC, NLP (Joint) |
2018-01-26 13:25 |
Fukuoka | Kyushu Institute of Technology | Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP2017-90 |
The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length o... [more] | NLP2017-90 pp.23-28 |
| IBISML | 2016-11-16 15:00 |
Kyoto | Kyoto Univ. | Structural Change Detection in Lithography Systems Yosuke Otsubo (NIKON), Masashi Sugiyama (RIKEN/UTokyo) IBISML2016-45 |
A lithography system, which consists of various mechanical units such as high-precision optical systems, prints circuit ... [more] | IBISML2016-45 pp.1-8 |
| NLP | 2015-03-03 13:25 |
Hyogo | Hyogo Prefecture Citizens' Hall | Methods of Generating Regular Graphs with Short Average Path Length Keisuke Fujita, Norikazu Takahashi (Okayama Univ.) NLP2014-144 |
The problem of finding a regular graph with given number of vertices and given degree that minimizes the average path le... [more] | NLP2014-144 pp.7-12 |
| NLP | 2014-05-26 15:25 |
Shimane | Big Heart IZUMO | A 2-switch-based method for searching algebraic connectivity maximizing graphs and its application to 3-regular graphs Takuro Fujihara, Norikazu Takahashi (Okayama Univ.) NLP2014-4 |
How to reach a consensus is an important problem in multiagent networks. In a representative consensus protocol proposed... [more] | NLP2014-4 pp.19-24 |
| MI | 2013-01-25 15:45 |
Okinawa | Bunka Tenbusu Kan | Row-Action Type Image Reconstruction Method for Total Variation Regularization Hirotaka Oomori, Hiroyuki Kudo, Taizo Suzuki (Univ of Tsukuba) MI2012-123 |
In X-ray computed tomography(CT), image reconstruction method from incomplete projection data is a well-known ill-posed ... [more] | MI2012-123 pp.317-321 |
| IBISML | 2011-11-09 15:45 |
Nara | Nara Womens Univ. | Learning a Graphical Structure with Clusters Satoshi Hara, Takashi Washio (Osaka Univ.) IBISML2011-45 |
In this paper, we propose an estimation technique of a graphical model with some unknown clusters. We introduce a new re... [more] | IBISML2011-45 pp.19-24 |
| IBISML | 2011-03-29 12:00 |
Osaka | Nakanoshima Center, Osaka Univ. | Learning an Invariant Substructure of Multiple Graphical Gaussian Models Satoshi Hara, Takashi Washio (Osaka Univ.) IBISML2010-129 |
Dependency structure among variables is closely tied to an underlying data generating process. Therefore, learning a dep... [more] | IBISML2010-129 pp.177-181 |
| OCS, CS (Joint) |
2011-01-27 16:05 |
Tokushima | The University of Tokushima | A demonstration of immunity against correlation attacks on quantum stream cipher by the Yuen 2000 protocol Kentaro Kato (Tamagawa Univ.) OCS2010-106 |
The Yuen 2000 protocol provides a data encryption system for optical fiber networks, based on physical and cryptographic... [more] | OCS2010-106 pp.43-48 |
| IT | 2009-07-23 13:55 |
Osaka | Kwansei Gakuin Univ. (Umeda campus) | Effective Methods of Constructing Irregular LDPC Codes under Message-Passing Decoding and Updating Order for Sequential Decoding Yuki Taniguchi, Gou Hosoya, Masayuki Goto, Shigeichi Hirasawa (Waseda Univ.) IT2009-11 |
The performance of a combination of the irregular low-density parity-check (LDPC) codes and the belief-propagation (BP) ... [more] | IT2009-11 pp.31-36 |
[Return to Top Page]