Computing a Non-trivial Lower Bound on the Joint Entropy between Two Images
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
In this report, a non-trivial lower bound on the joint entropy of two non-identical images is developed, which is greater than the individual entropies of the images. The lower bound is the least joint entropy possible among all pairs of images that have the same histograms as those of the given images. New algorithms are presented to compute the joint entropy lower bound with a computation time proportional to S log S where S is the number of histogram bins of the images. This is faster than the traditional methods of computing the exact joint entropy with a computation time that is quadratic in S .
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1347338
- Report Number(s):
- ORNL/TM--2017/85
- Country of Publication:
- United States
- Language:
- English
Similar Records
Entropic uncertainties for joint quantum measurements
Upper and lower bounds on gravitational entropy
Nonuniversal lower bound for the shear viscosity to entropy density ratio
Journal Article
·
Thu Oct 15 04:00:00 UTC 2009
· Physical Review. A
·
OSTI ID:21316345
Upper and lower bounds on gravitational entropy
Journal Article
·
Sun Jun 15 04:00:00 UTC 2008
· Journal of Cosmology and Astroparticle Physics
·
OSTI ID:22156645
Nonuniversal lower bound for the shear viscosity to entropy density ratio
Journal Article
·
Mon Feb 15 04:00:00 UTC 2010
· Physical Review. D, Particles Fields
·
OSTI ID:21413397