Optimal quantizer step sizes for transform coders

As evidenced by the theoretical modeling and simulation presented, the optimal quantizer solution for run-length and Huffman coding is quite addressable for the Laplacian case. The step sizes may be calculated in advance for images that share common statistics. Furthermore, the model can also be used for other uses such as bit-management for rate control and lower bound estimation for compressed file sizes; it is also the first step in the general solution to the transform coder quantization problem.< >