| 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 # | |
| SIP, CAS, CS | 2010-03-02 13:45 |
Okinawa | Hotel Breeze Bay Marina, Miyakojima | [Poster Presentation]
The study on shadow removal in transferred domain GMM foreground segmentation Kazuki Nakagami, Takao Nishitani (Tokyo Metro Univ.)  CAS2009-122 SIP2009-167 CS2009-117 |
Novel shadow removal method is proposed. Although there are many foreground segmentation algorithms, these methods have ... [more] | CAS2009-122 SIP2009-167 CS2009-117 pp.241-242 |
| COMP | 2010-01-25 16:10 |
Fukuoka | Nishijin Plaza, Kyushu University | Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2009-47 |
A unate gate is a logical gate computing a unate Boolean function. Examples of unate gates are AND-gates, OR-gates, NO... [more] |
COMP2009-47 pp.57-64 |
| COMP | 2009-10-16 10:35 |
Miyagi | Tohoku University | Small Grid Drawings of Planar Graphs with Balanced Bipartition Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33 |
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] | COMP2009-33 pp.9-15 |
| COMP | 2009-04-17 13:30 |
Kyoto | Kyoto Univ. | Energy Complexity and Depth of Threshold Circuits Kei Uchizawa, Takao Nishizeki (Tohoku Univ.) COMP2009-4 |
Suppose that a Boolean function $f$ can be computed by a threshold circuit $C$ of energy complexity $e$. Thus, at most... [more] |
COMP2009-4 pp.21-28 |
| COMP | 2008-10-10 14:30 |
Miyagi | Tohoku Univ. | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size Takehiro Ito (Tohoku Univ.), Takeaki Uno (NII), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) COMP2008-41 |
Assume that each vertex of a graph $G$ is assigned a nonnegative integer weight and that $l$ and $u$ are integers such t... [more] | COMP2008-41 pp.55-61 |
| COMP | 2008-10-10 15:15 |
Miyagi | Tohoku Univ. | Size-Energy Tradeoff for Threshold Logic Circuits Computing MOD Functions Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2008-42 |
A threshold logic circuit $C$ computing a Boolean function MOD$_m: \{ 0，1\}^n \to \{0, 1\}$ outputs ``0'' if the number ... [more] | COMP2008-42 pp.63-69 |
| CS, SIP, CAS | 2008-03-07 11:15 |
Yamaguchi | Yamaguchi University | On the Minimization of AND-EXOR Expressions for Multiple-Valued Two-Input Logical Functions Hitoshi Tsubata, Takaaki Mizuki, Takao Nishizeki (Tohoku Univ.) CAS2007-135 SIP2007-210 CS2007-100 |
There are a lot of algorithms to simplify or minimize AND-EXOR expressions, called ESOP (Exclusive-OR Sum-of-Products)... [more] |
CAS2007-135 SIP2007-210 CS2007-100 pp.59-63 |
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
On a parallel architecture towards TOPS DSP built by a first-generation DSP Bin Wu, Takao Nishitani, Hiroshi Suzuki, Hachiro Fujita (Tokyo Metro. Univ.) CAS2007-148 SIP2007-223 CS2007-113 |
This paper describes the advantage of super-parallel DSP architecture [1],[2] and its implementation by FPGA. High speed... [more] | CAS2007-148 SIP2007-223 CS2007-113 pp.103-104 |
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
Development of Support System for ASICs Design from Algorithms Koichi Mori (Tokyo Metropolitan Univ.), Yuichi Nakamura (NEC), Takao Nishitani (Tokyo Metropolitan Univ.) CAS2007-149 SIP2007-224 CS2007-114 |
[more] | CAS2007-149 SIP2007-224 CS2007-114 pp.105-106 |
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
Foreground Segmentation Using Gaussian Mixture Model for Pan-Tilt Camera Tomoyuki Suzuki, Hiroaki Tezuka, Takao Nishitani (Tokyo Metropolitan Univ.) CAS2007-152 SIP2007-227 CS2007-117 |
This paper describes foreground segmentation approach for a Pan-Tilt Camera. The approach expands Gaussian mixture model... [more] | CAS2007-152 SIP2007-227 CS2007-117 pp.119-120 |
| CS, SIP, CAS | 2008-03-07 13:00 |
Yamaguchi | Yamaguchi University | [Poster Presentation]
A study on crosing object detection by using Walsh spectrums feature parameters Tomoko Takahashi, Hiroaki Tezuka, Takao Nishitani (Tokyo Metropolitan Univ.) CAS2007-153 SIP2007-228 CS2007-118 |
[more] | CAS2007-153 SIP2007-228 CS2007-118 pp.121-122 |
| RCS, SIP | 2008-01-24 14:20 |
Hiroshima | Hiroshima City Uni. | A study on Retransmission of terrestrial Digital TV through WINDS satellite Tomohiro Kitagawa, Takao Nishitani (TMU), Hiroaki Komatsu (KUT), Hironori Kato, Norishige Omoto (JAMSS) SIP2007-148 RCS2007-151 |
This paper describes retransmission of the terrestrial digital broadcasting through WINDS multi-beam satellite. The stud... [more] | SIP2007-148 RCS2007-151 pp.103-108 |
| SIP, ICD, IE, IPSJ-SLDM (Joint) [detail] |
2007-10-25 16:00 |
Fukushima | Aidu-Higasiyama-Onsen Kuturogijuku | Study on a TOPS scale DSP Hiroshi Suzuki, Takao Nishitani, Wu Bin, Hachiro Fujita (TMU) SIP2007-119 ICD2007-108 IE2007-78 |
[more] | SIP2007-119 ICD2007-108 IE2007-78 pp.53-58 |
| SIP, ICD, IE, IPSJ-SLDM (Joint) [detail] |
2007-10-25 16:20 |
Fukushima | Aidu-Higasiyama-Onsen Kuturogijuku | Foreground Segmentation Using Spatio-Temporal Processing
-- A Study on TOPS DSP Architecture Driven Algorithm for Foreground Segmentation -- Hiroaki Tezuka, Tomoyuki Suzuki, Takao Nishitani (Tokyo Metropolitan Univ.) SIP2007-120 ICD2007-109 IE2007-79 |
This paper describes a robust foreground segmentation algorithm in HDTV video sequence. The present algorithm is based ... [more] |
SIP2007-120 ICD2007-109 IE2007-79 pp.59-64 |
| CAS | 2007-01-29 14:35 |
Ehime | Ehime Univ. | Study on a TOPS DPS Architecture Hiroshi Suzuki, Takao Nishitani, Hachiro Fujita (TMU) |
This paper introduces low power parallel processor architecture for image processing. When assuming to make first genera... [more] | CAS2006-65 pp.19-24 |
| RCS, SIP | 2007-01-25 09:45 |
Okinawa | NICT Okinawa | Study on terrestrial digital TV Re-broadcasting by a multi-beam internet satellite Kotaro Takahashi (TMU), Takao Nishitani (TMU/Kochi University of Technolog), Hiroaki Komatsu (KUT), hironoki Katoh, Norishige Omoto (JAMSS) SIP2006-141 RCS2006-199 |
[more] | SIP2006-141 RCS2006-199 pp.25-30 |
| CPSY | 2006-12-15 09:25 |
Tokyo | Tokyo Univ. Komaba Research Campus | Lightweight Intrusion Detection Module at Network Endpoint Atusi Maeda, Yusuke Watanabe, Takao Nishi, Yoshinori Yamaguchi (Univ. of Tsukuba) |
[more] | CPSY2006-40 pp.13-18 |
| COMP | 2006-10-17 09:00 |
Miyagi | Tohoku University | Convex Grid Drawings of Plane Graphs with Rectangular Contours Akira Kamada (Tohoku Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Tohoku Univ.) |
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and al... [more] | COMP2006-31 pp.1-8 |
| COMP | 2006-10-17 09:35 |
Miyagi | Tohoku University | Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs Kazuyuki Miura (Fukushima Univ.), Tetsuya Matsuno, Takao Nishizeki (Tohoku Univ.) |
[more] | COMP2006-32 pp.9-15 |
| COMP | 2006-10-17 10:25 |
Miyagi | Tohoku University | Approximability of Partitioning Graphs with Supply and Demand Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
Suppose that each vertex of a graph $G$ is either a supply vertex or a demand vertex and is assigned a positive real num... [more] | COMP2006-33 pp.17-23 |
[Return to Top Page]