Fast algorithm for entropy estimation

Evgeniy A. Timofeev; Alexei Kaltchenko

doi:10.1117/12.2016164

29 May 2013 Fast algorithm for entropy estimation

Evgeniy A. Timofeev, Alexei Kaltchenko

Proceedings Volume 8750, Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering XI; 87500U (2013) https://doi.org/10.1117/12.2016164
Event: SPIE Defense, Security, and Sensing, 2013, Baltimore, Maryland, United States

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.

Citation Download Citation

Evgeniy A. Timofeev and Alexei Kaltchenko "Fast algorithm for entropy estimation", Proc. SPIE 8750, Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering XI, 87500U (29 May 2013); https://doi.org/10.1117/12.2016164

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available