Presentation 1998/10/23
DT-CNN Block Matching by Cooperative and Competitive Networks
Masashi MORI, Satoshi SENGA, Yuichi TANJI, Mamoru TANAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The cooperative and competitive networks proposed by Amari and Abib are mathmatical model only. If this networks are implemented on realistic circuit elements, there are many problem to do. In this paper, the Amari-Abib model is extended so that it is easy to realize by circuit elements. Moreover, the extended cooperative and competitive networks are applied to block matching of a image, in order to illustrate that the proposed model is more effective.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) cooperative and competitive networks / maximum or minimum values detection / block matching / Cellular Neural Network
Paper # NLP98-68
Date of Issue

Conference Information
Committee NLP
Conference Date 1998/10/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) DT-CNN Block Matching by Cooperative and Competitive Networks
Sub Title (in English)
Keyword(1) cooperative and competitive networks
Keyword(2) maximum or minimum values detection
Keyword(3) block matching
Keyword(4) Cellular Neural Network
1st Author's Name Masashi MORI
1st Author's Affiliation Dept.of Electrical and Electronic Engineering, Sophia University()
2nd Author's Name Satoshi SENGA
2nd Author's Affiliation Dept.of Electrical and Electronic Engineering, Sophia University
3rd Author's Name Yuichi TANJI
3rd Author's Affiliation Dept.of Electrical and Electronic Engineering, Sophia University
4th Author's Name Mamoru TANAKA
4th Author's Affiliation Dept.of Electrical and Electronic Engineering, Sophia University
Date 1998/10/23
Paper # NLP98-68
Volume (vol) vol.98
Number (no) 344
Page pp.pp.-
#Pages 8
Date of Issue