Share Email Print
cover

Proceedings Paper

Fast algorithm for entropy estimation
Author(s): Evgeniy A. Timofeev; Alexei Kaltchenko
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Proposed is a new fast algorithm for entropy estimation of a given input word. The algorithm utilizes k-nearest neighbor search of a given dictionary. The time complexity of the search is independent of the dictionary size.

Paper Details

Date Published: 29 May 2013
PDF: 4 pages
Proc. SPIE 8750, Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering XI, 87500U (29 May 2013); doi: 10.1117/12.2016164
Show Author Affiliations
Evgeniy A. Timofeev, Yaroslavl State Univ. (Russian Federation)
Alexei Kaltchenko, Wilfrid Laurier Univ. (Canada)


Published in SPIE Proceedings Vol. 8750:
Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering XI
Harold H. Szu, Editor(s)

© SPIE. Terms of Use
Back to Top