By Topic

Kernel feature detector: extracting kernel features by minimizing α-information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kamimura, R. ; Inf. Sci. Lab., Tokai Univ., Kanagawa, Japan ; Nakanishi, S.

In the present paper, we propose kernel feature detectors for extracting salient features of input patterns. Kernel feature detectors are generated by the information controllers. The information controllers are mainly used to minimize the α-information, difference between Shannon entropy and Renyi entropy, and to generate explicit kernel feature detectors. By minimizing the α-information, a few important features called kernel features are separated from many other unimportant units. We applied our method to two problems: F-H problem and twenty-six alphabet character recognition. In all these cases, we succeeded in extracting kernel features of input patterns, corresponding to our intuition about the input patterns

Published in:

Neural Networks, 1996., IEEE International Conference on  (Volume:4 )

Date of Conference:

3-6 Jun 1996