Node compression in simulated annealing networks: an investigation with a scene analysis benchmark

Harmony theory (HT) networks constitute simulated annealing networks which greatly benefit from sparse coding: the precision and cooling procedure of the network improve: however, the increase in size renders each network update slow and computationally expensive. The author examines node compression. Comparisons with a sparse HT network are made, using as a benchmark a scene analysis task