| 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 # | |
| IT | 2023-08-04 09:55 |
Kanagawa | Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
New Algorithms for Computing Arimoto-Sibson Capacity Yuki Ishikawa, Akira Kamatsuka (SIT), Koki Kazama (Waseda Univ.)  IT2023-22 |
Arimoto's alternating optimization algorithm (Arimoto--Blahut algorithm) has been proposed as an algorithm for calculati... [more] | IT2023-22 pp.44-49 |
| IT | 2023-08-04 10:20 |
Kanagawa | Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Hölder's Reverse Inequality and Its Application to Computation of Lapidoth--Pfister Mutual Information Akira Kamatsuka (SIT), Koki Kazama (Waseda Univ.) IT2023-23 |
The H"{o}lder's inequality, a fundamental theoretical inequality, is employed to examine the characteristics of the reli... [more] | IT2023-23 pp.50-55 |
| NLP, MSS | 2023-03-17 14:50 |
Nagasaki | (Primary: On-site, Secondary: Online) |
Reformulation of Optimization Problem in Randomized NMF and Proposal of A Novel Iterative Update Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2022-105 NLP2022-150 |
As an approach to efficiently perform large-scale Nonnegative Matrix Factorization (NMF), a randomized NMF was recently ... [more] | MSS2022-105 NLP2022-150 pp.204-209 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2021-06-28 14:15 |
Online | Online | Modification of Optimization Problem in Randomized NMF and Design of Optimization Method based on HALS Algorithm Takao Masuda, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-4 IBISML2021-4 |
Nonnegative matrix factorization (NMF) is the process of decomposing a given nonnegative matrix into two nonnegative fac... [more] | NC2021-4 IBISML2021-4 pp.23-30 |
| EA, US, SP, SIP, IPSJ-SLP [detail] | 2021-03-03 10:00 |
Online | Online | A Constrained Alternating Minimization Approach to End-to-End Graph Signal Denoising Eisuke Yamagata, Shunsuke Ono (Titech) EA2020-59 SIP2020-90 SP2020-24 |
This paper proposes a denoising method for smooth graph signals observed on a graph of unknown topology. The proposed me... [more] | EA2020-59 SIP2020-90 SP2020-24 pp.1-4 |
| IT, SIP, RCS | 2017-01-20 10:50 |
Osaka | Osaka City Univ. | A New Iterative Method for Nonnegative Matrix Factorization with Sparsity and Smoothness and Its Global Convergence Takumi Kimura, Norikazu Takahashi (Okayama Univ.) IT2016-93 SIP2016-131 RCS2016-283 |
Nonnegative Matrix Factorization (NMF) is an operation that decomposes a given nonnegative matrix into two nonnegative f... [more] | IT2016-93 SIP2016-131 RCS2016-283 pp.273-278 |
| IBISML | 2012-11-07 15:30 |
Tokyo | Bunkyo School Building, Tokyo Campus, Tsukuba Univ. | Structure Learning for Anomaly Localization Satoshi Hara, Takashi Washio (Osaka Univ.) IBISML2012-36 |
In this paper, we propose a graphical model learning algorithm for an anomaly localization. We introduce a new regulariz... [more] | IBISML2012-36 pp.17-22 |
| CAS, CS, SIP | 2012-03-08 14:10 |
Niigata | The University of Niigata | Three variants of alternating direction method of multipliers without certain inner iterations and their application to image super-resolution via sparse representation Masao Yamagishi, Shunsuke Ono, Isao Yamada (Tokyo Inst. of Tech.) CAS2011-115 SIP2011-135 CS2011-107 |
We propose three variants of Alternating Direction Method of Multipliers (ADMM) employing simplified updates under addit... [more] | CAS2011-115 SIP2011-135 CS2011-107 pp.49-54 |
| SIP, RCS | 2011-01-20 15:20 |
Kagoshima | Generalizing the multiple measurement setting from sparse vector recovery to low-rank matrix recovery Silvia Gandy, Isao Yamada (Tokyo Inst. of Tech.) SIP2010-92 RCS2010-222 |
We discuss a novel multiple measurement setting for low-rank matrix recovery in analogy to the approach taken in the spa... [more] | SIP2010-92 RCS2010-222 pp.137-142 |
|
[Return to Top Page]