By Topic

Data compression by the recursive algorithm of exponential bidirectional associative memory

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
$33 $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)
Chua-Chin Wang ; Dept. of Electr. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Chang-Rong Tsai

A novel data compression algorithm utilizing the histogram and the high-capacity exponential bidirectional associative memory (eBAM) is presented. Since eBAM has been proved to possess high capacity and fault tolerance, it is suitable to be utilized in the data compression using the table-lookup scheme. The histogram approach is employed to extract the feature vectors in the given data. The result of the simulation of the proposed algorithm turns out to be better than the traditional methods

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)  (Volume:28 ,  Issue: 2 )