General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis

DOI10.1109/18.50370zbMath0731.62016OpenAlexW2077541600MaRDI QIDQ3357267

Lee Kenneth Jones, Charles L. Byrne

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.50370

zbMATH Keywords

image processingdata compressionpattern classificationcluster analysisspectrum estimationcross entropyorthogonality conditiondistance between probability distributionsMinimum distance approachesreconstruction of a real function

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10)

Related Items

Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Generalized projections for non-negative functions ⋮ Choosing a robustness tuning parameter ⋮ Relative entropy and spectral constraints: some invariance properties of the ARMA class ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Parametric Bayesian estimation of differential entropy and relative entropy ⋮ New estimates for Csiszár divergence and Zipf-Mandelbrot entropy via Jensen-Mercer's inequality ⋮ On new developments in divergence statistics ⋮ Unnamed Item ⋮ Quantization and clustering with Bregman divergences ⋮ Bregman divergences in the \((m\times k)\)-partitioning problem ⋮ The General Form of γ-Family of Quantum Relative Entropies ⋮ Unnamed Item ⋮ Monotone Riemannian metrics and relative entropy on noncommutative probability spaces