Search This Blog
Wednesday, September 11, 2013
For 32-bit input Huffman encoding: implementing a Frequency accumulator that does not require allocating a full Frequency table (too many entries for 32-bit) as it was in 8-,16-bit design.
Dynamically growing array of Leaves with binary search is implemented, this requires very little memory This function is called in a heavily parallel workflow, so the memory efficiency is extremely important.
Dynamically growing array of Leaves with binary search is implemented, this requires very little memory This function is called in a heavily parallel workflow, so the memory efficiency is extremely important.
Working on internal compression of 3D\4D volumes. Challenge here is
that all PET timepoints have different DICOM RescaleSlope tag. So they
have to be converted internally to pseudo real (floating point)
format. Predictive coding scheme is used. Resulting 32-bit residuals
are compressed using Huffman.
Have to adapt and existing BYTE-oriented Huffman entropy coder to INT32 input
Have to adapt and existing BYTE-oriented Huffman entropy coder to INT32 input
Subscribe to:
Posts (Atom)