Related Experiment Video
Updated: Nov 27, 2025

A New Technique for Quantitative Analysis of Hair Loss in Mice Using Grayscale Analysis
Published on: March 9, 2015
Universality of Logarithmic Loss in Successive Refinement
1Department of Electronic and Electrical Engineering, Hongik University, Seoul 04066, Korea.
Abstract:
We establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this result, we propose a low-complexity lossy compression algorithm for any discrete memoryless source.
Related Concept Videos
Laws of Logarithms I
Introduction to Logarithmic Functions
Reducing Line Loss
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...
Types of Functions III
Applications of Logarithms
Residuals and Least-Squares Property
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
